|
| CUDA_ONLY_HOS | simple_array () |
| | Default constructor: an empty array. More...
|
| |
| template<class ArrLike , class disabler = std::enable_if_t<!std::is_integral_v<ArrLike> && std::is_same_v<g24_lib::value_type<ArrLike>, Type> >> |
| CUDA_ONLY_HOS | simple_array (const ArrLike &a, const bool copy=default_is_copy) |
| | Copy-constructs from a generic container with a size() member function. If, by any reason, the user wants to force the pointer to be copied instead of performing allocations, copy can be put to false. More...
|
| |
| CUDA_ONLY_HOS | simple_array (const indexer size) |
| | Constructs an uninitialized array of size elements. More...
|
| |
| template<class ArrLike , class disabler = std::enable_if_t<!std::is_same_v<ArrLike, Type> && std::is_same_v<g24_lib::value_type<ArrLike>, Type> >> |
| CUDA_ONLY_HOS | simple_array (const indexer size, const ArrLike &a, const bool copy=default_is_copy) |
| | Copy-constructs from a generic container with a known size . If, by any reason, the user wants to force the pointer to be copied instead of performing allocations, copy can be put to false. More...
|
| |
| CUDA_ONLY_HOS | simple_array (const indexer size, const Type &val) |
| | Constructs an array of size elements that are initialized to val . More...
|
| |
| CUDA_HOS_DEV | simple_array (const simple_array &s, const bool copy=default_is_copy) |
| | Copy-constructs. If, by any reason, the user wants to force the pointer to be copied instead of performing allocations, copy can be put to false. More...
|
| |
| template<class other_manager , bool other_bool> |
| CUDA_ONLY_HOS | simple_array (const simple_array< Type, indexer, other_manager, other_bool > &s, const bool copy=default_is_copy) |
| | Copy-constructs from another memory context. If, by any reason, the user wants to force the pointer to be copied instead of performing allocations, copy can be put to false. More...
|
| |
| CUDA_HOS_DEV | simple_array (simple_array &&s) |
| | Move-constructs. More...
|
| |
| template<class other_manager , bool other_bool> |
| CUDA_ONLY_HOS | simple_array (simple_array< Type, indexer, other_manager, other_bool > &&s) |
| | Move-constructs from another memory context. More...
|
| |
| CUDA_HOS_DEV | ~simple_array () |
| |
| Type * | begin () |
| | Returns a pointer to the beginning of the array. More...
|
| |
| const Type * | begin () const |
| | Returns a pointer to the beginning of the array. More...
|
| |
| template<class stream > |
| CUDA_ONLY_HOS void | binary_input (stream &s) |
| |
| template<class stream > |
| CUDA_ONLY_HOS void | binary_output (stream &s) const |
| |
| CUDA_ONLY_HOS void | clear () |
| | Clears the array. If deallocatable() is false, just sets the size to 0 and the internal pointer to nullptr . More...
|
| |
| CUDA_HOS_DEV bool | deallocatable () const |
| | Returns true if the array can be deallocated (which should be the usual case) and false if not (when default_is_copy is false and the pointer has been copied from another object). More...
|
| |
| Type * | end () |
| | Returns a pointer to the end of the array. More...
|
| |
| const Type * | end () const |
| | Returns a pointer to the end of the array. More...
|
| |
| CUDA_HOS_DEV Type *& | get_access_to_array () |
| | Gives direct access to the underlying array. More...
|
| |
| CUDA_HOS_DEV const Type * | get_access_to_array () const |
| | Gives direct access to the underlying array. More...
|
| |
| template<class parallel , class Func , class ... Args> |
| void | operate_on_all (Func &&f, Args &&... args) |
| | Performs operation given by f on every element of the array. More...
|
| |
| CUDA_HOS_DEV | operator Type * () const |
| | Returns a pointer to the array. More...
|
| |
| CUDA_HOS_DEV simple_array & | operator= (const simple_array &s) |
| | Assignment operator. The behaviour will depend on the template parameter default_is_copy , with there being allocations if true and a simple pointer copy if it is false . More...
|
| |
| template<class other_manager , bool other_bool> |
| CUDA_ONLY_HOS simple_array & | operator= (const simple_array< Type, indexer, other_manager, other_bool > &s) |
| | Assignment operator from another memory context. The behaviour will depend on the template parameter default_is_copy , with there being allocations if true and a simple pointer copy if it is false and the memory locations are the same. More...
|
| |
| CUDA_HOS_DEV simple_array & | operator= (simple_array &&s) |
| | Move-assignment operator. More...
|
| |
| template<class other_manager , bool other_bool> |
| CUDA_ONLY_HOS simple_array & | operator= (simple_array< Type, indexer, other_manager, other_bool > &&s) |
| | Move-assignment operator from another memory context. More...
|
| |
| CUDA_HOS_DEV Type & | operator[] (const indexer i) |
| |
| CUDA_HOS_DEV const Type & | operator[] (const indexer i) const |
| |
| CUDA_ONLY_HOS void | resize (const indexer new_size) |
| | Resizes the array, unless the sizes match. More...
|
| |
| template<class parallel > |
| void | set_all (const Type &val) |
| | Sets all elements of the array to val . More...
|
| |
| void | set_all_simple (const Type &x) |
| | Sets all the elements of the array to x without using parallelism or such. More...
|
| |
| CUDA_HOS_DEV indexer | size () const |
| |
| template<class stream > |
| CUDA_ONLY_HOS void | textual_input (stream &s) |
| |
| template<class stream , class str = std::basic_string<typename stream::char_type>> |
| CUDA_ONLY_HOS void | textual_output (stream &s, const str &separator=" ") const |
| |
template<class Type, class indexer = g24_lib::Definitions::default_unsigned_indexer, class memory_manager = default_memory_manager<Type, indexer>, bool default_is_copy = true>
class g24_lib::simple_array< Type, indexer, memory_manager, default_is_copy >
A container that holds an array of objects in a given memory context.
- Template Parameters
-
| Type | The type of the objects in the array. |
| indexer | A type that is appropriate to hold the size of the array. |
| memory_manager | The memory manager corresponding to the memory context where the array will be held. |
| default_is_copy | Determines the behaviour of copy constructors and assignment operators: if false , instead of copying the elements into a new array, only the pointer is copied (and the memory will not be deleted upon destruction). In essence, if true , the array acts as something akin to an std::unique_ptr , while, if false , it is more like an std::weak_ptr . (This is currently only used to pass arrays into CUDA kernels. For the end user, default_is_copy should be true.) |
- Warning
- When acting as a raw pointer, the memory may become invalid if the object from which that pointer was copied is destructed or resized.
- Precondition
indexer
must satisfy the constraints placed on the choice of g24_lib::Definitions::default_unsigned_indexer.
-
memory_manager
must be a valid memory manager, that is, g24_lib::is_memory_manager<memory_manager>
should be true
.
- Warning
- Due to the possible need to copy objects between different memory contexts, namely when interfacing with CUDA-enabled GPUs, copy constructors or assignment operators of
Type
will not be invoked during these transfers: Type
will only be shallow-copied (that is, operations akin to std::memcpy
that copy bytes). For most numerical applications, this shouln't pose too much of a problem, but it is a limitation one must take into account carefully.
- Todo:
- Try to accomodate copy constructors/assignment operators into this.
Definition at line 79 of file simple_array.h.


|
SFML Game AI Demos
0.5.0
C++ intelligent agents for games, with demos using the SFML framework.
|
Namespace for the game AI demos. Contains all the classes required for the game demo, its scenes, entities, player, and artificial intelligence. More...
Classes | |
| class | AgentEntity |
| Subclass of LiveEntity for the intelligent agent entity. An agent entity can seek or flee from targets, or it can be in idle state. More... | |
| class | BaseEntityState |
| Base state class for entities in the game. A state defines an entity's current actions in the game. For example, an entity can be fleeing from another entity, or seeking an entity. More... | |
| class | DeadEntityState |
| Subclass of BaseEntityState used for the dead state of entities. More... | |
| class | Entity |
| Class for game entities such as items, NPCs, tiles and the player character. More... | |
| class | FleeEntityState |
| Subclass of BaseEntityState used for the fleeing state of an entity. In this state, an entity is moving away from a target entity. More... | |
| class | Game |
| Main game class used to initialize the game, create a game window and add scenes to it. More... | |
| class | IdleEntityState |
| Subclass of BaseEntityState used for the idling state. In this state, an entity is not performing any specific action (but may still be moving in a specified direction). More... | |
| class | InfoPanel |
| A class for information panel UI elements. An info panel element in the UI is a simple rectangle with text displayed inside it. This can be used to display game information, tooltips, HUD elements and more. It may also be attached to entities to display their information, such as health and current state. More... | |
| class | LevelScene |
| Subclass of Scene for game AI demo levels. More... | |
| class | LiveEntity |
| Subclass of Entity for live entities. Examples of live entities are NPCs, monsters and a player character. More... | |
| class | Logger |
| Provides a very simple logging utility for the game. More... | |
| class | PlayerEntity |
| Subclass of LiveEntity for the player character entity. More... | |
| class | Scene |
| A class for scenes and scene management. Scenes can be anything from levels to main menu screens. More... | |
| class | SeekEntityState |
| Subclass of BaseEntityState used for the seeking state of an entity. In this state, an entity is moving towards a target entity. More... | |
Namespace for the game AI demos. Contains all the classes required for the game demo, its scenes, entities, player, and artificial intelligence.


| About Dailyrotten |
|
Feedback
If you like this page, hate it, or would like to suggest changes,
<EMAIL_ADDRESS>is listening. This page
is experimental and somewhat different from what we usually offer, so please
do send your feedback.
Adding Stories
If you are a rotten newshound and you would like to suggest a story,
visit our submit page to
send us the URL. Stories that are accepted will have your name credited.
Viewership
On the first full day this page went live, 100,000 people visited this Rotten
News page. Of course that was the day after the WTC attacks, so that number is
somewhat distorted. Right now this page gets between 50,000 and 75,000 people
every day.
Linking
We encourage everyone to link to this page; if you like it, others probably
will as well.

Police spokesperson Captain Eddie Cronje said eyewitnesses apparently saw the men beat the boys with pool cues outside a pub at the old railway station in Mossel Bay.  Sounds like the work of the Japanese porn industry to me.
|
|
Read article...
|
|
Retirement home as crackwhore oasis
MSNBC | Submitted by: Snuffy McGraw
"Responding to questions from County Court Judge William Kelly and Assistant District Attorney Gary Heavner, Posner (age 75) also admitted taking money and sex for renting his bedroom for the sexual escapades, as well as other rooms where people smoked crack." Sex? Was there a Viagra smuggling charge that got thrown out somewhere?
|
|
Read article...
|
|
GOP sex offender also giant hypocrite
Baltimore Sun | Submitted by: Reid Fleming
Richard Anthony Delgaudio was recently convicted of kiddie porn for taking pictures of a 16-year-old girl.  Okay, fine. But Mr. Delgaudio also happens to be a very high-profile conservative Republican who denounced Bill Clinton as "a lawbreaker and a terrible example to our nation's young people." Tsk tsk. Delgaudio is the president of the Legal Affairs Council, which helped pay for Oliver North and Caspar Weinberger's Iran-Contra legal bills.
|
|
Read article...
|
|
Japan to Chinese sex slaves: please go away
Mainichi Daily News | Submitted by: Tim Howard
"The Tokyo District Court on Thursday rejected a claim by 10 Chinese people seeking compensation for sexual abuse that former Japanese Imperial Army members inflicted on them or their relatives during World War II, citing changes to Japan's legal system. In dismissing the suit the plaintiffs launched against the Japanese government, Presiding Judge Takaomi Takizawa accepted that the women had been mistreated, but refused their demand for 20 million yen each in compensation, saying the legal system did not allow it."
|
|
Read article...
|
|
Carnival freaks wanted for tradeshow booth
Sydney Morning Herald | Submitted by: optional
An Australian plumbing supply company is advertising for carnival freaks to help man their booth at an upcoming tradeshow. The ad calls for giants, dwarves, albinos, bearded women, human skeletons, etc. to join their "fun, 1900s-style freak-show gallery." This has, predictably, raised the ire of precisely the kind of groups you'd expect.
|
|
Read article...
|
|
12-year-old rapes 46-year-old
WKMG-TV 6 Orlando | Submitted by: Beast Of Blight
" A 12-year-old boy has been charged in the rape of a 46-year-old woman last week on a hiking trail near an elementary school.
Authorities say the boy faces five felony charges in the attack. A juvenile justice expert says the boy may be the youngest in the Bay Area ever to be charged with this type of crime."
|
|
Read article...
|
|
D'oh! Here we go again!
CNN | Submitted by: Crazy Quagga
Hey everybody! Empty your pockets of all metal and privacy!  Get ready for HOURS of Oprah and Dateline proselytizing about loving our children! "A 14-year-old student shot and fatally wounded his principal before killing himself in front of students in the school cafeteria, police and school officials said Thursday." Countdown till Rotten gets blamed for this starting now... 5... 4... 3...
|
|
Read article...
|
|
The cat lady to end all cat ladies
Los Angeles Times | Submitted by: Reid Fleming
We're not talking housecats this time: "More than 90 dead tigers, including 58 cubs stuffed into freezers, were discovered at the Riverside County home of a noted animal rescuer by authorities who also uncovered a menagerie of malnourished animals roaming the property." OK, so it's a guy. Men can be cat ladies too.
|
|
Read article...
|
|
Santa Cruz suing Feds over marijuana raids
Wire Services | Submitted by: Crazy Quagga
Santa Cruz overwhelmingly voted to decriminalize medical marijuana in 1992. The state of California followed suit in 1996. Despite this, the Feds have made it their business to harass medical pot growers in Santa Cruz by staging a series of raids against them. Now city officials are suing the DEA and Attorney General Ashcroft for hurting cancer patients and wasting taxpayer dollars, just to enforce federal laws that nobody supports. It's pot fercrissakes. Don't we have anything better to do with those law enforcement resources?
|
|
Read article...
|
|
|
|
|


GPROF
Section: GNU (1)Updated: 2012-06-22
Index Return to Main Contents
NAME
gprof - display call graph profile dataSYNOPSIS
gprof [ -[abcDhilLrsTvwxyz] ] [ -[ACeEfFJnNOpPqQZ][name] ][ -I dirs ] [ -d[num] ] [ -k from/to ]
[ -m min-count ] [ -R map_file ] [ -t table-length ]
[ --[no-]annotated-source[=name] ]
[ --[no-]exec-counts[=name] ]
[ --[no-]flat-profile[=name] ] [ --[no-]graph[=name] ]
[ --[no-]time=name] [ --all-lines ] [ --brief ]
[ --debug[=level] ] [ --function-ordering ]
[ --file-ordering map_file ] [ --directory-path=dirs ]
[ --display-unused-functions ] [ --file-format=name ]
[ --file-info ] [ --help ] [ --line ] [ --min-count=n ]
[ --no-static ] [ --print-path ] [ --separate-files ]
[ --static-call-graph ] [ --sum ] [ --table-length=len ]
[ --traditional ] [ --version ] [ --width=n ]
[ --ignore-non-functions ] [ --demangle[=STYLE] ]
[ --no-demangle ] [--external-symbol-table=name]
[ image-file ] [ profile-file ... ]
DESCRIPTION
"gprof" produces an execution profile of C, Pascal, or Fortran77 programs. The effect of called routines is incorporated in the profile of each caller. The profile data is taken from the call graph profile file (gmon.out default) which is created by programs that are compiled with the -pg option of "cc", "pc", and "f77". The -pg option also links in versions of the library routines that are compiled for profiling. "Gprof" reads the given object file (the default is "a.out") and establishes the relation between its symbol table and the call graph profile from gmon.out. If more than one profile file is specified, the "gprof" output shows the sum of the profile information in the given profile files."Gprof" calculates the amount of time spent in each routine. Next, these times are propagated along the edges of the call graph. Cycles are discovered, and calls into a cycle are made to share the time of the cycle.
Several forms of output are available from the analysis.
The flat profile shows how much time your program spent in each function, and how many times that function was called. If you simply want to know which functions burn most of the cycles, it is stated concisely here.
The call graph shows, for each function, which functions called it, which other functions it called, and how many times. There is also an estimate of how much time was spent in the subroutines of each function. This can suggest places where you might try to eliminate function calls that use a lot of time.
The annotated source listing is a copy of the program's source code, labeled with the number of times each line of the program was executed.
OPTIONS
These options specify which of several output formats "gprof" should produce.Many of these options take an optional symspec to specify functions to be included or excluded. These options can be specified multiple times, with different symspecs, to include or exclude sets of symbols.
Specifying any of these options overrides the default (-p -q), which prints a flat profile and call graph analysis for all functions.
- -A[symspec]
- --annotated-source[=
symspec]- The
-A option causes "gprof" to print annotated source code. If symspec is specified, print output only for matching symbols.- -b
- --brief
- If the -b option is given, "gprof" doesn't print the verbose blurbs that try to explain the meaning of all of the fields in the tables. This is useful if you intend to print out the output, or are tired of seeing the blurbs.
- -C[symspec]
- --exec-counts[=
symspec]- The
-C option causes "gprof" to print a tally of functions and the number of times each was called. If symspec is specified, print tally only for matching symbols.If the profile data file contains basic-block count records, specifying the -l option, along with -C, will cause basic-block execution counts to be tallied and displayed.
- -i
- --file-info
- The -i option causes "gprof" to display summary information about the profile data file(s) and then exit. The number of histogram, call graph, and basic-block count records is displayed.
- -I dirs
- --directory-path=
dirs- The
-I option specifies a list of search directories in which to find source files. Environment variable GPROF_PATH can also be used to convey this information. Used mostly for annotated source output.- -J[symspec]
- --no-annotated-source[=
symspec]- The
-J option causes "gprof" not to print annotated source code. If symspec is specified, "gprof" prints annotated source, but excludes matching symbols.- -L
- --print-path
- Normally, source filenames are printed with the path component suppressed. The -L option causes "gprof" to print the full pathname of source filenames, which is determined from symbolic debugging information in the image file and is relative to the directory in which the compiler was invoked.
- -p[symspec]
- --flat-profile[=
symspec]- The
-p option causes "gprof" to print a flat profile. If symspec is specified, print flat profile only for matching symbols.- -P[symspec]
- --no-flat-profile[=
symspec]- The
-P option causes "gprof" to suppress printing a flat profile. If symspec is specified, "gprof" prints a flat profile, but excludes matching symbols.- -q[symspec]
- --graph[=
symspec]- The
-q option causes "gprof" to print the call graph analysis. If symspec is specified, print call graph only for matching symbols and their children.- -Q[symspec]
- --no-graph[=
symspec]- The
-Q option causes "gprof" to suppress printing the call graph. If symspec is specified, "gprof" prints a call graph, but excludes matching symbols.- -t
- --table-length=num
- The
-t option causes the num most active source lines in each source file to be listed when source annotation is enabled. The default is 10.- -y
- --separate-files
- This option affects annotated source output only. Normally, "gprof" prints annotated source files to standard-output. If this option is specified, annotated source for a file named path/filename is generated in the file filename-ann. If the underlying file system would truncate filename-ann so that it overwrites the original filename, "gprof" generates annotated source in the file filename.ann instead (if the original file name has an extension, that extension is replaced with .ann).
- -Z[symspec]
- --no-exec-counts[=
symspec]- The
-Z option causes "gprof" not to print a tally of functions and the number of times each was called. If symspec is specified, print tally, but exclude matching symbols.- -r
- --function-ordering
-
The --function-ordering option causes "gprof" to print a
suggested function ordering for the program based on profiling data.
This option suggests an ordering which may improve paging, tlb and
cache behavior for the program on systems which support arbitrary
ordering of functions in an executable.
The exact details of how to force the linker to place functions in a particular order is system dependent and out of the scope of this manual.
- -R map_file
- --file-ordering
map_file- The
--file-ordering option causes "gprof" to print a suggested .o link line ordering for the program based on profiling data. This option suggests an ordering which may improve paging, tlb and cache behavior for the program on systems which do not support arbitrary ordering of functions in an executable.Use of the -a argument is highly recommended with this option.
The map_file argument is a pathname to a file which provides function name to object file mappings. The format of the file is similar to the output of the program "nm".
c-parse.o:00000000 T yyparse c-parse.o:00000004 C yyerrflag c-lang.o:00000000 T maybe_objc_method_name c-lang.o:00000000 T print_lang_statistics c-lang.o:00000000 T recognize_objc_keyword c-decl.o:00000000 T print_lang_identifier c-decl.o:00000000 T print_lang_type ...
To create a map_file with GNU "nm", type a command like "nm --extern-only --defined-only -v --print-file-name program-name".
- -T
- --traditional
- The -T option causes "gprof" to print its output in ``traditional'' BSD style.
- -w width
- --width=
width- Sets width of output lines to
width. Currently only used when printing the function index at the bottom of the call graph.- -x
- --all-lines
- This option affects annotated source output only. By default, only the lines at the beginning of a basic-block are annotated. If this option is specified, every line in a basic-block is annotated by repeating the annotation for the first line. This behavior is similar to "tcov"'s -a.
- --demangle[=style]
- --no-demangle
- These options control whether C++ symbol names should be demangled when printing output. The default is to demangle symbols. The "--no-demangle"
option may be used to turn off demangling. Different compilers have different mangling styles. The optional demangling style argument can be used to choose an appropriate demangling style for your compiler.
Analysis Options
- -a
- --no-static
- The -a option causes "gprof" to suppress the printing of statically declared (private) functions. (These are functions whose names are not listed as global, and which are not visible outside the file/function/block where they were defined.) Time spent in these functions, calls to/from them, etc., will all be attributed to the function that was loaded directly before it in the executable file. This option affects both the flat profile and the call graph.
- -c
- --static-call-graph
- The -c option causes the call graph of the program to be augmented by a heuristic which examines the text space of the object file and identifies function calls in the binary machine code. Since normal call graph records are only generated when functions are entered, this option identifies children that could have been called, but never were. Calls to functions that were not compiled with profiling enabled are also identified, but only if symbol table entries are present for them. Calls to dynamic library routines are typically not found by this option. Parents or children identified via this heuristic are indicated in the call graph with call counts of 0.
- -D
- --ignore-non-functions
- The -D option causes "gprof" to ignore symbols which are not known to be functions. This option will give more accurate profile data on systems where it is supported (Solaris and HPUX for example).
- -k from/to
- The
-k option allows you to delete from the call graph any arcs from symbols matching symspec from to those matching symspec to.- -l
- --line
-
The -l option enables line-by-line profiling, which causes
histogram hits to be charged to individual source code lines,
instead of functions. This feature only works with programs compiled
by older versions of the "gcc" compiler. Newer versions of
"gcc" are designed to work with the "gcov" tool instead.
If the program was compiled with basic-block counting enabled, this option will also identify how many times each line of code was executed. While line-by-line profiling can help isolate where in a large function a program is spending its time, it also significantly increases the running time of "gprof", and magnifies statistical inaccuracies.
- -m num
- --min-count=
num- This option affects execution count output only. Symbols that are executed less than
num times are suppressed.- -nsymspec
- --time=
symspec- The
-n option causes "gprof", in its call graph analysis, to only propagate times for symbols matching symspec.- -Nsymspec
- --no-time=
symspec- The
-n option causes "gprof", in its call graph analysis, not to propagate times for symbols matching symspec.- -Sfilename
- --external-symbol-table=
filename- The
-S option causes "gprof" to read an external symbol table file, such as /proc/kallsyms, rather than read the symbol table from the given object file (the default is "a.out"). This is useful for profiling kernel modules.- -z
- --display-unused-functions
- If you give the -z option, "gprof" will mention all functions in the flat profile, even those that were never called, and that had no time spent in them. This is useful in conjunction with the -c option for discovering which routines were never called.
Miscellaneous Options
- -d[num]
- --debug[=
num]- The
-d num option specifies debugging options. If num is not specified, enable all debugging.- -h
- --help
- The -h option prints command line usage.
- -Oname
- --file-format=
name- Selects the format of the profile data files. Recognized formats are
auto (the default), bsd, 4.4bsd, magic, and prof (not yet supported).- -s
- --sum
-
The -s option causes "gprof" to summarize the information
in the profile data files it read in, and write out a profile data
file called gmon.sum, which contains all the information from
the profile data files that "gprof" read in. The file gmon.sum
may be one of the specified input files; the effect of this is to
merge the data in the other input files into gmon.sum.
Eventually you can run "gprof" again without -s to analyze the cumulative data in the file gmon.sum.
- -v
- --version
- The -v flag causes "gprof" to print the current version number, and then exit.
Deprecated Options
-
These options have been replaced with newer versions that use symspecs.
"-e function_name"
The -e function option tells "gprof" to not print information about the function function_name (and its children...) in the call graph. The function will still be listed as a child of any functions that call it, but its index number will be shown as [not printed]. More than one -e option may be given; only one function_name may be indicated with each -e option.
"-E function_name"
The "-E function" option works like the "-e" option, but time spent in the function (and children who were not called from anywhere else), will not be used to compute the percentages-of-time for the call graph. More than one -E option may be given; only one function_name may be indicated with each -E option.
"-f function_name"
The -f function option causes "gprof" to limit the call graph to the function function_name and its children (and their children...). More than one -f option may be given; only one function_name may be indicated with each -f option.
"-F function_name"
The -F function option works like the "-f" option, but only time spent in the function and its children (and their children...) will be used to determine total-time and percentages-of-time for the call graph. More than one -F option may be given; only one function_name may be indicated with each -F option. The -F option overrides the -E option.
FILES
- a.out
- the namelist and text space.
gmon.out- dynamic call graph and profile.
gmon.sum- summarized dynamic call graph and profile.
BUGS
The granularity of the sampling is shown, but remains statistical at best. We assume that the time for each execution of a function can be expressed by the total time for the function divided by the number of times the function is called. Thus the time propagated along the call graph arcs to the function's parents is directly proportional to the number of times that arc is traversed.Parents that are not themselves profiled will have the time of their profiled children propagated to them, but they will appear to be spontaneously invoked in the call graph listing, and will not have their time propagated further. Similarly, signal catchers, even though profiled, will appear to be spontaneous (although for more obscure reasons). Any profiled children of signal catchers should have their times propagated properly, unless the signal catcher was invoked during the execution of the profiling routine, in which case all is lost.
The profiled program must call "exit"(2) or return normally for the profiling information to be saved in the gmon.out file.
SEE ALSO
monitor(3), profil(2), cc(1), prof(1), and the Info entry for gprof.``An Execution Profiler for Modular Programs'', by S. Graham, P. Kessler, M. McKusick; Software - Practice and Experience, Vol. 13, pp. 671-685, 1983.
``gprof: A Call Graph Execution Profiler'', by S. Graham, P. Kessler, M. McKusick; Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, SIGPLAN Notices, Vol. 17, No 6, pp. 120-126, June 1982.
COPYRIGHT
Copyright (c) 1988, 92, 97, 98, 99, 2000, 2001, 2003, 2007, 2008, 2009 Free Software Foundation, Inc.Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled ``GNU Free Documentation License''.
POD ERRORS
Hey! The above document had some coding errors, which are explained below:- Around line 539:
-
You can't have =items (as at line 545) unless the first thing after the =over is an =item
Index
This document was created by man2html, using the manual pages.
Time: 05:29:04 GMT, December 24, 2015


| WinAPI Wrapper |
The following topic contains several examples showing how to create simple applications of different types. You can copy these examples to .cpp files and compile them and run (although you will need to have a dialog box defined for the dialog box-based application examples).
#include <winapi.h> using namespace WinAPI; class MainWindow: public Window { public: MainWindow() { Create( "Example" ); } protected: virtual void OnDestroy() { PostQuitMessage( 0 ); } virtual void OnPaint() { PaintDC dc( *this ); dc.TextOut( WPoint( 50, 50 ), "Hello, World!" ); } private: virtual ~MainWindow() { } }; namespace { Application< MainWindow > app; }
In this example first the main window class is defined and the the application object is created. The constructor of the main window class creates the actual window object.
The main window processes two messages: in OnDestroy it processes the WM_DESTROY message and sends WM_QUIT to break the message queue; in OnPaint it processes the WM_PAINT message and draws "Hello, World!" text.
The destructor of the MainWindow class is private. It is hidden, because the object of this class should never be explicitly deleted. It is deleted automatically when the window is destroyed.
The application object takes care of creating the main window and processing the message loop. The object is hidden in an anonymous namespace, because there is no point in using it in any other way.
#include <winapi.h> #include "resource.h" using namespace WinAPI; class MainWindow: public ModelessDialog { public: MainWindow() { Create( IDD_MAINWINDOW, 0 ); } protected: virtual void OnDestroy() { PostQuitMessage( 0 ); } virtual void OnCommand( int nIdentifier, int nNotifyCode, HWND hwndControl ) { switch ( nIdentifier ) { case IDOK: case IDCANCEL: Destroy(); break; } } private: virtual ~MainWindow() { } }; namespace { Application< MainWindow, ModelessDialogAccel< MainWindow > > app; }
The difference between this window and the one in the previous example is that this window is a modeless dialog box, and hence it is derived from the ModelessDialog class. The modeless dialog closes/destroys itself when the user clicks either "OK" or "Cancel" button on the dialog.
#include <winapi.h> #include "resource.h" using namespace WinAPI; class MainWindow: public Dialog { public: MainWindow(): Dialog( IDD_MAINWINDOW ) { } protected: virtual void OnCommand( int nIdentifier, int nNotifyCode, HWND hwndControl ) { switch ( nIdentifier ) { case IDOK: case IDCANCEL: EndDialog(); break; } } }; int WINAPI WinMain( HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nShowCmd ) { MainWindow dlg; dlg.Go(); return 0; }
Here the main application window is a modal dialog box and it is derived from the Dialog class. The dialog closes itself when the user presses either "OK" or "Cancel" button on the dialog, and it does so calling the EndDialog function.
In this type of application there is no message loop and the main window does not behave in a typical way, therefore there is no application object and there is a custom WinMain function instead. The WinMain function calls Go and thus creates the dialog box and waits until it is destroyed.
#include <winapi.h> using namespace WinAPI; class DocumentWindow: public MDIChildWindow { public: DocumentWindow( HWND hwndParent ) { Create( "Sample Document", hwndParent ); } protected: virtual void OnPaint() { PaintDC dc( *this ); dc.TextOut( WPoint( 50, 50 ), "Hello, World!" ); } private: virtual ~DocumentWindow() { } }; class MainWindow: public MDIFrameWindow { public: MainWindow() { Create( "Example" ); } protected: virtual void OnDestroy() { PostQuitMessage( 0 ); } virtual bool OnCreate( LPCREATESTRUCT lpCreateStruct = 0 ) { CreateClient( GetClientRect() ); (new DocumentWindow( GetClientWindow() ))->Show(); return true; } }; namespace { Application< MainWindow > app; }
The difference between the main window here and in the first example is that the main window here is an MDI frame, and hence its derived from the MDIFrameWindow class. The frame window during processing the WM_CREATE message in OnCreate calls CreateClient to create the MDI client window and then creates one document window.
The document window is a MDI child window and it is derived from the MDIChildWindow class. It only paints "Hello, World!" in response to the WM_PAINT message.
Creating windows and controls, Creating dialog boxes, MDI applications, The application object


{% extends "base.html" %} {% block navbar %}
Sorry, the page you are looking for is not here or never was...
Why don't you try the Homepage?


Some mathematical concepts that are helpful in 3D graphics.
A nice way to write equations that 'have something in common'.
For example, say that we want to rotate a point [x,y] through an angle.
x' = x * some_operation1(angle)
y' = y * some_operation2(angle)
This would be the rotation matrix.
If the target is row 2 and column 3:
So we end up with:
x' = x*cos(angle) - y*sin(angle)
y' = x*sin(angle) + y*cos(angle)
A matrix can be used to describe rotation, translation and scaling. Matrices can be multiplied to represent a series of such transformations. Imagine if you have a turret on a tank. You can use one matrix to describe the rotation of the turret relative to the tank body. Another matrix to describe the rotation of the tank body relative to the ground and multiply them together to get the turret rotation relative to the ground.
In fact matrices are so useful matrix math is often implemented in hardware on GPUs.


 If you did not request a reset, ignore this email. {% include "includes/logo.html" %}
To reset your IFRC GO password, click here.


| Up | TOC | Index | |||||
| << 8 API Reference | < 9.19 Version 2.4 Beta April 10, 2003 | Up: 9 Release Notes | 9.21 Version 2.3 February 11, 2002 > | 10 Index >> |
9.20 Version 2.4 Alpha February 21, 2003
9.20.1 New Features
- Most machine-level exceptions (peek/poke to bad addresses etc.) in both the main program and in .dlls, are now caught by exw and exu, and reported in the usual way, with a full traceback and ex.err variable dump. This is a great improvement over the cryptic machine-level messages you used to get (and still get when using compiled languages, and most interpreted languages) about "segmentation violation", "illegal instruction" etc.). Thanks to Martin Stachon.
- In addition to stdcall, the C cdecl calling convention is now supported for calls to C routines in .dll's and also call-backs to Euphoria routines from C code.
- Euphoria's support for DOS long filenames has been extended to Windows XP.
- The trace screen shows you large sequences in pretty-print display on a separate screen. You can scroll through the whole sequence.
- pretty_print() was added to misc.e. It lets you display Euphoria objects with a nice, readable structured display, and many formatting options.
- Pretty-printing of sequences is now done in ex.err, the ? command, and db_dump().
- Euphoria Database System (EDS): db_rename_table(name, new_name) was added to database.e. This routine was submitted by Jordah Ferguson, and included with only trivial changes.
- Linux/FreeBSD: system() no longer initializes curses when there is no console window yet. Thanks to Daniel Johnson.
- The number of levels of nested include files has been raised to 30 (from 10). Thanks to Tone Skoda.
- Include statement path names can have double-quotes around them, so paths containing blanks can be handled correctly. This was actually implemented for 2.3 but never documented.
- exw.exe, and any executables produced by the Translator with Watcom, now have the subsystem set to 4.0 instead of 3.1. This improves the appearance of GUI's in some cases. The utility make31.exw will create a version of exw.exe that supports Windows GUI 3.1 as before, in the unlikely case that there are compatibility problems with Euphoria 2.3. Thanks to H. W. Overman, Brian Broker and others for recommending this change.
- makecon.exw - will create a version of exw.exe that operates as a console application - no console window is popped up, and stdin/stdout can be redirected
- trace(1 2 and 3) are now allowed with bind -clear (still not allowed with shrouded bind for security reasons). Thanks to Jonas Temple.
- Translator: You can now make a Euphoria .dll using Lcc and interface it with interpreted programs running under exw, and translated programs using Borland and Watcom. Previously, the main program had to also be compiled with Lcc.
- The Translator no longer uses the -m486 or -mpentium options available with GCC and DJGPP. These options were causing warnings, and the C compiler apparently sets the machine model correctly by itself. Thanks to Kenneth Rhodes.
- The Translator will now perform automatic calls to user-defined types, in the unusual case where the type routine has side-effects (it sets global variables, performs I/O etc.). Thanks to Andy Serpa.
- euphoria\demo\bench compares the Euphoria Interpreter and the Euphoria To C Translator against more than 20 other interpreted languages.
9.20.2 Porting Activity
- We ported the Interpreter and Translator to FreeBSD. The source now has several C #ifdef's for FreeBSD.
- Andy Cranston has ported Euphoria to HP Unix, and he plans to do Sun Unix.
9.20.3 Optimizations
<IP_ADDRESS> Interpreter
- Typical large slices are faster. About 30% faster for slices from about 100 to 50000 in length. (Overhead dominates for smaller slices, and lack of caching affects larger slices.) This assumes the slice is mostly integers (usually true), and an actual copy of the data is made (usually true since v1.4b).
- Statements that contain multiple & concatenations are much faster.
e.g. instead of: **result = a & b & c** being evaluated as: 1. copy a and b into temp 2. copy temp and c into result (a and b are effectively copied twice!) We now do: 1. copy a and b and c directly into result
So there is less copying of data and fewer temp sequences to create. The more & operators in an expression, the greater the speed-up. e.g. with 3 & operators some of the data was copied 3 times, etc. Jordah Ferguson pointed out that this was slow.
- The time overhead involved in calling and returning from a Euphoria call-back routine has been reduced by about 10 percent.
- In exw and ecw -wat, allocation of space for large numbers of objects is faster. It can be tremendously faster when hundreds of thousands or millions of objects are involved.
- Better UPX compression has chopped a few K off exw.exe vs. 2.3 (even though new code was added). Thanks to Wolfgang Fritz
<IP_ADDRESS> Euphoria Database System
- Keys and records are read faster due to a faster decompress() routine. Almost twice as fast when the key or record data to be retrieved consists mainly of sequences of characters or small integers. This case is quite common.
- Allocating new space in a database is much faster, up to 4x faster, especially in large databases with a large list of free blocks
- Inserting and deleting records in huge tables is now much faster. Combined with the speeded-up slices in Euphoria 2.4, database.e is now about 25% faster for a table with 10,000 records and over 3x faster for a table with 100,000 records. This really only matters if you are trying to insert/delete hundreds of records per second. In the typical case of a human operator entering data via GUI, you would never notice the insert/delete time for one record (a few milliseconds). Derek Parnell pointed out the slowness.
- db_select_table() is significantly faster.
- get4() is faster which speeds up everything.
<IP_ADDRESS> Other Optimizations
- bytes_to_int() in machine.e is now more than twice as fast.
- gets() is about 5% faster
- sort() and custom_sort() are a few percent faster. Thanks to Ricardo Forno for tweaking the Shell sort algorithm.
- Several additional optimizations have been added to the Translator. It produces executables that are faster and smaller than version 2.3. The 2.4 Translator has been successfully tested on hundreds of thousands of lines of Euphoria code, and there are currently no known code generation bugs. Some Translator benchmark results are in euphoria\demo\bench.
9.20.4 Bug Fixes
<IP_ADDRESS> Source Code
- bug fixed: The gnubsd batch file referred to syncolor.c and syncolor.o. (gnuexu was ok.)
- bug fixed: Karl Bochert pointed out a necessary C coding change to make poke() work with the latest version of Lcc. The change corrected the Translator (with recent versions of Lcc) and the Interpreter Source Code (compiled with Lcc)
<IP_ADDRESS> Interpreter
- bug fixed: A crash might occur in situations where a call-back routine indirectly called itself recursively. Thanks to Matthew Lewis and George Papadopoulos.
- bug fixed: In for-loops at the top-level of a program (outside of any routine), that incremented the loop variable by an integer other than the default of +1, end for was taking up to 15x longer than necessary due to a bug fix that was made back in November 1999. Only the end for itself was slow, not the code contained in the body of the loop. Antoine Tammer detected this.
- bug fixed: On XP, when you open a new DOS window that has more than 25 lines, the Virtual DOS Machine (VDM) is at first confused about the true number of lines. The first time (only) when you ran a Euphoria program in that window, if you ran it near the very bottom of the screen, the output might disappear, or the VDM or Euphoria might report an error etc. Euphoria (ex.exe) now detects the rare cases when VDM is confused and clears the screen, which clears up the confusion. A similar problem existed on NT, and was fixed a few years ago.
- bug fixed: The interpreter was referring to "call back from Windows" in ex.err, even on Linux or FreeBSD. It now says "call-back from external source" on those systems. Thanks to Pete Eberlein.
- bug fixed: When an include file couldn't be found, the error message referred to "euphoria\include". It now uses %EUDIR%\include
- bug fixed: An error message will no longer be generated on any platform for without profile_time. Thanks to Alan Oxley.
<IP_ADDRESS> Translator
- bug fixed: When assigning the result of an arithmetic calculation (typically multiply) involving two integers, to a variable declared as atom, where the atom variable had already (in the same basic block) been assigned an integer value, the Translator might not output any code to check for integer overflow (result outside of +/- one billion). This could cause a crash. Thanks to Andy Serpa.
- bug fixed: DJGPP strip.exe command in emake.bat would fail on XP,2000 due to a bug in DJGPP. Now emake.bat has: SET LFN=n to work around the bug in strip.exe
- bug fixed: Translated code compiled with Borland C was not producing INF's and NAN's, like Watcom and Lcc. Rather, it was crashing when a floating-point overflow (over 1e308), or an undefined f.p. result was calculated. The Interpreter Source Code was also corrected for those who wish to compile exw.exe using Borland. Thanks to Andy Serpa.
- bug fixed: In the first basic block of a Euphoria routine (i.e. before any control-flow statements), peek4u(),  peek4s(), and the "add integer 1" operation, would sometimes neglect to check for possible 31-bit integer overflow when assigning to a private variable declared as atom, unless the variable had been previously initialized. Thanks to Mike Duffy.
- bug fixed: In some cases, when assigning a sequence element to a variable declared as integer, and known to have an integer value at this point, the case where the element was an integer value stored in C double form was not handled correctly.
- bug fixed: In rare cases, the translator might output two unary minus operators in a row, which would be parsed by a C compiler as the C decrement operator "--".
- bug fixed: Euphoria .dll's were not always correctly freeing storage allocated by the main program, and vice versa. Memory could be wasted, and you might get a machine-level crash. Thanks to H. W. Overman.
Note: Due to this fix, any Euphoria .dll's created with the Translator version 2.3 or earlier, must be re-translated with 2.4, and re-compiled, in order to interface with the Euphoria 2.4 (or later) interpreter or translated code. New .dll's created with version 2.4 or later, will not work with the interpreter version 2.3 or earlier, except in trivial cases.
- bug fixed: The sleep(x) function was only sleeping for x milliseconds when using the Lcc run-time library. It now sleeps for x seconds, to conform with the Euphoria documentation for sleep(). Thanks to Wolfgang Fritz.
- bug fixed: On some versions of Linux, a translated/compiled Euphoria program would crash if standard output was redirected, e.g. for CGI
- bug fixed: On some versions of Linux, a translated/compiled Euphoria program would crash if machine(M_GET_SCREEN_CHAR, {row, col}) were called.
- bug fixed: In some cases the code was not correct when an integer variable was assigned the unary minus of an atom variable.
- bug fixed: In a very rare case, an uninitialized value in memory might be used to determine if a literal floating-point value should be treated as an integer or not. Incorrect code could result.
<IP_ADDRESS> Binder
- bug fixed: The binder would crash after seeing a comment with no new-line character, just EOF, on the last line of a file. Some versions of Win32Lib.ew had this. Thanks to Henri Goffin.
- bug fixed: The usage report of bind/shroud still said "-scramble", instead of "-clear" and had other errors for Linux/FreeBSD. Thanks to Chris Bensler.
- bug fixed: bind/shroud -clear might neglect to rename a private variable, when an earlier local variable gets renamed into the same name. Thanks to Pete Lomax.
- bug fixed: When an include file was missing \n on the last line, bind/shroud -clear might neglect to leave some whitespace before the next word in the main file. Thanks to Pete Lomax.
- bug fixed: If you defined a constant that was never used, and it was defined using an expression that contained a binary minus operator, a syntax error could occur in the bound or shrouded file that you create. Thanks to Chris Bensler.
<IP_ADDRESS> Library Routines
- bug fixed: walk_dir("/",...) would fail on Linux. Thanks to Ricardo Forno.
- bug fixed: db_compress() of EDS had an error if the database file or it's path contained a blank character. A blank is ok now on all platforms except DOS. Thanks to Virtual B.
- bug fixed: wildcard_file() in euphoria\include\wildcard.e is now case sensitive on Linux/FreeBSD (but is still case insensitive on DOS/Windows). Thanks to Jeff Fielding.
- bug fixed: dir() was not always reporting file sizes greater than 1 Gb correctly. It now handles up to 4 Gb. Arithmetic performed on the file size would probably fail. Thanks to Ricardo Forno.
- bug fixed: where() was not always reporting file positions greater than 1 Gb correctly. Arithmetic performed on the position would probably fail. It now handles up to 2 Gb.
- bug fixed: ex, exw, ec -wat, ecw -wat: The dir() function for DOS and Windows was not handling wildcards correctly when a backslash appeared at the end of the file or directory path. Thanks to Juergen Luethje.
<IP_ADDRESS> Namespace Feature
- bug fixed: If you tried to declare a new variable, using a namespace qualifier, e.g. integer y:x (which is illegal) it wouldn't complain, and would just ignore the "y:" part, as long as y:x was a routine (not a variable) in an earlier file. This is now caught as an error. Thanks to Martin Stachon.
- bug fixed: When declaring the type of a parameter, using a global type that was defined in more than one file, you would get an unclear error message stating "a type is expected here". Now you'll get a message pointing out that the type requires a namespace identifier to resolve it. Thanks to Juergen Luethje.
- bug fixed: The error message that you get if you specify a namespace qualifier and a ':', but you neglect to follow it with a properly-formed identifier, has been improved. Thanks to Carl White.
<IP_ADDRESS> Demo Programs
- bug fixed: In the window.exw demo program, allocate(64) and allocate(16) caused a storage leak. Thanks to Wolfgang Fritz and Jordah Ferguson.
<IP_ADDRESS> Trace/Debug
- bug fixed: When trace(0) was executed, followed later by trace(1), with no screen I/O in between, the values of some variables on the trace screen were not updated. Thanks to Ricardo Forno.
- bug fixed: with trace / with profile / trace(3), used all together, produced garbage source lines in ctrace.out. Thanks to Kat.


Provides a simple R interface to the OPUS Miner algorithm (implemented in C++) for finding the top-k productive, non-redundant itemsets from transaction data. The OPUS Miner algorithm uses the OPUS search algorithm to efficiently discover the key associations in transaction data, in the form of self-sufficient itemsets, using either leverage or lift. See <http://i.giwebb.com/index.php/research/association-discovery/> for more information in relation to the OPUS Miner algorithm.
| Version: | 0.1-0 |
| Imports: | Rcpp (≥ 0.12.9), arules (≥ 1.5-0), Matrix (≥ 1.2-7), methods |
| LinkingTo: | Rcpp |
| Published: | 2017-02-16 |
| Author: | Geoffrey I Webb [aut, cph] (OPUS Miner algorithm and C++ implementation, http://i.giwebb.com/index.php/research/association-discovery/), Christoph Bergmeir [ctb, cre], Angus Dempster [ctb, cph] (R interface) |
| Maintainer: | Christoph Bergmeir <christoph.bergmeir at monash.edu> |
| License: | GPL-3 |
| Copyright: | OPUS Miner algorithm and C++ implementation Copyright (C) 2012-2017 Geoffrey I Webb, R interface Copyright (C) 2017 Angus Dempster. |
| NeedsCompilation: | yes |
| Citation: | opusminer citation info |
| In views: | MachineLearning |
| CRAN checks: | opusminer results |
| Reference manual: | opusminer.pdf |
| Package source: | opusminer_0.1-0.tar.gz |
| Windows binaries: | r-devel: opusminer_0.1-0.zip, r-release: opusminer_0.1-0.zip, r-oldrel: opusminer_0.1-0.zip |
| OS X binaries: | r-release: opusminer_0.1-0.tgz, r-oldrel: opusminer_0.1-0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=opusminer to link to this page.


PIC OF THE DAY: When Someone Forces You To Say Congratulations
by Timothy NdoroIt seems like the Rusape Town Council was so excited with the appointment of Zvinechimwe Vhuru as the Permanent Secretary in the newly created Ministry of National Housing that they rushed to place a congratulatory message in the daily publications.
However, in their zeal to be the first to congratulate the new Permanent Secretary, the Rusape Town Council made several embarrassing blunders. To begin with, the image on the congratulatory message is not that of Zvinechimwe Vhuru but that of Marian Chombo, the former wife of former Finance Minister Ignatious Chombo.
Then the message itself is grammatically incorrect as the sex of the subject changes three times in one sentence. Or perhaps this is not a sign of incompetence but rather that of someone who begrudgingly posted the congratulatory message against their will.
Read the message below,
To View and Apply for the latest Jobs and Vacancies in Zimbabwe, Please Visit our Sister website iHarare Jobs


| Application number | {{application.number}} |
| Applicant | {{application.applicant.name}} |
| Age | {{application.applicant.age}} |
| Car | {{application.car.manufacturer}} {{application.car.type}} |
| Insurance product | {{application.insuranceProduct}} |
| Price inidcation | {{application.priceIndication}} |
| {{risk}} |


Your browser doesn't support webgl - Update it or switch to a different one to check the experience
drag to go trough the day
Winter Journey
by
Julien Renau / @julien_rno
Winter Journey
"For every dark night,
there is a brighter day..."


Writing (scholarly) texts - a great way is using Markdown. Bibtext interacts nicely with Markdown, so one can easily cite literature.
One question that came up for me a couple of times recently was how to cite blogs in Bibtex?
I found this solution to be the most convenient:
@misc{stats_test,
Author = {Sebastian Sauer},
Date-Added = {2018-03-29 13:54:38 +0000},
Date-Modified = {2018-03-29 13:55:51 +0000},
Doi = {10.17605/OSF.IO/SJHUY},
Howpublished = {Data Set},
Month = {01},
Title = {Results from an exam in inferential statistics},
Year = {2017}}
The important points are the @misc
class, and the Howpublished
field. Rendering this citation yields (in APA form):
Sauer, S. (2017, Januar). Results from an exam in inferential statistics. Data Set. doi:10.17605/OSF.IO/SJHUY
Which appears to me as a sensible solution. Note the inclusion of “Data set.” which is triggered by the Howpublished
field. Previously I have been missing out this field when citing blogs, or more generally, web content.
It may well be that there are other and better approaches around, so inform me if you find some easier or prettier way.


For many years i browse sometime on openclassroom, to learn one things at some moment. but i never do the activity until one of my friends tell me how openclassroom can help. i understand that i can have a real course on this website if want and i know how to learn so i decide to learn on openclassroom.
It's very usefull.
Learn more


This section is all about data management, all of which perform tasks on a
singular protected property called $data
.
The ArrayAccess trait wraps the ArrayAccess interface of PHP and when mounted will allow your class to be accessed like an array. Mounting this trait can be done with the following example.
use Cradle\Data\ArrayAccessTrait
class MyClass
{
use ArrayAccessTrait;
protected $data = array();
}
The ArrayAccess trait implements the ArrayAccess interface exactly adding
offsetSet
, offsetGet
, offsetExists
, offsetUnset
methods to your class
which makes the following now possible.
$myClass = new MyClass;
if(!isset($myClass['foo'])) {
$myClass['foo'] = 'bar';
}
echo $myClass['foo']; //--> 'bar'
unset($myClass['foo']);
The Countable trait wraps the Countable interface of PHP and when mounted will allow your class to be counted like an array. Mounting this trait can be done with the following example.
use Cradle\Data\CountableTrait
class MyClass
{
use CountableTrait;
protected $data = array();
}
The Countable trait implements the Countable interface exactly adding the
count
method to your class which makes the following now possible.
$myClass = new MyClass;
echo count($myClass); //--> 0
The Iterator trait wraps the Iterator interface of PHP and when mounted will allow your class to be iterated like an array. Mounting this trait can be done with the following example.
use Cradle\Data\IteratorTrait
class MyClass
{
use IteratorTrait;
protected $data = array();
}
The Iterator trait implements the Iterator interface exactly adding
rewind
, current
, next
, key
, valid
methods to your class
which makes the following now possible.
$myClass = new MyClass;
foreach($myClass as $key => $value) {
//Do something
}
The Magic trait adds extra accessors for the data array. Mounting this trait can be done with the following example.
use Cradle\Data\MagicTrait;
class MyClass
{
use MagicTrait {
MagicTrait::__getData as __get;
MagicTrait::__setData as __set;
MagicTrait::__callData as __call;
MagicTrait::__toStringData as __toString;
}
protected $data = array();
}
The Magic trait implements three magic methods adding __call
, __get
,
__set
methods to your class which makes the following now possible.
$myClass = new MyClass;
$myClass->setFooBar('zoo'); // $data['foo_bar']
echo $myClass->getFooBar(); //--> 'zoo'
$myClass->foo_bar = 'zoo'; // $data['foo_bar']
echo $myClass->foo_bar; //--> 'zoo'
echo $myClass; //--> <JSON string>
The Dot trait adds accessors to help manage three or more dimensional arrays. Mounting this trait can be done with the following example.
use Cradle\Data\DotTrait;
class MyClass
{
use DotTrait;
protected $data = array();
}
The Dot trait implements a four methods called getDot
, setDot
,
isDot
, removeDot
which can be used like the following
$myClass = new MyClass;
$myClass->setDot('some.path.to.value', 'foobar'); // $data['some']['path']['to']['value'] = 'foobar'
$myClass->getDot('some.path.to.value'); //--> 'foobar'
$myClass->getDot('some.path.to'); //--> ['value' => 'foobar']
$myClass->removeDot('some.path');
$myClass->isDot('some.path'); //--> false
$myClass->getDot('some-path-to-value', '-');
The Generator trait takes advantage of PHP generators. Mounting this trait can be done with the following example.
use Cradle\Data\GeneratorTrait;
class MyClass
{
use GeneratorTrait;
protected $data = array();
}
The Generator trait implements a single method called generator
which can be
used like the following.
$myClass = new MyClass;
foreach($myClass->generator() as $key => $value) {
//Do something
}
The data trait combines all the aforementioned traits so you wouldn't have to declare them one by one (on the off chance you would want to use all of them). Mounting this trait can be done with the following example.
use Cradle\Data\DataTrait;
class MyClass
{
use DataTrait;
}
A registry object contains methods to easily manage a multidimensional array. Implementing this object can be done like so.
use Cradle\Data\Registry;
$registry1 = new Registry;
//or
$registry2 = new Registry(['zoo' => ['foo' => ['bar']]]);
On top of all the DataTrait
methods, the registry implements 5 additional
methods.
exists
- Returns true if the data has the given key path or whether
if there is data at all.
$registry1->exists(); //--> false
$registry2->exists(); //--> true
$registry2->exists('zoo'); //--> true
$registry2->exists('zoo', 'foo'); //--> true
$registry2->exists('foo', 'bar'); //--> false
get
- Returns part of the data given the key path or the entire data set.
$registry2->get(); //--> ['zoo' => ['foo' => ['bar']]]
$registry2->get('zoo'); //--> ['foo' => ['bar']]
$registry2->get('zoo', 'foo'); //--> ['bar']
$registry2->get('zoo', 'foo', 0); //--> 'bar'
isEmpty
- Returns true if the data, given key path is empty or whether
if there is data at all.
$registry1->isEmpty(); //--> true
$registry2->isEmpty(); //--> false
$registry2->isEmpty('zoo'); //--> false
$registry2->isEmpty('zoo', 'foo'); //--> false
$registry2->isEmpty('foo', 'bar'); //--> true
remove
- Removes part of the data given the key path or the entire data set.
$registry2->remove('zoo', 'foo', 0); // 'bar'
$registry2->remove('zoo', 'foo'); // ['bar']
$registry2->remove('zoo'); // ['foo' => ['bar']]
$registry2->remove(); // ['zoo' => ['foo' => ['bar']]]
$registry2->remove('foo', 'bar'); // does nothing because it doesn't exist
set
- Sets part of the data given the key path or the entire data set.
$registry2->set('zoo', 'foo', 0, 'bar'); // ['zoo' => ['foo' => ['bar']]]
A model object simply deals with key/value pairs. Models become useful when pairing it with a data store, JSON results, services etc. Implementing this object can be done like so.
use Cradle\Data\Model;
$model1 = new Model;
//or
$model2 = new Model(['foo_bar' => 'zoo']);
On top of all the DataTrait
methods, the model object implements 2 additional
methods.
get
- Returns the entire data set.
$model2->get(); //--> ['foo_bar' => 'zoo']
set
- Sets the entire data set.
$model1->set(['foo_bar' => 'zoo']);
A collection object helper manages a list of models. Collections become useful when pairing it with a data store, JSON results, services etc. Implementing this object can be done like so.
use Cradle\Data\Collection;
$collection = new Collection;
A collection object only mounts ArrayAccessTrait
, CountableTrait
,
GeneratorTrait
, IteratorTrait
and implements 6 additional methods.
add
- Appends a model to the collection
$collection->add(new Model);
cut
- Removes a model in the collection given the index number and
reindexes the collection.
$collection->cut(1); //removes the second model
$collection->cut('first'); //removes the first model
$collection->cut('last'); //removes the last model
each
- Loops through each model in the list
$collection->each(function($model) {
//do something
});
get
- Returns the entire dataset as pure arrays
$collection->each(function($model) {
//do something
});
getModel
- Transforms an array into a model
$collection->getModel(['foo' => 'bar']); //--> Model
set
- Sets the collection
$collection->set([
['foo' => 'bar'],
['foo' => 'zoo']
])


Security is mostly a superstition. It does not exist in nature, nor do the children of men as a whole experience it. Avoiding danger is no safer in the long run than outright exposure. Life is either a daring adventure,
or nothing.
I have seen many storms in my life. Most storms have caught me by surprise, so I had to learn very quickly to look further and understand that I am not capable of controlling the weather, to exercise the art of patience
and to respect the fury of nature.
We need to find God, and he cannot be found in noise and restlessness. God is the friend of silence. See how nature - trees, flowers, grass- grows in silence; see the stars, the moon and the sun, how they move in silence...
We need silence to be able to touch souls.
If the sight of the blue skies fills you with joy, if a blade of grass springing up in the fields has power to move you, if the simple things of nature have a message that you understand, rejoice, for your soul is alive.
You and I are, by birth, by nature, and by choice, inwardly depraved, which is to say that we are entirely corrupt. That's not to say that we have no good in us; we do. However, anything good in us has been tainted with
evil. It touches everything. Without the redeeming power of Christ we cannot halt our own moral slide.
Nature is impersonal, awe-inspiring, elegant, eternal. It's geometrically perfect. It's tiny and gigantic. You can travel far to be in a beautiful natural setting, or you can observe it in your backyard - or, in my
case, in the trees lining New York City sidewalks, or in the clouds above skyscrapers.


Something hidden inside the file. Check it and find the key. You'll get a 1337 string if success. And you should be able to recognize the original (noob-readable) string. Use the FILE or static linked version or another version


Kim Kardashian finally breaks silence over Caitlyn Jenner in I'm A Celeb with Kylie dig
Kim is the first member of the Kardashian family to even reference former step-dad Caitlyn taking part in the UK's biggest reality show
by Lucy Buckland, http://www.facebook.com/MirrorCelebKim Kardashian has become the first member of her family to speak about Caitlyn Jenner's stint in I'm A Celebrity.
Reality star, entrepreneur and yummy mummy Kim took almost a week to acknowledge her former step father had stepped foot in the jungle.
But instead of wishing Caitlyn, 70, good luck Skims founder Kim appeared to take a dig at the jungle star for her use of a morning greeting.
Sharing a clip of ex Olympian Caitlyn addressing the camp using the now catchy Kylie Jenner version of "Rise and Shine", Kim slyly wrote: "I literally recorded this and set this as my alarm a few weeks ago!"
Although Caitlyn prefixed her morning wake up call with "Lets go team, it's not just another day, another day to excel, another day to be great."
Youngest daughter Kylie famously drove fans crazy with her insanely catchy Rise and Shine greeting to wake baby Stormi up in October's You Tube video tour of her office.
The video was viewed 4 million in its first day, 70 million times in its second day and one billion times by the end of the week.
Fans were thrilled with Kim's tweet. One gushed: "I love Caitlin just as a fan, I can’t imagine how fantastic she is as a part of your life."
Another simply wrote: "Just support Jenner Kim."
Although none of the Kardashians have spoken about their mum's ex, Caitlyn has been speaking affectionately about them, and even cried on the first day because she missed her grandchildren so much.


Remember how I started talking about my new adventure with learning to code over here? I have a new place to blog, thanks to Dev Bootcamp and Github!.
Diving into developer lingo
1 de mayo 2015
A few reflections from Week 1:
What are the benefits of version control?
Wait, what is version control? Let's consider this situation: Marley, Diddy and Beyonce are a team and working on a project together and have one file: Change the World through Dance.
Version control allows each contributor to work on the project without interrupting someone else's work and maintain the integrity of each person's unique work. It eliminates the need to send the newest version back and forth through lots of emails.
Let's imagine B, Diddy and Marley all adding text and inserting sounds at the same moment in time. But oops! Baby Marley hit all the keys on his dad's keyboard and did some funky stuff. No worries! Version control maintains each saved point because life happens.The major benefit of version control is that it creates efficiency for people working on teams or a person that works across multiple devices.
How does git help you keep track of changes?
Git is the software on your computer that allows you to save and keep track of your edits as you go. Let's say you are writing a blog entry (ha!) and have lots of funny ideas so you dump them into a file. You save them to a file. The next day you work on developing a story around Funny Ideas about Kale. Save (with git). That means git has a version of your file before Kale and after Kale. You can revert back to your original document pre-Kale.
The key work here is "track" because git stores what was changed in a document, who changed it and at what time. Talk about accountability! This is awesome because if need to ask a follow-up question to a teammate about their changes, you know what they changed, when they did it and who to go to for that change.
Why use GitHub to store your code?
Github is the online storage place for your files that you save with git. Let's go with another short story. You and your soccer team have a spreadsheet with player information: name, phone number, birthday and shoe size. Plus it has the league schedule, favorite watering holes for post-win celebrations and everyone's brackets for the World Cup. If that file is saved to Github, everyone on the team has access to the file, can create a local copy (called: clone in git lingo) on their own computer, make changes and submit them to the team. When Captain Jaclyn submits a change to the document, everyone else will see that change. Let's get a bit more technical.
Github allows a team to have a master folder called a repository. Each person on the team can create their own copy that is saved in their personal space. That's called fork a repository. That's still just on Github in the Internet. Now what if you want to work on that file but don't have access to Internet? You need a copy of that file on your computer! You can clone your repository and have that same file on your computer. It gets even cooler. You can merge your local copy to your Github repository so that changes you make from your computer also get added to the Github file. Remember working on group projects in high school? Everyone had a different role to complete? Github allows teams to work together and bring their individual work together easily.
p.s. It isn't an automatic relationship between git and github though. Don't be fooled.


- 9518pg2aUsername
- 17m 45sSession Time
- 300 MBIncoming Data
- 10 MBOutgoing Data
- 310 MBTotal Data
Refreshing in 13 seconds.
NA used of NA
Refreshes every 5 minutes
15m 02s used of 02h 00m 00s
Refreshes every 5 minutes
There is no usage statistic for this account.


The RecordingOptions class allows specifying options for recording.
More...
#include <RecordingOptions.hpp>
The RecordingOptions class allows specifying options for recording.
The RecordingOptions class contains more advance options for recording. It can be used to specify things like splitting of files and directories.
- See also
- DataRecorder
§ RecordingOptions() [1/3]
| XeThru::RecordingOptions::RecordingOptions |
( |
| ) |
|
§ RecordingOptions() [2/3]
§ RecordingOptions() [3/3]
§ ~RecordingOptions()
| XeThru::RecordingOptions::~RecordingOptions |
( |
| ) |
|
§ get_data_rate_limit()
| int XeThru::RecordingOptions::get_data_rate_limit |
( |
| ) |
const |
- Returns
- the data rate (ms) the recorder will read data from the module if set, otherwise returns -1 (no data rate limit). A value of 1000 ms means data is read every second. Data in between is discarded.
§ get_directory_split_size()
By default, this function returns a default constructed value (no directory split size) if no custom size is set.
- Returns
- the preferred directory split size
- See also
- PreferredSplitSize
§ get_file_split_size()
By default, this function returns a default constructed value (no file split size) if no custom size is set.
- Returns
- the preferred file split size
- See also
- PreferredSplitSize
§ get_session_id()
| std::string XeThru::RecordingOptions::get_session_id |
( |
| ) |
const |
By default, this function returns an universally unique identifier (UUID) if no custom id is set.
- Returns
- the session id
- See also
- set_session_id
§ get_user_header()
| Bytes XeThru::RecordingOptions::get_user_header |
( |
| ) |
const |
- Returns
- the custom user header. By default, this parameter is Bytes() (no custom header).
§ operator=() [1/2]
Copy assignment operator.
§ operator=() [2/2]
Move assignment operator.
§ set_data_rate_limit()
| void XeThru::RecordingOptions::set_data_rate_limit |
( |
int |
limit | ) |
|
Sets the data rate (ms) the recorder will read data from the module.
A value of 1000 ms means data is read every second. Data in between is discarded. By default, this parameter is -1 (no data rate limit).
- Parameters
-
| limit | Specifies the data rate limit |
§ set_directory_split_size()
| void XeThru::RecordingOptions::set_directory_split_size |
( |
const PreferredSplitSize & |
size | ) |
|
Sets the preferred directory split size as specified.
- Parameters
-
| size | Specifies the preferred split size |
§ set_file_split_size()
Sets the preferred file split size as specified.
- Parameters
-
| size | Specifies the preferred split size |
§ set_session_id()
| void XeThru::RecordingOptions::set_session_id |
( |
const std::string & |
id | ) |
|
Sets the session id as specified, overriding the default constructed value which is an universally unique identifier (UUID).
- Parameters
-
- See also
- get_session_id
§ set_user_header()
| void XeThru::RecordingOptions::set_user_header |
( |
const Bytes & |
header | ) |
|
Sets a custom header applied to the beginning of the recorded file.
By default, this parameter is Bytes() (no custom header).
- Parameters
-
| header | Specifies the header |
The documentation for this class was generated from the following file:


User Defined Categories
Back to Dashboard
Enter the categories you want to use for training
Add
{{userDefinedCategoryCount.category}}
Categories that are currently in use can NOT be deleted.
Uncheck
them first.


{{.NodeComment}} Wallet Name: {{.NodeName}}
Balance {{.Balance}} jeffCoins
Your Public Wallet Address. Use this to receive coins.
A grand total of 1,000,000 jeffCoins
The blockchain will not store jeffCoins but addies which are 1/1000 of a jeffCoin (.001 JEFF)
The founders wallet will start with 100,000 jeffCoins (100,000,000 addies) (10% of all jeffCoins)
Rewards 1 jeffCoin (1000 addies) every 10 minutes (144 jeffCoins/day or 52,560 jeffCoins/year)
Will take 17.12 years to mint all the jeffCoins (900,000/52,560 = 17.12)
Version: {{.ToolVersion}}
{{.NodeIP}}:{{.NodeHTTPPort}} (Using TCP Port {{.NodeTCPPort}}) API Commands


Parallel Graph Algorithms
-
A graph that supports vertex-parallel graph algorithms.
Graph structures are often parallelizable. One common way to parallelize is to parallelize by vertex. In this “think-like-a-vertex”, computation is organized into a series of steps, where each vertex executes executes on “local” information, such as vertex-specific properties, as well as the set of edges leaving the vertex. In order to compute useful properties of the graph, a mailbox abstraction is provided that allows a vertex to receive messages from a previous algorithm step, and to send messages to arbitrary other verticies that will be received in the subsequent step.
This abstraction is inspired by:
Pregel: A System for Large-Scale Graph Processing (2010) Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski
See also
MailboxesProtocolSee moreSee also
MailboxProtocolDeclaration
Swift
public protocol ParallelGraph : PropertyGraph
-
Context provided to the function that is invoked on a per-vertex basis.
We use a context object to (1) simplify the parallel graph API, and (2) make it easy to extend the parallel graph implementation if new bits of context need to be added over time.
ParallelGraphAlgorithmContext
also helps enforce the inability to access Vertex property maps during the course of execution, as that could result in violations of the Law of Exclusivity.See moreSee also
ParalleGraph
Declaration
Swift
public struct ParallelGraphAlgorithmContext< Graph, // : GraphProtocol, // Redundant conformance. Message, GlobalState: MergeableMessage, Mailbox: MailboxProtocol > where Mailbox.Message == Message, Mailbox.Graph == Graph
-
A vertex that can keep track of its distance from another point in the graph.
See moreDeclaration
Swift
public protocol DistanceVertex
-
A protocol for whether a vertex is reachable.
See moreDeclaration
Swift
public protocol ReachableVertex
-
Messages used during parallel BFS and parallel shortest paths.
See moreDeclaration
Swift
public struct DistanceSearchMessage<VertexId, Distance> : MergeableMessage where Distance : AdditiveArithmetic, Distance : Comparable
-
Declaration
Swift
public struct SIMDLabelBundle<SIMDType> where SIMDType : SIMD, SIMDType.Scalar == Float
extension SIMDLabelBundle: LabelBundle
extension SIMDLabelBundle: CustomStringConvertible
-
A message used in
See moreParallelGraph
algorithms to compute the sum of weights for all incoming edges to a vertex.Declaration
Swift
public struct IncomingEdgeWeightSumMessage : MergeableMessage
-
An optionally labeled vertex that can be used in the Expander algorithm for propagating labels across a partially labeled graph.
See also
ParallelGraph.propagateLabels
See moreSee also
ParallelGraph.computeEdgeWeights
Declaration
Swift
public protocol LabeledVertex
-
Represents a set of labels and their corresponding weights for use in the expander label propagation algorithm.
For example, we may have categories {A, B, C}. Vertex 1 is seeded with label A, and vertex 3 is seeded with label C. Because vertex 1 is connected to vertex 2, it will propagate its label A along. Vertex 3 is also connected to vertex 2, and sends its label C along. Vertex 2 thus should have a computed label of (assuming equal weight to edges 1->2 and 3->2) 50% A, and 50% C.
Note: a LabelBundle must encode the sparsity associated with the presence or absence of labels.
See moreSee also
ParallelGraph.propagateLabels
Declaration
Swift
public protocol LabelBundle : MergeableMessage
-
Represents the ability to consolidate two messages into a single message.
After merging with another message, only
See moreself
will be delivered. (other
will be discarded.)Declaration
Swift
public protocol MergeableMessage
-
Represents the per-vertex communication abstraction for vertex-parallel algorithms.
Vertex-parallel algorithms execute as a series of super-steps, where in each step, a vertex can (1) perform vertex-local computation, (2) receive messages from the previous step, and (3) send messages to any other vertex (that will be received in the next step).
As a simplification and performance optimization, we require that all messages can be merged, such verticies receive at most one message per step. Messages are merged in parallel, which reduces memory and bandwidth pressures. This does not cause a loss in generality of the algorithms that can be expressed, as it is trivial to write an “envelope” type that is an array of the underlying messages.
This abstraction is inspired by:
Pregel: A System for Large-Scale Graph Processing (2010) Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski
See moreDeclaration
Swift
public protocol MailboxProtocol
-
Represents the computation-wide communication abstraction for vertex-parallel algorithms.
See moreDeclaration
Swift
public protocol MailboxesProtocol
-
Mailboxes that allow communication without synchronization.
Note: messages are delivered only once.
See moreDeclaration
Swift
public class PerThreadMailboxes< Message: MergeableMessage, Graph: GraphProtocol >: MailboxesProtocol where Graph.VertexId: IdIndexable
-
A non-concurrent table-based mailbox implementation.
See moreDeclaration
Swift
public struct SequentialMailboxes< Message: MergeableMessage, Graph: GraphProtocol >: MailboxesProtocol where Graph.VertexId: IdIndexable


Brain Stimulator
Support Page Coming Soon.
To report a problem, give feedback, or send in ideas to improve this app, send an email to
<EMAIL_ADDRESS>.
Click
here
to go to my main page.


{% extends 'base_centered.html' %} {% load i18n %} {% comment %} This is very much a work in progress. See comments at https://github.com/stencila/hub/pull/552 {% endcomment %} {% block title %}{% trans "Open" %}{% endblock %} {% block layout_content %}


---
layout: default
title: Events
group: "navigation"
---
W3C WoT – Events
The Web of Things (WoT) groups meet during the W3C's annual Technical Plenary week and additional face-to-face meetings are scheduled by the participants that happen 2 times a year. Moreover, the work items are prototyped and tested in WoT IG PlugFests that are scheduled for the weekend or week before the face-to-face meetings.
Upcoming
Past
IEEE IIWOT 2023, January 11, 2023
W3C WoT Testfest, December 12-16, 2022
TPAC 2022 - September 12-16 2022
W3C WoT Testfest, June 6-10, 2022
Node.js Global Summit, May 18th, 2022
Sustainability Panel at the Advisory Committee Meeting, April 26th, 2022
The 5th Japanese CG Meeting on smart building use cases, April 22th, 2022
Plugfest/Testfest, March 14-18 2022
W3C Web of Things & ECHONET Lite Web API, March 11, 2022
ITU-T Webinar on WoT and Smart Cities, 3 February 2022 . Recording
The 2nd Japanese CG Kick-off Meeting, Jan 28th, 2022 10:00-11:30 (JST)
IEEE IIWOT 2022
IoT Tech Expo Europe 2021
more...
WoT at TPAC 2021
TPAC 2021 - October 18-29 2021
RIoT Summit September 9-10 2021
IoT Tech Expo September 29 2021
DIoT November 8-12 2021 (Cancelled)
Testfest - June 7-11 2021
Virtual F2F Meeting - June 21-July 2, 2021
Virtual F2F PlugFest - March 1-5, 2021 (joint plugfest with IETF hackathon)
Virtual F2F meeting - March 15-26, 2021
Virtual F2F meeting - October 2020
TPAC 2020


ACC Showcase
Home
(current)
Welcome to the ACC Showcase
Just press login when the button appears. No extension installed? Download
here
[NCAS LOGIN]


I love to design things,write code and make awesome products.
Android
Java,Python,C,C++,C#
html,javascript,css,jquery,bootstrap
opencv


5.5 Years of experience in Data Warehousing and Big Data technologies with experience in application development using Java and Python.
Highlights
- Designed and developed microservices using Spring Boot Framework.
- Created Real Time data streaming applications using Confluent Kafka and Spark.
- Worked on Big Data technologies like Hadoop(MapR), HBase, Solr, Sqoop, Hive and Spark.
- Experienced in data modelling for NoSQL and Relational database systems.
- Well versed with programming languages such as Java, Python and R.
- Familiar with programming Spark applications using pyspark and sparklyr.
- Skilled in using statistical methods including exploratory data analysis, regression analysis and cross-validation.
- Worked extensively on Data warehousing tools like Informatica PowerCenter, Golden Gate and very good exposure with database systems like Teradata and Oracle
- Experienced in creating interactive Shiny applications for dashboards and publishing visualizations.


Bookmark your crypto sites - Use those bookmarks and only those
Only send funds to trusted addresses - Double-check what address you're sending Nano (XRB) to. Look up the address at
www.nanode.co and check if there are bad reviews
Never trust any discord/slack/telegram/reddit message - Don't ever fall for messages that say you can get free XRB or that a hack occured
No where yet. Meanwhile, create pull requests


WWW Access Statistics for 2001
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
Close navigation window


DJ Chris Evans donates £6,000 to Shropshire hospital children's ward
by Lisa O'BrienDJ Chris Evans has donated £6,000 to the children’s ward at the trust running Shropshire's two main hospitals during a charity cash giveaway live on air.
The star gave out £250,000 to charities and nominees from The Sun’s Who Cares Wins health awards during his Virgin Radio Breakfast Show – which included porters Nick Evans and Ruth Lowe from the Princess Royal Hospital in Telford.
Nick and Ruth were crowned the winners of The Sun’s Ultimate Lifesaver award – and were invited to be part of the radio show.
They were live in the studio this week alongside celebrity guests James Martin, Beverly Knight and Sharleen Spiteri when they were presented with the cheque.
Nick said: “Ruth and I were sat with Chris Evans when we attended The Sun Who Cares Wins Awards. He invited us into the studio to see him and it really was an incredible experience and one that we both won’t forget.
“To also receive a cheque for £6,000 for our children’s ward was fantastic – the icing on the cake of this whole unbelievable experience. We can’t thank Chris enough.”
Nick and Ruth won the Ultimate Lifesaver award for helping to save the life of seven-week-old Logan Clifford.
Nick, 48, and Ruth, 47, sprang into action after Logan stopped breathing when his parents, Sarah and Mike were visiting a relative at the PRH – which is run by Shrewsbury and Telford Hospital NHS Trust.
Sarah’s screams alerted Ruth, who shouted for Nick.
He grabbed Logan and performed CPR as he ran down the corridor to A&E.
Nick continued CPR until the resuscitation team at PRH took over – and the porters stayed by Logan’s parents’ side until they knew he was going to be okay.
Jennie Probert, children’s ward manager at SaTH, said: “This is wonderful news for the children’s ward and we are so grateful to Chris for this fantastic donation. What Nick and Ruth did was amazing – they are true heroes – and we would like to thank them too.”
Chris Evans is a supporter of The Sun’s health awards, and was so touched by the incredible stories at this year’s event, he has decided to give away some of the profits from his CarFest events to those honoured – and the worthy causes they represent.
Nick was also the winner of SaTH’s VIP (Values in Practice) Award this year for patient experience.


August 21st, 2015
Still giggling over the best mistyped CSS declaration ever, shared by @LotteJackson…
display: bolock;
Anyone else ever done that?
Making @LotteJackson read @SlightlyLate’s newest post after she spent ages trying to fix a problem caused by a missing vendor prefix hyphen.
CSS element() function - Vincent De Oliveira
Fire up Firefox and try out these demos: the CSS element
value is pretty impressive (although there are currently some serious performance issues).
To put it simply, this function renders any part of a website as a live image. A. Live. Image!
How to fix a bad user interface - Scott Hurff
A lesson on the importance of handling each state of an interface:
- the blank state,
- the loading state,
- the partial state,
- the error state,
- and the ideal state
…instead of just focusing on that last one.
Crafting A Bridge Between Storytelling & UX Design
I kind of want to link to every one of John’s post chronicling his 90 days at Clearleft, but this one is particular good, I think: how narrative ideas from the world of storytelling can help unlock some design problems.
August 20th, 2015
Locking the Web Open: A Call for a Distributed Web | Brewster Kahle’s Blog
I like a lot of Brewster Kahle’s ideas here for a more distributed peer-to-peer architecture for the web, but I’m very wary of relying on JavaScript: I’d much prefer a simpler declarative format.
How future-safe are your ideas?
Will the Big Think piece you just posted to Medium be there in 2035? That may sound like it’s very far off in the future, and who could possibly care, but if there’s any value to your writing, you should care. Having good records is how knowledge builds.
CSS counter property By Charlotte Jackson
This is nifty little piece of CSS for numbering nested lists. I don’t think I’ve come across the counter
value or the counter-reset
and counter-increment
properties before (or if I did, I’ve completely forgotten about it).
dConstruct 2015 podcast: Carla Diana
The dConstruct podcast episodes are coming thick and fast. The latest episode is a thoroughly enjoyable natter I had with the brilliant Carla Diana.
We talk about robots, smart objects, prototyping, 3D printing, and the world of teaching design.
Remember, you can subscribe to the podcast feed in any podcast software you like, or if iTunes is your thing, you can also subscribe directly in iTunes.
And don’t forget to use the discount code ‘ansible’ when you’re buying your dConstruct ticket …because you are coming to dConstruct, right?
The Hamburger Menu Doesn’t Work - Deep Design
Building on Luke’s research, James outlines the problems with hiding navigation behind a hamburger icon. So, to be clear, the problem isn’t with the icon, so much as the way it is used as a cupboard to shovel all our messy navigation issues into.
Confidence and Overwhelm
Following on from her great conversation with Jen on The Web Ahead podcast, Rachel outlines a strategy to avoid feeling overwhelmed by the deluge of tools, frameworks, libraries, and techniques inundating front-end developers every day:
Learn your core skills well. Understand HTML and CSS, be able to build a layout without leaning on a framework. Get a solid understanding of how a website actually gets from the server to a browser, an understanding of security and accessibility. These are the basics, the constants. These things change slowly. These things sit underneath all the complexity and the tooling, the CMSs and the noise of thousands of people all trying to make their mark on this industry.
She also makes this important point:
As you are doing this don’t forget to share what you know.
August 19th, 2015
24 years ago today…
https://groups.google.com/forum/#!topic/comp.sys.next.announce/avWAjISncfw
Happy anniversary, @TimBerners_Lee!
Thinking it’s high time we had another Paper Camp. The first one was fun.
Cameron’s World
A wonderful collection of treasures excavated from GeoCities. Explore, enjoy, and remember what a crime it is that Yahoo wiped out so much creativity and expression.
“What colour is teal?”
“Like the duck.”
“That’s green!”
“No, a different duck.”
August 18th, 2015
Growing your business
I enjoyed chatting with Marcus and Paul on the Boagworld podcast …mostly because I managed to avoid the topic at hand by discussing sci-fi for half an hour before we settled to the boring stuff about work, business, and all that guff.


Table of Contents
Runge-Kutta methods
-
What?
-
- Why?
- The Taylor methods outlined in the previous section have the desirable property of highorder local truncation error, but the disadvantage of requiring the computation and evaluation of the derivatives of \(f(t, y)\). This is a complicated and time-consuming procedure for most problems, so the Taylor methods are seldom used in practice.
-
The Runge-Kutta methods have the high-order local truncation error of the Taylor methods but eliminate the need to compute and evaluate the derivatives of \(f(t, y)\)
- Taylor’s Theorem [2-variables]:
Runge-Kutta Methods of Order Two
-
What? \
- Midpoint Method:
- 2nd order:
- Higher order:
The fact that (5.21) has four parameters, however, gives a flexibility in their choice, so a number of \(O(h^2)\) methods can be derived.
- 2nd order:
- Modified Euler Method:
One of the most important is the Modified Euler method, which corresponds to choosing \(a_1 = a_2 = \dfrac{1}{2}\) and \(\alpha_2 = \delta_2 = h\). It has the following difference-equation form:
- Error Order:
The order of error for this new method is the same as that of the Taylor method of order two.
Higher-Order Runge-Kutta Methods
- What? The term \(T^{(3)}(t, y)\) can be approximated with error \(O(h^3)\) by an expression of the form \(f(t + \alpha_1, y + \delta_1 f(t + \alpha_2, y + \delta_2 f(t, y)))\), involving four parameters, the algebra involved in the determination of \(\alpha_1, \delta_1, \alpha_2,\) and \(\delta_2\) is quite involved.
-
Heun’s method:
- Local Truncation Error: \(\mathcal{O}(h^3)\).
- Runge-Kutta Order Four:
- Local Truncation Error: \(\mathcal{O}(h^4)\).
Provided the solution \(y(t)\) has five continuous derivatives.
- Algorithm:
- Local Truncation Error: \(\mathcal{O}(h^4)\).
Computational Comparisons
-
- What is Compuatation Heavy?
- The main computational effort in applying the Runge-Kutta methods is the evaluation of \(f\).
- Function Evaluations:
-
Second Order: 2 function evaluations per step Error of order \(\mathcal{O}(h^2)\). -
Fourth Order: 4 function evaluations per step Error of order \(\mathcal{O}(h^4)\).
-
- Relationship between number of evaluations and order of truncation error:
This indicates why the methods of order less than five with smaller step size are used in preference to the higher-order methods using a larger step size.
This is because..
-
Comparing lower-order Runge-Kutta Methods:
The Runge-Kutta method of order four requires four evaluations per step, whereas Euler’s method requires only one evaluation. Hence if the Runge-Kutta method of order four is to be superior it should give more accurate answers than Euler’s method with one-fourth the step size. Similarly, if the Runge-Kutta method of order four is to be superior to the second-order Runge-Kutta methods, which require two evaluations per step, it should give more accuracy with step size h than a second-order method with step size h/2.This indeed holds true.


We're sorry but frontend doesn't work properly without JavaScript enabled. Please enable it to continue.


They don't make sense because any concrete child class will have to implement the abstract method anyway.
Methods with different return types, exception declarations, annotations or modifiers than the method they override are not reported by this inspection.
Use the checkbox below to ignore any abstract methods that have a different JavaDoc comment than their super method.


Get to Know More
Taste US, Feel Us, Experience Us...The Pizza Inn Way!
Order Now
Place your Order.
1. Select Size
Small
Medium
Large
Next
2. Select crust type
Crispy
Stuffed
Chilly-Pepper
Next
3. Select toppings.
Please select topping of your choice.
Extra Cheese
Bacon
Onions
Pepperoni
Mushrooms
Pineapples
Olives
Sausage
Complete
4. Checkout
#
Size
Crust
Toppings.
Total
Checkout
Continue Shopping
Provide address for home delivery
Cancel
Your order is on transit...


{% extends 'swapi_info/base.html' %} {% block content %}
People
Planets
Species
Starships
Vehicles
Films


wordcloud2.js
Demo
Code
README
API
timdream
wordcloud2.js
, tag cloud/Wordle presentation on HTML5 canvas element
Your browser is not supported.
Run
Save
......
Examples
Love of the world
Web Technologies
The quick brown fox
Les Misérables
紅樓夢
List
Configuration
Dimension
Web Font
Options as a literal Javascript object
See
API
document for available options.
Width
px
Leave blank to use page width.
Height
px
Leave blank to use 0.65x of the width.
Device pixel density (
dppx
)
x
Adjust the weight, grid size, and canvas pixel size for high pixel density displays.
Extra Web Font CSS
Find your favorite font on
Google Web Fonts
. Re-run if the font didn't load in time.


{% extends 'core/base.html' %} {% load static %} {% block head_other %} {% endblock %} {% block content %}
An export plan is a business plan for selling internationally. It should detail the decisions you’ve made based on your market research, your objectives and how you plan to achieve them.
Your export plan is a great tool to show banks, investors or partners that you’re serious and have realistic and achievable goals.
A well structured plan will help you:
Put an export plan in place for your business
{% if request.user.is_authenticated %}Create a new plan{% else %}Create a free plan {% endif %}


Check window.opener to determine if we came from a new tab
Try window.close; redirect to URL if timeout
Do a window.close and nothing else.


Download and copy-paste the stylesheet link tag into your head tag before all other stylesheets to load our CSS.
<link rel="stylesheet" href="rc-layout/dist/rc-layout.css">
$gutter: 30px;
$screen-lg: 1200px;
@import "rc-layout/src/layout";
This is container
This is container
This is container-fluid
This is container-fluid
one
two
three
one
two
three
one
two
three
one
two
three
one
two
three
one
two
three
one
two-one
two-two
two-three
three
one
two-one
two-two
two-three
three
one
two
three
one
two
three