As has already been said, a widget is a window object that has state and behavior. In terms of Tcl/Tk a widget is created by calling a widget creation command. There is a specific widget creation for each type of widget.
The widget creation command is supplied with arguments. The first argument is always the name you want to give to the resulting widget; the other arguments set the initial state of the widget.
The immediate result of calling a widget creation command is that it returns the name of the new widget. A side-effect is that the instance of the widget is created and its name is defined as in the Tcl interpreter as a procedure through which the widget state can be accessed and manipulated.
This needs an example. We will use the widget creator command button
to make a button widget:
button .fred -text 'Fred' -background red
which creates an instance of a button widget named .fred
that will
display the text Fred
on the button and will have a red background
color. Evaluating this command returns the string .fred
, the name
of the newly created widget.
As a side-effect, a Tcl procedure named .fred
is created.
A call to a widget instance has the following form:
widgetName method methodArgs
where widgetName is the name of the widget to be manipulated, method is the action to be performed on the widget, and methodArgs are the arguments passed to the method that is performed on the widget.
The two standard methods for widgets are configure
and cget
.
configure
- is used to change the state of a widget; for example:
.fred configure -background green -text 'Sid'
will change the background color of the widget .fred
to green
and the text displayed to Sid
.
cget
is used to get part of the state of a widget; for example:
.fred cget -text
will return Sid
if the text on the button .fred
is Sid
.
In addition to these general methods, there are special methods
for each widget type. For example, with button widgets
you have the flash
and invoke
methods.
For example,
.fred invoke
can be called somewhere in the Tcl code to invoke button .fred
as though it had been clicked on.
.fred flash
can be called somewhere in the Tcl code to cause the button to flash.
We will come across some of these special method when we discuss the widgets in detail. For a comprehensive list of widget methods, refer to entry for the appropriate widget creation command in the Tcl/Tk manual.
We now discuss the widget creation command for each widget type.
A label is a simple widget for displaying a single line of text. An example of creating an instance of a label is
label .l -text "Hello world!"
which simply creates the label named .l
with the text `Hello
world!' displayed in it.
Most widgets that display text can have a variable associated with them
through the option -textvariable. When the value of the variable
is changed the text changes in the associated label.
For example,
label .l -text "Hello world!" -textvariable mytext
creates a text label called .l
displaying the initial text `Hello
world!' and associated text variable mytext
; mytext
will start
with the value `Hello world!'. However, if the following script is
executed:
set mytext "Goodbye moon!"
the text in the label will magically change to `Goodbye moon!'.
A message widget is similar to a label widget but for multi-line text. As its name suggests it is mostly used for creating popup message information boxes.
An example of a message widget is
message .msg -text "Your data is incorrect.\n\n \ Please correct it and try again." \ -justify center
which will create a message widget displaying the text shown, center justified. The width of the message box can be given through the -width switch. Any lines that exceed the width of the box are wrapped at word boundaries.
Calling the button
command creates an instance of a button widget.
An example is:
button .mybutton -text "hello" -command {puts "howdie!"}
which creates a button with name .mybutton
that will display
the text "hello" and will execute the Tcl script puts "howdie!"
(that is print howdie!
to the terminal) when clicked on.
Checkbuttons are buttons that have a fixed state that is either on or off. Clicking on the button toggles the state. To store the state, a checkbutton is associated with a variable. When the state of the checkbutton changes, so does that of the variable. An example is:
checkbutton .on_or_off -text "I like ice cream" -variable ice
which will create a checkbutton with name .on_or_off
displaying
the text `I like ice cream' and associated with the variable ice
. If
the checkbutton is checked, ice
will have the value 1; if not
checked, it will have the value 0. The state of the checkbutton can
also be changed by changing the state of the variable. For example,
executing
set ice 0
will set the state of .on_or_off
to not checked.
Radiobuttons are buttons that are grouped together to select one value among many. Each button has a value, but only one in the button group is active at any one time. In Tcl/Tk this is achieved by creating a series of radiobutton that share an associated variable. Each button has a value. When a radiobutton is clicked on, the variable has that value and all the other buttons in the group are put into the off state. Similarly, setting the value of the variable is reflected in the state of the button group. An example is:
radiobutton .first -value one -text one -variable count radiobutton .second -value two -text two -variable count radiobutton .third -value three -text three -variable count
which creates three radiobuttons that are linked through the variable
count
. If button .second
is active, for example, the
other two buttons are in the inactive state and count
has the
value two
. The following code sets the button group to make the
button .third
active and the rest inactive regardless of the current
state:
set count three
If the value of count
does not match any of the values of the
radiobuttons, they will all be off. For example executing the script
set count four
will turn all the radiobuttons off.
An entry widget allows input of a one line string. An example of an entry widget:
label .l -text "Enter your name" entry .e -width 40 -textvariable your_name
would display a label widget named .l
showing the string `Enter
your name' and an entry widget named .e
of width 40 characters.
The value of variable your_name
will reflect the string in the
entry widget: as the entry widget string is updated, so is the value of
the variable. Similarly, changing the value of your_name
in a
Tcl script will change the string displayed in the entry field.
A scale widget is for displaying an adjustable slider. As the slider is moved its value, which is displayed next to the slider, changes. To specify a scale, it must have -from and -to attributes, which is the range of the scale. It can have a -command option, which is set to a script to evaluate when the value of the slider changes.
An example of a scale widget is:
scale .s -from 0 -to 100
which creates a scale widget with name .s
that will slide over a
range of integers from 0 to 100.
There are several other options that scales can have. For example it is possible to display tick marks along the length of the scale through the -tickinterval attribute, and it is possible to specify both vertically and horizontally displayed scales through the -orient attribute.
A listbox is a widget that displays a list of single line strings.
One or more of the strings may be selected through using the mouse.
Initializing and manipulating the contents of a listbox is
done through invoking methods on the instance of the listbox.
As examples, the insert
method is used to insert a string
into a listbox, delete
to delete one, and get
to retrieve
a particular entry. Also the currently selected list items
can be retrieved through the selection
command.
Here is an example of a listbox that is filled with entries of the form
entry N
:
listbox .l for { set i 0 } { $i<10 } { incr i } { .l insert end "entry $i" }
A listbox may be given a height and/or width attribute, in which case it is likely that not all of the strings in the list are visible at the same time. There are a number of methods for affecting the display of such a listbox.
The see
method causes the listbox display to
change so that a particular list element is in view. For example,
.l see 5
will make sure that the sixth list item is visible. (List elements are counted from element 0.)
A scrollbar widget is intended to be used with any widget that is likely to be able to display only part of its contents at one time. Examples are listboxes, canvases, text widgets, and frames, amongst others.
A scrollbar widget is displayed as a movable slider between two arrows. Clicking on either arrow moves the slider in the direction of the arrow. The slider can be moved by dragging it with the cursor.
The scollbar and the widget it scrolls are connected through
Tcl script calls. A scrollable widgets will have a scrollcommand
attribute that is set to a Tcl script to call when the widget
changes its view. When the view changes the command is called,
and the command is usually set to change the state of its associated
scrollbar.
Similarly, the scrollbar will have a command
attribute that is
another script that is called when an action is performed on the
scrollbar, like moving the slider or clicking on one of its arrows.
That action will be to update the display of the associated scrollable
widget (which redraws itself and then invokes its scrollcommand
,
which causes the scrollbar to be redrawn).
How this is all done is best shown through an example:
listbox .l -yscrollcommand ".s set" -height 10 scrollbar .s -command ".l yview" for { set i 0 } { $i < 50 } { incr i } { .l insert end "entry $i" }
creates a listbox named .l
and a scrollbar named .s
. Fifty
strings of the form entry N
are inserted into the listbox. The
clever part is the way the scrollbar and listbox are linked. The
listbox has its -yscrollcommand attribute set to the script
".s set"
. What happens is that if the view of .l
is
changed, this script is called with 4 arguments attached: the
number of entries in the listbox, the size of the listbox window, the
index of the first entry currently visible, and the index of the last
entry currently visible. This is exactly enough information for the
scrollbar to work out how to redisplay itself. For example, changing
the display of the above listbox could result in the following
-yscrollcommand script being called:
.s set 50 10 5 15
which says that the listbox contains 50 elements, it can display
10 at one time, the first element displayed has index 5 and the
last one on display has index 15. This call invokes the set
method of the scrollbar widget .s
, which causes it to redraw
itself appropriately.
If, instead, the user interacts with the scrollbar,
the scrollbar will invoke its -command script, which in this example
is ".l yview"
. Before invoking the script, the scrollbar widget
calculates which element should the first displayed in its associated
widget and appends its index to the call.
For example, if element with index 20 should be the first to be displayed,
the following call will be made:
.l yview 20
which invokes the yview
method of the listbox .l
. This
causes .l
to be updated (which then causes its
-yscrollcommand to be called, which updates the scrollbar).
A frame widget does not do anything by itself except reserve an area of the display. Although this does not seem to have much purpose, it is a very important widget. It is a container widget; that is, it is used to group together collections of other widgets into logical groups. For example, a row of buttons may be grouped into a frame, then as the frame is manipulated so will the widgets displayed inside it. A frame widget can also be used to create large areas of color inside another container widget (such as another frame widget or a toplevel widget).
An example of the use of a frame widget as a container:
canvas .c -background red frame .f button .b1 -text button1 button .b2 -text button2 button .b3 -text button3 button .b4 -text button4 button .b5 -text button5 pack .b1 .b2 .b3 .b4 .b5 -in .f -side left pack .c -side top -fill both -expand 1 pack .f -side bottom
which specifies that there are two main widgets a canvas named .c
and a frame named .f
. There are also 5 buttons, .b1
through .b5
. The buttons are displayed inside the frame. Then
the canvas is displayed at the top of the main window and the frame
is displayed at the bottom. As the frame is displayed at the bottom,
then so will the buttons because they are displayed inside the frame.
(The pack
command causes the widgets to be handled for display
by the packer geometry manager. The -fill and -expand 1
options to pack for .c
tell the display manager that if the
window is resized, the canvas is to expand to fill most of the
window. You will learn about geometry managers later in the Geometry
Managers section.)
A toplevel widget is a new toplevel window. It is a container widget
inside which other widgets are displayed. The root toplevel widget has
path .
— i.e. dot on its own. Subsequent toplevel widgets
must have a name that is lower down the path tree just like any other
widget.
An example of creating a toplevel widget is:
toplevel .t
All the widgets displayed inside .t
must also have .t
as
the root of their path. For example, to create a button widget for
display inside the .t
toplevel the following would work:
button .t.b -text "Inside 't'"
(Attributes, such as size and title, of toplevel widgets can be changed
through the wm
command, which we will not cover in this
tutorial. The reader is referred to the Tk manual.)
Yet another kind of container is a menu widget. It contains a list of
widgets to display inside itself, as a pulldown menu. A simple entry in
a menu widget is a command
widget, displayed as an option in the
menu widget, which if chosen executes a Tcl command. Other types of
widgets allowed inside a menu widget are radiobuttons and checkboxes. A
special kind of menu item is a separator
that is used to group
together menu items within a menu. (It should be noted that the widgets
inside a menu widget are special to that menu widget and do not have an
independent existence, and so do not have their own Tk name.)
A menu widget is built by first creating an instance of a menu
widget (the container) and then invoking the add
method
to make entries into the menu.
An example of a menu widget is as follows:
menu .m .m add command -label "Open file" -command "open_file" .m add command -label "Open directory" -command "open_directory" .m add command -label "Save buffer" -command "save_buffer" .m add command -label "Save buffer as..." -command "save_buffer_as" .m add separator .m add command -label "Make new frame" -command "new_frame" .m add command -label "Open new display" -command "new_display" .m add command -label "Delete frame" -command "delete_frame"
which creates a menu widget called .m
, which contains eight menu
items, the first four of which are commands, then comes a separator
widget, then the final three command entries. (Some of you will notice
that this menu is a small part of the Files
menu from the menubar of
the Emacs text editor.)
An example of a checkbox and some radiobutton widget entries:
.m add checkbox -label "Inverse video" -variable inv_vid .m add radiobutton -label "black" -variable color .m add radiobutton -label "blue" -variable color .m add radiobutton -label "red" -variable color
which gives a checkbox displaying `Inverse video', keeping its
state in the variable inv_vid
, and three radiobuttons linked through
the variable color
.
Another menu item variant is the cascade
variant, which is used
to make cascadable menus, i.e. menus that have submenus.
An example of a cascade entry is the following:
.m add cascade -label "I cascade" -menu .m.c
which adds a cascade entry to the menu .m
that displays the text
`I cascade'. If the `I cascade' option is chosen from the .m
menu
then the menu .m.c
will be displayed.
The cascade option is also used to make menubars at the top of an application window. A menu bar is simply a menu each element of which is a cascade entry, (for example). The menubar menu is attached to the application window through a special configuration option for toplevel widgets, the -menu option. Then a menu is defined for each of the cascade entry in the menubar menu.
There are a large number of other variants to menu widgets: menu items can display bitmaps instead of text; menus can be specified as tear-off menus; accelerator keys can be defined for menu items; and so on.
 The menu of the menubutton is defined through the menu
command
and is attached to the menubutton.
An example of a menu button:
menubutton .mb -menu .mb.m -text "mymenu" menu .mb.m .mb.m add command -label hello .mb.m add command -label goodbye
which crates a menubutton widget named .mb
with attached menu
.mb.m
and displays the text `mymenu'. Menu .mb.m
is
defined as two command options, one labelled hello
and the other
labelled goodbye
. When the menubutton .mb
is clicked on,
the menu .mb.m
will popup and its options can be chosen.
A canvas widget is a container widget that is used to manage the drawing of complex shapes; for example, squares, circles, ovals, and polygons. (It can also handle bitmaps, text and most of the Tk widgets too.) The shapes may have borders, filled in, be clicked on, moved around, and manipulated.
We will not cover the working of the canvas widget here. It is enough to know that there is a powerful widget in the Tk toolkit that can handle all manner of graphical objects. The interested reader is referred to the Tk manual.
A text widget is another powerful container widget that handles multi-line texts. The textwidget can display texts with varying font styles, sizes, and colors in the same text, and can also handle other Tk widgets embedded in the text.
The text widget is a rich and complicated widget and will not be covered here. The interested reader is referred to the Tk manual.


Teaching
Overview
Courses
I have been a teaching assistant in the following courses:
Jan-May 2019
Jan-May 2017
Sep-Dec 2017
CSCI 570 Analysis of Algorithms (USC)
COMS 4735 Visual Interfaces to Computers (Columbia University)
The course is a survey of existing research systems that allow computers to accept and manipulate visual input, usually from real time cameras, in order to direct further computer processing.
COMS 4113 Fundamentals of Large-Scale Distributed System (Columbia University)
This class teaches design and implementation techniques that enable the building of fast, scalable, fault-tolerant distributed systems.


VLC(1) VLC(1) NAME vlc, qvlc, svlc, nvlc, rvlc, cvlc - the VLC media player SYNOPSIS vlc [OPTIONS] [ITEMS]... DESCRIPTION This manual page documents briefly the VLC multimedia player and server. OPTIONS VLC follows the usual GNU command line syntax, with long options starting with two dashes (`-'). For a precise description of options, please use "vlc --help". The complete list of VLC options depends on what plugins are installed because they automatically add their own options. Please use "vlc --longhelp --advanced" for a complete list of available options. ITEMS VLC recognizes several URL-style items: *.mpg, *.vob, *.avi, *.mp3, *.ogg, *.opus Various multimedia file formats dvd://[<device>][@<raw device>][#[<title>][:[<chapter>][:<angle>]]] DVD device (for instance dvd:///dev/dvd). The raw device is optional and must have been prepared beforehand. vcd://[<device>][@{E|P|E|T|S}[<number>]] VCD device (for instance vcd:///dev/cdrom). udp://[@[<multicast address>][:<local port>]] UDP stream, such as one sent by VLS or another VLC. Usually "udp://" is enough. http://<server address>[:<server port>]/[<file>] HTTP stream rtsp://<server address>[:<server port>]/<stream name> RTSP Video On Demand stream vlc://<command> Execute a playlist command. Commands are: pause (pause execution of other items), and quit (close VLC). SEE ALSO Online documentation: http://www.videolan.org/doc/ AUTHOR This manual page was written by Sam Hocevar<EMAIL_ADDRESS>for the Debian GNU/Linux system (but may be used by others). Feb 14, 2005 VLC(1)


This is an image which is stored as part of the pages asset in the content/
subdirectory:
This post overrides the name
page variable, by specifying another name as part of the metadata file default.yaml
in the post's directory. See how the URL and post title differ.


Just a grab-bag to show syntax:
module Trilean
exposing
( Reason
, Trilean
, isSure
, reason
)
-- ...
-- ...
type alias Reason =
String
type Trilean
= Yes
| No
| Other Reason
-- ...
-- ...
isSure : Trilean -> Bool
isSure trilean =
case trilean of
Yes ->
True
_ ->
False
-- ...
-- ...
reason : Trilean -> Maybe String
reason trilean =
case trilean of
Other str ->
Just str
_ ->
Nothing
-- ...
String
Maybe String
Important: You cannot use a Maybe String like a String any more than you can use an Array of Strings like a single String in Ruby.
singleDigitInts : List Int
singleDigitInts =
[ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ]
-- or `List.range 0 9`
doubleList : List Int -> List Int
doubleList list =
List.map (\int -> 2 * int) list
-- in Ruby:
-- list.map { |int| 2 * int }
map : (a -> b) -> ConcreteType a -> ConcreteType b
-- for List
map : (a -> b) -> List a -> List b
-- for Maybe
map : (a -> b) -> Maybe a -> Maybe b
-- Elm does not have Higher-Kinded Types, so this doesn't work:
map<M> : (a -> b) -> M a -> M b
Note: Lack of Higher-Kinded Types in this situation means you can't have a generic map function that works on anything "mappable."
normalizeString : String -> String
normalizeString input =
let
trimmed = String.trim input
lower = String.toLower trimmed
in
String.padLeft 8 ' ' lower
ok, ok, "forward function application"
normalizeString : String -> String
normalizeString input =
let
trimmed = String.trim input
lower = String.toLower trimmed
in
String.padLeft 8 ' ' lower
alsoNormalizeString : String -> String
alsoNormalizeString input =
input
|> String.trim
|> String.toLower
|> String.padLeft 8 ' '
You can supply only some arguments to any function, though only from left-to-right.
-- type signature of String.padLeft:
padLeft : Int -> Char -> String -> String
-- effective type signature of String.padLeft:
padLeft : Int -> (Char -> (String -> String))
Therefore, if you know the padding width, but not the padding char or the string, you can do:
String.padLeft 8
-- <function> : Char -> String -> String
alsoNormalizeString : String -> String
alsoNormalizeString input =
input
|> String.trim
|> String.toLower
|> String.padLeft 8 ' '
moreNormalizeString : String -> String
moreNormalizeString =
String.trim >> String.toLower >> String.padLeft 8 ' '
Note: This is kinda advanced and not completely necessary for the purposes of this workshop
parenNormalizeString : String -> String
parenNormalizeString input =
String.padLeft 8 ' ' (String.toLower (String.trim input))
anotherNormalizeString : String -> String
anotherNormalizeString input =
String.padLeft 8 ' ' <| String.toLower <| String.trim input
Note: Much like in Ruby, the balance between using and not using parens is subject to much debate
x = 42 -- Int
y = 3.14 -- Float
c = '.' -- Char (rarely used)
s = "hello world" -- String
l = [] -- List a
t = (1, "foo", 4.0) -- Tuple of type (Int, String, Float)
-- Record of type { foo : String, bar : Int }
r = { foo = "foo", bar = 123}
-- Bool
b1 = True
b2 = False
-- Maybe a
-- here, "Maybe String"
m1 = Just "a string"
m2 = Nothing
-- Result a b
-- here, "Result String Int"
r1 = Ok 42
r2 = Err "error message"
-- ours
type Trilean
= Yes
| No
| Other Reason
-- builtin
type Result a b
= Err a
| Ok b
type Maybe a
= Just a
| Nothing
type Maybe a
= Just a
| Nothing
-- Type constructors
Just : a -> Maybe a
Nothing : Maybe a
type Result a b
= Err a
| Ok b
-- List
first : List a -> Maybe a
-- String
join : String -> List String -> String
-- Json.Decode
decodeString : Decoder a -> String -> Result String a
-- List
filter : (a -> Bool) -> List a -> List a


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import config.ApplicationConfig @import views.html.helpers._ @import models.Leaving @import views.ViewHelpers @this(gmpMain: gmp_main, viewHelpers: ViewHelpers) @(dateOfLeavingForm: Form[models.Leaving],scenario: String)(implicit request: Request[_], context: config.GmpContext, messages: Messages,applicationConfig: config.ApplicationConfig) @implicitFormInstance = @{ Some(dateOfLeavingForm) } @pageScripts = { } @heading = { @{scenario match { case CalculationType.DOL => Messages("gmp.leaving.dol.question") case CalculationType.SPA | CalculationType.PAYABLE_AGE | CalculationType.REVALUATION => Messages("gmp.other.dol.left.question") case CalculationType.SURVIVOR => Messages("gmp.survivor.dol.question")} } } @gmpMain(title = heading + " - " + Messages("service.title") + " - " + Messages("gov.uk"), pageScripts = Some(pageScripts)) { @includes.back_link(Messages("gmp.bulk.problem.header")) @views.html.helpers.errorSummary(dateOfLeavingForm, formHeaderKey=heading.toString) @viewHelpers.form(action = routes.DateOfLeavingController.post) {


{# #} {# #} {# #}
There are five parts included in our project- a timeline of arts’ general types, a tree of arts’ types and objects, a word cloud of their key words, a list for masterpieces, and also, a gallery to present the arts to users.
The timeline: We design a timeline to describe the relationship between the centuries when the arts were created and the types of them. On this time line, we can click on it to look for more details of the periods we selected, zoom in and out to see it more clearly , and select the periods to get more information in the parts of tree, word cloud and masterpieces.
The tree: The tree is designed to make our users get more information about the types and objects of the arts in the period they selected from the timeline.
The word cloud: From the word cloud parts, users will get detailed description of the arts from the periods they selected, and when they click on the words, the webpage of the word will appear to tell more details about them.
The list: Here we present a list to make users know the most famous artists of the period they selected.
The gallery: In this gallery, uses can see the arts directly from their desired periods.
Let's take a time machine to start artistic journey together!
Want to know western art history? Try it!
Filter by artwork gene type or check this era's masters info.
Artiest Intro
Filter by description key words. (Not implemented yet, but you still can view this period's description key words)
You can press refresh to get new different images!


Random Number Generation Engine Class. More...
#include <random.h>
Public Member Functions | |
| randomEngine (randomEngineType typeIn=AF_RANDOM_ENGINE_DEFAULT, unsigned long long seedIn=0) | |
| This function creates a af::randomEngine object with a af::randomEngineType and a seed. | |
| randomEngine (const randomEngine &other) | |
| Copy constructor for af::randomEngine. | |
| randomEngine (af_random_engine engine) | |
| Creates a copy of the random engine object from a af_random_engine handle. | |
| ~randomEngine () | |
| Destructor for af::randomEngine. | |
| randomEngine & | operator= (const randomEngine &other) |
| Assigns the internal state of randome engine. | |
| void | setType (const randomEngineType type) |
| Sets the random type of the random engine. | |
| randomEngineType | getType (void) |
| Return the random type of the random engine. | |
| void | setSeed (const unsigned long long seed) |
| Sets the seed of the random engine. | |
| unsigned long long | getSeed (void) const |
| Returns the seed of the random engine. | |
| af_random_engine | get (void) const |
| Returns the af_random_engine handle of this object. | |
Random Number Generation Engine Class.
The af::randomEngine class is used to set the type and seed of random number generation engine based on af::randomEngineType.
|
explicit |
This function creates a af::randomEngine object with a af::randomEngineType and a seed.
| randomEngine | ( | const randomEngine & | other | ) |
Copy constructor for af::randomEngine.
| [in] | other | The input random engine object |
| randomEngine | ( | af_random_engine | engine | ) |
Creates a copy of the random engine object from a af_random_engine handle.
| [in] | engine | The input random engine object |
| ~randomEngine | ( | ) |
Destructor for af::randomEngine.
| af_random_engine get | ( | void | ) | const |
Returns the af_random_engine handle of this object.
| unsigned long long getSeed | ( | void | ) | const |
Returns the seed of the random engine.
| randomEngineType getType | ( | void | ) |
Return the random type of the random engine.
| randomEngine & operator= | ( | const randomEngine & | other | ) |
Assigns the internal state of randome engine.
| [in] | other | The object to be assigned to the random engine |
| void setSeed | ( | const unsigned long long | seed | ) |
Sets the seed of the random engine.
| [in] | seed | The initializing seed of the random number generator |
| void setType | ( | const randomEngineType | type | ) |
Sets the random type of the random engine.
| [in] | type | The type of the random number generator |


1. 本服务的宗旨是在不违反塞舌尔共和国相关法律法规的前提下，尽可能地为全球广大数字资产爱好者及用户提供专业、安全、可信赖的数字资产兑换服务。但您所在国家或地区属于监管明确禁止数字资产交易的法域或属于被列入相关受制裁国家名单的，您应禁止使用本服务。
2. 请您确保币币兑换属于自愿行为，并确认不使用数字货币参与任何传销、非法集资、诈骗等违法活动，请警惕一切许诺高额利息回报的非法项目，谨防上当受骗，避免造成不必要的财产损失。
3. 如果出现异常币币兑换行为可能会触发第三方风控系统，请配合完成身份认证，以便完成币币兑换订单。
4. 请注意，币币兑换不支持任何洗钱或其他非法活动，且当前并不支持任何一种完全匿名的数字货币，因此，在您使用币币兑换服务后，您的交易记录仍在链上可查，当您把一种数字货币兑换为另一种数字货币时，比如将
ETH 兑换为 BTC，您的交易记录在链上仍然是公开可查的。兑换后的 BTC
在比特币区块链上仍然能查询到之后的流向，币币兑换服务并不能带来额外的匿名性。当有权机关出示相应的调查文件要求本服务配合对指定用户进行调查时，我们将在核查司法文件的有效性和真实性后，按照经判定的有权机关的要求协助提供相应的用户数据，因此造成的用户隐私泄露、账户不能操作及由此给用户所造成的其他损失等，币币兑换服务不承担任何责任。
5. 凡使用币币兑换服务的用户，在交易前均应知悉：数字资产不以任何政府或中央银行为后盾支持，且数字资产价格波动大，持有或使用数字资产具有较高的风险。在作出交易决策前，您应理性审慎检查自身的财务状况以判断是否适合您。
6. 凡以任何方式使用币币兑换服务者，视为自愿接受本声明的约束。
7. 本声明未涉及的问题参见塞舌尔共和国有关法律法规，当本声明与塞舌尔共和国相关法律法规冲突时，以塞舌尔共和国相关法律法规为准。
8. 本声明可能以不同语言发布。 如有任何差异，以英文版为准。
1. The purpose of this service is to provide professional, safe and reliable digital asset exchange services to the global digital asset fans and users as much as possible without violating the relevant laws and regulations of the Republic of Seychelles.
However, if your country or region is a jurisdiction that explicitly prohibits the trading of digital assets or belongs to the list of relevant sanctioned countries, you should not the use of this service.
2. Please ensure that your swap is voluntary and confirm that you do not use digital currency to participate in any illegal activities such as pyramid schemes, illegal fund-raising, fraud, etc. Please be alert to all illegal projects that promise high
interest returns, beware of being deceived and avoid unnecessary property loss.
3. If an abnormal coin swap behavior may trigger a third-party risk prevention system, please complete the identity verification to complete the coin swap order.
4. Please note that Coin Swap does not support any money laundering or other illegal
activities, and currently does not support any kind of completely anonymous digital currency, so your
transaction history is still on the blockchain after you use the Coin Swap service. When you convert a digital
currency to another digital currency, such as converting ETH to BTC, your transaction history is still
publicly available on the blockchain. The subsequent flow of the previously converted BTC can still be checked
on the Bitcoin blockchain. The Coin Swap service does not bring additional anonymity. When the competent authority issues the corresponding investigation documents and requests the service to cooperate with the designated user’s data,
we will, after verifying the validity and authenticity of the judicial documents, assist in providing the corresponding user data in accordance with the requirements of the competent authority. The Coin Swap service does not assume any responsibility
for the leakage of user privacy, the inability of the account to operate, and other losses caused by the user.
5. Users who use the Coin Swap service should know before the transaction that the digital assets are not backed by any government or central bank, and the price of digital assets fluctuates greatly. The holding or use of digital assets has a higher risk.
Before making a trading decision, you should carefully check your financial situation to determine if it is suitable for you.
6. Anyone who uses the Coin Swap service in any way is deemed to be willing to accept this statement voluntarily.
7. For issues not covered by this statement, please refer to the relevant laws and regulations of the Republic of Seychelles. When this statement conflicts with the relevant laws and regulations of the Republic of Seychelles, the relevant laws and regulations
of the Republic of Seychelles shall prevail.
8. This statement may be published in a different language. In case of any discrepancies, the English version shall prevail.


| inheritance-expectations {testthat} | R Documentation |
See https://adv-r.hadley.nz/oo.html for an overview of R's OO systems, and the vocabulary used here.
expect_type(x, type)
checks that typeof(x)
is type
.
expect_s3_class(x, class)
checks that x
is an S3 object that
inherits()
from class
expect_s3_class(x, NA)
checks that x
isn't an S3 object.
expect_s4_class(x, class)
checks that x
is an S4 object that
is()
class
.
expect_s4_class(x, NA)
checks that x
isn't an S4 object.
See expect_vector()
for testing properties of objects created by vctrs.
expect_type(object, type) expect_s3_class(object, class, exact = FALSE) expect_s4_class(object, class)
object |
Object to test. Supports limited unquoting to make it easier to generate readable failures within a function or for loop. See quasi_label for more details. |
type |
String giving base type (as returned by |
class |
Either a character vector of class names, or
for |
exact |
If |
Other expectations:
comparison-expectations
,
equality-expectations
,
expect_error()
,
expect_length()
,
expect_match()
,
expect_named()
,
expect_null()
,
expect_output()
,
expect_reference()
,
expect_silent()
,
logical-expectations
x <- data.frame(x = 1:10, y = "x", stringsAsFactors = TRUE) # A data frame is an S3 object with class data.frame expect_s3_class(x, "data.frame") show_failure(expect_s4_class(x, "data.frame")) # A data frame is built from a list: expect_type(x, "list") # An integer vector is an atomic vector of type "integer" expect_type(x$x, "integer") # It is not an S3 object show_failure(expect_s3_class(x$x, "integer")) # Above, we requested data.frame() converts strings to factors: show_failure(expect_type(x$y, "character")) expect_s3_class(x$y, "factor") expect_type(x$y, "integer")


BTC vs Gold, interesting patterns. But is this data actionable?
2
Caglio05-Sep-19 03:08 PM
@dukeleto chameleon mobile not accepting it :(
dukeleto05-Sep-19 03:37 PM
@Caglio i think their latest release has a bug where they use old-style Hush addresses, and it's fixed and waiting on a new release. Does it show t1 address for Hush?
Mm2.0 + AtomicDex, sexy AF
@scytale as soon as you buy of course.
mrtzmp305-Sep-19 04:55 PM
Lol binance awards was tremendous lmao
mrtzmp305-Sep-19 05:07 PM
Fuck if 580 fails I don't know next stop 80 according my charts(edited)
It's like somebody Is selling above his walls moving it gradually lower(edited)
Damn guys
@Deleted User make it stop
Well thx lmao
Neko05-Sep-19 05:13 PM
I have a theory, kmd is one of the few unrealized 1+bi blockchain, the whales want to milk as much cheap kmd as possible
mrtzmp305-Sep-19 05:16 PM
Lay down the crackpipe
It's just one fucking whale who makes the price
Markus05-Sep-19 05:17 PM
airdrop selling have started
mrtzmp305-Sep-19 05:17 PM
Sir no fud pls
Look in the order book
@Markus
Everybody keen on market selling so no sell orders up, because there is no hope
Thus the heavens and the earth were completed in all their vast array. 2 By the seventh day God had finished the work he had been doing; so on the seventh day he rested from all his work. 3 Then God blessed the seventh day and made it holy, because on it he rested from all the work of creating that he had done.
Genesis 9:12-16
12 And God said, “This is the sign of the covenant I am making between me and you and every living creature with you, a covenant for all generations to come: 13 I have set my rainbow in the clouds, and it will be the sign of the covenant between me and the earth. 14 Whenever I bring clouds over the earth and the rainbow appears in the clouds, 15 I will remember my covenant between me and you and all living creatures of every kind. Never again will the waters become a flood to destroy all life. 16 Whenever the rainbow appears in the clouds, I will see it and remember the everlasting covenant between God and all living creatures of every kind on the earth.”


Written words are often misinterpreted. And this can lead to confusion, frustration or even conflict. Research has proven that people react to emoticons (and emojis) the same way they would react to a real human face. So emojis actually help you communicate better while you're texting. I bet there's no misunderstanding what the little guy on the right is expressing.
This is your chance to welcome emojis in your day-to-day real life, not just while your WhatsApping or texting. You can get stickers. Big ones or small ones. Or magnets. So that you can finally communicate better on your fridge! (Yep, I knew you were waiting for this!)
Tell us what you want. Big stickers? Small stickers? Or do you prefer magnets? Just enter your email address and get lucky to win any of the above!


TimeseriesGenerator
Utility class for generating batches of temporal data.
Inherits From: Sequence
tf.compat.v1.keras.preprocessing.sequence.TimeseriesGenerator
tf.compat.v2.keras.preprocessing.sequence.TimeseriesGenerator
This class takes in a sequence of data-points gathered at equal intervals, along with time series parameters such as stride, length of history, etc., to produce batches for training/validation.
data: Indexable generator (such as list or Numpy array) containing consecutive data points (timesteps). The data should be at 2D, and axis 0 is expected to be the time dimension. targets: Targets corresponding to timesteps in `data`. It should have same length as `data`. length: Length of the output sequences (in number of timesteps). sampling_rate: Period between successive individual timesteps within sequences. For rate `r`, timesteps `data[i]`, `data[i-r]`, ... `data[i - length]` are used for create a sample sequence. stride: Period between successive output sequences. For stride `s`, consecutive output samples would be centered around `data[i]`, `data[i+s]`, `data[i+2*s]`, etc. start_index: Data points earlier than `start_index` will not be used in the output sequences. This is useful to reserve part of the data for test or validation. end_index: Data points later than `end_index` will not be used in the output sequences. This is useful to reserve part of the data for test or validation. shuffle: Whether to shuffle output samples, or instead draw them in chronological order. reverse: Boolean: if `true`, timesteps in each output sample will be in reverse chronological order. batch_size: Number of timeseries samples in each batch (except maybe the last one).
A [Sequence](/utils/#sequence) instance.
from keras.preprocessing.sequence import TimeseriesGenerator import numpy as np data = np.array([[i] for i in range(50)]) targets = np.array([[i] for i in range(50)]) data_gen = TimeseriesGenerator(data, targets, length=10, sampling_rate=2, batch_size=2) assert len(data_gen) == 20 batch_0 = data_gen[0] x, y = batch_0 assert np.array_equal(x, np.array([[[0], [2], [4], [6], [8]], [[1], [3], [5], [7], [9]]])) assert np.array_equal(y, np.array([[10], [11]]))
__init__
__init__( data, targets, length, sampling_rate=1, stride=1, start_index=0, end_index=None, shuffle=False, reverse=False, batch_size=128 )
Initialize self. See help(type(self)) for accurate signature.
__getitem__
__getitem__(index)
__iter__
__iter__()
Create a generator that iterate over the Sequence.
__len__
__len__()
get_config
get_config()
Returns the TimeseriesGenerator configuration as Python dictionary.
A Python dictionary with the TimeseriesGenerator configuration.
on_epoch_end
on_epoch_end()
Method called at the end of every epoch.
to_json
to_json(**kwargs)
Returns a JSON string containing the timeseries generator
configuration. To load a generator from a JSON string, use
keras.preprocessing.sequence.timeseries_generator_from_json(json_string)
.
**kwargs: Additional keyword arguments to be passed to `json.dumps()`.
A JSON string containing the tokenizer configuration.


|
QuantLib: a free/open-source library for quantitative finance
Fully annotated sources - version 1.30
|
Singular value decomposition. More...
#include <ql/math/matrixutilities/svd.hpp>
Public Member Functions | |
| SVD (const Matrix &) | |
| const Matrix & | U () const |
| const Matrix & | V () const |
| const Array & | singularValues () const |
| Matrix | S () const |
| Real | norm2 () const |
| Real | cond () const |
| Size | rank () const |
| Array | solveFor (const Array &) const |
Private Attributes | |
| Matrix | U_ |
| Matrix | V_ |
| Array | s_ |
| Integer | m_ |
| Integer | n_ |
| bool | transpose_ |
Singular value decomposition.
Refer to Golub and Van Loan: Matrix computation, The Johns Hopkins University Press
| const Matrix & U | ( | ) | const |
| const Matrix & V | ( | ) | const |
| const Array & singularValues | ( | ) | const |
| Size rank | ( | ) | const |


Note: This is the demo content for demonstration purpose only. The primary function of this content is to show you what this theme can do. There is a more detailed explanation in the Getting Started section.
There are two types of callouts available in this theme,
note and important. To add a callout to
your documentation simply add the following html
code with
class important
or note
. Like in the example
bellow.
Copy the code and modify these blocks according to your needs.

Important:
This is an "Important" callout block of text.
This block indicates a warning or caution.
Use it for an important message.

Note:
This is a "Note" callout block of text.
This block signifies a general note.

Important: This is an “Important” callout block of text. This block indicates a warning or caution. Use it for an important message.
Note: This is a “Note” callout block of text. This block signifies a general note.
Note: Code blocks have copy functionality. To copy the code press the grey button located in the right side top corner.
You can create simple code blocks by placing triple backticks
```
before and after the code block. To render a code block
more readable, we recommend placing a blank line before and after code
blocks.
``` if (condition) { code to run if condition is true } else { run some other code instead } ```
if (condition) {
code to run if condition is true
} else {
run some other code instead
}
You can build tables with markdown to help you organize information. To add a table, use three or more hyphens (—) to create each column’s header, and use pipes (|) to separate each column like in the example below.
| Title | Title | | ------| ----- | | Text | Text | | Text | Text |
| Title | Title |
|---|---|
| Text | Text |
| Text | Text |
Note: Creating tables with hyphens and pipes can be time-consuming. To speed up the process, try using the Markdown Tables Generator.
We’ve packed this theme with powerful features to help you have awesome documentation for your current or next project.
Why not start using this theme today?


cdemi's
27 October 2020 |
Software Development #Software #Dev #Programming |
The State of Developer Ecosystem in 2020 (jetbrains.com) |
| The results of the fourth annual JetBrains Developer Ecosystem Survey 2020 based on the insights of almost 20,000 developers. Learn about programming languages, tools, technologies, and even developer lifestyles.... Read more |
Building Mental Models of Ideas That Don’t Change (engineering.shopify.com) |
| I hope these mental models are as valuable for you as they are for me. I’ll be presenting these ideas at ShipIt! Presents: Building Mental Models of Ideas That Don’t Change on October 28, 2020 at 1 pm EST (sign up here). I’ll go over the process of prioritizing new ideas and coming up with a system ... Read more |
.NET #dotNet |
Webinar – .NET Microservices == MEGAFUN – .NET Tools Blog (blog.jetbrains.com) |
| Join us Tuesday, November 17, 2020, 16:00 - 17:00 CET (10:00 AM - 11:00 AM EST or check other timezones) for our free live webinar, .NET Microservices == MEGAFUN, with LaBrina Loving.... Read more |
The Future of .NET is .NET 5 (youtu.be) ig20 ignite ignite 2020 microsoft ignite 2020 microsoft ignite microsoft msft ignite 2020 msft ignite ms ignite 2020 ms ignite DB123 The Future of .NET is .NET 5 DB123 Digital Breakout Scott Hunter |
| Get the latest updates in .NET and how you can be more productive building apps that run on any platform or device. Learn about some of the exciting things we're working on for .NET 5 and beyond. Learn more on our blog -- https://aka.ms/dotnet5 #MSIgnite... Read more |
Microsoft® and the .NET Foundation announce the release of version 1.0 of .NET for Apache® Spark™ (techcommunity.microsoft.com) Azure HDInsight Azure Databricks .NET for Spark Synapse Spark Apache Spark |
| It is our pleasure to announce the release of version 1.0 of .NET for Apache® Spark™, an open source package that brings .NET development to the Apache® Spark™ platform. The new 1.0 release of .NET for Apache® Spark™ includes the following: Support for .NET applications targeting .NET Standard 2.0 ...... Read more |
User Experience #UX |
Under the hood: Updating LinkedIn's UI (engineering.linkedin.com) |
| Across LinkedIn, we recently launched a new design that brings a warmer, more inclusive feeling to our products. Throughout the planning phases of this process, we were met with challenging questions in implementing this redesign, such as, “How do you modernize and refresh a user interface (UI) across three applications that combined have over 5,000 pages and hundreds of developers working within that code every day?” and “How do you do this while not blocking product development for our 706+ million members leveraging our platform?” It turned out to be quite the engineering challenge. This is the story of how many teams worked together to update the LinkedIn UI in less than 60 days—from kickoff to launch.... Read more |
Cloud |
Microsoft launches Azure Space initiative; partners with SpaceX | ZDNet (zdnet.com) |
| Microsoft is using its 'Amazon is your competitor' playbook to try to win over more satellite partners and customers. It's also launching a new Azure in a shipping container offering called Azure Modular Datacenter.... Read more |
Kubernetes #k8s |
Announcing Akri, an open source project for building a connected edge with Kubernetes (cloudblogs.microsoft.com) |
| Akri is a new open source project that is designed to electrify the edge for Kubernetes users, exposing leaf devices as resources in Kubernetes clusters.... Read more |
Data |
Magnet: A scalable and performant shuffle architecture for Apache Spark (engineering.linkedin.com) |
| Although Apache Spark has many benefits that contribute to its popularity at LinkedIn and among the industry in general, we’ve still experienced several challenges in operating Spark at our scale. We will focus on Spark shuffle scalability challenges in this blog post and introduce Magnet, a novel push-based shuffle service.... Read more |
Infrastructure #sysadmin |
Road to gRPC (blog.cloudflare.com) gRPC |
| Cloudflare launched support for gRPC during our 2020 Birthday Week. In this post, we’ll do a deep-dive into the technical details of how we implemented support.... Read more |
|
This newsletter is made with 💖 by cdemi and sponsored by moo Research. You can find this MIT Licensed open-source project on GitHub cdemi/NewsletterCurator. You can also find an archive of all sent newsletters on GitHub at https://newsletters.cdemi.io/. If you want to unsubscribe from this newsletter, please click here. If you're new and you want to subscribe to this newsletter, please click here. |


My Week with Marilyn
My Week with Marilyn is a movie starring Michelle Williams, Eddie Redmayne, and Kenneth Branagh. Colin Clark, an employee of Sir Laurence Olivier, documents the tense interaction between Olivier and Marilyn Monroe during the...


UFC Sao Paulo’s Charles Oliveira: ‘I’m the right guy’ to fight Khabib Nurmagomedov
by Lucas RezendeLighweight contender Charles Oliveira has an appointment with Jared Gordon on Saturday night at UFC Sao Paulo. However, that does not stop the submission specialist from thinking about his future in the UFC.
In an interview with Ag Fight, ‘Do Bronx’ made sure to establish he was not overlooking his upcoming fight with Gordon, but could not help but claim that current lightweight champion, Khabib Nurmagomedov, has yet to take on a grappler with his skill set. And Oliveira thinks could pose a real threat to the Russian’s undefeated record.
“I can’t say anything about Khabib, he’s been defeating everybody, He beat all the top guys. But they’re all strikers, none of them were jiu-jitsu guys who were unafraid of being taken down. I’m the answer to his game, I’m the right guy to fight Khabib, I think that, if I win two more fights, who knows, I might have this opportunity to fight him. It would be great since I have my jiu-jitsu and I’m not afraid of being taken down.”
Currently on a five-fight winning streak, with four submissions and one TKO victory, Charles Oliveira (27-8-1 NC) defeated the likes of Clay Guida, Jim Miller, Christos Giagos, David Teymur, and Nik Lentz, His last loss happened in December 2017, when he was TKO’d by Paul Felder.
Now, the 30-year-old is expected to meet Jared Gordon at UFC Fight Night 164, in Sao Paulo, Brazil, on November 16. The card is scheduled to be headlined by a light heavyweight bout between former middleweight Ronaldo ‘Jacare’ Souza and contender Jan Blachowicz.


| Port | Type | Severity | Details |
|---|---|---|---|
| tms | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_tlr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_rti | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_sdrs | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_cdr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_sdr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_e1dr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_pdr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_e2dr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_udr | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_sirs | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_cir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_sir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_e1ir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_pir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_e2ir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |
| jtag_state_uir | Output | Warning | Declared by entity but not connected by instance. Logic that only feeds a dangling port will be removed. |


{include file="../application/home/view/common/header.html" /}
{include file="../application/home/view/common/aside.html" /}
友情链接
OPPO R11


Publications
-
Qianqian Ma, Dan Kushnir, “Graph-based Impact-driven Exploration for Procedually-generated Environment”, in preparation, 2021.
-
Qianqian Ma, Yang-Yu Liu, Alex Olshevsky, “Optimal Vaccine Allocation for Epidemic Control”, in preparation, 2021.
-
Qianqian Ma, Yang-Yu Liu, Alex Olshevsky, “Optimal Lockdown for Pandemic Control”, preprint, 2021. [PDF]
-
Qianqian Ma, Alex Olshevsky, “Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion”, 2020 Neural Information Processing Systems (NeurIPS). [PDF] [code (Python)][code (Matlab)] [video]
-
Can Qin, Lichen Wang, Qianqian Ma, “Contradictory Structure Learning for Semi-supervised Domain Adaptation”, 2021 SIAM International Conference on Data Mining (SDM). [PDF]
-
Lichen Wang, Bo Zong,Qianqian Ma, Wei Cheng, Jingchao Ni, Wenchao Yu, Yanchi Liu, Dongjing Song, Haifeng Chen, and Yun Fu, “Inductive and Unsupervised Representation Learning on Graph Structured Objects”, 2020 International Conference on Learning Representations (ICLR). [PDF] [code]
-
Qianqian Ma, Li Li, Guangcheng Ma, Daling Jia, Hongwei Xia, “A new fuzzy H filter design for nonlinear time-delay systems with mismatched premise membership functions”, 2017 International Federation of Automatic Control World Congress (IFAC). [PDF]
-
Qianqian Ma, Li Li, Junhui Shen, Haowei Guan, Guangcheng Ma, Hongwei Xia, “Improved fuzzy H&infin filter design method for nonlinear systems with time-varying delay”, 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC). [PDF]
-
Qianqian Ma, Hongwei Xia, Guangcheng Ma, Yong Xia, Chong Wang, “Improved stability and stabilization criteria for T-S fuzzy systems with distributed time-delay”, 2017 International Conference of Data Mining and Big Data (DMBD). [PDF]
-
Qianqian Ma, Li Li, Hongwei Xia, Mingyang Yang, and Guangcheng Ma, “New Results on Stability and Stabilization Analyses for T-S fuzzy systems with Distributed Time-Delay under Imperfect Premise Matching”, 2016 International Conference on Intelligent Control and Information Processing (ICICIP). [PDF]
-
Li Li, Qianqian Ma, Hongwei Xia, Hongwei Xia, Guangcheng Ma, and Dali Zhang, “New H_\infty Filter Design Approach for Time-Delay Fuzzy-Model-Based System under Imperfect Premise Matching”, 2016 International Conference on Intelligent Control and Information Processing (ICICIP). [PDF]
Patent
- Changhong Wang, Hongwei Xia, Guangcheng Ma, Qianqian Ma, and Dali Zhang, “Control methods for T-S fuzzy systems with time-delay under imperfect premise matching”, granted China Invention Patent #CN201610976929.7. [PDF]


{% include "../includes/head.html" %}
{% block content %}{% endblock %} {% include "../partials/footer.html" %} {% include "../includes/foot.html" %}


Sign Up
Upload a Photo
Capture a Photo
From Photo Library
UPLOAD
Your name
( Required )
Your email
( Required )
Your phone
( Required )


If you love Telegram but don't want to leave Discord then you'll be pleased to find we've built a bridge in this channel. If you'd like to join the group in the Telegram app you can find it here: https://t.me/KomodoPlatform_Official.
Between 12-Dec-19 12:00 AM and 13-Dec-19 12:00 AM
GatewayBOT12-Dec-19 12:11 AM
[telegram] <Booboo222> Pretty new here. Any help would be greatly appreciated. I need to get my KMD off of Binance and am going to use the Magnum/Trezor method to store. Anyone had experience with this? Pros/cons?
GatewayBOT12-Dec-19 12:37 AM
[telegram] <polycryptoblog> Haven’t heard anything bad about magnum it is closed source though as I recall
GatewayBOT12-Dec-19 08:04 AM
[telegram] <t_dan> That combination is working great for me. (re @Booboo222: Pretty new here. Any help would be greatly appreciated. I need to get my KMD off of Binance and am going to use the Magnum/Trezor method to store. Anyone had experience with this? Pros/cons?)
GatewayBOT12-Dec-19 08:52 AM
[telegram] <t_dan> That's strange, I didn't leave and re-join the group. (re @You: )
GatewayBOT12-Dec-19 10:40 AM
[telegram] <bitgrinmw> Bought my first kmd earlier today. I got out of Arrr after the weekly meeting b/c I'm not cool with the OS on USB. As if crypto isn't hard enuf
GatewayBOT12-Dec-19 10:48 AM
[telegram] <Acura360> you mean Ghostship ? (re @bitgrinmw: Bought my first kmd earlier today. I got out of Arrr after the weekly meeting b/c I'm not cool with the OS on USB. As if crypto isn't hard enuf )
[telegram] <Acura360> You sold your ARRR because of Ghostship?
Don't get the sense of it.
GatewayBOT12-Dec-19 11:07 AM
[telegram] <ZaferGraph> Stop working and don't develop the project guys, it's not cool (re @Acura360: You sold your ARRR because of Ghostship?
Don't get the sense of it.)
[telegram] <Regnar> Fair enough. I think it's low but okay(edited)
[telegram] <bitgrinmw> Perfect
[telegram] <Regnar> But the OS is only one part of what they are doing, and isn't the entirety of it. But nvm I'm sure you did your research, I'm still a fan
[telegram] <bitgrinmw> Had better opp anyhow
GatewayBOT12-Dec-19 11:44 AM
[telegram] <Regnar> Yea I mean, that is the nature of open source development/projects. People come along who like the project and they bring their skills and capabilities with them to try and help the project in the way they know best.
I know Python so that's what I usually build stuff with. Some people are experts at Android dev, or iOS, or custom desktop OS. I don't hold it against an open source project if people come along and want to build something for it.
Not like Pirate is this massive business, or had a huge ICO and is spending frivolously
[telegram] <Regnar> But you like what you like, it's your investment (re @bitgrinmw: Had better opp anyhow )
GatewayBOT12-Dec-19 12:04 PM
[telegram] <Tom>
[telegram] <Tom> Hello fellas, heard OKEx is building a new community and there will be plenty of giveaways and tutorials. Join group: OKEx Official & OKB English Group
OKEx has built a new community group. There will be sessions of Operating Guide, Market Analysis, Investment course, Influencers' sharing and various promotions. To know more please visit:OKEx Official & OKB English Group
OKB is pumping and they have built a new community for OKB. Don't miss it: OKEx Official & OKB English Group
GatewayBOT12-Dec-19 12:59 PM
[telegram] <BearTheTrader> i hope that the stable coin project from komodo comes fast, i yesterday put my DAIs on Oasis to see what is it about and i have to say that it should be taken as inspiration by komodo development staff, it is clean, it works but it would be so much better with KMD low fees and less risk of congestion, i want so hard that komodo wins this race.(edited)
GatewayBOT12-Dec-19 01:09 PM
[telegram] <BearTheTrader> i would like something like this in pegs-cc(edited)
[telegram] <BearTheTrader>
[telegram] <BearTheTrader>
GatewayBOT12-Dec-19 01:20 PM
[telegram] <t_dan> Pegs will be decentralized, meaning you put your own kmd as collateral.
We are happy to announce that #Komodo website is now available in Turkish!
Komodo, blokzincir teknolojisi sektöründe en hızlı büyüyen ülkelerin başında yer alan Türkiye ile buluşuyor!
Hoş geldiniz arkadaşlar!
✨ https://t.co/Lr3o59YdiK
#blo...
[telegram] <Mixic> Friendly reminder that the Marmara University in Istanbul, Turkey is organizing their first Blockchain workshop, sponsored by Komodo. All content and workshop will be held in Turkish. If you are in Istanbul, Turkey on that date, feel free to join.
For more information or questions check the #marmara channel.
Marmara University Goztepe Campus
Education, Hizirbey Cd. · Kadıköy
Address: https://www.google.com/maps/search/?api=1&query=40.987312%2C29.053986
Friday, December 13, 2019
14:00 until 19:00
Free Ticket : https://www.eventbrite.com/e/blokzincir-calistayi-tickets-84414659519
Marmara Üniversitesi Göztepe Kampüsünde, blockchain topluluğu tarafından düzenlenecek olan workshopa davetlisiniz.
GatewayBOT12-Dec-19 05:27 PM
[telegram] <Andi> Dont tell erdogan (re @Mixic: Friendly reminder that the Marmara University in Istanbul, Turkey is organizing their first Blockchain workshop, sponsored by Komodo. All content and workshop will be held in Turkish. If you are in Istanbul, Turkey on that date, feel free to join.
For more information or questions check the #marmara channel.
Marmara University Goztepe Campus
Education, Hizirbey Cd. · Kadıköy
Address: https://www.google.com/maps/search/?api=1&query=40.987312%2C29.053986
Friday, December 13, 2019
14:00 until 19:00
Free Ticket : https://www.eventbrite.com/e/blokzincir-calistayi-tickets-84414659519)


Berkovich Space over \(\CC_p\)#
The Berkovich affine line is the set of seminorms on \(\CC_p[x]\), with the weakest topology that makes the map \(| \cdot | \to |f|\) continuous for all \(f \in \CC_p[x]\). The Berkovich projective line is the one-point compactification of the Berkovich affine line.
The two main classes are Berkovich_Cp_Affine
and
Berkovich_Cp_Projective
, which implement the affine and
projective lines, respectively.
Berkovich_Cp_Affine
and Berkovich_Cp_Projective
take as input one of the following: the prime \(p\), a finite
extension of \(\QQ_p\), or a number field and a place.
For an exposition of Berkovich space over \(\CC_p\), see Chapter 6 of [Ben2019]. For a more involved exposition, see Chapter 1 and 2 of [BR2010].
AUTHORS:
Alexander Galarraga (2020-06-22): initial implementation
- class sage.schemes.berkovich.berkovich_space.Berkovich#
Bases:
UniqueRepresentation
,Parent
The parent class for any Berkovich space
- class sage.schemes.berkovich.berkovich_space.Berkovich_Cp#
Bases:
Berkovich
Abstract parent class for Berkovich space over
Cp
.- ideal()#
The ideal which defines an embedding of the
base_ring
into \(\CC_p\).If this Berkovich space is backed by a p-adic field, then an embedding is already specified, and this returns
None
.OUTPUT:
An ideal of a
base_ring
ifbase_ring
is a number field.A prime of \(\QQ\) if
base_ring
is \(\QQ\).None
ifbase_ring
is a p-adic field.
EXAMPLES:
sage: R.<z> = QQ[] sage: A.<a> = NumberField(z^2 + 1) # optional - sage.rings.number_field sage: ideal = A.prime_above(5) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Projective(A, ideal) # optional - sage.rings.number_field sage: B.ideal() # optional - sage.rings.number_field Fractional ideal (-a - 2)
sage: B = Berkovich_Cp_Projective(QQ, 3) sage: B.ideal() 3
sage: B = Berkovich_Cp_Projective(Qp(3)) # optional - sage.rings.padics sage: B.ideal() is None # optional - sage.rings.padics True
- is_number_field_base()#
Return
True
if this Berkovich space is backed by a number field.OUTPUT:
True
if this Berkovich space was created with a number field.False
otherwise.
EXAMPLES:
sage: B = Berkovich_Cp_Affine(Qp(3)) # optional - sage.rings.padics sage: B.is_number_field_base() # optional - sage.rings.padics False
sage: B = Berkovich_Cp_Affine(QQ, 3) sage: B.is_number_field_base() True
- is_padic_base()#
Return
True
if this Berkovich space is backed by a p-adic field.OUTPUT:
True
if this Berkovich space was created with a p-adic field.False
otherwise.
EXAMPLES:
sage: B = Berkovich_Cp_Affine(Qp(3)) # optional - sage.rings.padics sage: B.is_padic_base() # optional - sage.rings.padics True
sage: B = Berkovich_Cp_Affine(QQ, 3) sage: B.is_padic_base() False
- prime()#
The residue characteristic of the
base
.EXAMPLES:
sage: B = Berkovich_Cp_Projective(3) # optional - sage.rings.padics sage: B.prime() # optional - sage.rings.padics 3
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.ideal(-1/2*a^2 + a - 3) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Affine(A, ideal) # optional - sage.rings.number_field sage: B.residue_characteristic() # optional - sage.rings.number_field 7
- residue_characteristic()#
The residue characteristic of the
base
.EXAMPLES:
sage: B = Berkovich_Cp_Projective(3) # optional - sage.rings.padics sage: B.prime() # optional - sage.rings.padics 3
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.ideal(-1/2*a^2 + a - 3) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Affine(A, ideal) # optional - sage.rings.number_field sage: B.residue_characteristic() # optional - sage.rings.number_field 7
- class sage.schemes.berkovich.berkovich_space.Berkovich_Cp_Affine(base, ideal=None)#
Bases:
Berkovich_Cp
The Berkovich affine line over \(\CC_p\).
The Berkovich affine line is the set of seminorms on \(\CC_p[x]\), with the weakest topology such that the map \(| \cdot | \to |f|\) is continuous for all \(f \in \CC_p[x]\).
We can represent the Berkovich affine line in two separate ways: either using a p-adic field to represent elements or using a number field to represent elements while storing an ideal of the ring of integers of the number field, which specifies an embedding of the number field into \(\CC_p\). See the examples.
INPUT:
base
– Three cases:a prime number \(p\). Centers of elements are then represented as points of \(\QQ_p\).
\(\QQ_p\) or a finite extension of \(\QQ_p\). Centers of elements are then represented as points of
base
.A number field \(K\). Centers of elements are then represented as points of \(K\).
ideal
– (optional) a prime ideal ofbase
. Must be specified if a number field is passed tobase
, otherwise it is ignored.
EXAMPLES:
sage: B = Berkovich_Cp_Affine(3); B # optional - sage.rings.padics Affine Berkovich line over Cp(3) of precision 20
We can create elements:
sage: B(-2) # optional - sage.rings.padics Type I point centered at 1 + 2*3 + 2*3^2 + 2*3^3 + 2*3^4 + 2*3^5 + 2*3^6 + 2*3^7 + 2*3^8 + 2*3^9 + 2*3^10 + 2*3^11 + 2*3^12 + 2*3^13 + 2*3^14 + 2*3^15 + 2*3^16 + 2*3^17 + 2*3^18 + 2*3^19 + O(3^20)
sage: B(1, 2) # optional - sage.rings.padics Type III point centered at 1 + O(3^20) of radius 2.00000000000000
For details on element creation, see the documentation of
Berkovich_Element_Cp_Affine
. Initializing by passing in \(\QQ_p\) looks the same:sage: B = Berkovich_Cp_Affine(Qp(3)); B # optional - sage.rings.padics Affine Berkovich line over Cp(3) of precision 20
However, this method allows for more control over behind-the-scenes conversion:
sage: B = Berkovich_Cp_Affine(Qp(3, 1)); B # optional - sage.rings.padics Affine Berkovich line over Cp(3) of precision 1 sage: B(1/2) # optional - sage.rings.padics Type I point centered at 2 + O(3)
Note that this point has very low precision, as
B
was initialized with a p-adic field of capped-relative precision one. For high precision, pass in a high precision p-adic field:sage: B = Berkovich_Cp_Affine(Qp(3, 1000)); B # optional - sage.rings.padics Affine Berkovich line over Cp(3) of precision 1000
Points of Berkovich space can be created from points of extensions of \(\QQ_p\):
sage: B = Berkovich_Cp_Affine(3) # optional - sage.rings.padics sage: A.<a> = Qp(3).extension(x^3 - 3) # optional - sage.rings.padics sage: B(a) # optional - sage.rings.padics Type I point centered at a + O(a^61)
For exact computation, a number field can be used:
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.prime_above(3) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Affine(A, ideal); B # optional - sage.rings.number_field Affine Berkovich line over Cp(3), with base Number Field in a with defining polynomial x^3 + 20
Number fields have a major advantage of exact computation.
Number fields also have added functionality. Arbitrary extensions of \(\QQ\) are supported, while there is currently limited functionality for extensions of \(\QQ_p\). As seen above, constructing a Berkovich space backed by a number field requires specifying an ideal of the ring of integers of the number field. Specifying the ideal uniquely specifies an embedding of the number field into \(\CC_p\).
Unlike in the case where Berkovich space is backed by a p-adic field, any point of a Berkovich space backed by a number field must be centered at a point of that number field:
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.prime_above(3) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Affine(A, ideal) # optional - sage.rings.number_field sage: C.<c> = NumberField(x^2 + 1) # optional - sage.rings.number_field sage: B(c) # optional - sage.rings.number_field Traceback (most recent call last): ... ValueError: could not convert c to Number Field in a with defining polynomial x^3 + 20
- Element#
alias of
Berkovich_Element_Cp_Affine
- class sage.schemes.berkovich.berkovich_space.Berkovich_Cp_Projective(base, ideal=None)#
Bases:
Berkovich_Cp
The Berkovich projective line over \(\CC_p\).
The Berkovich projective line is the one-point compactification of the Berkovich affine line.
We can represent the Berkovich projective line in two separate ways: either using a p-adic field to represent elements or using a number field to represent elements while storing an ideal of the ring of integers of the number field, which specifies an embedding of the number field into \(\CC_p\). See the examples.
INPUT:
base
– Three cases:a prime number \(p\). Centers of elements are then represented as points of projective space of dimension 1 over \(\QQ_p\).
\(\QQ_p\) or a finite extension of \(\QQ_p\). Centers of elements are then represented as points of projective space of dimension 1 over
base
.A number field \(K\). Centers of elements are then represented as points of projective space of dimension 1 over
base
.
ideal
– (optional) a prime ideal ofbase
. Must be specified if a number field is passed tobase
, otherwise it is ignored.
EXAMPLES:
sage: B = Berkovich_Cp_Projective(3); B # optional - sage.rings.padics Projective Berkovich line over Cp(3) of precision 20
Elements can be constructed:
sage: B(1/2) # optional - sage.rings.padics Type I point centered at (2 + 3 + 3^2 + 3^3 + 3^4 + 3^5 + 3^6 + 3^7 + 3^8 + 3^9 + 3^10 + 3^11 + 3^12 + 3^13 + 3^14 + 3^15 + 3^16 + 3^17 + 3^18 + 3^19 + O(3^20) : 1 + O(3^20))
sage: B(2, 1) # optional - sage.rings.padics Type II point centered at (2 + O(3^20) : 1 + O(3^20)) of radius 3^0
For details about element construction, see the documentation of
Berkovich_Element_Cp_Projective
. Initializing a Berkovich projective line by passing in a p-adic space looks the same:sage: B = Berkovich_Cp_Projective(Qp(3)); B # optional - sage.rings.padics Projective Berkovich line over Cp(3) of precision 20
However, this method allows for more control over behind-the-scenes conversion:
sage: S = Qp(3, 1) # optional - sage.rings.padics sage: B = Berkovich_Cp_Projective(S); B # optional - sage.rings.padics Projective Berkovich line over Cp(3) of precision 1 sage: Q1 = B(1/2); Q1 # optional - sage.rings.padics Type I point centered at (2 + O(3) : 1 + O(3))
Note that this point has very low precision, as S has low precision cap. Berkovich space can also be created over a number field, as long as an ideal is specified:
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^2 + 1) # optional - sage.rings.number_field sage: ideal = A.prime_above(2) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Projective(A, ideal); B # optional - sage.rings.number_field Projective Berkovich line over Cp(2), with base Number Field in a with defining polynomial x^2 + 1
Number fields have the benefit that computation is exact, but lack support for all of \(\CC_p\).
Number fields also have the advantage of added functionality, as arbitrary extensions of \(\QQ\) can be constructed while there is currently limited functionality for extensions of \(\QQ_p\). As seen above, constructing a Berkovich space backed by a number field requires specifying an ideal of the ring of integers of the number field. Specifying the ideal uniquely specifies an embedding of the number field into \(\CC_p\).
Unlike in the case where Berkovich space is backed by a p-adic field, any point of a Berkovich space backed by a number field must be centered at a point of that number field:
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.prime_above(3) # optional - sage.rings.number_field sage: B = Berkovich_Cp_Projective(A, ideal) # optional - sage.rings.number_field sage: C.<c> = NumberField(x^2 + 1) # optional - sage.rings.number_field sage: B(c) # optional - sage.rings.number_field Traceback (most recent call last): ... TypeError: could not convert c to Projective Space of dimension 1 over Number Field in a with defining polynomial x^3 + 20
- Element#
alias of
Berkovich_Element_Cp_Projective
- base_ring()#
The base ring of this Berkovich Space.
OUTPUT: A field.
EXAMPLES:
sage: B = Berkovich_Cp_Projective(3) # optional - sage.rings.padics sage: B.base_ring() # optional - sage.rings.padics 3-adic Field with capped relative precision 20
sage: C = Berkovich_Cp_Projective(ProjectiveSpace(Qp(3, 1), 1)) # optional - sage.rings.padics sage: C.base_ring() # optional - sage.rings.padics 3-adic Field with capped relative precision 1
sage: R.<x> = QQ[] sage: A.<a> = NumberField(x^3 + 20) # optional - sage.rings.number_field sage: ideal = A.prime_above(3) # optional - sage.rings.number_field sage: D = Berkovich_Cp_Projective(A, ideal) # optional - sage.rings.number_field sage: D.base_ring() # optional - sage.rings.number_field Number Field in a with defining polynomial x^3 + 20
- sage.schemes.berkovich.berkovich_space.is_Berkovich(space)#
Check if
space
is a Berkovich space.OUTPUT:
True
ifspace
is a Berkovich space.False
otherwise.
EXAMPLES:
sage: B = Berkovich_Cp_Projective(3) # optional - sage.rings.padics sage: from sage.schemes.berkovich.berkovich_space import is_Berkovich sage: is_Berkovich(B) # optional - sage.rings.padics True
- sage.schemes.berkovich.berkovich_space.is_Berkovich_Cp(space)#
Check if
space
is a Berkovich space overCp
.OUTPUT:
True
ifspace
is a Berkovich space overCp
.False
otherwise.
EXAMPLES:
sage: B = Berkovich_Cp_Projective(3) # optional - sage.rings.padics sage: from sage.schemes.berkovich.berkovich_space import is_Berkovich sage: is_Berkovich(B) # optional - sage.rings.padics True


r/arduino12hu/mcfc_as How to use an Arduino and Raspberry Pi to turn a fiber optic neural network into wall art opensource


This section will show all the posts from which you can get support and report perpetrators of Gender Based Violences
Add New Post Add New Region
{{ vm.message }}
{{ vm.error }}


A Julia package for generating visualizations in Vega
Getting Started
Visualization Primitives
Creating A Visualization From Scratch
The Vega package provides a Julia wrapper around the Vega Visualization Grammar from Trifacta. Vega is a declarative format on top of d3.js for creating interactive visualizations using JSON.
In particular, Vega.jl provides:
To learn more about specific features, see the Table of Contents on the left sidebar.
This project is maintained by randyzwitch.


External Panels
The panels below are all located outside the page. Panels outside of a page must be initalized manually and will not be handled by auto init. Panels outside of pages will remain in the DOM (unless manually removed) as long as you use Ajax navigation, and can be opened or closed from any page.
Navigate to page 2 to see this behavior. The HTML document for page 2 doesn't contain panel markup, but you can still open the panels.
Left panel examples
Overlay Reveal PushRight panel examples
Overlay Reveal Push


Toggle navigation
Blog
Services
Featured
Team
Contact
Posts Tagged “Product”
07/19/15
Selling a Product and not a Commodity
Product
Leveling Up


Club Update
The Cyber Security club is back!
It’s currently being rebuilt by Noah (Co-President), Sid (Co-President), Nathan, and Douglas. We aim to have everything up and running before the first week of class (September 22nd). Check back here soon for more information on the club, events, and other happenings. Our main method of communication has been discord, the link for which can also be found at the contact and about pages.
We hope to see you all soon! Thank you.
Read other posts


Gateway
BOT
04-Jul-18 07:14 AM
[dscrdeql] <skyfyre> Hey guys
[dscrdeql] <AndronicusBass-Founder> hey, ill test now
[dscrdeql] <skyfyre> Trying again
[dscrdeql] <skyfyre> With online
[dscrdeql] <skyfyre> Someone chat with me!!!
[dscrdeql] <skyfyre> Hahaha
[dscrdeql] <skyfyre> Need to raise my level
[dscrdeql] <skyfyre> Become supersaiyan
[dscrdeql] <skyfyre>
[dscrdeql] <Aspire219> lmao
[dscrdeql] <skyfyre> @Yukitty is a 50 years old guy
[dscrdeql] <skyfyre> Talk to me friend!
[dscrdeql] <skyfyre>
[dscrdeql] <jellysmash> @skyfyre hey there
[dscrdeql] <skyfyre> @jellysmash hey hey
[dscrdeql] <jellysmash> How's it going
[dscrdeql] <skyfyre> It's going good
[dscrdeql] <skyfyre> Had some lunch
[dscrdeql] <skyfyre>
[dscrdeql] <jellysmash> It's 5:23pm here
[dscrdeql] <jellysmash> In sydney
[dscrdeql] <skyfyre> 3:22pm here
[dscrdeql] <jellysmash> I'm still at work
[dscrdeql] <jellysmash> Just about to go home
[dscrdeql] <skyfyre> Haha
[dscrdeql] <skyfyre> Nice
[dscrdeql] <jellysmash> Where are you?
[dscrdeql] <skyfyre> How was work
[dscrdeql] <skyfyre> Taiwan
[dscrdeql] <skyfyre> Two hours behind you
[dscrdeql] <jellysmash> Work...just okay...could be better
[dscrdeql] <skyfyre> Haha
[dscrdeql] <jellysmash> Couldn't find something
[dscrdeql] <skyfyre> Waiting for bull run
[dscrdeql] <skyfyre> Then we all don't need to work
[dscrdeql] <skyfyre> Anymore
[dscrdeql] <Aspire219> prob end of year... still long wait buddy
[dscrdeql] <skyfyre>
[dscrdeql] <skyfyre> Yea..
[dscrdeql] <skyfyre> Ughh
[dscrdeql] <jellysmash> True..waiting for a moon


Add User
Confirm
Delete User
Delete
Change User
Confirm
Quick Links (Use with caution!)
Sitemap
Manual reload
Unstyled sessions overview
Unstyled Navbar
Invalidate all sessions (master only)
Toggle Admin-only mode
Toggle Admin mode
Sessions
Invalidate specific session (Master only)
Invalidate


×
Close
Select Data
×
Close
Upload Data
%s
Toggle navigation
Data Play
Data
Select CSV Dataset
Select R Sample Dataset
Add CSV Dataset
Analysis
Visulaization
Machine Learning
About
Dataset
Control
Visualization


- Game - Class in com.teamten.chess
-
Records an entire game.
- Game(Board) - Constructor for class com.teamten.chess.Game
-
- generateAllLegalMoves(int) - Method in class com.teamten.chess.Board
-
Like generateAllMoves() but only generates moves that wouldn't put us in check.
- generateAllMoves(int, boolean) - Method in class com.teamten.chess.Board
-
Generates all moves for the side whose turn it is, but does not remove moves
that would leave us in check.
- get(int) - Method in class com.teamten.render.Triangle
-
Return vertex at index (0, 1, or 2), with no bounds checking.
- getAlgebraicCharacter() - Method in class com.teamten.chess.Piece
-
Return the character that can be used to represent this piece in Algebraic Notation.
- getAlgebraicNotation(boolean) - Method in class com.teamten.chess.Move
-
Return the Algebraic Notation.
- getAngle() - Method in class com.teamten.mario.Player
-
- getAttackingPieceIndex(int, int) - Method in class com.teamten.chess.Board
-
If the given square is attacked by the given side, returns the index of (any)
attacking piece.
- getBoard() - Method in class com.teamten.chess.Game
-
Return the board this game is associated with.
- getCapturedPiece() - Method in class com.teamten.chess.Move
-
Return the piece captured by this move, or EMPTY if not a capturing move.
- getCentroid() - Method in class com.teamten.render.Triangle
-
Return the centroid of the triangle, which is just the average of the three
vertices.
- getCharacter() - Method in class com.teamten.chess.Piece
-
Return the character that can be used to represent this piece in ASCII mode.
- getCharacter() - Method in class com.teamten.chess.PieceType
-
Return the character that can be used to represent this piece in ASCII mode,
always lower case.
- getCharacter(int) - Static method in class com.teamten.tictactoe.Mark
-
Return a character for the mark ('X', 'O', or space).
- getCheckIndex(int) - Method in class com.teamten.chess.Board
-
If the king of the specified side is in check, return (any) index of an attacking
piece.
- getCheckIndex() - Method in exception com.teamten.chess.IllegalMoveException
-
If this move is illegal because the king would be in check, returns
one of pieces that would be putting it in check.
- getChildList() - Method in class com.teamten.render.BoundingBox
-
Returns the list of child bounding boxes in this bounding box.
- getCircumference() - Method in class com.teamten.mario.Player
-
- getDeepChildCount() - Method in class com.teamten.render.BoundingBox
-
Return the total number of children below this node, including this node.
- getEdge(int) - Method in class com.teamten.render.Triangle
-
Return the vector from vertex index to index + 1.
- getEdgeNormal(int) - Method in class com.teamten.render.Triangle
-
Return a normal to edge from vertex index to index + 1.
- getElapsed() - Method in class com.teamten.mario.Searcher.Results
-
- getEnv() - Method in class com.teamten.mario.World
-
- getExplored() - Method in class com.teamten.mario.Searcher.Results
-
- getFile(int) - Static method in class com.teamten.chess.Board
-
Return the file (1 to SIZE) for this index.
- getFileLetter(int) - Static method in class com.teamten.chess.Board
-
Return the letter for the file of this index.
- getFloor(int) - Method in class com.teamten.mario.Env
-
- getFloorCount() - Method in class com.teamten.mario.Env
-
- getFromIndex() - Method in class com.teamten.chess.Move
-
Returns the source index.
- getHtmlCharacter() - Method in class com.teamten.chess.Piece
-
Same as getUnicodeCharacter() but as an HTML entity.
- getIndex(int, int) - Static method in class com.teamten.chess.Board
-
Return the index into the SIZE*SIZE array given a rank and file.
- getIndex(int, int) - Static method in class com.teamten.tictactoe.Board
-
File and rank are as in chess (1-based).
- getIndex() - Method in class com.teamten.tictactoe.EvaluatedMove
-
- getInputs() - Method in class com.teamten.mario.Searcher.Results
-
- getLeft() - Method in class com.teamten.mario.Floor
-
- getLightColor(Intersection) - Method in class com.teamten.render.DirectionalLight
-
- getLightColor(Intersection) - Method in interface com.teamten.render.Light
-
Return the color of the light at this intersection point.
- getLightVector(Intersection) - Method in class com.teamten.render.DirectionalLight
-
- getLightVector(Intersection) - Method in interface com.teamten.render.Light
-
Return a unit vector from the intersection point to the light.
- getLongAlgebraicNotation() - Method in class com.teamten.chess.Move
-
Return the long algebraic notation for the move, e.g., "e2e4" or "b7b8q".
- getMark(int) - Method in class com.teamten.tictactoe.Board
-
Returns the mark (see Mark class) at index.
- getMinT() - Method in class com.teamten.render.Intersection
-
The parametric distance along the ray to the intersection.
- getMove() - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
- getMove(int) - Method in class com.teamten.chess.Game
-
Get the move by index.
- getMove(Board) - Method in class com.teamten.tictactoe.ComputerPlayer
-
Get a move to make with its score.
- getMoveCount() - Method in class com.teamten.chess.Game
-
Returns the number of moves in this game.
- getMovesSinceCapture() - Method in class com.teamten.chess.Move
-
- getMovingPiece() - Method in class com.teamten.chess.Move
-
Return the piece being moved.
- getNextMove() - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
- getNextMove() - Method in class com.teamten.tictactoe.EvaluatedMove
-
- getNormal() - Method in class com.teamten.render.Intersection
-
Utility method for getting the normal of the triangle at the intersection
point (interpolating the vertex normals), taking into account whether it's
backfacing.
- getNormal() - Method in class com.teamten.render.Triangle
-
Return the geometric normal of the triangle.
- getNormal() - Method in class com.teamten.render.Vertex
-
- getNumPieces(int) - Method in class com.teamten.chess.Board
-
Return the number of (non-pawn) pieces for this side.
- getOtherSide(int) - Static method in class com.teamten.chess.Side
-
Given a side, returns the other side.
- getOtherSide(int) - Static method in class com.teamten.tictactoe.Mark
-
Given a mark, return the other side (cross for nought, etc.).
- getPath() - Method in class com.teamten.mario.Searcher.Results
-
- getPiece(int) - Method in class com.teamten.chess.Board
-
Return the piece at index, or EMPTY if the square is empty.
- getPieceForCharacter(char) - Static method in class com.teamten.chess.Piece
-
Return the piece that would have returned this from its getCharacter()
method.
- getPieceForTypeAndSide(PieceType, int) - Static method in class com.teamten.chess.Piece
-
Return the piece for this piece type and side.
- getPieceType() - Method in class com.teamten.chess.Piece
-
Return the piece type (king, queen, etc) for this piece, or null if an
empty square.
- getPlayer() - Method in class com.teamten.mario.World
-
- getPoint() - Method in class com.teamten.mario.Player
-
- getPoint() - Method in class com.teamten.render.Intersection
-
Get the point in 3D space of the intersection.
- getPoint() - Method in class com.teamten.render.Vertex
-
- getPosition(int) - Static method in class com.teamten.chess.Board
-
Return a position (such as "a1") for an index.
- getPositionBonus(int) - Method in class com.teamten.chess.Piece
-
Return the position bonus for this piece at this location.
- getPositionBonus(int) - Method in class com.teamten.chess.PieceType
-
Return the position bonus, as a double where 1 means a pawn value.
- getPromotedPiece() - Method in class com.teamten.chess.Move
-
Return the piece we're promoting to, or EMPTY if not a promoting move.
- getPushBack(Player, int, int, int, int) - Method in class com.teamten.mario.Env
-
- getRadius() - Method in class com.teamten.mario.Toy
-
- getRank(int) - Static method in class com.teamten.chess.Board
-
Return the rank (1 to SIZE) for this index.
- getRankDigit(int) - Static method in class com.teamten.chess.Board
-
Return the digit for the rank of this index.
- getRealRadius() - Method in class com.teamten.mario.Player
-
- getRelativeIndex(int, int, int) - Static method in class com.teamten.chess.Board
-
Like getIndex(), but offset by the delta rank and file.
- getScore() - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
- getScore() - Method in class com.teamten.tictactoe.EvaluatedMove
-
- getSide() - Method in class com.teamten.chess.Board
-
Return the side whose turn it is.
- getSide() - Method in class com.teamten.chess.ComputerPlayer
-
- getSide() - Method in class com.teamten.chess.Piece
-
Return the side (Side.WHITE or Side.BLACK) for this piece, or 0 if an empty square.
- getSide() - Method in class com.teamten.tictactoe.Board
-
Return whose side (see Mark class) it is to play.
- getSize() - Method in class com.teamten.render.BoundingBox
-
Return the diagonal size of the bounding box.
- getSnappedRadius() - Method in class com.teamten.mario.Player
-
- getSpeed() - Method in class com.teamten.mario.Player
-
- getToIndex() - Method in class com.teamten.chess.Move
-
Returns the destination index.
- getTop() - Method in class com.teamten.mario.Floor
-
- getTotalPieces() - Method in class com.teamten.chess.Board
-
Return the total number of non-pawn pieces on the board.
- getToy(int) - Method in class com.teamten.mario.Env
-
- getToyIndex(Player) - Method in class com.teamten.mario.Env
-
- getTriangle() - Method in class com.teamten.render.Intersection
-
Return the triangle that was intersected, or null if the ray hit nothing.
- getTriangleList() - Method in class com.teamten.render.BoundingBox
-
Returns the list of triangles in this bounding box.
- getUnicodeCharacter() - Method in class com.teamten.chess.Piece
-
Returns the char for the Unicode character.
- getUnicodeOffset() - Method in class com.teamten.chess.PieceType
-
Return the offset from 0x2654 for this piece type for white.
- getUnicodeOffset(int) - Static method in class com.teamten.chess.Side
-
Return the offset from 0x2654 for this color.
- getValue() - Method in class com.teamten.chess.PieceType
-
Return the piece's value (e.g., 3 for bishop, 9 for queen).
- getVx() - Method in class com.teamten.mario.Player
-
- getVy() - Method in class com.teamten.mario.Player
-
- getWidth() - Method in class com.teamten.mario.Floor
-
- getWinner() - Method in class com.teamten.tictactoe.Board
-
Returns a side that has won, or EMPTY if neither.
- getX() - Method in class com.teamten.mario.Player
-
- getY() - Method in class com.teamten.mario.Player
-
- GRAVITY - Static variable in class com.teamten.mario.World
-
- Searcher - Class in com.teamten.mario
-
Implements the A* search algorithm to find the best move.
- Searcher() - Constructor for class com.teamten.mario.Searcher
-
- Searcher.Results - Class in com.teamten.mario
-
Search results.
- serialize() - Method in class com.teamten.chess.Board
-
Serialize the board to a string.
- serialize() - Method in class com.teamten.chess.Game
-
Serialize the game to a string.
- serialize() - Method in class com.teamten.chess.Move
-
Serialize the move to a string.
- setCamera(Matrix) - Method in class com.teamten.render.DirectionalLight
-
- setCamera(Matrix) - Method in interface com.teamten.render.Light
-
Sets the camera transform for this pass.
- setCheck(boolean) - Method in class com.teamten.chess.Move
-
Set whether this move puts the other king in check.
- setCullBackfacingTriangles(boolean) - Method in class com.teamten.render.Renderer
-
Whether to hide triangles that face away from the camera.
- setExplored(List<Point>) - Method in class com.teamten.mario.WorldDrawer
-
Set of points we explored.
- setFov(double, double) - Method in class com.teamten.render.Renderer
-
Sets the full horizontal and vertical field of view in radians.
- setIndex(int) - Method in class com.teamten.tictactoe.EvaluatedMove
-
The index where the move was made.
- setMark(int, int) - Method in class com.teamten.tictactoe.Board
-
Sets the mark (see Mark class) at index.
- setMaterial(Material) - Method in class com.teamten.render.Renderer
-
Sets the material for all geometry.
- setMove(Move) - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
- setMovesSinceCapture(int) - Method in class com.teamten.chess.Move
-
- setMovingInCheck(boolean) - Method in class com.teamten.chess.Move
-
- setNextMove(ComputerPlayer.EvaluatedMove) - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
Keep track of next move for principal variation.
- setNextMove(EvaluatedMove) - Method in class com.teamten.tictactoe.EvaluatedMove
-
Principal variation linked list.
- setOtherInCheck(boolean) - Method in class com.teamten.chess.Move
-
- setPath(List<Point>, double) - Method in class com.teamten.mario.WorldDrawer
-
Debug path to draw.
- setPiece(int, Piece) - Method in class com.teamten.chess.Board
-
Sets the piece at index, or EMPTY to empty the square.
- setScore(double) - Method in class com.teamten.chess.ComputerPlayer.EvaluatedMove
-
Positive scores are good for the side making the move.
- setScore(double) - Method in class com.teamten.tictactoe.EvaluatedMove
-
The score for this player after this move is made.
- setSide(int) - Method in class com.teamten.chess.Board
-
Set the side whose turn it is.
- setTarget(Point) - Method in class com.teamten.mario.WorldDrawer
-
- setWorld(World) - Method in class com.teamten.mario.WorldDrawer
-
- shade(RayTracer, Vector, Intersection, Light[], boolean) - Method in class com.teamten.render.AmbientOcclusionMaterial
-
- shade(RayTracer, Vector, Intersection, Light[], boolean) - Method in interface com.teamten.render.Material
-
Return the shaded point for this intersection.
- shade(RayTracer, Vector, Intersection, Light[], boolean) - Method in class com.teamten.render.PhongMaterial
-
- shade(Vector, Intersection, boolean) - Method in interface com.teamten.render.RayTracer
-
Shade the point at the intersection (whose triangle is not null), given that
the eye is coming in the direction of "eye".
- Side - Class in com.teamten.chess
-
Sides are represented as an integer, with 0 for white and 1 for black.
- SIZE - Static variable in class com.teamten.chess.Board
-
- SIZE - Static variable in class com.teamten.tictactoe.Board
-
- start() - Method in class com.teamten.chess.server.ChessServer
-
- start() - Method in class com.teamten.chess.UciParser
-
Loop, reading a line and executing it, until done.
- step(Input) - Method in class com.teamten.mario.World
-
- swapSides() - Method in class com.teamten.chess.Board
-
Swap the side whose turn it is, turning the new side.


{#- This file was automatically generated - do not edit -#} {% import "partials/language.html" as lang with context %}


Format: TextAreaLineHeight real,
Example: TextAreaLineHeight 0.015,
Purpose: How much space each line can take, if the used FontSize does not fit this the Text won't be displayed or there will be alot of space between Lines.
Used in: TEXTAREA


Uttarakhand is famous for Char Dham Yatra, which literally means 'Journey to the Four Centres'.
Badrinath
Badrinath is the abode of Lord Vishnu, who is called 'Badri Vishal', Badri the Big One. The priests of Badrinath are from the southernmost part
of India, i.e. Kerala. This is according to the rules laid down by Adi Sankara. Badrinath remains out of bounds for pilgrims for 6 months a
year, from October to May.
Kedarnath
Kedarnath is the abode of Lord Shiva. Kedarnath is one of the 12 Jyotirlingams of India and the only one in the Uttarakhand. While there is a
motorable road to Badrinath, Kedarnath could only be reached by foot. The 14 km trek begins from Gaurikund. After the 2013 Himalayan
floods, the trek currently is of more than 18 km due to washing away of trekking paths.
Gangotri
Gangotri is the origin of the holy river Ganga. River Ganga is revered as a mother throughout India. Gangotri is a place which is not only the
origin of Ganga but also where Ganga flows in a northerly direction, hence the name 'Gangotri'. The river Ganga flows out from the melting
Gangotri Glacier.Close to the temple is Bhagirath Shila, which according to the Hindu philosophy is the place where Bhagirath did penance for
5500 years to seek the blessings of Mother Ganga and requested her to descend to the Earth from her heavenly abode to cleanse the sins of his ancestors.
Yamunotri
Yamunotri is the origin of the holy river Yamuna. A temple dedicated to the holy river Yamuna is situated at the place. The actual origin
of the river is the Yamunotri Glacier.


 Would you be happy or scared if the person actually died after you wrote down their names? This time, I’ll recommend you guys a heated Japanese drama named It Is Your Turn.
When we watch ordinary thriller, most of the suspects will be limited in 3-5 people. According to the speculation step by step, the audience will lock the suspect in the end. When it comes the J-Drama It’s your turn, things gonna be quite different for it adapts the method of anonymous intersect killing. This hint makes it difficult for both the police in the drama and the audience outside to find the real killer behind the scenes.
By the way, most of the 37 people on the show are relevant characters in the case. In the first few episodes, the biggest griping among the audience was that “I can’t remember the characters’ names, faces, room numbers and the relationships between each householder!”
It’s your turn has released four series so far: あなたの番です、あなたの番です 扉の向こう、あなたの番です 特別編 and あなたの番です-反撃編. If you are going to watch this J-Drama, I suggest that you should follow the order given above :D
你有那种恨到想要他去死的人吗？如果在你写下这个人的名字之后对方就真的死了，你是会觉得开心还是觉得害怕呢？冰冰今天想要介绍的这部日剧，讲的就是一个「交换杀人」的故事。
我们在看普通悬疑片的时候，犯罪嫌疑人大多会锁定在3-5人之中，再根据层层推理锁定最后的那一个人。《轮到你了》采用的匿名交换杀人的手法，使得无论是剧中的警方还是场外的观众，在寻中幕后真凶的过程中困难重重。
顺便一说，这部剧出场的37人中绝大多数都是重要人物。在最初的几集里面，观众感叹最多的就是“记不住人名、长相、住的房号以及彼此间的人物关系”。
《轮到你了》目前已经播放了四个系列，分别是《轮到你了》、《轮到你了番外篇：房门之内》、《轮到你了特别篇》以及《轮到你了反击篇》。大家如果准备观看这个系列的话，推荐按照文中所述的顺序唷:D
（本篇完）
※ The following part is needed to put filled in and added to your text, as otherwise it will not be included later on phase II on Triple A.
※ 리뷰 하단에 다음 두가지 항목 포함 필수 (미포함 시 차후 자체사이트에 반영 안됨)
- Movie URL: (https://www.themoviedb.org/tv/88570)
Critic: AAA
영화 URL: (https://www.themoviedb.org/tv/88570)
- 별점: AAA
This page is synchronized from the post: ‘【AAA】轮到你了 あなたの番です It Is Your Turn （2019）’


The Firth of Forth, on Scotland's east coast, gives access to Edinburgh which lies 20 miles from the mouth of the Forth. The area also provides a good stretch of sailing water, especially for racing.
Edinburgh © S/Y Suwena
Position 56° 08'N, 02° 34'W (Entrance to the Firth of Forth)
Position 55° 59'30"N, 03° 13'20"W (Granton Harbour, Edinburgh)
Position 56° 13'06"N, 02° 41'50"W (Anstruther Harbour)
See the United Kingdom formalities page for details of clearance.
Any berthing options near Edinburgh are in rather industrial surroundings.
Granton harbour (on the Edinburgh waterfront) partly dries but recent dredging now allows 24hr access with a depth of 2m at LW at the entrance and at the pontoons.
Granton Harbour © Google Earth
Port Edgar is a full service marina lying just west of the Forth Road Bridge at South Queensferry. Take extra care when arriving in the dark as the wave barrier in the middle of the marina entrance is poorly lit. Enter from the west and keep well clear of both sides. Due to the proximity of both road and bridge, this is not a quiet berth. In NW'ly winds the swell affects berths on the hammerheads.
Anstruther harbour lies on the north bank of the Firth of Forth, close to the entrance. It dries but is accessible 4hrs each side of HW.
Another harbour in the Forth suitable for yachts,is at Grangemouth. The rest are purely commercial.
Last updated February 2015.
[Show additional 5 entries for this category]


Create Account
Already a member ?
Log in
Smart Louis!
©2018 All Rights Reserved. Smart Louis! Your best personal assistant!