C++ API memory management definitions.
More...
|
| namespace | std |
| | Standard std namespace.
|
| |
|
| class | os::rtos::memory::allocator_deleter< A > |
| | Allocator deleter. More...
|
| |
| class | os::rtos::memory::allocator_stateless_default_resource< T > |
| | Standard allocator based on the RTOS system default memory manager. More...
|
| |
| class | os::rtos::memory::allocator_stateless_polymorphic_synchronized< T, L, get_resource > |
| | Allocator using memory resources. More...
|
| |
| class | os::memory::block_pool |
| | Memory resource managing a pool of same size blocks, using an existing arena. More...
|
| |
| class | os::memory::block_pool_typed_allocated< T, A > |
| | Memory resource managing a dynamically allocated pool. of same size blocks of type T. More...
|
| |
| class | os::memory::block_pool_typed_inclusive< T, N > |
| | Memory resource managing an internal pool. of same size blocks of type T. More...
|
| |
| class | os::memory::first_fit_top |
| | Memory resource implementing the first fit, top-down allocation policies, using an existing arena. More...
|
| |
| class | os::memory::first_fit_top_allocated< A > |
| | Memory resource implementing the first fit, top-down allocation policies, using a dynamically allocated arena. More...
|
| |
| class | os::memory::first_fit_top_inclusive< N > |
| | Memory resource implementing the first fit, top-down allocation policies, using an internal arena. More...
|
| |
| class | os::memory::lifo |
| | Memory resource implementing the LIFO allocation/deallocation policies, using an existing arena. More...
|
| |
| class | os::memory::lifo_allocated< A > |
| | Memory resource implementing the LIFO allocation policies, using a dynamically allocated arena. More...
|
| |
| class | os::memory::lifo_inclusive< N > |
| | Memory resource implementing the LIFO allocation policies, using an internal arena. More...
|
| |
| class | os::memory::malloc_memory_resource |
| | A memory manager that allocates memory via the system std::malloc() and deallocates via std::free() . More...
|
| |
| class | os::rtos::memory::memory_resource |
| | Memory resource manager (abstract class). More...
|
| |
| class | os::memory::new_delete_memory_resource |
| | A memory manager that allocates memory via the system operator new and deallocates via operator delete . More...
|
| |
| class | os::memory::null_memory_resource |
| | An internal memory manager that throws a bad_alloc() exception when trying to allocate. More...
|
| |
|
| template<typename T , typename A , typename ... Args> |
| auto | os::rtos::memory::allocate_unique (const A &allocator, Args &&... args) |
| | Function template to allocate a unique pointer.
|
| |
| new_handler | std::get_new_handler () noexcept |
| | Get the current handler.
|
| |
| template<typename T , typename ... Args> |
| std::enable_if<!std::is_array< T >::value, std::shared_ptr< T > >::type | os::rtos::make_shared (Args &&... args) |
| | Create an object that is owned by a shared_ptr and is allocated using the RTOS system allocator.
|
| |
| template<typename T1 , typename T2 , typename L , F get_resource> |
| bool | os::rtos::memory::operator!= (const allocator_stateless_polymorphic_synchronized< T1, L, get_resource > &lhs, const allocator_stateless_polymorphic_synchronized< T2, L, get_resource > &rhs) noexcept |
| |
| template<typename T1 , typename T2 , typename L , F get_resource> |
| bool | os::rtos::memory::operator== (const allocator_stateless_polymorphic_synchronized< T1, L, get_resource > &lhs, const allocator_stateless_polymorphic_synchronized< T2, L, get_resource > &rhs) noexcept |
| |
| new_handler | std::set_new_handler (new_handler handler) noexcept |
| | Establishes the function designated by handler as the current new_handler .
|
| |
|
| void * | operator new (std::size_t bytes) |
| | Allocate space for a new object instance.
|
| |
C++ API memory management definitions.
The µOS++ RTOS includes several advanced and flexible memory management features.
First, it defines a configurable memory manager for the application free store (also known as the "heap").
Second, it defines a separate memory manager to be used by the RTOS system objects. This separate manager can be configured to use any allocation policy. It may use either a statically or a dynamically allocated area.
The reason for the system memory manager is to allow RTOS system objects to be separated from application objects; this has several advantages:
- it helps to protect the system objects from application bugs; this is beneficial during debug and it can improve reliability in the field.
- it helps improve system performances, by allowing to locate the system objects on a fast, on-chip RAM, in case the platform has multiple RAM regions with different performances.
Third, system objects that require dynamic memory may be created with custom allocators, defined by the user.
Access to the application memory manager is done using the standard functions:
malloc()
/free()
in C (thread safe)
std::malloc()
/std::free()
in C++ (thread safe)
new
/delete
in C++ (thread safe)
The default application memory manager is set in the os_startup_initialize_free_store()
function, called by the startup code when running on bare metal.
On synthetic POSIX platforms the default memory manager is os::memory::malloc_memory_resource
, which uses memory from the system free store.
By default the RTOS system memory manager is the same as the application memory manager, but, for isolation reasons, it is recommended to define a separate memory mananger for the RTOS system objects.
The basic memory management class is os::rtos::memory::memory_resource
, which will be standard starting with C++17. The µOS++ version of this class includes several extensions, like out of memory processing and statistics (and this is the reason the class is not defined in os::estd
).
◆ allocator
Type of allocator used by the system objects. Must be stateless.
- Template Parameters
-
| T | Type of elements to be allocated. |
Definition at line 54 of file os-types.h.
◆ allocator_typed
template<typename T , typename U = T>
Type of an allocator for objects of type T.
- Template Parameters
-
The allocator uses scheduler critical sections to be thread safe, and the default memory resource associated with the given type.
Definition at line 1073 of file os-memory.h.
◆ out_of_memory_handler_t
Type of out of memory handler.
Definition at line 142 of file os-memory.h.
◆ unique_ptr
template<typename T , typename U = T>
Type of a RTOS unique pointer to objects of type T.
- Template Parameters
-
The type is based on the standard unique pointer, but with the specific RTOS deleter.
Definition at line 1084 of file os-memory.h.
◆ allocate_unique()
template<typename T , typename A , typename ... Args>
| auto os::rtos::memory::allocate_unique |
( |
const A & |
allocator, |
|
|
Args &&... |
args |
|
) |
| |
Function template to allocate a unique pointer.
- Template Parameters
-
| T | Type of object to be allocated. |
| A | Allocator type. |
| Args | Variable arguments list. |
- Parameters
-
| allocator | Reference to allocator. |
| args | Arguments used to construct the object of type T. |
- Returns
- A standard unique pointer with deleter.
◆ get_default_resource() [1/2]
Get the default application memory manager.
- Parameters
- None.
- Returns
- Pointer to a memory manager object instance.
If not set explicitly by the user, this function will return an instance of malloc_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 184 of file memory_resource.
◆ get_default_resource() [2/2]
Get the default RTOS system memory manager.
- Parameters
- None.
- Returns
- Pointer to a memory manager object instance.
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1133 of file os-memory.h.
◆ get_new_handler()
| new_handler std::get_new_handler |
( |
| ) |
|
|
noexcept |
Get the current handler.
- Parameters
- None.
- Returns
- Pointer to user function, or
nullptr
if not set.
The initial new_handler
is a null pointer.
Definition at line 108 of file new.cpp.
◆ get_resource_typed()
Function template to get a memory resource.
- Returns
- Pointer to current memory resource.
◆ get_resource_typed< condition_variable >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1162 of file os-memory.h.
◆ get_resource_typed< event_flags >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1177 of file os-memory.h.
◆ get_resource_typed< memory_pool >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1192 of file os-memory.h.
◆ get_resource_typed< message_queue >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1207 of file os-memory.h.
◆ get_resource_typed< mutex >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1222 of file os-memory.h.
◆ get_resource_typed< semaphore >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1237 of file os-memory.h.
◆ get_resource_typed< thread >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1147 of file os-memory.h.
◆ get_resource_typed< timer >()
If not set explicitly by the user, this function will return an instance of null_memory_resource
on bare metal platforms and of malloc_memory_resource
on POSIX platforms.
Definition at line 1252 of file os-memory.h.
◆ init_once_default_resource()
| void os::rtos::memory::init_once_default_resource |
( |
void |
| ) |
|
◆ make_shared()
template<typename T , typename ... Args>
| std::enable_if<!std::is_array< T >::value, std::shared_ptr< T > >::type os::rtos::make_shared |
( |
Args &&... |
args | ) |
|
|
inline |
Create an object that is owned by a shared_ptr
and is allocated using the RTOS system allocator.
- Parameters
-
| args | Arguments for the T object's constructor. |
- Returns
- A shared_ptr that owns the newly created object.
- Exceptions
-
| * | An exception may be thrown from allocate() or from the constructor of T. |
Definition at line 176 of file os.h.
◆ malloc_resource()
Get the address of a memory manager based on POSIX malloc()
.
- Parameters
- None.
- Returns
- Pointer to a memory manager object instance.
- See also
- malloc_memory_resource
Definition at line 189 of file os-memory.cpp.
◆ new_delete_resource()
Get the address of a memory manager based on new/delete
.
- Parameters
- None.
- Returns
- Pointer to a memory manager object instance.
◆ null_memory_resource()
Get the address of an ineffective memory manager.
- Parameters
- None.
- Returns
- Pointer to a memory manager object instance.
◆ operator new()
| void * operator new |
( |
std::size_t |
bytes | ) |
|
Allocate space for a new object instance.
- Parameters
-
| bytes | Number of bytes to allocate. |
- Returns
- Pointer to allocated object.
The allocation function (<IP_ADDRESS>) called by a new-expression (5.3.4) to allocate a storage of size bytes suitably aligned to represent any object of that size.
Return a non-null pointer to suitably aligned storage (3.7.4), or else throw a bad-alloc
exception. This requirement is binding on a replacement version of this function.
- Note
- A C++ program may define a function with this function signature that displaces the default version defined by the C++ standard library.
- Warning
- Cannot be invoked from Interrupt Service Routines.
Definition at line 143 of file new.cpp.
◆ operator!=() [1/2]
template<typename T1 , typename T2 , typename L , F get_resource>
◆ operator!=() [2/2]
Compare the memory_resource
instances for inequality.
- Parameters
-
| lhs | First instance to compare. |
| rhs | Second instance to compare. |
- Return values
-
Definition at line 1468 of file os-memory.h.
◆ operator==() [1/2]
template<typename T1 , typename T2 , typename L , F get_resource>
◆ operator==() [2/2]
Compare the memory_resource
instances for equality.
- Parameters
-
| lhs | First instance to compare. |
| rhs | Second instance to compare. |
- Return values
-
Definition at line 1462 of file os-memory.h.
◆ set_default_resource() [1/2]
Set the default application memory manager.
- Parameters
-
| res | Pointer to new memory manager object instance. |
- Returns
- Pointer to previous memory manager object instance.
Definition at line 58 of file memory-resource.cpp.
◆ set_default_resource() [2/2]
Set the default RTOS system memory manager.
- Parameters
-
| res | Pointer to new memory manager object instance. |
- Returns
- Pointer to previous memory manager object instance.
On bare metal applications, this function is called from os_startup_initialize_free_store()
, during the system startup, with a memory manager handling the free RAM.
- Warning
- This function is not thread safe.
Definition at line 206 of file os-memory.cpp.
◆ set_new_handler()
| new_handler std::set_new_handler |
( |
new_handler |
handler | ) |
|
|
noexcept |
Establishes the function designated by handler as the current new_handler
.
- Parameters
-
| handler | Pointer to user function. |
- Returns
- The previous handler.
This handler is invoked when the standard operator new() detect an out of memory condition, to give a chance to the application process it properly. If the application can arrange for more memory to be used for allocation, this function should return and the allocation process is retried. If not, this function should gracefully shut down and restart.
The initial new_handler
is a null pointer.
Definition at line 86 of file new.cpp.
◆ set_resource_typed()
Function template to set a memory resource.
- Parameters
-
| res | Pointer to memory resource. |
- Returns
- Pointer to previous memory resource.
◆ set_resource_typed< condition_variable >()
◆ set_resource_typed< event_flags >()
◆ set_resource_typed< memory_pool >()
◆ set_resource_typed< message_queue >()
◆ set_resource_typed< mutex >()
◆ set_resource_typed< semaphore >()
◆ set_resource_typed< thread >()
◆ set_resource_typed< timer >()
◆ new_handler_
| std::new_handler anonymous_namespace{new.cpp}::new_handler_ |
The current new handler.
The initial new_handler
is a null pointer, initialised as part of the .bss section.
Definition at line 54 of file new.cpp.
◆ nothrow
| const nothrow_t std::nothrow |
Initial value:
Definition at line 66 of file new.cpp.


My First Website
An HTML Playground
Welcome to Page 3! This is a paragraph with a tooltip.
Weekdays
Monday
Tuesday
Wednesday
Thursday
Friday
Link to Page 1 of this Site.
Link to Google.


How to rename files
Most of the files in the file tree can be renamed. For this, right-click on the item that you want to rename and select
Rename...
from the popup menu as follows;


Community Contributions to Materials Project
MPContribs enables materials researchers to contribute experimental and
theoretical materials data to Materials
Project (MP). Data on MPContribs is collectively maintained as annotations
to existing MP materials and automatically exposed to over 130,000 MP users.
MPContribs disseminates contributions as preview cards on MP's materials
details pages, in form of domain-specific interactive landing pages on this
portal, and programmatically through its RESTful API. See the
documentation for more info.


221
days until
Family Vacation
Recent site activity
-
Home
edited by Some User
-
Calendar
edited by Some User
-
Personal Page
edited by Some User
-
Home
edited by Some User
-
Important Documents
edited by Some User
- View All
Home
Note: This template is meant to be a nonpublic site.
| Project List Owner | Description | Complete |
|---|---|---|
| Dad | Fix Bathroom Sink | |
| Mom | Clean out the garage | |
| Kids | Clean their rooms | |
| Showing 3 items from page My Project List sorted by time. View more » |
| Important numbers | Owner |
|---|---|
|<PHONE_NUMBER> | Police department |
|<PHONE_NUMBER> | Fire department |
|<PHONE_NUMBER> | Poison control |
| 30309 | Hospital |
|<PHONE_NUMBER> | Water company |
| (404) 574-811 | Doctor |
|<PHONE_NUMBER> | Power company |
|<PHONE_NUMBER> | Local EMS |
| Showing 8 items from page Files sorted by time. View more » |
Tip: How to replace this calendar
| Sun | Mon | Tue | Wed | Thu | Fri | Sat |
|---|---|---|---|---|---|---|
|
28
|
1
|
2
|
3
|
4
|
5
|
6
|
|
7
|
8
|
9
|
10
|
11
|
12
|
13
|
|
14
|
15
|
16
|
17
|
18
|
19
|
20
|
|
21
|
22
|
23
|
24
|
25
|
26
|
27
|
|
28
|
29
|
30
|
31
|
1
|
2
|
3
|


Stories
Engineering opportunities
Senior engineering students create design projects to address real-world problems—some with sponsorships from high-profile companies
Imagine a robot that travels on the ceiling and helps you out around the house. Try to picture an autonomous, mechanized lifeguard that waits in the water, kicking into high gear when someone starts drowning.
These may sound like props in the latest J. J. Abrams movie, but engineering students at UC Santa Cruz have turned their collaborations with industry professionals into essential projects that address real-world concerns ranging from climate change and public safety to the secrets of extraterrestrial soil.
High-profile Silicon Valley companies are sponsoring 11 senior projects this year in the hopes of providing students with immersive "real world" industry experience while giving self-motivated Banana Slugs a toehold in the highly competitive tech world.
Industry leaders including Google, Netflix, Xilinx, and Oracle meet with students each week to check on their progress and offer tools to help them succeed.
For engineering seniors, the design project is a transition from being a Banana Slug to a contributing member of a team in a career in industry or research.
Carol Owens (Crown College) is team leader on a project sponsored by Google to build a mobile environmental sensing system that plots field-recorded data on Google Maps.
It's her first time working in a group, and she's learning about the challenges of reaching a consensus. She says she was drawn to the project because of its potential to help in the real world.
"It has a positive impact on the environment by helping environmental scientists gather data and raising public awareness about pollutants and greenhouse gases," said Owens.
Finding the right project for students involves a little "matchmaking," said Patrick Mantey, who directs UCSC's Center for Information Technology and Research in the Interest of Society (CITRIS) and is associate dean of industry programs and Baskin Professor of Computer Engineering. Some students decide to delve into venture capitalism and pursue challenges that are not funded by corporate sponsors.
A team of six seniors fronted $3,000 of their own money to enter the NASA Centennial Challenge, which helps NASA advance its use of technology through the use of prize competitions.
Geoffrey Budd (College Ten) and his colleagues are competing with 13 other teams from around the world to build a robot that can locate and retrieve extraterrestrial samples.
"If we are successful, not only will we have learned a great deal about autonomous robot navigation and construction, but we will also have brought a significant amount of attention to UCSC's new robotics engineering major," Budd said.
Budd and the rest of the team were notified in March that the cost of materials for the project will be funded by the UC Santa Cruz Foundation.
Students who are building a robotic lifeguard are also willing to fund their own project.
The lifeguard robot the team is building will be able to travel faster than a human lifeguard's average swim speed.
"Coming from a beach town, we realized the need for safety," said team leader Darrel Deo (Crown College). "Our lifeguard will not suffer from fatigue."
Ethan Papp (Crown College, '12) led a team last year that built a prototype for a glass microphone. He's back this year as a teaching assistant for the corporate senior design courses. He said he learned about professionalism and high expectations during last year's project.
"We were expected to produce nothing short of excellent quality work because it would be showcased and shared with a representative from Corning Incorporated, which was sponsoring our project," he said.
Last year's corporate sponsors hired many of last year's crew of engineering students. The high-profile companies know that UCSC engineering students are learning about the values of hard work and collaboration, said Mantey.
"The partnerships with industry, and the participation of the industry engineers in guiding their projects, give our students the opportunity to understand how to work in the real world," said Mantey.
In good company
2013 senior engineering design corporate sponsors:
- Applied Materials
- Dell KACE
- eBay
- Echelon
- Netflix
- Oracle
- Raytheon
- Xilinx
- Yaskawa


A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
hyperDEX08-Aug-19 02:25 PM
We will go down, up or sideways
Just need a 50BTC buy wall of old
siu - Chainmakers08-Aug-19 02:45 PM
KMD might have found a bottom, finally
Ending Diagonal might be in play
Flint08-Aug-19 02:47 PM
even a whale is not needed, but enough that in China there is a flash mob for the purchase of 1 komodo and we fly to the moon with a billion capitalization
@siu - Chainmakers do we have resistance within this channel?
siu - Chainmakers08-Aug-19 02:50 PM
that is is not a channel in my chart
is a ED formation
once it breaks the above line it should bounce hard.
Need confirmation tho
Flint08-Aug-19 02:51 PM
what about low trading volumes?
siu - Chainmakers08-Aug-19 02:51 PM
but bullish divergence in daily RSI and diminishing volume on all this move down seems to indicate that a bottom will be found soon
Markus08-Aug-19 02:51 PM
Flint rly
ur still not understanding?
we talked about alts and kmd pretty much whole day yesterday and u ask about volume when it should be obvious at this point
Flint08-Aug-19 02:52 PM
paired with bitcoin, its time to find the bottom! but in a pair to the dollar we can still fall
I'm sorry, but I probably missed something
Markus08-Aug-19 02:54 PM
so is kmd only alt dumping?
what u think Flint
Flint08-Aug-19 02:55 PM
I simply do not stop being confused by these low trading volumes without good green candles from a minimum of local
Markus08-Aug-19 02:56 PM
there is no interest in alt coins so ofc it result in low volume and pretty much everyone selling will dump price cause theres nobody buying when everyone focus on bitcoin
thats how the market work and have been working for a while
first btc then alts when whales see bigger opportunity in alts
Flint08-Aug-19 02:57 PM
its all the damn bitcoin dominance. need a certain bitcoin movement so that traders stop taking money from komodo for the sake of bitcoin
dan.08-Aug-19 02:58 PM
@hyperDEX i know a lady who will do it
is that a for real bounty?
Tek08-Aug-19 03:00 PM
if i stay longer at work shitposting
Flint08-Aug-19 03:00 PM
@Markus yes you are absolutely right but there is definitely a group of traders who are waiting for a certain price good for themselves on komodo maybe 68k satoshi maybe another price - after all, we have already seen a powerful upward movement after local lows
Tek08-Aug-19 03:00 PM
I can go home earlier tomorrow
stay an half hour longer shitposting on company time?
Markus08-Aug-19 03:01 PM
30 min is nothing
Tek08-Aug-19 03:01 PM
but the sun is shinin yo i want to fug off outta here
Flint08-Aug-19 03:04 PM
but the current small price rebound inspires confidence that if we have not yet found the absolute bottom, then next to it - in any case, we also dont see large volumes for sales, and this is good when sales volumes do not exceed purchases several times — but buyers so far careful - maybe the whale is sitting and waiting for its reasonable price, which is close to the current one but still higher, otherwise we would have already seen a powerful pump
dan.08-Aug-19 03:05 PM
@hyperDEX if you're serious DM me, I know a gorgeous lady. If not that's ok
Flint08-Aug-19 03:06 PM
would gain a foothold above $ 1 and then at least the bottom had decided that we wont go lower but for now fortune-telling on coffee grounds
dxer66608-Aug-19 03:45 PM
1 sat is bottom
Markus08-Aug-19 04:12 PM
There is always this one person
Oszy08-Aug-19 04:16 PM
1 sat is not the end, the end is when there is no buy order at 1 sat
1
phm8708-Aug-19 04:28 PM
Some exchanges have price precision of 0.01 sat. And if there is no buyers at all, the "buy price" can be 0. For other coins, I saw one buyer at 1 sat : maybe he wanted to buy all of these coins
Oszy08-Aug-19 04:42 PM
oh yes there is 0
bitconneect
Cryptoon08-Aug-19 04:52 PM
bcash requires 20 confirmations ffs
Thought that was 5 confs only for CEX as well
PHBA206108-Aug-19 04:59 PM
probably cex & payment service providers have different requirements
phm8708-Aug-19 05:16 PM
@Oszy BCC scam/ponzi have a price on cmc and on coinpaprika but hopefully I found no exchange. I have no clues where these prices are coming from
https://coinpaprika.com/coin/bcc-bitconnect/
Warning for noobs: bcc is a well known ponzi (with jail maybe for its creators), do not buy that shit
BitConnect Price Chart | Market Capitalization | BCC to USD Calculator | BCC ROI Calculator | News | Description | Team | Related Events | Community | Similar coins to BitConnect BCC


Hacklab Cosenza / Centro di Ricerca su Tecnologia e Innovazione
EIGRP was released in 1992 by Cisco and until 2013 has only been available on Cisco devices.
In 2013 Cisco released an informational RFC to IETF covering basic functionality, thus making EIGRP an open standard able to interoperate with non-Cisco devices. Advanced features of EIGRP remain Cisco-only.
EIGRP is at the core a distance-vector routing protocol, because it learns information about the topology only from directly connected EIGRP routers, but it also borrow features typical of a link-state routing protocol.
EIGRP is network-layer agnostic: it’s able to perform a routing function for really any L3 protocol, even future ones, thanks to protocol-dependent modules (PDMs).
PDMs "translate" the L3 protocol to the DUAL algo and to store the results of DUAL into tables specific to the L3 protocol. It works as an abstraction layer for:
The consequences of being L3-agnostic is that EIGRP cannot use TCP and UDP, which are specific to IPv4/6.
EIGRP uses its own transport protocol, the Reliable Transport Protocol. It obviously supports reliable delivery (requiring ACKs, similar to TCP), but it also does unrealiable delivery with no acknowledge requirements.
RTP supports both unicast and multicast for sending EIGRP packets. Multicast addresses for EIGRP are <IP_ADDRESS> (IPv4) and FF02::A (IPv6).
EIGRP supports MD5 authentication of routing packets as RIP and OSPF, but doesn’t encrypt them.
IPv4/6 encapsulation uses 88 in Protocol/Next Header fields.
Used to discover EIGRP neighbors and establish and maintain adjacencies with them. They are sent:
An established adjacencies is considered broken when no Hello packet has been received for an Hold timer. Default is 3x the Hello timer (15s on broadcast, 180s on NBMA).
After that, the routes through that neighbor are no longer viable to EIGRP, that starts to search for a new path by sending query packets.
EIGRP routing informations are propagated through its Update packets.
They are not periodic, but instead only sent incrementally (partial) and only to the affected EIGRP-neighbors (bounded). The net effect is a huge bandwidth saving achievable with EIGRP.
When required by a single router, they are sent as unicast, otherwise as multicast (on supported networks). In any case they use reliable delivery so acknowledge is required.
Required any time reliable delivery is used.
EIGRP Acknowledge packets have the form of an Hello packet without any data. They are obviously sent with unreliable RTP, otherwise they would cause a loop of ACKs.
Queries and Replies are used by EIGRP and DUAL when searching information in other neighbors.
Both use reliable delivery. Queries are sent as multicast, while Replies as unicast.
Replies have to be sent even for negative answers, that is when a neighbor doesn’t have the required information.
An EIGRP router send queries even for a network previously attached to it that it is now down, because there’s always the possibility of another path in the topology.
EIGRP data field is called TLV (Type, Length and Value). There are many, but CCNA focuses on 3 of them. Regardless of the TLV, the same EIGRP packet header is used.
The important field in the EIGRP header are the OpCode and the Autonomous System Number.
The EIGRP Parameter’s TLV (also known as General TLV, Type 0x0001) includes:
The IP Internal Route TLV (Type 0x0002) is used to advertise EIGRP routes in the autonomous system. It includes:
The IP External Route TLV (Type 0x0003) is a message for importing external routes into EIGRP, such as a default static route.
EIGRP’s autonomous system numbers are unrelated to the AS numbers assigned by IANA.
To enter EIGRP configuration mode, use
Router(config)# router eigrp [autonomous_system]
The AS number ranges between 1-65535. It has to be the same within the desidered EIGRP routing domain.
This command doesn’t start the EIGRP process, but only enters the configuration mode. The no
version of this command stops the process and delete all existing config.
Everything is the same as with OSPF:
Router(config)# eigrp router-id [id]
show ip protocols
command.Router(config-router)# eigrp router-id <IP_ADDRESS>
Router(config-router)# end
Router# show ip protocols
*** IP Routing is NSF aware ***
Routing Protocol is "eigrp 1"
[output omitted]
EIGRP-IPv4 Protocol for AS(1)
Metric weight K1=1, K2=0, K3=1, K4=0, K5=0
NSF-aware route hold timer is 240
Router-ID: <IP_ADDRESS>
Topology : 0 (base)
Active Timer: 3 min
Distance: internal 90 external 170
[output omitted]
The network
command works just as in any IGP routing protocol and has the same effects:
There are 2 versions of the network command:
network {classful_addr}
enables interfaces and announces subnets of that classful address.network {network_addr} [wildcard]
enables a specific subnet and the interface belonging in that subnet.EIGRP also allows for passive interfaces, when we want to announce a subnet but sending routing updates would be useless (because there are no neighbors) or undesirable (because the other end of the link is not under our control).
!!! Specific interface !!!
Router(config-router)# passive-interface [if_id]
!!! Passive by default, then exceptions !!!
Router(config-router)# passive-interface default
Router(config-router)# no passive-interface [if_id]
Router(config-router)# end
Router# show ip protocols
*** IP Routing is NSF aware ***
Routing Protocol is "eigrp 1"
Outgoing update filter list for all interfaces is not set
Incoming update filter list for all interfaces is not set
Default networks flagged in outgoing updates
Default networks accepted from incoming updates
Redistributing: static
EIGRP-IPv4 Protocol for AS(1)
Metric weight K1=1, K2=0, K3=1, K4=0, K5=0
NSF-aware route hold timer is 240
Router-ID: <IP_ADDRESS>
Topology : 0 (base)
Active Timer: 3 min
Distance: internal 90 external 170
Maximum path: 4
Maximum hopcount 100
Maximum metric variance 1
Automatic Summarization: disabled
Maximum path: 4
Routing for Networks:
<IP_ADDRESS>
<IP_ADDRESS>/30
Passive Interface(s):
GigabitEthernet0/0
Routing Information Sources:
Gateway Distance Last Update
<IP_ADDRESS> 90 02:14:28
<IP_ADDRESS> 90 02:14:28
Distance: internal 90 external 170
Router#
The list of adjancencies established by an EIGRP router is stored in the neighbor table, which can be displayed with
Router#show ip eigrp neighbors
EIGRP-IPv4 neighbors for AS(1)
H Address Interface Hold Uptime SRTT RTO Q Seq
(sec) (ms) Cnt Num
1 <IP_ADDRESS> Fa0/0 11 00:06:06 19 200 0 27
0 <IP_ADDRESS> Se0/0/1 14 01:35:12 16 120 0 18
EIGRP is the preferred IGP routing protocol on Cisco devices. Its routes have an AD of 90 for internal routes and 170 for external ones (imported from non-EIGRP sources).
There is also an AD of 5 for EIGRP summary route. However, EIGRP autosummarization is disabled by default since IOS 15.0. On previous IOS version, it can be disabled with
Router(config-router)# no auto-summary
For 2 EIGRP-enabled routers to establish an adjancency, several parameters must match. Among them there are metric weights and AS number.
Hellos exchanges to establish adjacency goes as follows:
The content of EIGRP Update packets received from neighbors is included in routers’ topology table.
It is different from the routing table because it contains every route to every destination network learned by EIGRP, even the ones that won’t be installed in the RT. The exchange of routing information goes as follows:
EIGRP uses a composite metric: this means the cost of a path is the result of a formula that uses several combined parameters (weights).
For the composite metric to make sense, every EIGRP routers in the routing domain have to agree on the same weights to compute it. They do so with the K1, K2, K3, K4 and K5 parameters in the General TLV.
The general EIGRP composite metric formula is:
With the default weights, the general formula becomes
The K parameters can be altered with the command
Router(config-router)# metric weights {tos k1 k2 k3 k4 k5}
and verified with show ip protocols
. Nevertheless, modifying them is not advisable because normally not weighted parameters will result in frequent recalculation of the metric, and hence the topology table.
All of the metric parameters can be displayed with:
Router# show interfaces Fa0/1
FastEthernet0/1 is up, line protocol is up
[output omitted]
MTU 1500 bytes, BW 10000 Kbit, DLY 100000 usec, rely 255/255, load 1/255
[output omitted]
Bandwidth and delay are not measured dynamically, and are instead pre-determined values that can be tuned.
Router(config-if) bandwidth [kbps_value]
This is especially important for serial links, because a speed of T1 (1544 Kbps) is often the default.EIGRP uses both split horizon and hold-down timers (an interval after a network goes down in which the router will refuse routes to that network, to avoid potential instability) to avoid routing loops.
The main loop-avoiding mechanism in EIGRP is DUAL. When there is a topology change, DUAL make sure that affected router re-synchronize at the same time while excluding unaffected routers from the topology recomputation.
DUAL makes its decision about route recomputations with a workflow model known as DUAL Finite State Machine (FSM), which is made up of:
Router# show ip route
[omitted]
D <IP_ADDRESS>/24 [90/3012096] via <IP_ADDRESS>, 02:11:10, Serial0/0/0
DUAL is why EIGRP routes are marked as "D" in the routing table.
EIGRP topology table contains both successors and feasible successors. To display main and sub-entries:
Router# show ip eigrp topology
[omitted]
P <IP_ADDRESS>/24, 1 successors, FD is 3012096
via <IP_ADDRESS> (3012096/2816), Serial0/0/0
via <IP_ADDRESS> (41024256/2170112), Serial0/1/0
[omitted]
Router# show ip eigrp topology
[omitted]
P <IP_ADDRESS>/24, 1 successors, FD is 3012096
via <IP_ADDRESS> (3012096/2816), Serial0/0/0
via <IP_ADDRESS> (41024256/2170112), Serial0/1/0
[omitted]
First subentry content:
Router# show ip eigrp topology
[omitted]
P <IP_ADDRESS>/24, 1 successors, FD is 3012096
via <IP_ADDRESS> (3012096/2816), Serial0/0/0
via <IP_ADDRESS> (41024256/2170112), Serial0/1/0
[omitted]
Other subentries are present if there are FSs:
It could happen that a backup route it’s actually available, but that it doesn’t meet the FC.
If so, that backup route doesn’t enter the topology table. To display every link regardless of the FC requirements, use show ip eigrp topology all-links
.
Being a distance-vector routing protocol, EIGRP doesn’t build a map of the network topology. DUAL only way to guarantee no routing loop is to respect the FC. A non-FS route can still be used, but further processing by DUAL is required and a delay is inevitable.
FSM study is not part of CCNA.
To understand how DUAL is operating, the output of the FSM can be enabled with the command debug eigrp fsm
.
When DUAL cannot find a FS meeting the FC, it puts the route into active state. The router queries its neighbors for a route to that destination network and waits for replies. If the replies contain a route to that network, it can become a new successor.
IPv6 EIGRP has been available since IOS 12.4(6)T, by adding the IPv6 PDM. It runs independently from IPv4 EIGRP. The differences are minimal. DUAL and FSM, RTP, EIGRP packet types, the composite metric are common traits.
Router(config)# ipv6 router eigrp {as_number}
Router(config-if)# ipv6 eigrp {as_number}
EIGRP simply cannot operate correctly if the right adjacencies are not formed. By default, every adjacency change is displayed in the terminal thanks to the command
Router(config-router)# eigrp log-neighbor-changes
%DUAL-5-NBRCHANGE: EIGRP-IPv6 2: Neighbor FE80::1
(Serial0/0/0) is up: new adjacency
If an adjacency isn’t formed like it’s supposed to, first verify network connectivity to that neighbor. Then, check that both routers have the same AS number and that neighbor's network is included in network
statements.
For EIGRP-IPv6, manually set the link-local addresses to more easily identify the interfaces in debug/config (eg. FE80::2 for R2).


Development
Monster Sudoku was created in C++ using Qt Creator. It can generate random puzzles based on size and number of pre-filled cells, or accept puzzles from file input. It will then try to solve the puzzles, using backtracking search, until it either finds a solution, or decides there is no solution.
The solver stores the puzzle in a custom data structure that encapsulates a 2d array. The solver then works through the puzzle, via backtracking search. The solver also utilizes many different heuristics to improve performance. This includes:
- Minimum Remaining Values - Helps decide which cell to try to solve next. The cell with the smallest domain, or the minimum remaining values has a higher chance of choosing the correct value, and can remove impossible values early on.
- Least Constraining Value - Helps decide which value to choose for a cell. If this value constrains the least number of cells by being chosen, then it is less likely to fail and cause a backtrack.
- Degrees Heuristic - Again helps decide which cell to solve next. Choosing the cell that has the highest number of constraints on other unassigned cells helps reduce the domains of those cells.
- Arc Consistency - Ensures that impossible or illegal values are removed from cells before trying to solve another cell.
- Forward Checking - Determine the effect of a value assignment to a cell by checkings its neighbors and constraints.
The solver first checks and maintains arc consistency when given a puzzle. Puzzles begin with some of the cells already solved. This means that the solver can reduce domains of the solved cells neighbors to reduce the search space. Afterwards, it decides on a cell to try and solve using the Minimum Remaining Values heuristic. If there is more than one cell that has the smallest domain, the ties are broken via the Degrees heuristic. If there are still ties, then the first one is chosen.
If the chosen cell has a domain size of 1, then the answer is simple: choose the remaining value. However, if there is more than one value in the domain (most likely case), then the solver decides on which one to try using the Least Constraining Value heuristic.
Once a value is chosen, the solver records this action and that depth its in, and maintains arc consistency by propagating through the cell's neighbors, and ensuring that there are no illegal values in their domains. For each value that needs to be removed, the solver records that action as well. Once finished, the solver chooses another cell to solve. If there are no other cells left, then the solver checks to make sure each cell has an assigned value. If each cell does have an assigned value, the solver has found a solution and ends. however, if at least one cell does not have a value, then the solver must backtrack.
To backtrack, the solver goes through each recorded action in that depth, and inverts the action. The solver then marks the chosen value for the cell as illegal, and chooses the next best value following the heuristics. If the solver cannot backtrack any further, the solver ends with no solution.
Closing Thoughts
The solve algorithm could have definitely been better. For larger puzzles, where n >= 12, the solver potentially took hours to solve. Inefficient and slow algorithms for the heuristics and search are to blame. One of the more obvious improvements that could have been made was to pre-process the degrees of each cell, and simply modify them as needed, instead of calculating them at every iteration.


Don't Mind Me!
Of Growth Mindset and Randomness
February 22, 2015
A few weeks ago, I checked out a link that Dev Bootcamp had sent prior to the start of Phase 0. It included a quiz and covered information on different thinking styles. DBC encouraged us to take the test and learn what our style was. The four types of thinking are Concrete Sequential, Abstract Sequential, Concrete Random, and Abstract Random. On the quiz, I scored evenly for Concrete Random and Abstract Random.
According to Anthony Gregorc, Concrete Random thinkers are experimenters. I find this to be a true reflection of my thinking style. I learn a lot by doing things hands on. As I read things, I like to experiment and try them out to see what the results are. I tend to be a little competitive(in a friendly way :-) ) and because of this I work best alone.
However, as an equally Abstract Thinker, I like to listen to what others have to say. This makes working in a group, or pair, doable. Because I am also an Abstract Random Thinker, I can focus on the issues at hand and combine that with my more Concrete side to find a solution.
With both of these thinking styles, the Phase 0 portion of my journey with DBC is a little more difficult. I tend to stray from routine, and with the remote learning experience, it's important to have some sort of organized routine to stay on track. So this is something I must continue to work on.
Overall, knowing my thinking style positively impacts my goal of becoming a Web Developer through DBC. I've always possessed a growth mindset. So I am dedicated to excelling in as many areas as I possibly can. Not even the sky is my limit!
Do you know your thinking style? Check out the quiz at The Learning Web.
- Geovanna
-
Click here for more posts, or select a title below:
- Git It? Got It? Good?
- What's Cooking at DBC?
- Are You In or Out?
- The Index is Key


I bring you an important message from Ed Baxter, benign dictator of Resonance104.4fm, the home for the past eight years of the world's most Hooting Yardist radio programme, Hooting Yard On The Air. Says Dr Baxter:
Resonance 104.4fm's annual on-air fund raiser runs all this week till midnight on Sunday the 19th of February. If you love Resonance104.4fm and the broadcasts made by our astonishing array of presenters, please support us via a donation, pledge, bequest, gift or purchase from our shop. The alternative—for the station to take regular on-air advertising—is something we'd all prefer not to contemplate. But as it approaches its tenth anniversary Resonance urgently need funds to continue its work. Visit resonancefm.com to make a donation of any size. PLUS as usual we're having an auction of unique and wondrous items, with contributions from David Shrigley, Bob & Roberta Smith, Glen Baxter and much more (rare records, wine, services, etc)—the list will grow as the week progresses.
Visit resonancefm.com/auction-2012 and make a bid by emailing<EMAIL_ADDRESS>Or why not simply phone us with a pledge on 020 7407 1210?
Many thanks.


Press n or j to go to the next uncovered block, b, p or k for the previous block.
| File | Statements | Branches | Functions | Lines | |||||
|---|---|---|---|---|---|---|---|---|---|
| src |
|
31.58% | 18/57 | 6.06% | 2/33 | 37.93% | 11/29 | 31.58% | 18/57 |
| src/containers/albums |
|
93.75% | 30/32 | 75% | 6/8 | 100% | 11/11 | 96.43% | 27/28 |
| src/containers/albums/components |
|
60.98% | 25/41 | 100% | 0/0 | 43.75% | 7/16 | 56.76% | 21/37 |
| src/containers/comments |
|
96.67% | 29/30 | 83.33% | 5/6 | 100% | 11/11 | 96.3% | 26/27 |
| src/containers/comments/components |
|
59.52% | 25/42 | 100% | 0/0 | 43.75% | 7/16 | 55.26% | 21/38 |
| src/containers/components |
|
44.44% | 4/9 | 100% | 0/0 | 40% | 2/5 | 44.44% | 4/9 |
| src/containers/extra |
|
100% | 9/9 | 100% | 0/0 | 100% | 4/4 | 100% | 8/8 |
| src/containers/landing |
|
100% | 6/6 | 100% | 0/0 | 100% | 3/3 | 100% | 5/5 |
| src/containers/layout |
|
75% | 9/12 | 0% | 0/4 | 75% | 3/4 | 72.73% | 8/11 |
| src/containers/layout/components |
|
33.33% | 6/18 | 0% | 0/7 | 25% | 2/8 | 33.33% | 5/15 |
| src/containers/photos |
|
93.55% | 29/31 | 83.33% | 5/6 | 100% | 11/11 | 92.86% | 26/28 |
| src/containers/photos/components |
|
60.98% | 25/41 | 100% | 0/0 | 43.75% | 7/16 | 56.76% | 21/37 |
| src/containers/posts |
|
93.55% | 29/31 | 83.33% | 5/6 | 100% | 11/11 | 92.86% | 26/28 |
| src/containers/posts/components |
|
60.42% | 29/48 | 100% | 0/0 | 38.89% | 7/18 | 56.82% | 25/44 |
| src/containers/todos |
|
96.67% | 29/30 | 87.5% | 7/8 | 100% | 11/11 | 96.3% | 26/27 |
| src/containers/todos/components |
|
60.98% | 25/41 | 100% | 0/0 | 43.75% | 7/16 | 56.76% | 21/37 |
| src/containers/users |
|
96.67% | 29/30 | 83.33% | 5/6 | 100% | 11/11 | 96.3% | 26/27 |
| src/containers/users/components |
|
60.98% | 25/41 | 100% | 0/0 | 43.75% | 7/16 | 56.76% | 21/37 |
| src/redux |
|
100% | 11/11 | 100% | 0/0 | 100% | 1/1 | 100% | 11/11 |
| src/redux/albums |
|
58.02% | 47/81 | 40% | 6/15 | 50% | 14/28 | 63.08% | 41/65 |
| src/redux/comments |
|
63.41% | 52/82 | 46.67% | 7/15 | 57.14% | 16/28 | 66.67% | 44/66 |
| src/redux/photos |
|
58.02% | 47/81 | 40% | 6/15 | 50% | 14/28 | 63.08% | 41/65 |
| src/redux/posts |
|
62.96% | 51/81 | 46.67% | 7/15 | 57.14% | 16/28 | 67.19% | 43/64 |
| src/redux/todos |
|
62.96% | 51/81 | 46.67% | 7/15 | 57.14% | 16/28 | 67.19% | 43/64 |
| src/redux/users |
|
61.33% | 46/75 | 53.33% | 8/15 | 50% | 14/28 | 68.97% | 40/58 |
| src/utils |
|
81.25% | 26/32 | 100% | 0/0 | 75% | 9/12 | 80.77% | 21/26 |


Parents' Site
Verbs make up about one-third of the characters that second graders learn.
A Pronunciation Guide is available.
Click on the characters on the left to begin. If your browser is not set to allow active content, you will not
see a speaker icon to the left of each character selected. To allow active content for this web site, follow the
browser's prompts. Then click once on the speaker icon to activate it and again to play the sound.


Publishing a Single Page Translation
How to publish individual translations of a single page. This updates the view permissions for the selected page so they are the same as the default language version of the page.
The page must be translated. See "Setting a Page as Translated"
Using the ControlBar
- View the page in the language you are publishing.
- Navigate to the required page.
- Select Page Localization from the Edit Page section of the ControlBar.
- At Published ,
- Click the Update Localization button.
Using the Languages Module
- Navigate to Admin > Advanced Settings > Languages - OR - Go to a Languages module.
- Select the Content Localization tab.
- At Select a Page, find or select the required page.
- At Published , to translate the page.
-
Click the Update button.


I am a Ph.D student in the School of Electrical and Computer Engineering at Purdue University, advised by Prof. Sabre Kais and Prof. Zubin Jacob. My previous research experiences include microwave synthesis, semi-classical modeling, quantum transport modeling and fabrication of nanoelectronic devices. The interplay between quantum computing and artificial intelligence excites me and in that regard my current research interest lies in quantum machine learning. With regards to quantum information theory, my interests include algorithms and complexity theory, and also in understanding the fundamental limits of information processing.
GPA: 3.67
GPA: 9.52/10.0
Advisors: Prof. Sabre Kais & Prof. Zubin Jacob
Research: Classical and Quantum Machine Learning for physics-based simulations
Achievements:
Advisor: Prof. Digbijoy N. Nath
Achievements:
Modeled MoS2/GaN heterostructure based vertical photodetector for deep UV applications and worked closely with experimentalists to understand the carrier transport in the device.
Advisor: Prof. S.A. Shivashankar
Achievements:
First ever demonstration of synthesizing self-assembled Cu2S nanoparticles using microwave irradiation.
Advisors: Prof. Sriraam. N and Dr. A.S. Hegde (Director - Neurosurgeon, M.S. Ramaiah Memorial Hospital, Bangalore)
Achievements:
Achieved state-of-the-art classification accuracy by processing Electroencephalogram data for the real-time detection of focal epileptic seizures using an SVM classifier.
Advisor: Prof. S.A. Shivashankar
Achievements:
First ever demonstration of synthesizing delafossite CuAlO2 nanoparticles using microwave irradiation.
Ph.D. Student
PhD Student
PhD Student
Research Student, Undergraduate Thesis
Summer Research Intern
Research Assistant
Summer Research Intern


Search
Projects
Offers
Profile
Your Projects
Add New Project
Back
Add new project
Remember! The more detailed description of the project and required skills, the better the system will be able to identify the potential participants.
Description of the idea
Add picture
Project name
Enter a description of the idea
Would you like your project to be private (visible only to you and invitees)?
Add project


This website is only accessible if you're using a screenreader.
Now, I know what you're thinking, "I can just remove the CSS that's preventing me from using this site with my eyes! You're not the boss of me!"
Okay, that's true. But how about you be a sport and play along?


{% extends 'base.html' %} {% block header %} {% endblock %} {% block app_content %}
| Team | Wins | Losses | Points Scored | Points Against | Points Scored / Game | Points Against / Game |
|---|---|---|---|---|---|---|
| {{ d.team }} | {{ d.wins }} | {{ d.losses }} | {{ d.points }} | {{ d.points_against }} | {{ d.points_per_game }} | {{ d.points_against_per_game }} |


Domain Management
Caution: Due to visiting through HTTP without SSL protection, the domain management key is leaked to the Internet data link. This page should never be visited though HTTP protocol. Please consider to access this page through HTTPS only and change the domain management key ASAP.
All unmatched requests with this domain name will be redirected to this address specified.
The address to be redirected to.
Navigate to this page when using this setting as path segment.
After enable this, the records with similar names with different case will be kept only one.
Navigating from host which equals alias column of this table will be treated as to the host specified in target column of the same record.
| Address | Target | Permanent | Query String | Management |
|---|---|---|---|---|
|
|
|
|
||
|
There's no active redirects yet.
|
||||
|
|
|
|


“out of insecurity and boredom I developed an elaborate form of displacement activity, a self-estranging technique, creating what I called ‘angel trap stationery’ — paper painted with symbols and impregnated with scents designed to attract various powers and dominions of the air to aid me in the act of composition.”
Peter Blegvad, interviewed in The Believer, November/December 2009


the Photon Beam is the first pedal available from q/z pedals. A carefully designed envelope filter/ phase shifter guitar effects unit that sends your tone into orbit!


name: inverse layout: true class: center, middle, inverse --- # Various NDA related work at UU ## Zsolt Elter ## 2019 --- layout: false .left-column[ ## Content ] .right-column[ NDA related: - MVA to verify BU, CT and IE - MVA: Multivariate analysis - BU burnup - CT cooling time - IE initial enrichment - BIC (BU-CT-IE) - MVA to classify partial defects - feign: python package to estimate geometric efficiency - Database for MVA investigations - Safeguards of quivers General: - Publishing open source software ] --- template: inverse ## BU,CT,IE verification in BWRs --- .left-column[ ## BIC for BWR ### Intro ] .right-column[ - Predict Burnup, Cooling-time and initial enrichment - From spent fuel inventory (gamma emitters) - Neutron measurements (eg. DDSI - differential die away self interrogation) - This work has been studied in many aspects - By C. Hellesen [with PLS - partial least squares regression - on gamma signatures for PWR fuel](https://www.sciencedirect.com/science/article/pii/S0306454917302220) - By M. Åberg Lindell [with various methods on gamma signatures for PWR](https://www.sciencedirect.com/science/article/pii/S0168900218305370). Also MOX vs UOX classification work. - By L. Pöder Balkeståhl [with PLS on gamma and neutron signatures for PWR](http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-380882) - By me (with random forest on gamma and neutron signatures for BWR) - Currently by S. Grape et al. with random forest on gamma, neutron and cherenkov signatures. ] --- .left-column[ ## BIC for BWR ### Intro ### Idea ] .right-column[ - Predictions without any a priori assumption on the fuel! - Do burnup calculation for a large amount of BU-CT-IE configurations - Train a machine learning model - Test and validate - Apply on real measurements - Burnup calculations with Serpent2 - pincell modell - axial void profile - Neutron signature here is just k-inf ] --- .left-column[ ## BIC for BWR ### Intro ### Idea ] .right-column[ ![drawing90](figures/methodN.png) ] --- .left-column[ ## BIC for BWR ### Intro ### Idea ### Remarks ] .right-column[ - IE cannot be predicted without neutron signature - CT gets predicted very well - Uncertainties? - What if irradiation history is not "ideal"? - Experimental validation? ] --- template: inverse ## Partial defect with gamma spectroscopy --- .left-column[ ## Partial defect ### Intro ] .right-column[ - The integrity (are parts modified?) has to be verified - In a fuel assembly pins may be removed or changed (during operation eg leaks or bad intentions) - Can these verifications be done with non-destructive assay? - Currently: 1-2 pin accuracy PGET tomography and 30-50% accuracy with DCVD Digital Cherenkov viewing device - Something is needed in the 10-30% range for reliable sampling strategies ![drawing25](figures/assemblyexter.png) ![drawing25](figures/assemblyrandom.png) Illustration of 30% defects in 17x17 PWR fuel (grey: fuel pin, black: guide tube, red: replaced pin) ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ] .right-column[ - [Esarda bulletin No. 56 pp 6-11 by C. Hellesen and S. Grape](https://esarda.jrc.ec.europa.eu/images/Bulletin/Files/B_2018_056.pdf) - Gross, Partial, Pin-level - 1 PWR assembly contains cca 6 kg Pu -> two 2/3 diverted = SQ - Roll-up scenario: smaller fractions from more assemblies - Exclude roll-up in a facility with 100k assemblies: challenge. - Something is needed in the 10-30% range for reliable sampling strategies Material | | Significant Quantity --- | --- | ---
Plutonium
| |
8 kg
High-enriched U
| |
25 kg U-235
Low-enriched U
| |
85 kg U-235
] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ] .right-column[ - Geometric efficiency depends on the gamma energy - For high energy gamma-rays even the less peripheral rods can weakly contribute to the signal - By replacing different parts of an assembly with non-radioactive, but strong attenuating materials, one may observe a different change in the passive gamma spectra for lower and higher energy gamma peaks ![drawing75](contributionMap0.png) ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ] .right-column[ - Geometric efficiency depends on the gamma energy - For high energy gamma-rays even the less peripheral rods can weakly contribute to the signal - By replacing different parts of an assembly with non-radioactive, but strong attenuating materials, one may observe a different change in the passive gamma spectra for lower and higher energy gamma peaks ![drawing75](figures/contributionMap.gif) ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ] .right-column[ - More information by applying multi-variate data analysis? - Compute the gamma spectra for many BU, CT, IE configurations - And for several defect ”classes” - Define feature vector (eg. gamma peaks) which represents the spectrum - Train classification method with feature vectors → Many (synthetic) samples are needed - Predict for an unknown spectrum whether it comes from intact fuel ![drawing75](figures/PGS_example.png) ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ### Where? Clab ] .right-column[ ![drawing75](figures/CLABMCNPXMODEL_New.png) - Flux at detector in two steps with MCNPX - F5 (semi-deterministic point detector) for geometric efficiency - F8 (pulse-height) for intrinsic efficiency - Later with - `feign` for geometric efficiency - Calibration curve for intrinsic efficiency - Source term based on Serpent2 calculations ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ### Where? Clab ### Results ] .right-column[ What is essentially being calculated? Geometric efficiency. .left-column50[ Classes `Orig` `Exter` ![drawing35](figures/assemblyorig.png) ![drawing35](figures/assemblyexter.png) `Inter` `Random` ![drawing35](figures/assemblyinter.png) ![drawing35](figures/assemblyrandom.png) ] .right-column50[ ![drawing75](figures/geomefficiencyOEIR.png) ![drawing75](figures/geomefficiencyOEIRNorm.png) ] ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ### Where? Clab ### Results ] .right-column[ - BU: 20-50 MWd/kgU, CT: 5-30y, IE=3.5% - Feature vector: normalized and scaled counts - Did some recursive feature selection - The most important features seem to be - Cs-134: 0.604, 1.167, 1.365 - Cs-137 0.662 - Eu-154 0.723, 1.596 ![drawing45](figures/featureAllpeak2D.png) ![drawing45](figures/PD_ranges_impact3D_3.png) When looking into it in more detail it turns out the shape comes from the BU and CT. " nuisance parameters" How to get rid of it? ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ### Where? Clab ### Results ] .right-column[ - Use only Eu-154 lines as features. - The shape is gone... ![drawing45](figures/featureEUpeak2D.png) Add some noise and the blobs grow, still possible to classify ![drawing45](figures/onlyeu154_werrorNew4.png) ] --- .left-column[ ## Partial defect ### Intro ### Sampling strategy ### Why gamma? ### How? MVA ### Where? Clab ### Results ### Remarks ] .right-column[ - I have done this for a [lot more configurations](https://www.openprocessing.org/sketch/495110). - Always planned to wrap this up nicely to see how well I can classify based on noise... - Seems to be working on the 30% level. 15% is to be proved - Axial scan, so partial diversion is detected as well - At least five minutes measurements (comparable to PGET) - Fuel needs to be moved to spectroscopy station - Is this really the ideal tool at 10-30% defect level? - Practical use is problematic? Can the simulation based model be used for real measurements? ] --- template: inverse ## Spent fuel inventory database --- .left-column[ ## Intro ] .right-column[ - For the previous works quite many datasets were created - Still there is a "need more data" feeling - Random forests are greedy... - At the beginning BU-CT-IE randomly sampled - Then a well structured database with 700k datapoints - To reduce computing time the samples are built on each other - First a burnup calculation is run with many burnup steps - Then the inventories are let to decay further - Only few 1000 calculations are needed - With Serpent2 - Infinite lattice of PWR fuel pins - Reflective boundary conditions were applied. - Fuel rod radius is 0.41 cm, cladding radius 0.42/0.48 cm, pitch 1.26 cm - Each 365 days long cycle results in a burnup of 10 GWd/tU - 30-day outage period. - JEFF 3.1 cross-section library ] --- .left-column[ ## Intro ] .right-column[ Final dataset - for UOX and MOX - BU 5-70 MWd/kgU with 0.5 steps - IE 1.5-6.0 w% with 0.1 steps - CT 0-70 years in steps of 3 months up to 10 years, then in steps of 6 months up to 40 years and after that in steps of 1 year. - In a tidy csv file - Open to play around - To be published in Data in Brief (SCK colleagues doing similar with Origen-ARP) - Plans to provide tutorial python notebook. ```python import pandas as pd import matplotlib.pyplot as plt fueldata=pd.read_csv('PWR_UOX-MOX.csv',header = 0, index_col=0) #plotting BU vs Cs137 content plt.plot(fueldata.BU,fueldata.Cs137,'bo') plt.xlabel('BU') plt.ylabel('isotope concentration') plt.show() #subset of fuel configurations where CT is 5-30years subfuel=fueldata[(fueldata["CT"]> 5*365) & (fueldata["CT"] < 30*365)].sample(n=100000,random_state=1) ``` ] --- template: inverse ## Verification of quivers --- .left-column[ ## Quivers ### Intro ] .right-column[ An archer’s case for holding arrows .left-column50[ ![drawing50](figures/geomplot_geom1.png) Cluster of stainless steel tubes to house damaged fuel (cladding rupture) Designed by Westinghouse ] .right-column50[ ![drawing50](figures/assemblyorig.png) Identical dimensions as regular fuel. No special handling required. ] ] --- .left-column[ ## Quivers ### Intro ] .right-column[ - For PWR and BWR fuel - 14-28 BWR rods or 30-60 PWR rods - Actual design may depend on request - But in Sweden there is one BWR and one PWR type - Temporary lid and long-term storage lid - After closure: water evacuated, filled with helium - New product (cca 20 in Sweden) [See leaflet for images](http://www.westinghousenuclear.com/Portals/0/operating%20plant%20services/fuel/Fuel%20Outage%20and%20Field%20Services/WestinghouseQuiver-12823.pdf) ![drawing25](figures/geomplot_geom2.png) ] --- .left-column[ ## Quivers ### Intro ### Goal ] .right-column[ - Gross defect: is there nuclear material inside? - Non-destructive assay - Measurements from top do not require fuel movement - Cherenkov viewing device did not see anything in Forsmark NPP - Focus on SFAT now (and possibly the FORK later) ] --- .left-column[ ## Quivers ### Intro ### Goal ### Studied quiver ] .right-column[ .right-column50[ - From Ringhals PWR - 34 rods from 20 assemblies - Thicker tube holds rod as well - 5-36 MWd/kgU (low burnup) - 30-42 years old (long cooling time) - 2.5-3.5 w% initial enrichment ] .left-column50[ ![drawing75](figures/geomplot_geom1.png) Darker red implies higher burnup ] ] --- .left-column[ ## Quivers ### Intro ### Goal ### Studied quiver ### Methodology ] .right-column[ ![drawing75](figures/methodology.png) - Neutron and gamma flux estimated around the quiver - Gamma reaction rate from Cs-137 estimated in the SFAT - Detector from available geometry details ![drawing75](figures/sfat_geom_label.png) ] --- .left-column[ ## Quivers ### Intro ### Goal ### Studied quiver ### Methodology ### Particle transport ### Results ] .right-column[ gamma ![drawing75](figures/gamma_axial_flux_profile.png) neutron ![drawing75](figures/neutron_axial_flux_profile_ave_linear.png) ] --- .left-column[ ## Quivers ### Intro ### Goal ### Studied quiver ### Methodology ### Particle transport ### Results ] .right-column[ ![drawing75](figures/vrstepsLow.png)
Less than 3 counts in 5 minutes is estimated with the modeled SFAT.
Work in progress, VR scheme needs to be double checked. ] --- template: inverse ## Air activation in NESSA --- .left-column[ ## NESSA ### Intro ] .right-column[ - NEutron Source in UppSAla - Lead by A. Prokofiev (some slides based on his) - Keep and develop competence in - Nuclear physics and data - Neutron physics - Radiation physics, protection, detectors Used for - Reactions - Tomography - Detectors - Radiation effects - PGAA - prompt gamma activation analysis ] --- .left-column[ ## NESSA ### Intro ] .right-column[ - d + t -> 4He + n - d has to be accelerated - Nearly monoenergetic neutrons - 4x1e10 n/s - 18 months or 1000 operational hours - Beam size: not exceeding 18 mm - Pulsing (pulse duration down to 10 us, period to 50 us) - Delivery 2020 Fall - Availability to users: 2021 ] --- .left-column[ ## NESSA ### Intro ### Air activation ] .right-column[ - Is it safe to enter the bunker after irradiation? - Need for ventillation? - Neutron transport with MCNP (input developed by E. Andersson Sundén) - Activation with Fispact-II - Approximations - spectrum is the same everywhere - flux is the same in the room - material loss is neglected ] --- .left-column[ ## NESSA ### Intro ### Air activation ] .right-column[ ![drawing75](figures/nessaprelimfluxandRRandXSNew.png) - O16(n,p)N16 - N14(n,2n)N13 - Ar40(n,g)Ar41 - Ar40(n,p)Cl40 - N15(n,p)C15 - 018(n,a)C15 - Ar40(n,a)S37 - N15(n,a)B12 - Ar40(n,2n)Ar39 - N14(n,t)H3 - Ar36(n,g)Ar37 - Ar38(n,2n)Ar37 ] --- .left-column[ ## NESSA ### Intro ### Air activation ] .right-column[ .left-column50[ ![drawing75](figures/activity_over_timeFispactNew_nolegend.png) ![drawing75](figures/doserate_over_timeFispactNew_nolegend.png) ] .right-column50[ ![drawing85](figures/activity_over_timeFispactNewZoom.png) ![drawing85](figures/doserate_over_timeFispactNewZoom.png) ] (Half-lifes: H3: 12.34y, N13: 9.96 min, N16: 7.13 s, Ar41: 1.82 h) Highest dose rate is 17.7 uSv/h. Better to wait couple of hours before entering. ] --- template: inverse ## DDSI work and Cherenkov --- .left-column[ ## DDSI, Cherenkov ### Intro ] .right-column[ DDSI by L. Pöder Balkeståhl - Differential Die-away Self-interrogation - [Die-away time parametrized](https://www.stralsakerhetsmyndigheten.se/contentassets/37a5600de45242d6813e477f104bb9c4/parametrisering-av-avklingningstiden-tau-fran-ddsi-instrumentet-vid-modellering-av-intakta--pwr-branslen---li-poder.pdf) - For given BU, CT, IE the tau can be predicted. - We use that in MVA DCVD by E. Branger - fast measurements - mostly total intensity is used - to verify BU, CT, IE partial defect - Based on operator declarations estimate the gamma emission spectrom with Origen-ARP - Then predict the Cherenkov intensity (with the help of Geant4 models) - Using image analysis for less than 50% defect? ] --- template: inverse ## feign --- .left-column[ ## feign ### Intro ] .right-column[ ![drawing65](figures/rayDemo.png) - Compute the uncollided F5 tally - 2D geometries. For a long collimator with a narrow horizontal slit that is placed in front of the detector, the axial dependence is negligible. - Build-up factor neglected. OK - If high energy-resolution detector - Direct photons contribute to peak - Scattered photons contribute to background ] --- template: inverse ## Journal of Open Source Software --- .left-column[ ## Publishing code ### JOSS ] .right-column[ **Don't we have enough journals already?** "*Perhaps, and in a perfect world we'd rather papers about software weren't necessary but we recognize that for most researchers, papers and not software are the currency of academic research and that citations are required for a good career.*" /from [JOSS hompage](https://joss.theoj.org/about)/ JOSS (and JOSE for open source education) - provides a simple submission process - paper (250-1000 words) takes few hours (if code is well-documented) - is free and open source - has a nuclear engineer editor and reviewers - has a transparent and open review process in github issues (for example [`feign`'s](https://github.com/openjournals/joss-reviews/issues/1650)). What you get - an article...:) - a code that was installed, tested, reviewed by at least three scientists - experience from a different world... journal run by enthusiastic young people. This is nothing like Elsevier... ] --- .left-column[ ## Publishing code ### JOSS ### Requirements ] .right-column[ For the code - Obvious research application - License, Community guidelines - Documentation (readme) - API documentation - Install instructions - Tests - Examples For the paper - 250-1000 words - Summary for non-specialists - Statement of need - Bibliography with DOI Indeed, you see some articles, which are just 1 page long. [Mine](https://joss.theoj.org/papers/10.21105/joss.01650) was a bit more detailed. [Detailed seminar on good practices.](https://ezsolti.github.io/TKworkshop/) ] --- template: inverse ## Thanks for listening!


Browse packages
Merchello
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
ezSearch
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
uBlogsy
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
Multi Url Picker
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
Articulate
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
301 URL Tracker
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
uCommerce
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
Desktop Media Uploader
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...
LocalGov Starter Kit
Everyone deserves a form creator that's as easy to use as Umbraco, so we built just that. Whether ...


Sweeper Car List
Search Sweeper Car
Sweeper Car ID
Sweeper Car Name
IP
Status
Start Cleaning / Stop Cleaning
Car Status
1
Sweeper One
<IP_ADDRESS>
On Duty
Recall
Detail
2
Sweeper Two
<IP_ADDRESS>
On Duty
Recall
Detail


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object model.Graph<NodeType>
NodeType
- the class of a node in the graphpublic class Graph<NodeType extends INode<NodeType>>
A graph implementation that provides a merge operation to merge another graph
into it. The graph can be modified by adding nodes to it. Whether edges can
be added depends on the capability of the NodeType
class.
| Constructor Summary | |
|---|---|
Graph()
Create an empty graph. |
|
Graph(java.util.Collection<NodeType> nodes)
Create a graph from nodes. |
| Method Summary | |
|---|---|
void |
add(NodeType node)
Add the node the graph |
void |
addInitial(NodeType initialNode,
java.lang.String relation)
Mark initialNode as initial with respect to relation . |
java.util.Set<NodeType> |
getInitialNodes()
Get the union over all relations of the initial nodes |
java.util.Set<NodeType> |
getInitialNodes(java.lang.String relation)
The nodes in the graph that are initial with respect to the relation |
java.util.Set<NodeType> |
getNodes()
Get all nodes in this graph |
java.util.Set<java.lang.String> |
getRelations()
Get all relations that appear in this graph. |
void |
merge(Graph<NodeType> graph)
Merge graph into this graph. |
void |
remove(NodeType node)
Remove the node from the graph |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public Graph(java.util.Collection<NodeType> nodes)
nodes
- the nodes of the graphpublic Graph()
| Method Detail |
|---|
public java.util.Set<NodeType> getInitialNodes()
IGraph
getInitialNodes
in interface IGraph<NodeType extends INode<NodeType>>
public java.util.Set<NodeType> getInitialNodes(java.lang.String relation)
IGraph
getInitialNodes
in interface IGraph<NodeType extends INode<NodeType>>
relation
- the relation
public java.util.Set<NodeType> getNodes()
IGraph
getNodes
in interface IGraph<NodeType extends INode<NodeType>>
public java.util.Set<java.lang.String> getRelations()
IGraph
getRelations
in interface IGraph<NodeType extends INode<NodeType>>
public void add(NodeType node)
IModifiableGraph
add
in interface IModifiableGraph<NodeType extends INode<NodeType>>
node
- the node to addpublic void remove(NodeType node)
IModifiableGraph
remove
in interface IModifiableGraph<NodeType extends INode<NodeType>>
node
- the node to removepublic void addInitial(NodeType initialNode, java.lang.String relation)
IModifiableGraph
initialNode
as initial with respect to relation
.
Implementations should make sure that initialNode is in fact a node of
the graph.
addInitial
in interface IModifiableGraph<NodeType extends INode<NodeType>>
initialNode
- the node to mark as initialrelation
- the relation with respect to which the node should be initialpublic void merge(Graph<NodeType> graph)
graph
into this graph.
graph
- the graph to merge into this one
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Order Detail
Task
Charge
Task ID
Task Name
Task Description
Task Owner
Task ID
Task Name
Task Description
Task Owner


×
Settings saved correctly
Console reporter
Enabled
Pooling period seconds:
[error]
The amount of time between polls in seconds
Report metric types:
JVM metrics
Operating system metrics
Database metrics
Logging framework metrics
Cache metrics
HTTP request time metrics
Business event metrics
JMX reporter
Enabled
Report metric types:
JVM metrics
Operating system metrics
Database metrics
Logging framework metrics
Cache metrics
HTTP request time metrics
Business event metrics
CSV file reporter
Enabled
Pooling period seconds:
[error]
The amount of time between polls in seconds
Report metric types:
JVM metrics
Operating system metrics
Database metrics
Logging framework metrics
Cache metrics
HTTP request time metrics
Business event metrics
Log file reporter
Enabled
Pooling period seconds:
[error]
The amount of time between polls in seconds
Report metric types:
JVM metrics
Operating system metrics
Database metrics
Logging framework metrics
Cache metrics
HTTP request time metrics
Business event metrics
Save


HTML HEADINGS.
As the name implies, HTML headings are used as headers in a code. They can be likened to the title tag but headings but there are six(6) different levels of HTML headings according to their size.
Check this example out.
This example shows all the six levels of HTML headings in use. Try using them and see how they work.
HTML LINES.
HTML lines tags include < hr/> and < br/> which are used t5o separate text in which they are included in.
EXAMPLE
< p>HELLO I AM < br/> Marvel.
OR
< p>HELLO I AM < hr/> Marvel.
 Remember to save the file extemnsion as .html or .htm
<--
-->


Numbers 4:22
Take also the sum of the sons of Gershon, throughout the houses of their fathers, by their families;


An interactive explorer for single-cell transcriptomics data
Quick start
Installation
Gallery
Cellxgene data portal
Demo datasets
Preparing your data
Launching cellxgene
Hosting cellxgene
Annotating data
Methods
Troubleshooting
Roadmap
Contributing (ideas or code)
Contact & finding help
Code
We warmly welcome contributions from the community!
To ensure a welcoming experience for our entire community, this project adheres to the Contributor Covenant code of conduct. By participating, you are expected to uphold this code. Please report unacceptable behavior to<EMAIL_ADDRESS>If you have any questions about any of this stuff, just ask! :)
We’d love to hear from you! Please submit any bug reports and feature requests through Github issues.
If you are interested in working on cellxgene
development, you’ll need to use git to make a copy of the project repository and share your changes.
We have several “rules” (strong suggestions really) for contributions:
If your contribution is complex, adds new features, new UI design or otherwise warrants discussion, we highly recommend that you submit a github issue, and engage other contributors in a discussion about the details of your proposed PR. This will save you time in the long run, as many details and decisions can be hashed out ahead-of-time.
Please submit any direct contributions by forking the repository, creating a feature branch, and submitting a Pull Request.
First, you’ll need the following installed on your machine
Then clone the project
git clone https://github.com/chanzuckerberg/cellxgene.git
This is enough to get you started with editing documentation. If you’d like to contribute code:
Build the client web assets from inside the cellxgene
folder
make build-for-server-dev
Install all requirements (we recommend doing this inside a virtual environment)
pip install -e .
You can start the app while developing either by calling cellxgene
or by calling python -m server
. We recommend using the --debug
flag to see more output, which you can include when reporting bugs.
If you have any questions about developing or contributing, come hang out with us by joining the CZI Science Slack and posting in the #cellxgene-dev
channel.
This project has made a few key design choices:
regl
(a webgl library), react
, redux
, d3
, and blueprint
to handle rendering large numbers of cells with lots of complex interactivityDepending on your background and interests, you might want to contribute to the frontend, or backend, or both!
Please submit any direct contributions via a Pull Request. It’d be great for PRs to include test cases and documentation updates where relevant, though we know the core test suite is itself still a work in progress.
The documentation is written in markdown, and lives in the directory cellxgene/docs/posts
. You can directly edit or add to these files and submit a Pull Request as described above.
To preview your changes on your local machine, you’ll need to install Jekyll and Ruby using these instructions (you don’t have to know how to program in Ruby, just install it).
You can then preview your changes by running cellxgene/docs$ bundle exec jekyll serve
and navigating to the url indicated in the terminal.


Her husband was killed while working for a coal mining company. The company owned her house and would soon be forcing her out to make room for her spouse’s replacement.
It was the late 1920s, and the U.S. would soon be in the grips of the Great Depression. In the years that followed her husband’s death, the widow cleaned houses and washed clothes to keep food on her kids’ table. The family’s story is one of resilience, love and hope.
If it wasn’t for Suzi Whaples, however, all of those great and terrible memories might have been forgotten. Whaples is the widow’s granddaughter and has traveled the country recounting her family’s story. She’s part of a growing movement of storytelling in Appalachia.
“It’s slowly getting to the point where young people of today can’t relate to that kind of lifestyle at all ... but what they can relate to is the humanity of the story.”-Suzi Whaples, storyteller
“I can have you laughing one minute and wiping your tear the next,” Whaples said.
Almost all of Whaples’ stories center around her family. Her journey to storytelling began at a young age when her Aunt Louise told her about growing up in Depression-era West Virginia.
“Such poverty you’ve never seen,” Whaples recalled.
But her stories don’t focus on her family’s poverty. Instead, Whaples hones in on the human elements of their stories. One of the stories is about her grandmother sewing a patchwork coat for her Aunt Louise in order to keep warm as she walked to school.
The patchwork coat story deals with themes of love and bullying. After she told the story at a recent event in Chillicothe, children ran up to her to say how much they loved it. For Whaples, the stories are more than just her family’s history: She views her storytelling as a way to preserve and celebrate the region’s coal mining heritage.
Memories from the mountains
“Do you know what a coal tipple is?”
Whaples had mentioned the word as she told her family’s story. Her grandfather was killed on a coal tipple more than 90 years ago. Tipples were usually wooden structures that housed conveyor belts to load coal onto trains.
Those structures used to dot the landscape of Southeast Ohio and West Virginia, but as the region’s coal industry has disappeared, so have the tipples.
Whaples uses the word often in her stories. But as she told stories to a crowd at the Southern Ohio Storytelling Festival in Chillicothe, Whaples realized that many younger audience members didn’t know what she was talking about when she said “tipple.”
It was a reminder that the past is getting more and more distant, Whaples said. Still, she was happy to teach her audience more about the history of coal mining in the region.
“It’s slowly getting to the point where young people of today can’t relate to that kind of lifestyle at all,” Whaples said. “But what they can relate to is the humanity of the story.”
Preserving West Virginia’s coal mining heritage has always been one of Whaples’ goals with storytelling. She began her professional storytelling in the 1990s for a library she was working at in West Virginia. Her group, The Mountain Women, eventually won a national award in Jonesborough, Tennessee.
When her touring partner had to quit storytelling for personal reasons, Whaples realized she wasn’t ready to stop telling tales. That’s when she started recounting the stories her Aunt Louise told her.
“It’s a wonderful thing to do, especially if you’re sharing things of your own life,” she said.
Storytelling has been spreading throughout Appalachia in recent years, with festivals being held across the region. In Ohio, Chillicothe storyteller Thomas Burnett founded the Appalachian Ohio Storytelling Project to bring storytellers from around the area together.
While many storytellers have been recounting stories for many years, some have only recently discovered the craft. Mike Kubisek started telling stories after he met Burnett about five years ago.
Learning Appalachian tales has been an educational experience for Kusbisek. Although he lives in a rural part of Athens County, he’s originally from New England. Kubisek said storytelling has taught him about the region’s culture.
“I’ve learned a lot of stories that are Appalachian in nature,” Kubisek said. “There are old stories, and frequently I retell them or I add my own twists to them.”
Appalachian stories can sometimes offer surviving accounts of what life was like for coal miners in the region, Ohio University Political Science professor Barry Tadlock said. Tadlock, an expert on Appalachia, noted that there is often a lack of primary sources when it comes to everyday life in the region’s mining towns.
“Given the absence of a traditional journal, (storytelling) functions that way,” Tadlock said.
Tadlock noted that many Appalachian stories derive from the diverse cultures of the miners who came to the region for work. Those stories live on in the region and across the globe to this day.
A worldwide story
Judi Tarowski discovered storytelling when she was searching for a childhood pen pal. Tarowski had once visited her friend in Wales, but the two had lost touch as they grew older.
When Tarowski finally managed to contact her old friend, she found out the woman was now a touring storyteller in the United Kingdom. The exchanged emails eventually turned to in-person visits, and it was during one of those visits that her former pen pal encouraged her to become a storyteller.
Tarowski, who has lived in western Pennsylvania, Ohio and West Virginia her entire life, has now been telling stories for nearly 11 years. As she learned Appalachia’s stories, she discovered many similarities with the Welsh stories her friend told.
Many Welsh immigrants came to the area around Gallipolis in the early 1800s, Tarowski said, and they brought their culture and stories with them to the area. Tarowski said stories like those are a way to preserve and celebrate culture for Welsh people across the globe.
“It’s a sharing of stories, and it’s a sharing of culture,” Tarowski said.
Storytelling is a universal form of communication. Tarowski pointed to various cultures across the globe with rich stories. The native people of Australia have designated storytellers to keep their history; Native Americans also passed down stories as a way to preserve their history.
“For centuries, us Lakota have carried our past through oral tradition, as we call it,” Tristan Picotte wrote for the Partnership With Native Americans. “These stories tell the origin of entire nations, why animals looked or acted the way they did, and where or how entire cultural traditions originated.”
As Kubisek has studied stories from Appalachia and across the globe, he, too, has found many parallels between cultures. He said many stories are similar in cultures that might seem distant, with little twists added based on geography and history.
For Kubisek, it’s evidence of the way humans communicated before writing and carving were widespread.
“Before we were writing things, we were telling stories,” Kubisek said. “That’s how we passed on our history and how we passed on our culture.”
‘Worth more to them than silver or gold’
The event in Chillicothe was a special one for Whaples. She was making a comeback after a hiatus to take care of her husband.
Telling her story is incredibly important to Whaples, and she encourages others to pass their stories on as well. Even if no one is willing to listen, Whaples said, people should record their stories for future generations.
“If you don’t do anything else, tell your story,” Whaples said. “Record it and save it. I promise you that someday your voice in that recording, telling a story about your life, will be worth more to (your family) than silver and gold.”
Kubisek has seen a growing community of young people getting involved with storytelling. He said he’s worked on storytelling with a boy who’s only about 12 years old and added that there are storytelling groups from Columbus comprised entirely of younger people.
He also stressed that anyone, regardless of their background, can become a storyteller.
“Anybody can tell stories,” Kubisek said.  I promise you that someday your voice in that recording, telling a story about your life, will be worth more to (your family) than silver and gold.”-Suzi Whaples, storyteller
Whaples thinks that storytelling will continue regardless of technological changes or changes in society. While younger audiences might not be able to relate to the company town lifestyle her family lived so many years ago, she said they will always be able to relate to the love and humanity in her stories.
“How many of us would give everything we have to spend five more minutes with our grandparents and say ‘Please, tell me a story?’” Whaples asked. “I’m telling you, it’s eternal.”


I have a solid development background using following technologies: Jave Enterprise, Web (HTML and javascript), Python, C++, Web Services, BPEL, Business Integration (EAI). Now, I'm involved in customer facing activities to evangelize about Red Hat Business Automation portfolio, deliver Demonstrations and Seminars, implement Proof of Technology and Proof of Concept.
My main expertise is Business Process Management and Decision Management, but I even follow and advise on related matters: Enterprise Architecture, Mobile Development, Service Orientation, Connectivity, Social Computing and Collaboration facilities. Specialties: I work in a Sales organization as Specialist Solution Architect for the EMEA Region. I came across multiple sectors: banking, insurance, oils company, distribution, aeronautical.
Down you can find my accounts on the major social networks. Feel free to contact me! (Yes, I missed Facebook...)


Data is the new oil? No: Data is the new soil
Follow me: | | |
© 2018 Elliot Kim. This work is liscensed under CC BY-NC 4.0.
Powered by jekyll


GTS Audio Conferencing Service
Quick Reference Guide
Conference Invitations
Your participants need to know:
- Date & time of the conference
- Dial in phone numbers - include both the local 613 and tool-free numbers
- Conference ID (7-digit access code)
Beginning a Conference
As the Moderator:
- Call either the local or toll-free number associated with your account
- Select your language
- Enter your Conference ID followed by the # (pound key)
- Press * (star key), then enter your Moderator PIN
- Press 1 to start or join your conference, or press 2 to change account options (like disabling Entry & Exit tones)
Top Star Touch Features
|
Available to Moderator |
|---|---|
|
Available to Everyone |
Fun Fact: When all lines are muted by the Moderator, participants can still speak by pressing *7 to unmute!
Conferencing Tips during COVID-19
- Use a landline phone, instead of your cellular phone
- Start meetings on quarter hours, instead of on the hour or half-hour
- When possible, schedule meeting outside of peak hours;
- Before
- to
- after
- Use the local 613 number to connect whenever possible
- If unable to connect via the local number, try the toll-free number
Update account information or add a Webex account with the GTS Change request from:
http://www.gocconference.com/accounts/?lang=en


--- layout: archive header: overlay_image: splash2.jpg caption: "Photo credit: [**Unsplash**](https://unsplash.com)" permalink: /categories/ title: "Posts by Category" author_profile: true --- {% include base_path %} {% include group-by-array collection=site.posts field="categories" %} {% for category in group_names %} {% assign posts = group_items[forloop.index0] %}


---
layout: page
title: News
header: Posts By Category
parent: news
group: news
weight: 5
js: news.js
css: news.css
permalink: /news_by_category/
---
{% include navigation/news_chooser.html %}
{% assign categories_list = site.categories %}
{% include JB/categories_list %}
{% for category in site.categories %}
{{ category[0] | join: "/" }}
{% assign posts_list = category[1] %}
{% include JB/posts_collate %}
{% endfor %}


Play tic tac toe online with your friend. You can create a private board where you can play unlimited number of games.
To play with your friends, simply share the above link via WhatsApp, Skype, email or whatever you want!


WITNESS LIST Finance Committee March 3, 2003 - 8:00A Article I, Employees Retirement Sys ON: Anderson, Gary (Texas Public Employees Association), Austin, TX Beckett, Sheila Executive Director (Employees Retirement System), Austin, TX Norris, Robert Analyst (Legislative Budget Board), Austin, TX Smith, Zelma Senior Analyst (Legislative Budget Board), Austin, TX Article III, Group Insurance Contri ON: Hassel, Steve Associate Vice Chancellor (Human Resources/Texas A&M University System) Norris, Robert Analyst (Legislative Budget Board), Austin, TX O'Connor, Caroline Legislative Director (Texas State Employees Union), Austin, TX Sarver, James Director - Employee Group Insurance (U.T. System), Austin, TX Stewart, Dan Ex. Director, Employment & Benefits (U.T. System) Wielmaker, John Analyst (Legislative Budget Board), Austin, TX Article III, Optional Retirement Pr FOR: Hempstead, Chuck Association Management (Texas Association of College Teachers), Austin, TX ON: Hempstead, Chuck Association Management (Texas Association of College Teachers), Austin, TX Norris, Robert Analyst (Legislative Budget Board), Austin, TX Article III, Teacher Retirement Sys ON: Dunlap, Charles Executive Director (Teacher Retirement System), Austin, TX Jung, Ronnie Deputy Director (Teacher Retirement System), Austin, TX Lehr, Mike Legislative Coordinator (Texas Retired Teachers Association), Austin, TX McDonald, Wade Senior Analyst (Legislative Budget Board), Austin, TX Norris, Robert Analyst (Legislative Budget Board), Austin, TX Registering, but not testifying: On: Sayers, DeEtta Retired Teacher (Texas Retired Teachers Association) Wallace, Margaret Retired AISD Teacher (Texas Retired Teacher Association), Austin, TX Article III, Telecommunications Inf FOR: Altmiller, Eileen Librarian (Self), Buda, TX McDonald, Carol Association Executive (Independent Colleges & Universities of Texas), Austin, TX Meraz, Gloria Goverment Relations, Librarian (Texas Library Association), Austin, TX Meraz, Gloria Government Relations/Librarian (Texas Library Association), Austin, TX ON: Jameson, Arlen D. Executive Director (Telecommunications Infrastructure Board), Austin, TX McGeady, John Analyst (Legislative Budget Board), Austin, TX Registering, but not testifying: For: Martin, Paul School Board Member/Technology Dir. (Santa Anna ISD, Coleman ISD), Coleman, TX On: Duffey, Delia Deputy Director (Telecommunications Infrastructure Fund), Austin, TX Fitzsimons, Blair Chairman (Telecommunications Infrastructure Board), San Antonio, TX Johnson, Steven Legislative Liaison (Telecommunications Infrastructure Board), Austin, TX Latham, Wendy Special Assistant to Ex. Director (Telecommunications Infrastruction Bd.), Austin, TX Powel, Martin State Employee (Telecommunications Infrastructure Board), Austin, TX Article III, Texas Education Agency FOR: Covington, Dr. Veronica Librarian (Self) Lara, Rene Legislative Liaison (Texas Federation of Teachers), Austin, TX ON: Alanis, Dr. Felipe Commissioner (Texas Education Agency), Austin, TX Anderson, David Lawyer (Texas Education Agency), Austin, TX Caro, Jack Legislative Liaison (Comptroller of Public Accounts), Austin, TX Case, Karen (Texas Education Agency) Faulkner, Charles Education Administrator (Windham School District), Huntsville, TX Gregg, Brock Public Education Advocate (ATPE) Hollingsworth, Lonnie Attorney (Texas Classroom Teachers Association), Austin, TX Hoppe, Bill Director, Agency Infrastructure (Texas Education Agency), Austin, TX Hurt, William Investment Advisor/Investment Banking (Communities In Schools), Houston, TX McGeady, John Analyst (Legislative Budget Board), Austin, TX Monroe, Bill CPA, Chief of Operations (Texas Education Agency), Austin, TX Morrow, Mike Superintendent (Windham School District) Parks, Ursula Manager (Legislative Budget Board), Austin, TX Smisko, Ann Associate Commissioner (Texas Education Agency), Austin, TX Timmins, Holland Acting Executive Administrator (Permanent School Fund) Watkins, Joe Bill Attorney/Lobbyist (Association of American Publishers), Austin, TX Wisnoski, Joe Assistant Commissioner (Texas Education Agency), Austin, TX Registering, but not testifying: For: Altmiller, Eileen Librarian (Self), Buda, TX On: Cochran, Phillip Director, Education Service Center (Texas Education Agency), Austin, TX Flathouse, Ed Educator (Texas Education Agency), Austin, TX McMichael, Ron Deputy Commissioner (Texas Education Agency), Austin, TX Rawson, Brian Chief Information Officer (Texas Education Agency), Austin, TX


Tenants living in squalid conditions in New Jersey building call temporary fixes unacceptable
by WABCNEWARK, New Jersey (WABC) -- Tenants forced to vacate a mold and rodent-infested apartment building with no heat are receiving some temporary relief.
The new property owners of the Stratford Place public housing building have struck a deal with the city to clean things up before moving tenants out.
But for the people who live there, it's shot of a total victory - residents say the temporary fixes are unacceptable.
The tenants were initially going to have to vacate the dilapidated building by 5 p.m. Thursday after the city condemned the building.
Residents showed Eyewitness News the horrid conditions that they have endured for years: Mold, no heat, holes in the wall, stairs falling apart, exposed wires and missing smoke detectors are just some of the issues.
In court on Thursday, the city made an agreement with the new owners to try to make conditions at least livable until the families can be moved to other locations while the building undergoes an 18-month renovation.
The owners' attorney, Elnardo Webster, said the new owners just acquired the building a couple weeks ago and it was the previous owners who failed to bring it up to code.
He said his clients had to take ownership or lose their investment.
Work is being done, but tenants question if they can continue to have their families in the building, even with the attempt to bring it at least up to code.


The Media Session API plugin for wavesurfer.js allows you to customize media notifications by providing metadata for the media your web app is playing. It also allows you to handle media related events such as seeking or playback which may come from notifications or media keys.
Note: this plugin only works in Chrome 57 and newer (Firefox is working on it).
WaveSurfer
instance and supply an object for the metadata
propertyMediaSession
instance| Name | Required | Default | Description |
|---|---|---|---|
wavesurfer |
yes | A WaveSurfer instance. | |
metadata |
yes | A MediaMetadata object: a representation of the metadata associated with a MediaSession that can be used by user agents to provide customized user interface. |


PART IX. DIRECTORS AND OFFICERS
A. Board of Directors
[§414-191] Requirement for and duties of board of directors. (a) Except as provided in section 414-163, each corporation must have a board of directors.
(b) All corporate powers shall be exercised by or under the authority of, and the business and affairs of the corporation managed under the direction of, its board of directors, subject to any limitation set forth in the articles of incorporation or in an agreement authorized under section 414-163. [L 2000, c 244, pt of §1]