- getActionMessage() - Method in class com.rath.rathbot.action.ActionBan
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionExecCommand
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionKick
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionMute
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionUnban
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionUnmute
-
- getActionMessage() - Method in class com.rath.rathbot.action.ActionWarn
-
- getActionMessage() - Method in class com.rath.rathbot.action.RBAction
-
Gets a String representation of all of the action's parameters.
- getBanCount() - Method in class com.rath.rathbot.disc.InfractionData
-
Gets how many times the user has been banned.
- getBanCount(long) - Static method in class com.rath.rathbot.disc.Infractions
-
Gets how many times the user has been banned.
- getChannelMap() - Static method in class com.rath.rathbot.RathBot
-
Gets the reference to the channel map.
- getClient() - Static method in class com.rath.rathbot.RathBot
-
Gets the reference to the Discord client.
- getCommandDescription() - Method in class com.rath.rathbot.cmd.admin.UIDCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.BanCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.KickCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.MuteCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.UnbanCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.UnmuteCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.actions.WarnCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.disc.ReportCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.faq.FAQEditCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.faq.FAQListCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.faq.FAQRemoveCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.HelpCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.msg.PingCmd
-
- getCommandDescription() - Method in class com.rath.rathbot.cmd.RBCommand
-
Gets this command's description.
- getCommandMap() - Static method in class com.rath.rathbot.RathBot
-
Gets the commands that are registered for the bot.
- getCommandName() - Method in class com.rath.rathbot.cmd.admin.UIDCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.BanCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.KickCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.MuteCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.UnbanCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.UnmuteCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.actions.WarnCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.disc.ReportCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.faq.FAQEditCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.faq.FAQListCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.faq.FAQRemoveCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.HelpCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.msg.PingCmd
-
- getCommandName() - Method in class com.rath.rathbot.cmd.RBCommand
-
Gets the name of this command.
- getCommandUsage() - Method in class com.rath.rathbot.cmd.admin.UIDCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.BanCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.KickCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.MuteCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.UnbanCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.UnmuteCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.actions.WarnCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.disc.ReportCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.faq.FAQEditCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.faq.FAQListCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.faq.FAQRemoveCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.HelpCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.msg.PingCmd
-
- getCommandUsage() - Method in class com.rath.rathbot.cmd.RBCommand
-
Gets this command's usage syntax in case an error was made.
- getConsoleCommands(Scanner) - Static method in class com.rath.rathbot.ConsoleHandler
-
Starts the command line interpreter.
- getCount() - Method in class com.rath.rathbot.msg.SpamThreshold
-
Gets the number of messages to trigger.
- getFaq(String) - Static method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
Sends a FAQ's contents to the specific channel.
- getFaqList() - Static method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
Gets a list of FAQs that are currently set.
- getHistory() - Method in class com.rath.rathbot.disc.InfractionData
-
Gets the user's infraction history.
- getInfractionHistory(long) - Static method in class com.rath.rathbot.disc.Infractions
-
Gets the user's infraction history.
- getInfringingUser() - Method in class com.rath.rathbot.action.RBDiscAction
-
Gets the member who received the punishment.
- getIssuer() - Method in class com.rath.rathbot.action.RBIssuedAction
-
Gets the member who issued the action that the bot performed.
- getKickCount() - Method in class com.rath.rathbot.disc.InfractionData
-
Gets how many times the user has been kicked.
- getKickCount(long) - Static method in class com.rath.rathbot.disc.Infractions
-
Gets how many times the user has been kicked.
- getLevel(long) - Static method in class com.rath.rathbot.cmd.PermissionsTable
-
Gets the permission level for the given user.
- getMessage() - Method in exception com.rath.rathbot.exceptions.FAQNotFoundException
-
- getMessage() - Method in class com.rath.rathbot.msg.MessageTrackerEntry
-
Gets the message contents.
- getMuteCount() - Method in class com.rath.rathbot.disc.InfractionData
-
Gets how many times the user has been muted.
- getMuteCount(long) - Static method in class com.rath.rathbot.disc.Infractions
-
Gets how many times the user has been muted.
- getMuteDuration() - Method in class com.rath.rathbot.disc.InfractionData
-
- getPermMap() - Static method in class com.rath.rathbot.cmd.PermissionsTable
-
Gets the reference to the permissions table.
- getPrep() - Method in enum com.rath.rathbot.disc.PunishmentType
-
- getReason() - Method in class com.rath.rathbot.disc.InfractionEntry
-
Gets the reason the staff provided for the infraction.
- getReason() - Method in enum com.rath.rathbot.msg.SpamTrigger
-
Gets the String form of the reason.
- getSubcommands() - Method in class com.rath.rathbot.cmd.msg.faq.FAQCmd
-
- getSubcommands() - Method in class com.rath.rathbot.cmd.RBCommand
-
Gets the sub-commands this command has.
- getTaskByName(String) - Static method in class com.rath.rathbot.task.TaskRegistry
-
Gets a task by its name.
- getTaskMap() - Static method in class com.rath.rathbot.task.TaskRegistry
-
Gets all tasks currently registered.
- getTime() - Method in class com.rath.rathbot.msg.MessageTrackerEntry
-
Gets the time this message was sent as Epoch time.
- getTimeout() - Method in class com.rath.rathbot.msg.SpamThreshold
-
Gets the amount of time in seconds that must not have passed to trigger.
- getTimestamp() - Method in class com.rath.rathbot.disc.InfractionEntry
-
Gets the time the infraction was made.
- getType() - Method in class com.rath.rathbot.disc.InfractionEntry
-
Gets the type of punishment.
- getVerb() - Method in enum com.rath.rathbot.disc.PunishmentType
-
- getWarnCount() - Method in class com.rath.rathbot.disc.InfractionData
-
Gets how many times the user has been warned.
- getWarnCount(long) - Static method in class com.rath.rathbot.disc.Infractions
-
Gets the number of times the user has been warned.
- guild - Static variable in class com.rath.rathbot.RathBot
-
The IGuild object used by the Discord API.
- GUILD_ID - Static variable in class com.rath.rathbot.RathBot
-
The osu! University guild ID.


Rules of the game
This game for children follows similar rules to a 3x3 TicTacToe game with a little twist. A player can move with any figure (matroska) of their color, even if the matroska is already placed on the board. There is a limited number of matroskas for each player (two for each of the three sizes).
Matroska can be places on top of other matroskas if it's size is bigger than the size of the already placed matroska (placing matroskas of same color on top of each other is allowed). A matroska which is below another matroska can not be moved. A player must remember, if a matroska stands on top of another matroskas. There is no way to tell so after a matroska is placed.
The goal is to have a sequence of three matroskas (in a row, column or diagonal).
The red player moves first.
CPU player
Extensive normal-form game
This game can be represented as an extensive normal-form game (EFG) in which a single state of the board is represended by a GameState (a graph node) and each possible move in this GameState is represented by a MoveAction (a graph edge). Number of possible moves differ depending on a particular GameState. For example, the initial GameState (an empty board) has 27 (9 board tiles times 3 matroska size types) possible actions.
There are two players in this game. The first player is maximizing the utility, the second player is minimizing the utility.
A terminal GameState is every state where the goal of the game is reached and one of the two players is a winner.
MiniMax algorithm
The MiniMax algorithm is used for solving this EFG. Since the branching factor of this game is quite big, the depth to which the Minimax algorithm expands must be limited. When maximum depth is reached, MiniMax uses a heuristic function to calculate a utility estimate of the GameStates in this depth.
To reach bigger depths with the same computation time, the alpha-beta pruning of the game tree is used. The order in which possible actions are expanded is random. This has a room for improvement, since the order of action expansion has a significant effect on the efficiency of the alpha-beta pruning.
In addition to this, a killer-move heuristic is used in each depth to prioritize moves, which has caused an alpha-beta cutoff in the same depth in previously computed parts of the game tree. In each depth, two distinct killer-move actions are kept in memory and tried in all subsequent GameStates before other actions.
Non-terminal utility heuristics
Another important part of this algorithm is the computation of utility for GameNodes which are not terminal (when the maximum depth of the MiniMax algorithm is reached).
The heuristic used in this example goes like this: For each top-most matroska of the maximizing-player add a value of the tile on which it stands (4 for middle, 3 for corner, 2 for the rest) and also add 2 for each adjacent matroskas of same color. This heuristic can probably be improved.
Difficulty
Because of the speed limitations of javascript for this particular task, the maximum rechable depth of the MiniMax algorithm appears to be somewhere about eight. This means, that the CPU player can simulate at most eight moves ahead. Eight moves is not much, but it successfully imitates a human-player behaviour.
It should be possible to beat the CPU player, as the game requires more than eight moves to simulate completely.
The difficulty levels which can be set in game settings have the following number of simulated moves: easy - one simulated move, medium - two simulated moves, hard - eight simulated moves.


Inserts or updates the
width
and
height
attributes of an
<img>
tag according to the actual size of the image that is declared in the
src
attribute.


In order to list the different repositories you could use, ContinuousPipe needs you to link at least one code repository. Click here to link some accounts.
Select the account ContinuousPipe should use to list the different repositories.
Personal repositories
{{ organisation.identifier }}
{{ repository.name }}


Elixir v1.3.4 Stream
Module for creating and composing streams.
 Any enumerable that generates
items one by one during enumeration is called a stream. For example,
Elixir’s Range
is a stream:
iex> range = 1..5
1..5
iex> Enum.map range, &(&1 * 2)
[2, 4, 6, 8, 10]
In the example above, as we mapped over the range, the elements being
enumerated were created one by one, during enumeration. The Stream
module allows us to map the range, without triggering its enumeration:
iex> range = 1..3
iex> stream = Stream.map(range, &(&1 * 2))
iex> Enum.map(stream, &(&1 + 1))
[3, 5, 7]
Notice we started with a range and then we created a stream that is
meant to multiply each item in the range by 2. At this point, no
computation was done. Only when Enum.map/2
is called we actually
enumerate over each item in the range, multiplying it by 2 and adding 1.
We say the functions in Stream
are lazy and the functions in Enum
are eager.
Due to their laziness, streams are useful when working with large
(or even infinite) collections. When chaining many operations with Enum
,
intermediate lists are created, while Stream
creates a recipe of
computations that are executed at a later moment. Let’s see another
example:
1..3
|> Enum.map(&IO.inspect(&1))
|> Enum.map(&(&1 * 2))
|> Enum.map(&IO.inspect(&1))
1
2
3
2
4
6
#=> [2, 4, 6]
Notice that we first printed each item in the list, then multiplied each element by 2 and finally printed each new value. In this example, the list was enumerated three times. Let’s see an example with streams:
stream = 1..3
|> Stream.map(&IO.inspect(&1))
|> Stream.map(&(&1 * 2))
|> Stream.map(&IO.inspect(&1))
Enum.to_list(stream)
1
2
2
4
3
6
#=> [2, 4, 6]
Although the end result is the same, the order in which the items were printed changed! With streams, we print the first item and then print its double. In this example, the list was enumerated just once!
That’s what we meant when we said earlier that streams are composable,
lazy enumerables. Notice we could call Stream.map/2
multiple times,
effectively composing the streams and keeping them lazy. The computations
are only performed when you call a function from the Enum
module.
Creating Streams
There are many functions in Elixir’s standard library that return streams, some examples are:
IO.stream/2
- streams input lines, one by oneURI.query_decoder/1
- decodes a query string, pair by pair
This module also provides many convenience functions for creating streams,
like Stream.cycle/1
, Stream.unfold/2
, Stream.resource/3
and more.
Note the functions in this module are guaranteed to return enumerables. Since enumerables can have different shapes (structs, anonymous functions, and so on), the functions in this module may return any of those shapes and that this may change at any time. For example, a function that today returns an anonymous function may return a struct in future releases.
Summary
Functions
Shortcut to chunk(enum, n, n)
Streams the enumerable in chunks, containing n
items each, where
each new chunk starts step
elements into the enumerable
Chunks the enum
by buffering elements for which fun
returns
the same value and only emit them when fun
returns a new value
or the enum
finishes
Creates a stream that enumerates each enumerable in an enumerable
Creates a stream that enumerates the first argument, followed by the second
Creates a stream that cycles through the given enumerable, infinitely
Creates a stream that only emits elements if they are different from the last emitted element
Creates a stream that only emits elements if the result of calling fun
on the element is
different from the (stored) result of calling fun
on the last emitted element
Lazily drops the next n
items from the enumerable
Creates a stream that drops every nth
item from the enumerable
Lazily drops elements of the enumerable while the given
function returns true
Executes the given function for each item
Creates a stream that filters elements according to the given function on enumeration
Creates a stream that filters and then maps elements according to given functions
Creates a stream that will apply the given function on enumeration and flatten the result, but only one level deep
Creates a stream that emits a value after the given period n
in milliseconds
Injects the stream values into the given collectable as a side-effect
Emits a sequence of values, starting with start_value
. Successive
values are generated by calling next_fun
on the previous value
Creates a stream that will apply the given function on enumeration
Creates a stream that will reject elements according to the given function on enumeration
Returns a stream generated by calling generator_fun
repeatedly
Emits a sequence of values for the given resource
Runs the given stream
Creates a stream that applies the given function to each element, emits the result and uses the same result as the accumulator for the next computation
Creates a stream that applies the given function to each
element, emits the result and uses the same result as the accumulator
for the next computation. Uses the given acc
as the starting value
Lazily takes the next count
items from the enumerable and stops
enumeration
Creates a stream that takes every nth
item from the enumerable
Lazily takes elements of the enumerable while the given
function returns true
Creates a stream that emits a single value after n
milliseconds
Transforms an existing stream
Transforms an existing stream with function-based start and finish
Emits a sequence of values for the given accumulator
Creates a stream that only emits elements if they are unique
Creates a stream where each item in the enumerable will be wrapped in a tuple alongside its index
Zips two collections together, lazily
Types
Functions
Shortcut to chunk(enum, n, n)
.
chunk(Enumerable.t, pos_integer, pos_integer, Enumerable.t | nil) :: Enumerable.t
Streams the enumerable in chunks, containing n
items each, where
each new chunk starts step
elements into the enumerable.
step
is optional and, if not passed, defaults to n
, i.e.
chunks do not overlap. If the final chunk does not have n
elements to fill the chunk, elements are taken as necessary
from leftover
if it was passed. If leftover
is passed and
does not have enough elements to fill the chunk, then the chunk is
returned anyway with less than n
elements. If leftover
is not
passed at all or is nil
, then the partial chunk is discarded
from the result.
Examples
iex> Stream.chunk([1, 2, 3, 4, 5, 6], 2) |> Enum.to_list
[[1, 2], [3, 4], [5, 6]]
iex> Stream.chunk([1, 2, 3, 4, 5, 6], 3, 2) |> Enum.to_list
[[1, 2, 3], [3, 4, 5]]
iex> Stream.chunk([1, 2, 3, 4, 5, 6], 3, 2, [7]) |> Enum.to_list
[[1, 2, 3], [3, 4, 5], [5, 6, 7]]
iex> Stream.chunk([1, 2, 3, 4, 5, 6], 3, 3, []) |> Enum.to_list
[[1, 2, 3], [4, 5, 6]]
Chunks the enum
by buffering elements for which fun
returns
the same value and only emit them when fun
returns a new value
or the enum
finishes.
Examples
iex> stream = Stream.chunk_by([1, 2, 2, 3, 4, 4, 6, 7, 7], &(rem(&1, 2) == 1))
iex> Enum.to_list(stream)
[[1], [2, 2], [3], [4, 4, 6], [7, 7]]
Creates a stream that enumerates each enumerable in an enumerable.
Examples
iex> stream = Stream.concat([1..3, 4..6, 7..9])
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5, 6, 7, 8, 9]
Creates a stream that enumerates the first argument, followed by the second.
Examples
iex> stream = Stream.concat(1..3, 4..6)
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5, 6]
iex> stream1 = Stream.cycle([1, 2, 3])
iex> stream2 = Stream.cycle([4, 5, 6])
iex> stream = Stream.concat(stream1, stream2)
iex> Enum.take(stream, 6)
[1, 2, 3, 1, 2, 3]
Creates a stream that cycles through the given enumerable, infinitely.
Examples
iex> stream = Stream.cycle([1, 2, 3])
iex> Enum.take(stream, 5)
[1, 2, 3, 1, 2]
Creates a stream that only emits elements if they are different from the last emitted element.
This function only ever needs to store the last emitted element.
Elements are compared using ===
.
Examples
iex> Stream.dedup([1, 2, 3, 3, 2, 1]) |> Enum.to_list
[1, 2, 3, 2, 1]
Creates a stream that only emits elements if the result of calling fun
on the element is
different from the (stored) result of calling fun
on the last emitted element.
Examples
iex> Stream.dedup_by([{1, :x}, {2, :y}, {2, :z}, {1, :x}], fn {x, _} -> x end) |> Enum.to_list
[{1, :x}, {2, :y}, {1, :x}]
Lazily drops the next n
items from the enumerable.
If a negative n
is given, it will drop the last n
items from
the collection. Note that the mechanism by which this is implemented
will delay the emission of any item until n
additional items have
been emitted by the enum.
Examples
iex> stream = Stream.drop(1..10, 5)
iex> Enum.to_list(stream)
[6, 7, 8, 9, 10]
iex> stream = Stream.drop(1..10, -5)
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5]
Creates a stream that drops every nth
item from the enumerable.
The first item is always dropped, unless nth
is 0.
nth
must be a non-negative integer, or FunctionClauseError
will be thrown.
Examples
iex> stream = Stream.drop_every(1..10, 2)
iex> Enum.to_list(stream)
[2, 4, 6, 8, 10]
iex> stream = Stream.drop_every(1..1000, 1)
iex> Enum.to_list(stream)
[]
iex> stream = Stream.drop_every([1, 2, 3, 4, 5], 0)
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5]
Lazily drops elements of the enumerable while the given
function returns true
.
Examples
iex> stream = Stream.drop_while(1..10, &(&1 <= 5))
iex> Enum.to_list(stream)
[6, 7, 8, 9, 10]
Executes the given function for each item.
Useful for adding side effects (like printing) to a stream.
Examples
iex> stream = Stream.each([1, 2, 3], fn(x) -> send self, x end)
iex> Enum.to_list(stream)
iex> receive do: (x when is_integer(x) -> x)
1
iex> receive do: (x when is_integer(x) -> x)
2
iex> receive do: (x when is_integer(x) -> x)
3
Creates a stream that filters elements according to the given function on enumeration.
Examples
iex> stream = Stream.filter([1, 2, 3], fn(x) -> rem(x, 2) == 0 end)
iex> Enum.to_list(stream)
[2]
filter_map(Enumerable.t, (element -> as_boolean(term)), (element -> any)) :: Enumerable.t
Creates a stream that filters and then maps elements according to given functions.
Exists for symmetry with Enum.filter_map/3
.
Examples
iex> stream = Stream.filter_map(1..6, fn(x) -> rem(x, 2) == 0 end, &(&1 * 2))
iex> Enum.to_list(stream)
[4, 8, 12]
Creates a stream that will apply the given function on enumeration and flatten the result, but only one level deep.
Examples
iex> stream = Stream.flat_map([1, 2, 3], fn(x) -> [x, x * 2] end)
iex> Enum.to_list(stream)
[1, 2, 2, 4, 3, 6]
iex> stream = Stream.flat_map([1, 2, 3], fn(x) -> [[x]] end)
iex> Enum.to_list(stream)
[[1], [2], [3]]
Creates a stream that emits a value after the given period n
in milliseconds.
The values emitted are an increasing counter starting at 0
.
This operation will block the caller by the given interval
every time a new item is streamed.
Examples
iex> Stream.interval(10) |> Enum.take(10)
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Injects the stream values into the given collectable as a side-effect.
This function is often used with run/1
since any evaluation
is delayed until the stream is executed. See run/1
for an example.
Emits a sequence of values, starting with start_value
. Successive
values are generated by calling next_fun
on the previous value.
Examples
iex> Stream.iterate(0, &(&1+1)) |> Enum.take(5)
[0, 1, 2, 3, 4]
Creates a stream that will apply the given function on enumeration.
Examples
iex> stream = Stream.map([1, 2, 3], fn(x) -> x * 2 end)
iex> Enum.to_list(stream)
[2, 4, 6]
Creates a stream that will reject elements according to the given function on enumeration.
Examples
iex> stream = Stream.reject([1, 2, 3], fn(x) -> rem(x, 2) == 0 end)
iex> Enum.to_list(stream)
[1, 3]
Returns a stream generated by calling generator_fun
repeatedly.
Examples
# Although not necessary, let's seed the random algorithm
iex> :rand.seed(:exsplus, {1, 2, 3})
iex> Stream.repeatedly(&:rand.uniform/0) |> Enum.take(3)
[0.40502929729990744, 0.45336720247823126, 0.04094511692041057]
Emits a sequence of values for the given resource.
Similar to transform/3
but the initial accumulated value is
computed lazily via start_fun
and executes an after_fun
at
the end of enumeration (both in cases of success and failure).
Successive values are generated by calling next_fun
with the
previous accumulator (the initial value being the result returned
by start_fun
) and it must return a tuple containing a list
of items to be emitted and the next accumulator. The enumeration
finishes if it returns {:halt, acc}
.
As the name says, this function is useful to stream values from resources.
Examples
Stream.resource(fn -> File.open!("sample") end,
fn file ->
case IO.read(file, :line) do
data when is_binary(data) -> {[data], file}
_ -> {:halt, file}
end
end,
fn file -> File.close(file) end)
Runs the given stream.
This is useful when a stream needs to be run, for side effects, and there is no interest in its return result.
Examples
Open up a file, replace all #
by %
and stream to another file
without loading the whole file in memory:
stream = File.stream!("code")
|> Stream.map(&String.replace(&1, "#", "%"))
|> Stream.into(File.stream!("new"))
|> Stream.run
No computation will be done until we call one of the Enum functions
or Stream.run/1
.
Creates a stream that applies the given function to each element, emits the result and uses the same result as the accumulator for the next computation.
Examples
iex> stream = Stream.scan(1..5, &(&1 + &2))
iex> Enum.to_list(stream)
[1, 3, 6, 10, 15]
Creates a stream that applies the given function to each
element, emits the result and uses the same result as the accumulator
for the next computation. Uses the given acc
as the starting value.
Examples
iex> stream = Stream.scan(1..5, 0, &(&1 + &2))
iex> Enum.to_list(stream)
[1, 3, 6, 10, 15]
Lazily takes the next count
items from the enumerable and stops
enumeration.
If a negative count
is given, the last count
values will be taken.
For such, the collection is fully enumerated keeping up to 2 * count
elements in memory. Once the end of the collection is reached,
the last count
elements will be executed. Therefore, using
a negative count
on an infinite collection will never return.
Examples
iex> stream = Stream.take(1..100, 5)
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5]
iex> stream = Stream.take(1..100, -5)
iex> Enum.to_list(stream)
[96, 97, 98, 99, 100]
iex> stream = Stream.cycle([1, 2, 3]) |> Stream.take(5)
iex> Enum.to_list(stream)
[1, 2, 3, 1, 2]
Creates a stream that takes every nth
item from the enumerable.
The first item is always included, unless nth
is 0.
nth
must be a non-negative integer, or FunctionClauseError
will be thrown.
Examples
iex> stream = Stream.take_every(1..10, 2)
iex> Enum.to_list(stream)
[1, 3, 5, 7, 9]
iex> stream = Stream.take_every([1, 2, 3, 4, 5], 1)
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5]
iex> stream = Stream.take_every(1..1000, 0)
iex> Enum.to_list(stream)
[]
Lazily takes elements of the enumerable while the given
function returns true
.
Examples
iex> stream = Stream.take_while(1..100, &(&1 <= 5))
iex> Enum.to_list(stream)
[1, 2, 3, 4, 5]
Creates a stream that emits a single value after n
milliseconds.
The value emitted is 0
. This operation will block the caller by
the given time until the item is streamed.
Examples
iex> Stream.timer(10) |> Enum.to_list
[0]
transform(Enumerable.t, acc, fun) :: Enumerable.t when fun: (element, acc -> {Enumerable.t, acc} | {:halt, acc}), acc: any
Transforms an existing stream.
It expects an accumulator and a function that receives each stream item
and an accumulator, and must return a tuple containing a new stream
(often a list) with the new accumulator or a tuple with :halt
as first
element and the accumulator as second.
Note: this function is similar to Enum.flat_map_reduce/3
except the
latter returns both the flat list and accumulator, while this one returns
only the stream.
Examples
Stream.transform/3
is useful as it can be used as the basis to implement
many of the functions defined in this module. For example, we can implement
Stream.take(enum, n)
as follows:
iex> enum = 1..100
iex> n = 3
iex> stream = Stream.transform(enum, 0, fn i, acc ->
...> if acc < n, do: {[i], acc + 1}, else: {:halt, acc}
...> end)
iex> Enum.to_list(stream)
[1, 2, 3]
transform(Enumerable.t, (() -> acc), fun, (acc -> term)) :: Enumerable.t when fun: (element, acc -> {Enumerable.t, acc} | {:halt, acc}), acc: any
Transforms an existing stream with function-based start and finish.
The accumulator is only calculated when transformation starts. It also allows an after function to be given which is invoked when the stream halts or completes.
This function can be seen as a combination of Stream.resource/3
with
Stream.transform/3
.
Emits a sequence of values for the given accumulator.
Successive values are generated by calling next_fun
with the previous
accumulator and it must return a tuple with the current value and next
accumulator. The enumeration finishes if it returns nil
.
Examples
iex> Stream.unfold(5, fn 0 -> nil; n -> {n, n-1} end) |> Enum.to_list()
[5, 4, 3, 2, 1]
Creates a stream that only emits elements if they are unique.
Keep in mind that, in order to know if an element is unique or not, this function needs to store all unique values emitted by the stream. Therefore, if the stream is infinite, the number of items stored will grow infinitely, never being garbage collected.
Examples
iex> Stream.uniq([1, 2, 3, 3, 2, 1]) |> Enum.to_list
[1, 2, 3]
iex> Stream.uniq([{1, :x}, {2, :y}, {2, :z}, {1, :x}], fn {x, _} -> x end) |> Enum.to_list
[{1, :x}, {2, :y}]
Creates a stream where each item in the enumerable will be wrapped in a tuple alongside its index.
Examples
iex> stream = Stream.with_index([1, 2, 3])
iex> Enum.to_list(stream)
[{1, 0}, {2, 1}, {3, 2}]
iex> stream = Stream.with_index([1, 2, 3], 3)
iex> Enum.to_list(stream)
[{1, 3}, {2, 4}, {3, 5}]


Name: {{item.name}}
Departure Flight: {{item.flight.departure.name}}
Departure Flight Date and Time: {{item.flight.departure.dateAndtime}}
Departure Flight Duration: {{item.flight.departure.duration}}
Arrival Flight: {{item.flight.arrival.name}}
Arrival Flight Date and Time: {{item.flight.arrival.dateAndtime}}
Arrival Flight Duration: {{item.flight.arrival.duration}}
Price: {{item.price}}
Hotel: {{item.hotel.name}}. {{item.hotel.description}}
Hotel Price: {{item.hotel.price}}


Hello readers! My name is Jon and my first week at Dev Bootcamp (DBC) is quickly winding down. I have learned a lot in only a short period of time and I thought I’d share some of the important takeaways I’ve gleaned thus far in Phase 0.
The week kicked off by learning about a computer’s command line interface (CLI). Most people interact directly with their computer through the graphical user interface (GUI) – the various graphical icons and visual symbols present on a computer (e.g. – folders, files, application icons, etc.) The CLI, on the other hand, is an alternative way to interact with your computer by executing commands in the computer’s command line interpreter (aka terminal), or “shell.” A shell is a user interface (such as bash, a Unix shell and command language, which serves as the default shell on Mac OS X) that grants an individual the ability to interact with an operating system’s services. In other words, the shell is a software program that interprets commands from the user so that a computer’s operating system can perform certain functions. Learning how to navigate the command line is essential in programming efficiently and effectively.


Try Router First
Created by
Rui Ferreira
Contents
What is the problem?
How can I fix it?
Where am I going?


Running Calculator v1.3
Race Time Calculator
Split Calculator
Race Time:
Time:
Gender:
Male
Female
Distance:
100m
200m
400m
800m
1500m
1600m
3000m
3200m
5000m
8000m
10000m
Convert To:
Gender:
Male
Female
Distance:
100m
200m
400m
800m
1500m
1600m
3000m
3200m
5000m
8000m
10000m
Convert!
Output:
Split Time:
Time:
Distance:
100m
200m
400m
800m
1500m
1600m
3000m
3200m
5000m
8000m
10000m
or enter here:
m
km
ft
mi
Convert To:
Distance:
100m
200m
400m
800m
1500m
1600m
3000m
3200m
5000m
8000m
10000m
or enter here:
m
km
ft
mi
Convert!
Output:
Copyright (c) 2015-2018 Ethan Shields. All Rights Reserved.


|
Drake
|
A Spatial Mass Matrix (also called Spatial Inertia) M represents the mass, center of mass location, and inertia in a single 6×6 symmetric, mass-weighted positive definite matrix that logically consists of four 3×3 submatrices.
Spatial mass matrix ---------- ---------- 0 | | | 1 | I(=mG) | m c× | 2 | | | ---------- ---------- 3 | | | 4 | -m c× | mE | 5 | | | ---------- ---------- Symbol: M
The symbols in the figure have the following meanings, assuming we have a spatial inertia M for a body B, taken about a point P. For numerical computation, the quantities must be expressed in a specified frame we'll denote as F here.
| Symbol | Meaning |
|---|---|
| m | mass, a nonnegative scalar |
| I | 3×3 inertia matrix, taken about P, expressed in F |
| G | 3×3 unit inertia (gyration matrix) about P, exp. in F |
| c | position vector from P to B's center of mass, exp. in F |
| c× | 3×3 cross product matrix of c |
| E | 3×3 identity matrix |
In practice the 36-element spatial inertia has only 10 independent elements, so we can represent it more compactly. Also, inertia is most effectively represented as mass times a unit inertia, which permits numerically robust representation of shape distribution for very small or zero masses.
Spatial inertia for a rigid body B is taken about a point P, and expressed in some frame F. Often P=Bcm (B's center of mass) or P=Bo (B's origin), and F=B (the body frame) or F=W (the world frame). We always document these clearly and use the decorated symbol \( [M^{B/P}]_F \) = M_BP_F
to mean spatial inertia of body B about point P, expressed in frame F. For example, M_BBcm_W
(= \([M^{B/B_{cm}}]_W\)) is the spatial inertia of body B taken about its center of mass (the "central inertia") and expressed in the world frame. We allow the body name and frame to be dropped if it is obvious from the "about" point, so M_Bcm
( \(M^{B_{cm}}\)) is the central spatial inertia of body B, expressed in B. Inertia can be taken about any point. For example M_BWo_W
( \([M^{B/Wo}]_W\)) is body B's spatial inertia taken about the World frame origin, and expressed in World.
Given M_BP_F
( \([M^{B/P}]_F\)), its top left submatrix is I_BP_F
( \([I^{B/P}]_F\)) and position vector c = p_PBcm_F
( \([^Pp^{B_{cm}}]_F\)), that is, the position vector of the center of mass measured from point P and expressed in F. Note that if the "taken about" point is Bcm
, then c=0.


wall time
`Prev `__
W
`Next `__
--------------
**wall time**: n.
(also wall clock time)
1. ‘Real world’ time (what the clock on the wall shows), as opposed to
the system clock's idea of time.
2. The real running time of a program, as opposed to the number of
`*tick* <../T/tick.html>`__\ s required to execute it (on a timesharing
system these always differ, as no one program gets all the ticks, and on
multiprocessor systems with good thread support one may get more
processor time than real time).
--------------
+----------------------------------+----------------------------+------------------------------+
| `Prev `__ | `Up <../W.html>`__ | `Next `__ |
+----------------------------------+----------------------------+------------------------------+
| wall follower | `Home <../index.html>`__ | wall wart |
+----------------------------------+----------------------------+------------------------------+


Base styles for Markdown-generated HTML
If you generate HTML from Markdown and have to control over the styles applied to individual elements, mdscss provides you with base styles to apply to a wrapper element.
You can also configure many variables or apply only part of the styles using the Sass mixins and variables.
npm install --save-dev mdscss
Ingredients:
Instructions:
Don't believe everything you read on the internet — Albert Einstein


Choose To Eat!
APPLE BRUSCHETTA
Aged Prosciutto | Blue Cheese Spread | Granny Smith Apple | Local Honey
CAPRESE SALAD
Buffalo Mozzarella | Vine Ripe Tomato | EVOO | Basil | Balsamic Reduction
MAC & CHEESE BITES
Spring Mix | Chipotle Aioli Dipping Sauce
RICOTTA RAVIOLI
Homemade white wine wild mushroom sauce, topped with herb mix and parmesan cheese.
GRILLED CHICKEN PITA
Avocado | Roasted Bell Peppers | Grilled Onions | Provolone | Arugula | Garlic Aioli | Pita Bread
MEDITERRANEAN TACOS
Blackened Grilled Shrimp | Feta | Pineapple Salsa | Romaine | Tzatziki | Corn Tortilla GLUTEN FREE


61A
Operations Research Analyst
Caleb Ziegler
Roles/Responsibilities
- Assessments/Lessons Learned
- Data
- Retrieval
- Analysis
- Visualization
- Process Improvement
Day-to-Day
- Write programs to retrieve or analyze data
- Build dashboards/charts
- Automate and/or optimize business processes
- Brief dashboards/charts or results of analysis
Support from Others
- Cyber supports by providing hardware and software
- All AFSCs support by collecting structured, organized, and well-documented data on their processes
- Work alongside engineers and pilots in test


ChartBuilder, Modified for ProPublica
1. Input your data
Warning: Data is Invalid
Check the format of your data
Header
Data
2. Series Options
Press "enter" to see changes in the fields below.
Chart Width
Font Size (px)
3. Chart Options
Title
Source
Something like "Source: Bureau of Labor Statistics"
4. Axis Options
Axis Prefix
Axis Suffix
Number of Y Axis Ticks
3
4
5
6
7
8
9
10
Axis Max
Axis Min
Axis Tick Override
5. Bottom Axis Options
Tick date frequency
auto
1 hour
2 hours
3 hours
4 hours
6 hours
1 day
1 week
1 month
3 months
6 months
1 year
5 years
10 years
20 years
50 years
100 years
X Axis Date Format
2/25/2012
25/2/2012
2/25
Feb. 25
25 Feb.
2/13
'13
2013
Q2 (Jan. FY)
Q2 (July FY)
February
Feb.
3:27
No options available
4. Export
Create Image of Chart
Download Image of Chart
or
Download SVG of Chart


Nullish coalescing operator '??'
Nullish '??'
(a ?? b)
result = (a !== null && a !== undefined) ? a : b;
In other words, ?? returns the first argument if it’s not null/undefined. Otherwise, the second one. The nullish coalescing operator isn’t anything completely new. It’s just a nice syntax to get the first “defined” value of the two. We can rewrite result = a ?? b using the operators that we already know, like this:
let user;
alert(user ?? "Anonymous"); // Anonymous
Comparison with ||
The OR || operator can be used in the same way as ??, as it was described in the previous chapter. For example, in the code above we could replace ?? with || and still get the same result:
let firstName = null;
let lastName = null;
let nickName = "Supercoder";
// shows the first truthy value:
alert(firstName || lastName || nickName || "Anonymous"); // Supercoder
- The important difference between them is that:
- || returns the first truthy value.
- ?? returns the first defined value.
In other words, || doesn’t distinguish between false, 0, an empty string "" and null/undefined. They are all the same – falsy values. If any of these is the first argument of ||, then we’ll get the second argument as the result.In practice though, we may want to use default value only when the variable is null/undefined. That is, when the value is really unknown/not set.


| Exported Interfaces - Details |
::com::sun::star::container::XHierarchicalName
- Description
- provides the complete hierarchical name of this element
within the hierarchy tree.
|
|
::com::sun::star::container::XNamed
- Description
- provides the local name of this element within its parent.
Renaming an element is generally not supported.
|
|
::com::sun::star::beans::XProperty
- Usage Restrictions
- optional
- Description
- provides a property descriptor for this element.[optional]
This interface may be missing, if the hierarchy supports no traits that are
described by ::com::sun::star::beans::PropertyAttribute
values.
If the parent of this object implements
::com::sun::star::beans::XPropertySetInfo, then this returns
the same ::com::sun::star::beans::Property as the
::com::sun::star::beans::XPropertySetInfo of the parent.
|
|
::com::sun::star::beans::XPropertyWithState
- Usage Restrictions
- optional
- Description
- provides access to the default state of this element. [optional]
This interface may be missing, if the hierarchy supports access to
a default state and values only for simple values or not at all.
If the parent of this object implements
::com::sun::star::beans::XPropertyState, then members
of this interface have the same effect as corresponding members of the parent.
If an implementation is part of a read-only view of the hierarchy,
attempts to change property states will fail.
|
|
::com::sun::star::container::XChild
- Usage Restrictions
- optional
- Description
- provides access to the parent of this element [optional].
This interface may be missing if this object is not obtained
as a child or descendant of another tree node, for example, directly from a factory or provider.
::com::sun::star::container::XChild::getParent()
returns NULL, if this object is currently not contained in another node.
Setting a different parent is, generally, not supported.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Forked from: https://code.google.com/p/wsg50-ros-pkg
Modifications of this repository: Reading back state with high rates, open-loop control via topics, catkinized, modifications for hydro. Existing features are not discussed here - see original Wiki: https://code.google.com/p/wsg50-ros-pkg/wiki/wsg_32
Todo: Restructure code
See https://code.google.com/p/wsg50-ros-pkg/wiki/wsg_32. Services currently block the reception of state updates.
Select by com_mode parameter.
Polling
Gripper state is polled regularly using built-in commands (original implementaion). Service calls (e.g. move) block polling as long as the gripper moves. The topic interface is not available. Up to 15 Hz could be reached with the WSG-50 hardware revision 2.
Script
Allows for closed-loop control with a custom script (see below) that supports up to 2 FMF finger. Gripper state is read synchronously with the specified rate. Up to 30 Hz could be reached with the WSG-50 hardware revision 2. The gripper can be controlled asynchronously by sending position or velocity goals to the topics listed above. Commands will be sent with the next read command in the timer callback timer_cb().
The service interface can still be used - yet, they are blocking the gripper communication. There are no state updates while the gripper is moved by a service.
Auto_update
Requests periodic updates of the gripper state (position, speed, force; less data than with the script). Up to 140 Hz could be reached with the WSG-50 hardware revision 2. All responses of the gripper must be received by a reading thread which also publishes the ROS messages. Therefore, most commands in functions.cpp cannot be used. Position targets are sent asynchronously to the gripper using the built-in commands.
The services are disabled.
The script cmd_measure.lua must be running on the gripper for the script mode. It allows for non-blocking position and velocity control and responds with the current position, speed, motor force and up to two FMF finger forces. The custom commands 0xB0 (read only), 0xB1 (read, goal position and speed), 0xB2 (read, goal speed) are used. Tested with firmware version 2.6.4. There have been minor API changes since 1.x.
Remains unchanged; new features not implemented here.


More Safe Serialization for .NET
Here. From Dominic Cooney: This library provides similar functionality to the .NET Framework's binary serialization (although unlike Chris Sell's SafeFormatter, it's not a drop-in replacement for the binary formatter; you have to implement an interface). It works on the .NET Compact Framework, and in downloaded code with only 'Internet' permissions. Unlike SafeFormatter, this library preserves the object reference graph.


---
layout: post
date: 2010-05-13
time: "09:00:00"
authors: ["Greg Wilson"]
title: A Word (Or Three) From Our Sponsors
tags: ["Community"]
---
Starting next week, we're going to start posting interviews with the people who are sponsoring Software Carpentry. Questions we'll ask include:
- What sort of work does your organization do?
- What kind of people work there? What backgrounds and skills do they typically have when they join you, and where do they need help?
- What do they find most frustrating when doing computational work?
- How do you hope this course will help them?
- How will you tell if it actually has (i.e., how will you evaluate this course's success or failure)?
What else would you like us to ask them?


|
Graphitti
A toolkit/software architecture to ease creating high-performance neural network simulators
|
Files | |
| file | AllIFNeurons.cpp [code] |
| A container of all Integate and Fire (IF) neuron data. | |
| file | AllIFNeurons.h [code] |
| A container of all Integate and Fire (IF) neuron data. | |
| file | AllIFNeurons_d.cu [code] |
| A container of all Integate and Fire (IF) neuron data. | |
| file | AllIZHNeurons.cpp [code] |
| A container of all Izhikevich neuron data. | |
| file | AllIZHNeurons.h [code] |
| A container of all Izhikevich neuron data. | |
| file | AllIZHNeurons_d.cu [code] |
| A container of all Izhikevich neuron data. | |
| file | AllLIFNeurons.cpp [code] |
| A container of all LIF neuron data. | |
| file | AllLIFNeurons.h [code] |
| A container of all LIF neuron data. | |
| file | AllLIFNeurons_d.cu [code] |
| A container of all LIF neuron data. | |
| file | AllSpikingNeurons.cpp [code] |
| A container of all spiking neuron data. | |
| file | AllSpikingNeurons.h [code] |
| A container of all spiking neuron data. | |
| file | AllVerticesDeviceFuncs.h [code] |
| Device functions for vertices. | |
| file | AllVerticesDeviceFuncs_d.cu [code] |
| Device functions for vertices. | |


SR2016 Activity Day Quiz
13th February 2016
Get into teams of three or four, fetch a laptop and some
paper if you wish, and assign a scribe.
After the first set of questions, two teams will be
eliminated with the remaining two
teams battling it out for…
A prize of some sort!
How many tokens are in the arena at the beginning of a match?
What do the following wire colours mean:
True or false?
Tokens which are the right way up but not touching the floor of the arena contribute to the points of the team.
True!
Tokens always give points to the team whose colour is facing upwards, regardless of whether the token is touching the ground or not.
What are the maximum dimensions that a robot may occupy just before a match starts?
How many degrees can a token be tilted before it no longer scores a point for a team?
30°
True or false?
All electronics must be securely fixed to the robot and shouldn't be easily removable.
False!
All electronics must be securely fixed to the robot, but should also be easily removable.
What year was the first competition?
“My tablet isn't connecting to the robot.”
- Is it connected to a different WiFi network?
- Is it even connected to the robot WiFi?
- What happens when you tap on the ‘Student Robotics’ app?
- What happens if you manually go to
http://robot.sr
?
- Is WiFi enabled?
- Try manually connecting using the WiFi key in
wifi.yaml
.
- Is a dongle attached to the USB hub?
What are the dimensions of a token?
In each knockout match, how many teams proceed to the next round?
2 teams
How can your code find out which zone the robot is starting in?
R.zone
docs/programming/sr/#OtherRobotAttributes
What are the dimensions of the arena and zones?
True or false?
Teams can appeal the Judge's decision.
False!
How many game points would be earned by the team in the green corner for each of the following tokens?
- A token located outside of any scoring zones, with its green side facing upwards.
- A token located in the green scoring zone, with its green side facing upwards.
- A token located in the green scoring zone, with its orange side facing upwards.
- 1 point
- 2 points
- 0 points
What will the carpet be like?
“My robot doesn't turn on.”
- Is the battery charged?
- Is the robot assembled correctly?
- Does the code look right? Does the robot work with minimal code?
- Are the various lights on?
- Does it work after removing individual components?
- Is the switch loop wire in?
What are the sizes of the various libkoki markers?
This code doesn't compile. What's wrong with it?
# look.py
from future import print_function
def look_at_things(R):
markers = R.see
print("I can see", markers.length, "markers:")
return markers.length
# robot.py
from sr import *
import look.py
R = robot()
while True
if look.look_at_things():
R.motors[0].m0 = 25
R.motors[1].m0 = 25
time.sleep(2,5)
R.motors[0].m0 = 0
R.motors[1].m0 = 0
…
future
should be __future__
R.see
is a function and should have round brackets after it
markers.length
should be len(markers)
from sr import *
- module name should be sr.robot
import look.py
shouldn't have extension
robot
should be Robot
while True
missing colon
R
isn't passed to look_at_things
- Indentation is wrong after the
if
statement
R.motors[x].m0 = y
should use the .power
attribute
- Missing
import time
time.sleep(2,5)
should have a period instead of a comma
True or false?
The battery may only be directly connected to the power board.
True!
Write some code to make the robot move around in a square shape.
Hint: use the simulator!
Something like this:
from sr.robot import *
import time
R = Robot()
while True:
# Move forward
R.motors[0].m0.power = 50
R.motors[0].m1.power = 50
time.sleep(2)
# Turn 90°
R.motors[0].m0.power = -25
R.motors[0].m1.power = 25
time.sleep(0.5)
First set of questions are over!
Who gets eliminated?
What do the following kit PCB colours mean:
- Blue: Team Kit
- Red: Development Kit
- Green: Commercial
What safety checks should be performed during the competition?
- Food and drink not permitted in team pits.
- Ensure there are appropriate evacuation routes.
- Frankfurter test.
- Do not give out power tools.
- Extension leads taped down and covered.
- Make sure the arena has fire extinguishers, that haven't expired.
- Maximum of four teams in an arena at any time.
- Collect all batteries from teams at the beginning.
- The battery must be secure in the robot.
Why can't teams use ruggeduino pins 0 and 1?
Those are reserved for serial communications with the brain board.
How many libkoki markers are visible in the arena just before a match begins, in total?
7 markers per wall × 4 walls = 28
4 markers per robot × 4 robots = 16
5 visible markers per token × 9 tokens = 45
The sixth marker on each token is face-down against the ground!
Total: 28 + 16 + 45 =
89
Put these games in order.
- Tin Can Rally
- Slots
- QuacMan
- Sunny Side Up
- Golf & Squirrel
- A Strange Game
- Pirate Plunder
- Capture the Flag
- Golf & Squirrel
- QuacMan
- Tin Can Rally
- Pirate Plunder
- A Strange Game
- Slots
- Capture the Flag
- Sunny Side Up


class Solution: def maxScore(self, s: str) -> int: oneCount = 0 for n in s: if n == '1': oneCount += 1 res = 0 rScore = oneCount lScore = 0 for i in range(len(s)-1): if s[i] == '0': lScore += 1 else: rScore -= 1 res = max(res,lScore + rScore) return res


PROPERTY
Tipperary farmhouse and top quality land for sale at public auction
TWO STOREY HOUSE AT ROCHESTOWN, CAHIR
Rochestown House, Cahir goes for sale by public auction on Friday, December 13, at 3pm in Cahir House Hotel. E21 XH74
C. 5.28 Hectare / 13.047 acre residential farm.
Lands are laid out in five fields, are well fenced, with mature hedges.
Renowned for their fattening qualities, these top quality lands are free draining and suitable for any farming purpose.
Mains water supply to the property.
The farmhouse is a traditional style two-storey, two bedroom residence which is in need of modernisation but offers huge scope for the discerning purchaser.
Solicitor with carriage of sale is Ms. Valerie Noonan, M.F. Noonan & Son, Rathkeale, Co. Limerick.
Contact REA Stokes & quirke on<PHONE_NUMBER> or check out www.reastokesandquirke.ie


Sand Content of Australia's Northwest Shelf
Mud Content of Australia's Northwest Shelf
Gravel Content of Australia's Northwest Shelf
Gravel Content of Australia's Northwest Shelf
Australian Coastal Sediment Compartments
Primary Points
Australian Coastal Sediment Compartments
Secondary Points
Australian Coastal Sediment Compartments
Primary Compartments
Australian Coastal Sediment Compartments
Secondary Compartments
Marine Sediments Database (MARS)
Towed Underwater Video Transects
Marine Survey Backscatter


Because any user listed who has permissions will have those permissions on all databases, it is usually a good idea not to grant users on this page any permissions. Instead, use the Database Permissions page to grant access to users on a per-database basis.


Statistics (2013-2018)
- Research areas: 19
- Conferences: 166
- Conferences with papers by Brazilian professors: 119
- Journals: 64
- Journals with papers by Brazilian professors: 55
- Brazilian professors: 926
- Brazilian professors with papers: 503
- Papers: 1303
- Papers in conferences: 704
- Papers in journals: 599
- Papers in top venues: 141
- Papers with arXiv preprints: 53
- Papers per year (all papers / papers in top-venues):
- 2013: 210 / 22
- 2014: 243 / 15
- 2015: 208 / 24
- 2016: 223 / 26
- 2017: 236 / 32
- 2018: 183 / 22
- Papers per research area (all papers / papers in confs / papers in journals / papers in top-venues):
- Computer Science (general): 28 / 0 / 28 / 0
- Software Engineering: 334 / 117 / 217 / 38
- Programming Languages: 40 / 23 / 17 / 9
- Human-Computer Interaction: 40 / 32 / 8 / 5
- Databases & Information Systems: 84 / 37 / 47 / 6
- Computing Education: 15 / 11 / 4 / 1
- Computer Vision: 147 / 36 / 111 / 4
- Operational Research: 167 / 0 / 167 / 0
- Papers per research area (all papers / papers in top-conferences):
- Computer Networks: 71 / 4
- Mobile Computing: 22 / 0
- Distributed Systems: 42 / 4
- Computer Architecture & HPC: 59 / 9
- Web & Information Retrieval: 48 / 16
- Data Mining & Machine Learning: 38 / 14
- Artificial Intelligence: 75 / 21
- Algorithms & Complexity: 33 / 2
- Security & Cryptography: 8 / 2
- Formal Methods & Logic: 16 / 0
- Robotics: 36 / 0
(last updated on Mon Sep 24 18:12:12 -03 2018)


DIE HARD 2: DIE HARDER A film review by Jeff Wallace Copyright 1990 Jeff Wallace
Summary: Terrorists take over an airport at Christmas time. John McClane (Bruce Willis) is waiting for his wife's flight to arrive. Much havoc ensues. The result is the most spectacular and entertaining movie this summer.
The Los Angeles Times recently asked "Where's this summer's blockbuster movie?" The answer is: it's finally here and it's name is DIE HARD 2.
I loved the original DIE HARD and I fully expected to be disappointed by the sequel. Incredibly, this movie is as engrossing and even more spectacular than the original. The plot isn't all that important, but it provides a good foundation for John McClane (Bruce Willis) vs. the bad guys as in the original.
It's Christmas time again and McClane is at Dulles International Airport waiting for his wife's flight to arrive. Also due to arrive is General Esperanza, a deposed Latin American dictator, who is being extradited to the U.S. to face drug charges. Esperanza appears unruffled by his extradition and we quickly discover why.
A group of terrorists/mercenaries take control of the airport and threaten mass destruction if Esperanza isn't released to them. Of course McClane figures out that something nasty is occurring before anyone else. And, of course, the local police don't listen to him.
This occurs in the first 15-20 minutes which leaves our hero, Lieutenant John McClane, now with the Los Angeles Police Department, a good 90+ minutes to kill bad guys, get shot at and make wisecracks.
The story isn't highly original and it certainly isn't going to win an Academy Award for script writing, but you don't go to an action film expecting an in-depth character analysis.
Once the basic set-up information is out of the way DIE HARD 2 takes off. It rolls from shoot-outs to explosions to chase scenes without letting you (or McClane) catch your breath. The fast pace is perfect for this movie and it holds your attention from start to finish.
The bad guys are very bad. The good guy is very good (and very lucky). The photography is impressive and the stunts and effects are stupendous. Industrial Light & Magic is at its peak once again. ILM's models can easily convince you that you're looking at a real 747. This movie is at its finest in 70mm at a theater with a good sound system.
It is a perfect put-your-mind-in-neutral-and-kick-back summer adventure movie.
Highly recommended. On the -4 to +4 scale, I give it +4. The best summer movie this year.
---- Jeff Wallace, Experimental Computing Facility (XCF), U.C. Berkeley Internet<EMAIL_ADDRESS>UUCP:...!ucbvax!scam!jeffw
.
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


Migration Guide & Issues
How to migrate from React Native X to 0.60.x
-
For more fast upgrade use Upgrade Helper. Just select your total RN version and target RN version. Implement diff changes into your application https://react-native-community.github.io/upgrade-helper/
Need to disable auto linking. Add into react-native.config.js
module.exports = {
dependencies: {
'react-native-fbsdk': {
platforms: {
android: null,
ios: null,
}
}
}
}
- Also read this additional information
https://github.com/react-native-community/discussions-and-proposals/issues/129 https://github.com/facebook/react-native-fbsdk/issues/429
- For build Android before building app use Jetify. Run
npx jetify
npx react-native run-android
Troubleshooting
####Android
Issue:
Could not get unknown property 'mergeResourcesProvider' for object of type com.android.build.gradle.internal.api.ApplicationVariantImpl.
https://github.com/wix/react-native-navigation/issues/4757
> Could not resolve all artifacts for configuration ':classpath'.
> Could not find io.fabric.tools:gradle:1.25.4.
Searched in the following locations:
- https://dl.google.com/dl/android/maven2/io/fabric/tools/gradle/1.25.4/gradle-1.25.4.pom
- https://dl.google.com/dl/android/maven2/io/fabric/tools/gradle/1.25.4/gradle-1.25.4.jar
- https://jcenter.bintray.com/io/fabric/tools/gradle/1.25.4/gradle-1.25.4.pom
- https://jcenter.bintray.com/io/fabric/tools/gradle/1.25.4/gradle-1.25.4.jar
Required by:
project :
Solution:
https://stackoverflow.com/questions/46787741/could-not-find-io-fabric-toolsgradle
Issue:
A problem occurred evaluating script.
> Could not find method leftShift() for arguments [setup_eyrc4t7859zi4o3488yvdtnd5$_run_closure2@3d71a0b7] on task ':app:preBuild' of type org.gradle.api.DefaultTask.
Solution:
https://stackoverflow.com/questions/55793095/could-not-find-method-leftshift-for-arguments-after-updating-studio-3-4
Issue:
* What went wrong:
A problem occurred configuring project ':app'.
> compileSdkVersion is not specified.
Solution:
https://stackoverflow.com/questions/50530889/gradle-sync-failed-cause-compilesdkversion-is-not-specified
Issue:
/Users/igor/Work/Tipsi/tipsi/packages/app/android/app/src/main/java/com/tipsi/MainApplication.java:10: error: package android.support.multidex does not exist
import android.support.multidex.MultiDexApplication;
Solution:
https://medium.com/@aungmt/multidex-on-androidx-for-rn-0-60-x-cbb37c50d85
Issue:
/Users/igor/Work/Tipsi/tipsi/packages/app/android/app/src/main/java/com/tipsi/MainApplication.java:11: error: cannot find symbol
import com.facebook.CallbackManager;
^
symbol: class CallbackManager
location: package com.facebook
/Users/igor/Work/Tipsi/tipsi/packages/app/android/app/src/main/java/com/tipsi/MainApplication.java:12: error: cannot find symbol
import com.facebook.FacebookSdk;
^
symbol: class FacebookSdk
location: package com.facebook
/Users/igor/Work/Tipsi/tipsi/packages/app/android/app/src/main/java/com/tipsi/MainApplication.java:13: error: package com.facebook.appevents does not exist
import com.facebook.appevents.AppEventsLogger;
Solution: Downgrade FBSDK to 0.10.1
Issue:
/Users/igor/Work/Tipsi/tipsi/packages/app/node_modules/react-native-fbsdk/android/src/main/java/com/facebook/reactnative/androidsdk/Utility.java:52: error: package android.support.annotation does not exist
import android.support.annotation.Nullable;
^
/Users/igor/Work/Tipsi/tipsi/packages/app/node_modules/react-native-fbsdk/android/src/main/java/com/facebook/reactnative/androidsdk/FBAppEventsLoggerModule.java:23: error: package android.support.annotation does not exist
import android.support.annotation.Nullable;
Solution: Add to MainApplication.java
this
import androidx.annotation.Nullable;
Issue:
/Users/igor/Work/Tipsi/tipsi/packages/app/android/app/build/generated/rncli/src/main/java/com/facebook/react/PackageList.java:70: error: constructor FBSDKPackage in class FBSDKPackage cannot be applied to given types;
new FBSDKPackage(),
^
required: CallbackManager
found: no arguments
reason: actual and formal argument lists differ in length
1 error
Solution: Downgrade FBSDK to 0.10.1


{% extends 'layouts/layout.fishfrytable.html' %} {% block title %}Fish Fry! - Contribute{% endblock %} {% block content %}
Validated and published Validated, not published Needs checked
| Venue Name | Address | Website | Validated | Published |
|---|---|---|---|---|
| Venue Name | Venue Address | Website | Validated | Published |
Don't see the Fish Fry you're looking for below?
Add a New FishFry


Hi, my name is
Anakin Skywalker
Analytical, goal oriented leader with proven track record in manegement and
enforcement Space Fleet Operation and Frontened Developement. Wide range of hands-
on experiance, including:
- Large scale contruction project oversite
- Advanced forms of mind control
- Planetary scaledemolition operations
- Fugitive recovery services
Together we can rule galaxy
Notable achievements
Designed, built and piloted a custop pod racer. 32 BBY Bonta Eve Classic Race Champion
In my spare time at Wald's Parts junk shop I designed and built a Class III open cockpit Podracer capable
of 588mph top speed. Went on to win the Boonta Eve Classic race in 32 BBY - first ever win by a human.
Generated documented company revenue of over 59 wupiupi during the course of my enslavement.
Oversight of DS1 and DS2 Orbital Battle Situations construction projects
During my tenure as a Supreme Imperial Fleet Commander I was in charge of large capital construction projects
for the Deep Space Fleet. Performed acceptance testing of the DS1 SuperLaser in 0 BBY by annihilating
Alderaan - a terrestrial class planet in the Core Worlds region. Succesfully tripled the deep space fire power of
the imperial fleet in accordance with the Tarkin Doctrine before losing both projects to run-away photon
torpedoes.
I find your lack of faith
disturbing.
Experience
Sith Empire Headquaters, Dromund Kaas
Supreme commander of Imperialo Forces, Emperor's Enforcer
- As the right-hands man to Emperor Sidious, hunter down jedi survivors and enforced the will of the
empire; - Overwas construction of the first generation Death Star;
- First ever Imperial Supreme Commander;
Wally's Parts / Toyarian Watto junk shop, Mos Espa, Tatooine
Enslaved Volunteer
- General help and front-desk retail operations at the junk shop, second hand droid parts, mechanical /
droid repair services; - Designed and piloted custom.built Podracer, ran track-side operations for the podracing team;
When I left you, I was but the learner; now I am the master.
Formal training
Green Fox Academy, Budapest
Full stack developer
- Padawann to Knight Tojas.
- Learned programming with a specialisation on JavaScript and Front-end technologies
Sith Empire, Coruscant
Master of the Dark Side of the Force
- Apprentice to Sith Lord Darth Sidious;
Jedi Order Academy, Coruscant
Master of Jedi Force
- Padawan to Knight Obi Wan Kenobi. Bodyguard to Senator Padme Amidala during the Clone Wars of
22 BBY; - Graduated with donors;
Personal Interests
- Midi-Chlordan research as a hobby;
- Recreational mind-control techniques;
- Amateur and local club podracing.


| Process/Service | Function | In service patchable | Managed by | Restart command | Patch Restart command | Restart dependency | Impact(if restarted while in operation) | Special handling required |
|---|---|---|---|---|---|---|---|---|
| ceilometer-polling | Daemon that polls Openstack services and build meters | Y | PMON | /etc/init.d/openstack-ceilometer-polling restart | N | As batch_polled_samples is set to True, may lose some samples that are in the pollsters memory if the process is restarted exactly when they have just finished polling for samples and are about to publish these samples to RabbitMQ. This is about 10 millisecond window for cpu_source and 0.03 millisecond 1 second window for meter related sources. | N | |
| ceilometer-agent-notification | Daemon that listens to notifications on message queue, converts them to Events and Samples and applies pipeline actions | Y | SM | sm-restart-safe service ceilometer-agent-notification which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-agent-notification stop /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-agent-notification start |
N | May lose some samples/events if the process is restarted while they are being transformed or converted. | N | |
| ceilometer-collector | Daemon that gathers and records event and metering data created by notification and polling agents | Y | SM | sm-restart-safe service ceilometer-collector which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-collector stop /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-collector start |
N | May lose some samples/events if the process is restarted while they
are being persisted in Postgres DB. This is a tiny window
especially with recent optimization work (no message signature
verification, one single call to create_sample stored proc). Note: Making sure that child processes and their database connections are released when a parent process is stopped is part of collector functionality. It is not specific to in-service patching. |
N | |
| ceilometer-api | Service to query and view data recorded by the collector | Y | SM | sm-restart-safe service ceilometer-api which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-api stop /bin/sh /usr/lib/ocf/resource.d/openstack/ceilometer-api start |
N | While the service is restarted, horizon or CLI ceilometer request will fail. Horizon request will be re-established automatically in its next polling interval. CLI command needs to be re-issued. | N | |
| ceilometer-expirer-active | Cron job that purges expired samples and events as well as related meter and resource data | Y | CRON | N/A To run the expirer manually: /usr/bin/ceilometer-expirer-active |
N | There is no need to restart after patch. The change will take
effect next time the expirer cron job is run. Unless there are new features specifically planned for expirer, this code is very stable. |
N | |
| haproxy | A Proxy service that is responsible for forwarding external REST API requests to Open Stack and Titanium Cloud services that listening on the internal interfaces. | Y | SM | sm-restart-safe service haproxy which runs the following: /bin/sh /etc/init.d/haproxy stop /bin/sh /etc/init.d/haproxy start |
/usr/local/sbin/patch-restart-haproxy | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | Y |
| sm | Service management daemon | N | PMON | /etc/init.d/sm restart | N | Will cause all services disabled on the active controller before the standby controller takes over the control. | N | |
| sm-api | Daemon that provides sm api | N | PMON | N | N | |||
| sm-eru | Daemon that records sm eru data | N | N | N | ||||
| sm-watchdog | Daemon that loads NFS watchdog module to look for and handle stalled NFS threads | N | N | N | ||||
| neutron-server | Service that manages network functions | Y | SM | sm-restart-safe service neutron-server which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/neutron-server stop /bin/sh /usr/lib/ocf/resource.d/openstack/neutron-server start |
/bin/neutron-restart neutron-server or /bin/neutron-restart --all |
N | Will cause neutron services to not be available while restarting, which will prevent instances from being created while it is down. Could cause RPCs from workers to fail while it is restarting. | N |
| neutron-dhcp-agent | Agent on worker node that manages DHCP servers for tenant networks | Y | PMON | /etc/init.d/neutron-dhcp-agent restart | /bin/neutron-restart neutron-dhcp-agent or /bin/neutron-restart --all |
N | Will prevent binding new DHCP servers while it is down. Requires special handling to kill metadata haproxy processes for networks. | Y |
| neutron-metadata-agent | Agent on worker node serving metadata to nodes | Y | PMON | /etc/init.d/neutron-metadata-agent restart | /bin/neutron-restart neutron-metadata-agent or /bin/neutron-restart --all |
N | Nodes will not be able to receive metadata while it is down | N |
| neutron-sriov-nic-agent | Agent on worker node responsible for setting SR-IOV port information | Y | PMON | /etc/init.d/neutron-sriov-nic-agent restart | /bin/neutron-restart neutron-sriov-nic-agent or /bin/neutron-restart --all |
N | Will not be able to set device parameters while restarting | N |
| neutron-bgp-dragent | BGP dynamic routing agent on controller node | Y | PMON | /etc/init.d/neutron-bgp-dragent restart | /bin/neutron-restart neutron-bgp-dragent or /bin/neutron-restart --all |
N | Will not be able to set device parameters while restarting | N |
| keystone-all | Keystone provides services that support an identity, token management, and service catalog and policy functionality. | Y | SM | sm-restart-safe service keystone which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/keystone stop /bin/sh /usr/lib/ocf/resource.d/openstack/keystone start |
/usr/local/sbin/patch-restart-processes keystone-all | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| aodh-api | Aodh service that handles API requests for openstack alarming. | Y | SM | sm-restart-safe service aodh-api which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-api stop /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-api start |
N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N | |
| aodh-evaluator | Aodh service that performs threshold evaluation for openstack alarming. | Y | SM | sm-restart-safe service aodh-evaluator which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-evaluator stop /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-evaluator start |
N | While the service is restarted no openstack alarm threshold evaluations will be executed until the service is re-enabled. | N | |
| aodh-listener | Aodh service that generates alarms based on events. | Y | SM | sm-restart-safe service aodh-listener which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-listener stop /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-listener start |
N | While the service is restarted no openstack event based alarms will be generated until the service is re-enabled. | N | |
| aodh-notifier | Aodh service that sends openstack alarm notifications. | Y | SM | sm-restart-safe service aodh-notifier which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-notifier stop /bin/sh /usr/lib/ocf/resource.d/openstack/aodh-notifier start |
N | While the service is restarted no openstack alarm threshold notifications will be issued until the service is re-enabled. | N | |
| aodh-expirer-active | Cron job that purges expired openstack alarms | Y | CRON | N/A To run the expirer manually: /usr/bin/aodh-expirer-active |
N | There is no need to restart after patch. The change will take
effect next time the expirer cron job is run. Unless there are new features specifically planned for expirer, this code is very stable. |
N | |
| heat-api | Heat service for API requests for openstack orchestration. | Y | SM | sm-restart-safe service heat-api which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api stop /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api start |
N | While the service is restarted, horizon or CLI heat requests will fail. Horizon will re-established automatically. CLI commands needs to be re-issued. Heat stack updates in progress may fail. | N | |
| heat-api-cfn | Heat service for AWS Cloudformation API requests. | Y | SM | sm-restart-safe service heat-api-cfn which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api-cfn stop /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api-cfn start |
N | While the service is restarted, cloudformation API requests such as autoscaling will not be processed. | N | |
| heat-api-cloudwatch | Heat service for AWS Cloudwatch metric collection. | Y | SM | sm-restart-safe service heat-api-cloudwatch which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api-cloudwatch stop /bin/sh /usr/lib/ocf/resource.d/openstack/heat-api-cloudwatch start |
N | While the service is restarted, stats sent from VMs will not be processed. | N | |
| heat-engine | Heat service for AWS Cloudwatch metric collection. | Y | SM | sm-restart-safe service heat-engine which runs the following: /bin/sh /usr/lib/ocf/resource.d/openstack/heat-engine stop /bin/sh /usr/lib/ocf/resource.d/openstack/heat-engine start |
N | While the service is restarted, openstrack heat orchestration commands will not be processed. Stacks being created, deleted or updated will fail and need to be re-initiated. | N | |
| heat-purge-deleted-active | Cron job that purges deleted openstack heat stacks from the database | Y | CRON | N/A To run the expirer manually: /usr/bin/heat-purge-deleted-active |
N | There is no need to restart after patch. The change will take
effect next time the cron job is run. Unless there are new features specifically planned, this code is very stable. |
N | |
| Glance | Glance imaging service - a single script restarts both glance-api and glance-registry. | Y | SM | /usr/bin/restart-glance |
N | While the service is restarted, the outstanding requests will continue and new requests will get connection error until the service is re-enabled. The graceful restart takes more than 30 secs the process is killed. Timers are configurable from the restart script | N | |
| Cinder | Cinder volume service - a single script restarts cinder-volume, cinder-scheduler, cinder-api and cinder-backup. | Y | SM | /usr/bin/restart-cinder |
N | While the service is restarted, the outstanding requests will continue and new requests will get connection error until the service is re-enabled. Timers are configurable from the restart script | N | |
| Horizon | Horizon - Openstack Dashboard GUI used to control openstack and Titanium Cloud operations | Y | SM | sm-restart service horizon |
/usr/bin/horizon-patching-restart | N | When horizon is restarted via the patch restart command all users will be logged out. If they try to log back in before the server is up again they will see an internal server error. It usually takes less than a minute for the service to restart | N |
| IO-Monitor | Daemon which monitors cinder devices and raises alarms for excessive storage IO load. | Y | PMON | pmon-restart io-monitor-manager | /usr/local/sbin/patch-restart-processes io-monitor-manager | N | Generally there should be no impact. It is very unlikely for the system to encounter an excessive storage IO load which will only last a couple of seconds until the io-monitor process is restarted, such that it will not be detected. | N |
| vim | Virtual Infrastructure Manager | Y | SM | sm-restart-safe service vim | N | While the service is restarting, requests through the VIM API or through the Nova API Proxy will fail. Any instance actions normally triggered due to instance state changes (from nova) will not occur until the process starts up again and audits the instance states. | N | |
| vim-api | Virtual Infrastructure Manager API | Y | SM | sm-restart-safe service vim-api | N | While the service is restarting, requests through the external VIM API will fail. | N | |
| vim-webserver | Virtual Infrastructure Manager Web Server | Y | SM | sm-restart-safe service vim-webserver | N | No impact. This service is for design use only. | N | |
| nova-api | Nova API Service | Y | SM | sm-restart-safe service nova-api |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-placement-api | Nova Placement API Service | Y | SM | sm-restart-safe service nova-placement-api |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-conductor | Nova Conductor Service | Y | SM | sm-restart-safe service nova-conductor |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-scheduler | Nova Scheduler Service | Y | SM | sm-restart-safe service nova-scheduler |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-console-auth | Nova Console Auth Service | Y | SM | sm-restart-safe service nova-console-auth |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-novnc | Nova VNC Service | Y | SM | sm-restart-safe service nova-novnc |
/bin/nova-restart | N | While the service is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| nova-compute | Nova Compute Service | Y | PMON | /usr/local/sbin/pmon-restart nova-compute |
/bin/nova-restart | N | While the services is restarted, the outstanding requests will fail and new requests will get connection error until the service is re-enabled. | N |
| ceph-osd & ceph-mon | Ceph OSD and Monitor processes | Y | PMON | /etc/ceph/ceph_pmon_wrapper.sh restart |
/etc/ceph/ceph_pmon_wrapper.sh restart | N | Ceph processes on a node will restart (ceph-mon and ceph-osd). The restart will take at most 30s and functionality should not be affected. Note that this command should not be executed at the same time on storage-0 and any of the controller nodes as we do not support restarting two of the three ceph-mon at the same time. | Restarting it on controller-0, controller-1 & storage-0, at the same time with glance, cinder, nova, ceph-rest-api, sysinv or ceph-manager on the active controller should be avoided due to ~30 secs delay to ceph APIs. This delay happens when any of the ceph-mon changes state and may cause timeouts when dependent services restart. Recommendations: (1) On the active controller, restart Ceph before the other service; (2) updating ctrl-0,ctrl-1 & storage-0 at the same time should be avoided. |
| Process/Service | Function | In service patchable | Managed by | Restart command | Patch Restart command | Restart dependency | Impact(if restarted while in operation) | Special handling required |


About Us
About IETE
The Institution of Electronics and Telecommunication Engineers (IETE) is India's leading recognised professional society devoted to the advancement of Science and Technology of Electronics, Telecommunication & IT. Government of India has recognised IETE as a Scientific and Industrial Research Organization (SIRO) and also notified as an educational Institution of national eminence. The objectives of IETE focus on advancing electro-technology. The IETE conducts and sponsors technical meetings, conferences, symposia, and exhibitions all over India, publishes technical journals and provides continuing education as well as career advancement opportunities to its members. The IETE focuses on advancement of the Science and Technology of Electronics, Telecommunication, Computers, Information Technology and related areas. Towards this end the Institution promotes and conducts basic engineering and continuing technical education programmes for human resource development.
About IETE-DBIT-ISF
The Institution of Electronics and Telecommunication Engineers (IETE) branch at Don Bosco Institute of Technology, Mumbai (DBIT) and IETE Students Forum (ISF) has conducted numerous workshops, events and competitions over the past years. The IETE-DBIT-ISF has been run efficiently mostly by collaborating with the Department of Electronics & Telecommunication Engineering (EXTC). The core team of students along with the respective faculty coordinator have ensured that all the students at DBIT got a chance to learn about all the developments in the world of microprocessors, circuit simulations, PCB designing and understanding the working of hardware. It also conducts technical events like Oscillations, which is held across many colleges in Mumbai, including Don Bosco Institute of Technology, Mumbai (DBIT).


Curry Night Friday 12th October 2012
We are meeting at Wetherspoons (top of town) at 19.00hrs before
going on to Tuli's for a curry at 20.00 hrs. See you there!
Quiz Night Sunday 30th September 2012
BHP Quiz Night at 20.00hrs at the Portsmouth Arms in Hatchwarren.
Get your thinking caps on for the next one!
Annual Trip to the All England Badminton Tournament in March
2013
Watch this space for more details of this popular annual club
outing.


本书pdf是文字版。
1.1 Basic Concepts
1.2 The History of the Concept of the Macromolecule
1.3 Classification of Polymers
1.4 Structure and Properties of Polymers
2.1 Chain Polymerisation
2.2 Arrangement of Monomer Units
2.3 Kinetics of Chain Polymerisation
2.4 Autoacceleration
2.5 Practical Methods of Chain Polymerisation
2.6 Other Chain Polymerisation Mechanisms
2.7 Step Polymerisation
2.8 Step polymerisation with Polyfunctional monomers
2.9 Copolymerisation
3.1 Polymer Stereochemistry
3.2 Polymer Crystallinity
3.3 Thermal and Mechanical Properties
4.1 Introduction
4.2 Phenol–Formaldehyde Resins
4.3 Unsaturated Polyester Resins
4.4 Polyurethanes
4.5 Epoxy Resins
5.1 Introduction
5.2 Dissolution of Polymers
5.3 Solubility Parameters
5.4 Simple Liquid Mixtures and Raoult's Law
5.5 Entropy of Mixing
5.6 Real Molecules in Dilute Solution
5.7 Shapes of Polymer Molecules in Solution
5.8 Reptation Model of Molecular Motion
5.9 Water-Soluble Polymers
5.10 Uses of High-Viscosity Polymer Solutions
5.11 Polymer Melts
6.1 Introduction
6.2 Molar Masses from Colligative Properties
6.3 Light Scattering
6.4 Viscosity Methods of Determining Relative Molar Mass
6.5 End Group Analysis
6.6 Gel Permeation Chromatography
7.1 Introduction
7.2 Stress, Strain, and Young's Modulus
7.3 Brittle and Tough Fracture
7.4 Types of Strength
7.5 The Influence of Surfaces
7.6 Viscoelasticity
7.7 Creep and Stress Relaxation
7.8 Cold Drawing
7.9 Dynamic Tests
7.10 Time/Temperature Relationship
7.11 Rubberlike Elasticity
7.12 Reinforced Polymers
7.13 Practical Measurements of Mechanical Properties
7.14 Further Reading
8.1 Introduction
8.2 Behaviour of Polymers In Fires
8.3 Assessment of Combustion Behaviour
8.4 Improvement of Stability of Polymers in Fires
8.5 Weathering of Polymers
8.6 Protection of Polymers from Photo-oxidation
8.7 Biological Degradation of Polymers
8.8 Exploitation of Polymer Degradation
9.1 Introduction
9.2 Organic Dendrimers
9.3 Supramolecular Dendrimers
9.4 Shapes and Conformations of Dendrimers
9.5 Dendrimer Micelles
9.6 Characterization of Dendrimers
9.7 Applications of Dendrimers
9.8 Megamers
10.1 Introduction
10.2 Polymers in Medicine
10.3 Ionomers
10.4 Electronically Conducting Polymers
10.5 Interpenetrating Polymer Networks
10.6 Inorganic Polymers
10.7 Polymer Liquid Crystals
10.8 Polymers for Food Packaging
11.1 Introduction
11.2 Pollution by Polymers
11.3 The Nature of the Problem
11.4 Polymers and Energy
11.5 Recycling of Polymers
11.6 Degradable Polymers
11.7 The Future


{{>common/header}} {{>common/normal-container}}
This is the reference UI for the OWASP AppSensor project. For more information, see these resources:


Noro is on the western side of the island of New Georgia, which itself lies in about the middle of the Solomon Islands chain.
Position 08° 14'S, 157° 11'45"E.
For full details on clearing into and out of these Islands see Solomon Islands Formalities.
This is a Port of Entry and the necessary officials for clearing in and out are based here (Customs, Immigration, Health and Quarantine).
It has been reported by cruisers that Noro is now the preferred port of entry into the Western Province as Gizo has been experiencing reports of theft, and the Immigration officer is extremely uncooperative and rarely available.
The Immigration officer at Noro is the most senior in the Solomon Islands. He is called Billy and can be contacted on +6777495010. Cruisers recommend this is a good telephone number to have if you leave your yacht in the Solomons and have to return with only a single ticket. You won't be allowed on the flight, but a call to Billy will get you on.
Advice is to begin check in early as it takes most of the day and is a lengthy process. Clearance fees are charged according to the boat length and are quite high.
Last updated July 2016.
This port has several safe anchorages and is a very useful port for both clearing in and out.
The nearest repair facilities are at Liapari on the island of Vella Lavela.
Last updated February 2015.


Indented code with two space indent in first and last line:
two spaces *hello*
{ more }
and
Indented code requires a leading/trailing blank line: quick-command --option "$*"
Indented code does not require a trailing blank line:
code
and not code.
Code in blockquote:
code
Code in list:
code


Welcome to the GTA PHP MeetUp
Namespaces and Autoloading
Presented by Vic Metcalfe
Make and Wear a
NAME BADGE
Looking for work? BLUE
Looking to hire? RED
Just a tourist? WHITE
Upcoming Events
True North PHP
Nov 6-8, 2014 - truenorthphp.ca - @TrueNorthPHP
Upcoming Events
WordCamp Toronto 2014
Sat Nov 15, 2014 - Sun Nov 16, 2014
Humber College, Lakeshore
http://2014.toronto.wordcamp.org/
$30 for a whole weekend of WordPress goodness, including food and refreshments.
Thanks to our hosts:
Jobspring Partners Toronto
@jobspringCanada


James Fuller
d.o: fullerja | @webJWF
Follow along at: http://rawgit.com/jwfuller/behat101/master/index.html#/
An opensource automated testing system, written in PHP. It is used to do Behavioral/Acceptance/Customer testing.
As much as we can
As much as we can
cd [directory/for/nglocal]
git pull
git checkout feature/testing
cd ~/data/code/dslm_base/profiles/cu_fit-current
git pull
git checkout testing
./start.sh
./test.sh
This will do a clean install of cu_fit and run the test suite.
Currently it takes ~21 minutes


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object edu.cmu.cs.stage3.image.codec.TIFFDecodeParam
public class TIFFDecodeParam
An instance of ImageDecodeParam
for decoding images in
the TIFF format.
To determine the number of images present in a TIFF file, use
the getNumPages()
method on the
ImageDecoder
object that will be used to perform the
decoding. The desired page number may be passed as an argument to
the ImageDecoder.decodeAsRaster)()
or
decodeAsRenderedImage()
methods.
For TIFF Palette color images, the colorMap always has entries
of short data type, the color Black being represented by 0,0,0 and
White by 65536,65536,65536. In order to display these images, the
default behavior is to dither the short values down to 8 bits.
The dithering is done by calling the decode16BitsTo8Bits
method for each short value that needs to be dithered. The method has
the following implementation:
byte b;
short s;
s = s & 0xffff;
b = (byte)((s >> 8) & 0xff);
If a different algorithm is to be used for the dithering, this class
should be subclassed and an appropriate implementation should be
provided for the decode16BitsTo8Bits
method in the subclass.
If the palette contains image data that is signed short, as specified
by the SampleFormat tag, the dithering is done by calling
decodeSigned16BitsTo8Bits
instead. The method has the
following implementation:
byte b;
short s;
b = (byte)((s + Short.MIN_VALUE) >> 8);
In order to use a different algorithm for the dithering, this class
should be subclassed and the method overridden.
If it is desired that the Palette be decoded such that the output
image is of short data type and no dithering is performed, the
setDecodePaletteAsShorts
method should be used.
This class is not a committed part of the JAI API. It may be removed or changed in future releases of JAI.
TIFFDirectory
,
Serialized Form| Constructor Summary | |
|---|---|
TIFFDecodeParam()
Constructs a default instance of TIFFDecodeParam . |
| Method Summary | |
|---|---|
byte |
decode16BitsTo8Bits(int s)
Returns an unsigned 8 bit value computed by dithering the unsigned 16 bit value. |
byte |
decodeSigned16BitsTo8Bits(short s)
Returns an unsigned 8 bit value computed by dithering the signed 16 bit value. |
boolean |
getDecodePaletteAsShorts()
Returns true if palette entries will be decoded as
shorts, resulting in an output image with short datatype. |
void |
setDecodePaletteAsShorts(boolean decodePaletteAsShorts)
If set, the entries in the palette will be decoded as shorts and no short to byte lookup will be applied to them. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public TIFFDecodeParam()
TIFFDecodeParam
.
| Method Detail |
|---|
public void setDecodePaletteAsShorts(boolean decodePaletteAsShorts)
public boolean getDecodePaletteAsShorts()
true
if palette entries will be decoded as
shorts, resulting in an output image with short datatype.
public byte decode16BitsTo8Bits(int s)
short
datatype is a
signed value. Therefore the Java short
datatype cannot
be used to store the TIFF specified short value. A Java
int
is used as input instead to this method. The method
deals correctly only with 16 bit unsigned values.
public byte decodeSigned16BitsTo8Bits(short s)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Seven Booked in India for Killing Neighbour’s Rooster
New Delhi (Sputnik): A fight over a seemingly petty issue has resulted in the murder of a rooster. A post-mortem confirms the use of a blade on the rooster's neck.
In a bizarre incident at least seven people have been booked by police in the Indian state of Bihar after a woman’s rooster was found dead following her quarrel with neighbours.
According to the police, Kamla Devi, a resident of a remote village in Bihar, had a dispute with her neighbour.
“Following the long happening dispute, the two parties fought again over a matter two days ago. During the scuffle, the neighbour snatched Kamala Devi's pet rooster and killed it", a senior police officer said.
A post-mortem of the rooster at a local veterinary hospital revealed, it had been killed with a sharp object.
“As per the post-mortem reports, use of blade on the rooster's neck was confirmed. A first information report was lodged for the murder of a rooster under section 429 (Mischief by killing or maiming cattle, etc.), 341 (Punishment for wrongful restrain) and 323 (Punishment for voluntarily causing hurt) of the Indian Penal Code against seven people", the officer added.
A further investigation is underway.


Edit a page on the site with MS Word
While browsing the Cozmos application site
(http://localhost:8080/cozmos?) with Internet Explorer, chose
"Edit page with Microsoft Word" from the File menu. This used to
be mapped to Ctrl-E (pity its not). When finished choose the
regular Save Icon.
This is not a first class experience as MS Word writes dirty HTML. It also does not handle standard HTML images too well.