4/15 email
To the CSI Faculty and Staff: FACULTY MEMO
Dear Faculty, We hope this message finds you and your family members safe and well. As we move to “distance learning” for the rest of the semester, the Center for Student Accessibility (CSA) would like to remind you about the importance of compliance with the Americans with Disabilities Act (ADA) as it relates to online classwork and exams. Please remember accessibility is mandated by law under the Americans with Disabilities Act and Rehabilitation Act to make certain that all courses meet accessibility standards. This must remain top priority during this time of “distance learning.”
While the implementation of these measures for accessibility may be confusing or seem difficult, there are online guides and videos regarding Blackboard, links to which may be found below. Please also feel free contact our office at<PHONE_NUMBER> and leave a message or e-mail us at<EMAIL_ADDRESS>CSA staff will respond promptly.
Exam Accommodations Creating exceptions and adjusting time limits – Some students who are allowed extended time on tests (as per their documentation) can take tests on Blackboard. There is a timer feature in Blackboard that can be used to ensure that they receive the extended time they require without going over the amount of extended time that their documentation allows. For information on how to do this click on this link: Exceptions and timing in Blackboard
Materials and Exams Make certain your Blackboard site and posted materials are all accessible. Can a screen reader program read your Word files? Are your PDFs searchable? Learn about how to make your Word, Excel, PowerPoint and PDF documents accessible. This “Universal Design in Learning” link will show you how with links to individual guides and tutorials. This resource contains all you need to know about making your posted materials on Blackboard accessible click the link below: Universal Design in Learning
Video Course Content Any video content, whether pre-recorded or live-streamed, must be captioned for students with hearing impairments. If providing captions is not practical or possible, please provide a transcript of the video. The Center for Student Accessibility can also assist in getting videos captioned. Automatically generated captions are NOT a reliable alternative. For captioning guidelines, please click: Captioning Videos
When using Skype or other live-streaming options for your course lectures please keep in mind that a transcript must be provided for students who are deaf or hard of hearing. For best practices it is best to give access to the Skype or streaming service to a Sign Language Interpreter or a CART (Communication Access Realtime Translation) Provider. For this service, contact CSA or your department chair.
Using Platforms Outside of Blackboard Some departments utilize platforms that are more conducive to their programs when lecturing or giving exams. It is important that these platforms are accessible to students with disabilities. Some features of these other platforms such as “lockdown browsers” feature are not accessible to students with disabilities, therefore much of their assistive technology programs will not be compatible. In this case it is important to work with CSA to find alternatives.
We appreciate your cooperation in creating accessible instruction options for our students, and for your continued dedication to ensuring the success of our students in these trying and uncertain times. If you have questions or concerns, please feel free to contact our office at<PHONE_NUMBER> and leave a message or e-mail us at<EMAIL_ADDRESS>Thank you,
Center for Student Accessibility College of Staten Island City University of New York 2800 Victory Boulevard Staten Island, NY 10314<PHONE_NUMBER><EMAIL_ADDRESS>www.csi.cuny.edu/csa
Stefan Charles-Pierre, CRC Director, Center for Student Accessibility College of Staten Island City University of New York 2800 Victory Boulevard Staten Island, NY 10314<EMAIL_ADDRESS>(718) 982-2697<PHONE_NUMBER> Fax www.csi.cuny.edu/csa


The data source
The data source for these graphs is a report called University of California Revenue and Expense Trends (Fiscal Years 2008 through 2012) which was prepared by the UC Office of the President (UCOP). Amounts displayed in the graphs are in thousands of dollars.
The technology
These interactive graphs were made using an excellent javascript charting library called dc.js, which was built to work natively with crossfilter and leverages the super awesome d3.js.


In this digital age of music, album art often gets the cold shoulder. This site is a tribute to the those album cover artists who put the albums we love in the perfect wrapping paper. Add your favorite covers and artists below.


--- layout: post title: "morning lyrics" comments: true ---
There was a game we used to play
we would hit the town on Friday night
and stay in bed until Sunday.
We used to be so free
We were living for the love we had
and living not for reality


You are viewing an historical archive of past issues. Please
report new issues to the appropriate project issue tracker on
GitHub.
Comments
-
Greg Hurrell
Nope, you did the right thing filing the feature request here. Growl support is already slated for Synergy Advance, but I'll see what I can do for Synergy.
-
Greg Hurrell
- ** Bug 80 has been marked as a duplicate of this bug. ***
-
Greg Hurrell
Implemented in 1.7.
-
Greg Hurrell
Marking as CLOSED.
Add a comment
Comments are now closed for this issue.


New Delhi, IN
Tue, 5 Mar 2019
Jaipur, IN
Tue, 26 Mar 2019
Operator :
Mahalaxmi Travels (RJ)
(AC Seater-Sleeper (2 + 2))
Boarding Point & Time :
Hare Rama Travels (1945-46 Jat Fauji Dharamshala)
02:30 PM
Seat no(s) :
L9 , L13
Onward Fare
You Pay :
111,338


Posted by February 1, 2017
onI'm very pleased to announce that Packt has published Learning Aurelia [https://www.packtpub.com/web-development/learning-aurelia] by long-time Aurelia community member Manuel Guilbault [http://manuelguilbault.com]. In conjunction with the book release, Manuel put together a short excerpt from the book, which I'm sure the whole community will enjoy. Read on to learn more about Aurelia from Manuel and don't forget to pick up your copy today [https://www.packtpub.com/web-development/learning-aurelia].
Posted by January 18, 2017
onToday, I'd like to introduce you to Tomas Billborn, from Nordic Cinema Group, to tell you a little bit about their experience with Aurelia.
Posted by January 12, 2017
onThis week's releases contain the usual bug fixes as well as a few performance enhancements. Additionally, a couple of new features have landed.
Posted by January 2, 2017
on2017 is going to be a great year for Aurelia and her community. With continued adoption by startups, the enterprise and many industries, we're seeing amazing growth every week. As always, our team is working hard and we've got some great things planned for 2017. Read on to see what we're working on now.
Posted by December 24, 2016
onAs always, we continue to make improvements to Aurelia. Below is a list of changes in this week's set of updates.
Posted by December 14, 2016
onPlease let me introduce Sean Landsman, a developer on ag-Grid to share what he's been working on. Sean, take it away...
Posted by December 8, 2016
onWe've had a huge set of releases this week, including everything from bug fixes, to performance improvements, new features and fundamentals work that prepares the way for what's next. The full details are below...


API Reference#
This is the reference for classes (CamelCase
names) and functions
(underscore_case
names) of Braindecode.
Classifier#
braindecode.classifier
:
|
Classifier that does not assume softmax activation. |
Regressor#
braindecode.regressor
:
|
Regressor that calls loss function directly. |
Models#
braindecode.models
:
|
Shallow ConvNet model from Schirrmeister et al 2017. |
|
Deep ConvNet model from Schirrmeister et al 2017. |
|
EEG Inception. |
|
EEG-ITNet: An Explainable Inception Temporal |
|
EEGNet model from Lawhern et al. 2016. |
|
EEGNet v4 model from Lawhern et al 2018. |
|
Hybrid ConvNet model from Schirrmeister et al 2017. |
|
Residual Network for EEG. |
|
Temporal Convolutional Network (TCN) from Bai et al 2018. |
|
Sleep staging architecture from Chambon et al 2018. |
|
Sleep staging architecture from Blanco et al 2020. |
|
Sleep Staging Architecture from Eldele et al 2021. |
|
Sleep staging architecture from Perslev et al 2021. |
|
Thinker Invariance DenseNet model from Kostas et al 2020. |
|
Returns shape of neural network output for batch size equal 1. |
|
Apply module on multiple windows. |
Training#
braindecode.training
:
|
Compute Loss after averaging predictions across time. |
|
Compute Loss between timeseries targets and predictions. |
|
Class to compute scores for trials from a model that predicts (super)crops. |
|
Class to compute scores for trials from a model that predicts (super)crops with time series target. |
|
Epoch Scoring class that recomputes predictions after the epoch on the training in validation mode. |
|
Implements loss for Mixup for EEG data. |
|
Assigning window predictions to trials while removing duplicate predictions. |
|
Create trialwise predictions and optionally also return trialwise labels from cropped dataset given module. |
Datasets#
braindecode.datasets
:
|
Returns samples from an mne.io.Raw object along with a target. |
|
A base class for concatenated datasets. |
|
Returns windows from an mne.Epochs object along with a target. |
|
A class for moabb datasets. |
|
High-gamma dataset discribed in Schirrmeister et al. 2017. |
|
BNCI 2014-001 Motor Imagery dataset. |
|
Temple University Hospital (TUH) EEG Corpus (www.isip.piconepress.com/projects/tuh_eeg/html/downloads.shtml#c_tueg). |
|
Temple University Hospital (TUH) Abnormal EEG Corpus. |
|
Sleep Physionet dataset. |
|
BCI competition IV dataset 4. |
|
Create a BaseConcatDataset of WindowsDatasets from X and y to be used for decoding with skorch and braindecode, where X is a list of pre-cut trials and y are corresponding targets. |
|
Create WindowsDatasets from mne.RawArrays |
|
Create WindowsDatasets from mne.Epochs |
Preprocessing#
braindecode.preprocessing
:
|
Create windows based on events in mne.Raw. |
|
Windower that creates sliding windows. |
|
|
|
Perform exponential moving demeanining. |
|
Perform exponential moving standardization. |
|
DEPRECATED: will be removed in 0.8.0. |
|
Applies multiple bandpass filters to the signals in raw. |
|
Apply preprocessors to a concat dataset. |
|
Preprocessor for an MNE Raw or Epochs object. |
Data Utils#
braindecode.datautil
:
|
|
|
Load a stored BaseConcatDataset of BaseDatasets or WindowsDatasets from files. |
Samplers#
braindecode.samplers
:
|
Base sampler simplifying sampling from recordings. |
|
Sample sequences of consecutive windows. |
|
Sample examples for the relative positioning task from [R0467437a2408-Banville2020]. |
|
Balanced sampling of sequences of consecutive windows with categorical targets. |
Augmentation#
braindecode.augmentation
:
|
Basic transform class used for implementing data augmentation operations. |
|
Identity transform. |
|
Transform composition. |
|
A base dataloader class customized to applying augmentation Transforms. |
|
Flip the time axis of each input with a given probability. |
|
Flip the sign axis of each input with a given probability. |
|
FT surrogate augmentation of a single EEG channel, as proposed in [Ra7c6c14d9bd9-1]. |
|
Randomly shuffle channels in EEG data matrix. |
|
Randomly set channels to flat signal. |
|
Randomly add white noise to all channels. |
|
Permute EEG channels inverting left and right-side sensors. |
|
Smoothly replace a randomly chosen contiguous part of all channels by zeros. |
|
Apply a band-stop filter with desired bandwidth at a randomly selected frequency position between 0 and |
|
Add a random shift in the frequency domain to all channels. |
|
Interpolates EEG signals over sensors rotated around the desired axis with an angle sampled uniformly between |
|
Interpolates EEG signals over sensors rotated around the Z axis with an angle sampled uniformly between |
|
Interpolates EEG signals over sensors rotated around the Y axis with an angle sampled uniformly between |
|
Interpolates EEG signals over sensors rotated around the X axis with an angle sampled uniformly between |
|
Implements Iterator for Mixup for EEG data. |
|
Identity operation. |
|
Flip the time axis of each input. |
|
Flip the sign axis of each input. |
|
FT surrogate augmentation of a single EEG channel, as proposed in [R52a4658fffa7-1]. |
|
Randomly set channels to flat signal. |
|
Randomly shuffle channels in EEG data matrix. |
|
Permute EEG channels according to fixed permutation matrix. |
|
Randomly add white Gaussian noise to all channels. |
|
Smoothly replace a contiguous part of all channels by zeros. |
|
Apply a band-stop filter with desired bandwidth at the desired frequency position. |
|
Adds a shift in the frequency domain to all channels. |
|
Interpolates EEG signals over sensors rotated around the desired axis with the desired angle. |
|
Mixes two channels of EEG data. |
Utils#
braindecode.util
:
|
Set seeds for python random module numpy.random and torch. |
Visualization#
braindecode.visualization
:
|
|
|
Generates a confusion matrix with additional precision and sensitivity metrics as in [R8046536b33dd-1]. |


Nehemiah 1:10
Now these are thy servants and thy people, whom thou hast redeemed by thy great power, and by thy strong hand.


Register
First Name:
Last Name:
Male
Female
Other
Email:
Password:
Birthday
Month
Feb
March
April
Day
2
3
Year
1995
1994
I agree to the terms and conditions
Submit


SUPER BANDA
A melhor Banda do mundo
Histria da Banda.. What is Lorem Ipsum? Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
CONTATO
| Cidade | Data | |
|---|---|---|
| Campinas-Sp | 31/07/2020 | (19)99565-2977 |


Arabesque is a student activity founded in 2011 that aims to help students increase their awareness, discover their talents and accept others. Also motivates them to play a vital role in developing their society using all their positive potentials.
Be a voice, not an echo!
One light lights another.


| Id | Name | Password | Started | Expired Date | Unix Time | Links | |
|---|---|---|---|---|---|---|---|
|
{{ client.id }}
|
{{ client.name }}
|
{{ client.email }}
|
{{ client.pwd }}
*****
|
{{ client.started | date:'longDate' }} | {{ client.expired | date:'longDate' }} | {{ (client.expired + 86400000)/1000 }} |
|


monitoR: Acoustic Template Detection in R
Acoustic template detection and monitoring database interface. Create, modify, save, and use templates for detection of animal vocalizations. View, verify, and extract results. Upload a MySQL schema to a existing instance, manage survey metadata, write and read templates and detections locally or to the database.
| Version: |
1.0.7 |
| Depends: |
R (≥ 2.10), tuneR, methods |
| Imports: |
graphics, grDevices, stats, utils |
| Suggests: |
fftw, parallel, RODBC, knitr |
| Published: |
2018-02-14 |
| Author: |
Sasha D. Hafner and Jon Katz, with code for the Fourier transform from the seewave package (by Jerome Sueur, Thierry Aubin, and Caroline Simonis), and code for the readMP3 function from the tuneR package (by Uwe Ligges). Therese Donovan provided creative direction and database design support. |
| Maintainer: |
Sasha D. Hafner <sdh11 at cornell.edu> |
| License: |
GPL-2 |
| URL: |
http://www.uvm.edu/rsenr/vtcfwru/R/?Page=monitoR/monitoR.htm |
| NeedsCompilation: |
no |
| Citation: |
monitoR citation info |
| Materials: |
README NEWS ChangeLog |
| CRAN checks: |
monitoR results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=monitoR
to link to this page.


Puppy frightened of fireworks dies from heart attack ahead of Bonfire Night
Devastated South Yorkshire dog owner Susan Paterson issued a warning after the tragic death of her puppy
by Saffron OtterA pet owner claims her puppy has 'died of fright' caused by the loud noise of fireworks.
Molly suffered a heart attack triggered from 'loud bangs going off' over the weekend, her owner claimed.
The tiny terrier died just days before Bonfire Night, the Manchester Evening News reports.
Eighteen-week-old terrier Molly's death comes as a debate rages over whether fireworks sales either side of the Guy Fawke's celebrations should be limited - or even banned.
Many pet owners have been pleading for a crackdown on personal fireworks sales, saying the noise terrifies their pets and can even cause them to injure themselves.
Susan Paterson shared photos of the pup with her alarming message to the public Facebook group - Wombwell wise - which covers the area in Barnsley, South Yorkshire.
The post has since been shared 63,000 times.
In her devastating message, Susan calls for people to support the FAB (Firework Abatement Campaign) and to sign the petition against random fireworks.
On Sunday night, she said: "Due to the enormous amount of fireworks with loud bangs going off around Wombwell and lower Darfield last night, we lost a young terrier with a heart attack.
"Please think of the animals. Molly was only 18 weeks old and died of FRIGHT caused by fireworks.
"Please support FAB Anti Random Fireworks page and sign their petition".
The post has since accumulated a huge response, prompting Susan to post: "Thanks for all your comments. We are still trying to make sense of what happened. Dreading the fireworks again tonight."
The Change.org petition has so far 496,099 signatures - and counting.
Julian Doorne, who started the petition, said: "Fireworks can cause serious distress to animals. They don’t only suffer psychologically, but also physically as many attempt to run away from, or hide from, the bangs.
"With extreme noise levels and people being able to let off fireworks any time of year, it’s difficult for those who care for animals to be able to put measures in place to protect their animals.
"I’m calling for an urgent review of firework regulations to further restrict their use, as a step to preventing needless animal suffering."
Last month Sainsbury's chose to ban the sale of fireworks entirely, while other supermarkets this year are selling 'low-noise' fireworks .
RSPCA advice on keeping pets secure during fireworks:
- Give your cat or dog somewhere to hide which they can access at all times - maybe under furniture or in a quiet corner.
- Walk dogs during daylight hours and keep dogs and cats indoors when fireworks are likely to be set off.
- At nightfall, close windows and curtains - put on calming music such as Classic FM to mask the sound of fireworks.
- Make sure your pet can’t escape if there’s a sudden noise, and remember to make sure your pets are microchipped and keep your microchip details up to date.
- Never punish your pets when they are scared as this will only make things worse in the long run.
- It’s fine to comfort your pet if it helps them relax, or leave them alone unless you think they will harm themselves.


You are successfully connected to the conference bridge You can invite other people to join the conference by sharing conference link


BN_BLINDING_new(3)
BN_BLINDING_new, BN_BLINDING_free, BN_BLINDING_update, BN_BLINDING_convert,
BN_BLINDING_invert, BN_BLINDING_convert_ex, BN_BLINDING_invert_ex,
BN_BLINDING_get_thread_id, BN_BLINDING_set_thread_id,
BN_BLINDING_thread_id, BN_BLINDING_get_flags, BN_BLINDING_set_flags,
BN_BLINDING_create_param - blinding related BIGNUM functions.
#include <openssl/bn.h>
BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai,
BIGNUM *mod);
void BN_BLINDING_free(BN_BLINDING *b);
int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b,
BN_CTX *ctx);
int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
BN_CTX *ctx);
#ifndef OPENSSL_NO_DEPRECATED
unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
#endif
CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *);
unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
BN_MONT_CTX *m_ctx);
BN_BLINDING_new() allocates a new BN_BLINDING structure and copies the A and Ai values into the newly created BN_BLINDING object.
BN_BLINDING_free() frees the BN_BLINDING structure.
BN_BLINDING_update() updates the BN_BLINDING parameters by squaring the A and Ai or, after specific number of uses and if the necessary parameters are set,
by re-creating the blinding parameters.
BN_BLINDING_convert_ex() multiplies n with the blinding factor A. If r is not NULL a copy the inverse blinding factor Ai will be returned in r (this is useful if a RSA object is shared among several threads).
BN_BLINDING_invert_ex() multiplies n with the inverse blinding factor Ai. If r is not NULL it will be used as the inverse blinding.
BN_BLINDING_convert() and BN_BLINDING_invert()
are wrapper functions for BN_BLINDING_convert_ex() and
BN_BLINDING_invert_ex() with r set to NULL.
BN_BLINDING_thread_id() provides access to the CRYPTO_THREADID
object within the BN_BLINDING structure. This is to help users provide proper locking if needed for
multi-threaded use. The ``thread id'' object of a newly allocated BN_BLINDING structure is initialised to the thread id in which
BN_BLINDING_new() was called.
BN_BLINDING_get_flags() returns the BN_BLINDING flags.
Currently there are two supported flags: BN_BLINDING_NO_UPDATE and
BN_BLINDING_NO_RECREATE. BN_BLINDING_NO_UPDATE inhibits the automatic update of the BN_BLINDING parameters after each use and BN_BLINDING_NO_RECREATE inhibits the automatic re-creation of the BN_BLINDING parameters after a fixed number of uses (currently 32). In newly allocated BN_BLINDING objects no flags are set. BN_BLINDING_set_flags() sets the BN_BLINDING parameters flags.
BN_BLINDING_create_param() creates new BN_BLINDING parameters using the exponent e and the modulus m. bn_mod_exp and
m_ctx can be used to pass special functions for exponentiation (normally
BN_mod_exp_mont() and BN_MONT_CTX).
BN_BLINDING_new() returns the newly allocated BN_BLINDING structure or NULL in case of an error.
BN_BLINDING_update(), BN_BLINDING_convert(),
BN_BLINDING_invert(), BN_BLINDING_convert_ex()
and BN_BLINDING_invert_ex() return 1 on success and 0 if an
error occurred.
BN_BLINDING_thread_id() returns a pointer to the thread id
object within a BN_BLINDING object.
BN_BLINDING_get_flags() returns the currently set BN_BLINDING flags (a unsigned long value).
BN_BLINDING_create_param() returns the newly created BN_BLINDING
parameters or NULL on error.
bn(3)
BN_BLINDING_thread_id was first introduced in OpenSSL 1.0.0, and it
deprecates BN_BLINDING_set_thread_id and BN_BLINDING_get_thread_id.
BN_BLINDING_convert_ex, BN_BLINDIND_invert_ex, BN_BLINDING_get_thread_id,
BN_BLINDING_set_thread_id, BN_BLINDING_set_flags, BN_BLINDING_get_flags and
BN_BLINDING_create_param were first introduced in OpenSSL 0.9.8
Nils Larsch for the OpenSSL project (http://www.openssl.org).
|


|
The site has moved to http://mussard.github.io/ |
|
|
Bastien Mussard ... Thesis |
Modelisation of London dispersion forces by Random Phase Approximation : methodological developments.(Modélisations quantochimiques des forces de dispersion de London par la méthode des phases aléatoires : développements méthodologiques.) Original manuscript: (lien) Reviewed manuscript: (pdf) (hal) (arxiv) (Last modified: 17 Nov. 2015) Defense: 2013.12.13 (pdf) Thesis committee
AbstractIn this thesis are shown developments in the random phase approximation (RPA) in the context of range-separated theories. We present advances in the formalism of the RPA in general, and particularly in the ''dielectric matrix'' formulation of RPA, which is explored in details. We show a summary of a work on the RPA equations with localised orbitals, especially developments of the virtual localized orbitals that are the ''projected oscillatory orbitals'' (POO). A program has been written to calculate functions such as the exchange hole, the response function, etc on real space grid (parallelepipedic or of the ''DFT'' type) ; some of those visualisations are shown here. In the real space, we offer an adaptation of the effective energy denominator approximation (EED), originally developped in the reciprocal space in solid physics. The analytical gradients of the RPA correlation energies in the context of range separation has been derived. The formalism developped here with a lagrangian allows an all-in-one derivation of the short- and long-range terms that emerge in the expressions of the gradient. These terms show interesting parallels. Geometry optimisations at the RSH+dRPA-I and RSH+SOSEX levels on a set of 16 molecules are shown, as well as calculations and visualisations of correlated densities at the RSH+dRPA-I level. |


14 oct 2018
Drake just admitted that he once wanted to start a family with Rihanna. “As life takes shape and teaches you your own lessons, I end up in this situation where I don’t have the fairy tale, like, ‘Oh, Drake started a family with Rihanna and this is like so perfect’…it looks so good on paper,” the rapper, 31, said during an interview with LeBron James and Maverick Carter on the new HBO series The Shop on Oct. 12. “By the way, I wanted that too at one time.” While Drizzy didn’t end up having kids with the “Wild Thoughts” singer, he did have a son with French artist and former adult film star Sophie Brussaux. In 2017, she gave birth to their son, Adonis, which Drake confirmed was his on his track, “March 14,” off his June 2018 album, Scorpion. “I have a son, he’s a beautiful boy,” he said as she showed LeBron a photo of the baby on his phone. “Crazy blue eyes, bro,” the NBA star responded. “Crazy blue eyes, baby blue eyes,” Drake said. “You know he’s already in the pool like shooting the basketball. He’s gonna get to a certain age, I’m gonna bring him right to ‘Bron’s house and I’ma be like, ‘Yo, summer camp at Bronny’s house!” The “God’s Plan” hitmaker also opened up about navigating co-parenting with someone he doesn’t really have a relationship with. “I am a single father learning to communicate with a woman who, you know, we’ve had our moments,” he said. “I do want to be able to explain to my son what happened.  Like, we have found ourselves in a situation and we are both equally responsible and now, like, I’m just really excited to be a great father.” Drake’s own upbringing and strained relationship between his own parents also influenced the way he approaches fatherhood. “Because I want [my son] to love his mother and I have to project that energy,” he said. “But I didn’t come from that. I came from my mother being like, ‘Nah, your dad is this.'”


Copyright (c) 2003 Tim Schutz
This game is played on a 4x4 square board:
|
If you use Reversi stones to play this game, condition (c) from endgame can be simplified: for each four in-a-row, keep one piece and return the other three to the common pool. When there are no more pieces to drop, condition (c) is true.
|
|
An example
The current player dropped a white stone at [1].
He made two four in-a-rows, but they share a stone (the marked stone at c2). So, the player must select only one of those to remove, earning one point. |
This game entered at the 2004 Shared Pieces Game Design Competition and was considered among the best entries.


Register
Please fill in this form to create an account.
Name
Email
Password
Register
Already have an account?
Sign in
.


Binary Tree Application: Binary Space Partitioning
Procedural container generation using Binary Space Partitioning
Binary Space Partitioning
Let’s take a step back from all of this theory and look at a cool application of a binary tree: binary space partitioning. I used binary space partitioning in my Roguelike Dungeoncrawler Game to create procedurally generated worlds. This means that each level (and indeed, each game) never has the same size or configuration of rooms.
In the demo above, each room configuration is generated with a single function call: there are no predetermined dimensions other than the container’s width and height constraints and a minimum child dimension. Pretty cool, right?
Binary space partitioning is a technique for recursively dividing a space subject to some constraints. In this case, the constraint is the width and height of the container, and the fact that we do not want containers to overlap (since they represent separate “rooms”). By creating Leaves which hold Containers inside of them, we are able to generate non-overlapping rooms with a specified amount of space between them (namely, the padding of the leaves that offsets the boundary of the containers).
Let’s make some leaves and containers.
All that the leaves and containers know about is an x and y position (of their upper-left corner) and a width and height. Leaves hold containers. Containers are the shapes that you see drawn on the screen.
Leaves have an x and y position and a width and a height. They also have a container (the structure within them that you see drawn), as well as a left and a right child. Thus, a leaf is an extension of the concept of a node in a binary tree with a few additional properties for this application.
We pad each container by a random amount, setting its width and height to between 70 and 90% of its enclosing leaf. Then, we set the x and y coordinates of the container within the leaf by assigning half the padding to the left & right coordinate. This has the effect of centering the container within each leaf.
We can draw a container just by defining a rectangle with its x and y coordinates and stroking it on an HTML5 canvas. This is a simple introduction to drawing shapes with canvas if you need a refresher.
const randomIn = (min, max) => Math.floor(Math.random() * (max - min)) + min;
let Container = function (x1, y1, x2, y2) {
this.x1 = x1;
this.y1 = y1;
this.x2 = x2;
this.y2 = y2;
};
let Leaf = function (x, y, width, height) {
this.x = x;
this.y = y;
this.width = width;
this.height = height;
this.left = null;
this.right = null;
this.container = null;
};
Leaf.prototype.addContainer = function () {
let width = Math.floor(randomIn(0.7, 0.9) * this.width);
let height = Math.floor(randomIn(0.7, 0.9) * this.height);
let xPos = Math.floor(this.x + (this.width - width) / 2);
let yPos = Math.floor(this.y + (this.height - height) / 2);
this.container = new Container(xPos, yPos, xPos + width, yPos + height);
};
Leaf.prototype.drawSelf = function (ctx) {
let C = this.container;
ctx.strokeStyle = "black";
ctx.strokeWidth = "2";
ctx.stroke();
ctx.strokeRect(C.x1, C.y1, C.x2 - C.x1, C.y2 - C.y1);
};
Now all we have to do is partition the space into non-overlapping leaves at the desired level of depth. We’ll do this in two steps. First, we have to define a splitLeaf
function for the leaves.
We choose whether to split the leaf vertically or horizontally. We do this based on a set proportion. If the width/height ratio is greater than or equal to 1.5 (so it’s a rectangle with, e.g., width>= 15 for height 10), we choose to split the container vertically. Otherwise, the container is either a square or taller than it is wide. In this case, we choose to split the container horizontally.
You can toggle the desired width/height ratio to get more vertical containers, more horizontal containers, or more square-like containers.
Once we choose the direction of split, we calculate the available space to partition in the chosen direction. If we are splitting horizontally (dividing with a horizontal line, somewhere in the y-coordinates of the container), we calculate the total height of the container. If we are splitting vertically, (dividing with a vertical line, somewhere in the x-coordinates of the container) we calculate the total width of the container.
If the total width or height available is less than the minimum leaf size*2, we return false (it’s not possible to create the container). Otherwise, we pick a random split point that is between the minimum leaf size and the maximum available space minus the minimum leaf size. This means that we ensure that each container has at a minimum minLeafSize
, and at a maximum max-minLeafSize
.
Once we’ve determined that we have the horizontal or vertical space available to make the split, we set the leaf’s left and right children to the two new leaves.
If we split vertically, both new leaves share the same height, and their width is partitioned into [0, splitLoc]
and [splitLoc, this.width-splitLoc]
.
If we split horizontally, both new leaves share the same width, and their heights are partitioned into [0, splitLoc]
and [splitLoc, this.height-splitLoc]
.
Leaf.prototype.splitLeaf = function () {
let splitVertical;
if (this.width / this.height >= 1.5) {
splitVertical = true;
} else {
splitVertical = false;
}
let max = (splitVertical ? this.width : this.height) - minLeafSize;
if (max <= 2 * minLeafSize) {
return false;
}
let splitLoc = randomIn(minLeafSize, max - minLeafSize);
if (splitVertical) {
this.left = new Leaf(this.x, this.y, splitLoc, this.height);
this.right = new Leaf(
this.x + splitLoc,
this.y,
this.width - splitLoc,
this.height
);
} else {
this.left = new Leaf(this.x, this.y, this.width, splitLoc);
this.right = new Leaf(
this.x,
this.y + splitLoc,
this.width,
this.height - splitLoc
);
}
return true;
};
Finally, we define a function that will recursively traverse all the leaves of a given leaf and return an array of their children. We’ll use this later on the root leaf of our container to gather up all the leaves so that we can draw them.
Leaf.prototype.getLeafs = function () {
return !this.left && !this.right
? [this]
: [].concat(this.left.getLeafs(), this.right.getLeafs());
};
Using the code we wired up
Now that we have a container class and a leaf class with a leaf splitting function, all that we have to do is call the function. We’ll wrap it in a redrawCanvas
method so that we can call it repeatedly with setInterval
to randomly generate a new board.
Generating a board from the classes we’ve defined is pretty simple.
First we define some constants: the max width and height, a minimum leaf size, and the desired number of leaves.
Then, we define a root leaf that contains all the space available for partitioning.
Finally, we call splitLeaf()
on the left and right child of every element in our leaf tree that has not yet been split (for which both leaf.left
and leaf.right
is null).
When the while loop exits, root
will contain the maximum number of possible leaves given our constraints.
If you were to log out the length of the leaves in each iteration, you’ll notice that it’s in the mid-to-high 500s. This is almost half of our desired number of leaves. The reason this happens is because there are conditions in our splitLeaf
method that return false if the leaf is not able to be split. This makes sense too if you consider the bounds of the board (700x420) and the minimum leaf size. It’s actually impossible to have 1000 non-overlapping leaves of side dimension 10 on a board that’s 700x420 (you’d need minimally 1000x1000 available).
Once we have a root
element with all our leaves in it, we call getLeaves
to populate an array with all the leaves. For each leaf, we add a container (the inner parts you see drawn on the screen, padded out by our specified percentages). We then draw the container.
const gameWidth = 700;
const gameHeight = 420;
const minLeafSize = 10;
const desiredNumberOfLeaves = 1000;
function redrawCanvas() {
ctx.setTransform(1, 0, 0, 1, 0, 0);
ctx.clearRect(0, 0, gameWidth, gameHeight);
ctx.translate(0.5, 0.5);
// create leaves with containers
let root = new Leaf(0, 0, gameWidth, gameHeight);
let leafLitter = [root];
let didSplit = true;
while (didSplit) {
didSplit = false;
leafLitter.forEach((leaf) => {
if (leaf.left === null && leaf.right === null) {
if (leaf.splitLeaf() && leafLitter.length < desiredNumberOfLeaves) {
leafLitter.push(leaf.left, leaf.right);
didSplit = true;
}
}
});
}
// draw containers inside leaves
let leaves = root.getLeafs();
leaves.forEach(function (leaf) {
leaf.addContainer();
leaf.drawSelf(ctx);
});
}
And this code just sets up our canvas when the window loads and draws a new, procedurally generated canvas every second to the screen for your viewing pleasure.
window.onload = function () {
const cvs = document.getElementById("board");
const ctx = cvs.getContext("2d");
redrawCanvas(ctx);
setInterval(function () {
redrawCanvas(ctx);
}, 1000);
};
Next steps
If you wanted to use this code to generate a game, you’d still have to connect each space with hallways and make the coordinates navigable. However, with just a few lines of code, we’ve solved a pretty complex problem: subdividing a space into arbitrarily small, non-overlapping spaces.
This is an application where trees make a lot of sense to use: each child element is smaller and consists of some subdivision of its parent’s space. Imagine how hard it would be to keep track of all these elements if we didn’t have some sort of hierarchy to store them in. Who’s parents of who? How do we know how much space to allocate for each child?
Leveraging a binary tree structure allows us to easily achieve this task. Note that no collision detection was required to make sure the spaces are non-overlapping: with the binary subdivision algorithm, we get non-overlapping spaces for free.
Binary Space Partitioning can get even more complicated as it can be used to subdivide space in 3D to help render polygons in 3D graphics engines. Read more about them if you’re interested: they are pretty awesome tools that can serve a variety of purposes.
Why not fork the Codepen? Try planting your own tree and watch it grow!


| About Dailyrotten |
|
Feedback
If you like this page, hate it, or would like to suggest changes,
<EMAIL_ADDRESS>is listening. This page
is experimental and somewhat different from what we usually offer, so please
do send your feedback.
Adding Stories
If you are a rotten newshound and you would like to suggest a story,
visit our submit page to
send us the URL. Stories that are accepted will have your name credited.
Viewership
On the first full day this page went live, 100,000 people visited this Rotten
News page. Of course that was the day after the WTC attacks, so that number is
somewhat distorted. Right now this page gets between 50,000 and 75,000 people
every day.
Linking
We encourage everyone to link to this page; if you like it, others probably
will as well.
Other Rotten
Rotten
Gaping Maw
Celebrity Morgue
Mugshots
Rotten Store
Shockumentary
Rate My Poo
Rate My Kitten
Rate My Finger
Penny Postcards
Phallic
Dr. Sputnik
Boners
Dead Pool
NNDB
Home
Make Dailyrotten your start page
|
|
|
November 17, 2003
Animal groomer accused of bludgeoning pets
South Florida Sun-Sentinel | Submitted by: sTabby
"Brian Butler says he brought his 16-year-old poodle Spike to the shop last month for a haircut, and the next day his dog was dead from broken ribs and internal bruising. 'This is inexcusable, unforgivable,' said Butler, a Wilton Manors resident who said he has filed a police report. 'I brought my dog there for a nice bubble bath and haircut... Spike didn't deserve to die like that.' ... Butler said he was so distraught after Spike's death that he crawled into his dog's cage so he wouldn't forget the way his pet smelled."
|
|
Read article...
|
|
Correction: no link between Saddam and al Qaeda
defenselink.mil | Submitted by: Sans_A_Cause
The Pentagon has disavowed a recent story in The Weekly Standard purporting to document links between Saddam Hussein and al Qaeda: "News reports that the Defense Department recently confirmed new information with respect to contacts between al-Qaida and Iraq in a letter to the Senate Intelligence Committee are inaccurate... The classified annex was not an analysis of the substantive issue of the relationship between Iraq and al Qaida, and it drew no conclusions."
|
|
Read article...
|
|
Chopstick splinter removed from man's head
Wire Services | Submitted by: Terrin
"Malaysian surgeons treating a man for an eye infection said they were surprised to find part of a chopstick embedded in his face - the result of an assault five years ago. Doctors at a government hospital in the northern city of Ipoh said they found the section of a wooden chopstick lodged in tissue between his eyes during exploratory surgery to remove an unknown foreign object... the man, Ng Keng Choon, was lucky to be alive because the chopstick had been nudging against his brain... 'If the stick had gone another half-centimeter (0.2 inch) deeper, he could be dead.'"
|
|
Read article...
|
|
Girl allegedly kills brother John Carpenter style
pub.tv2.no | Submitted by: Tommy G
"The 14-year-old Danish girl, who allegedly attacked and killed her brother while he was sleeping in his bed, was most likely inspired by horror movies... The children's father woke up because of noise from his son's room. The sight that allegedly met the sleep-drunken father was his 14-year-old daughter sitting on top of her brother stabbing him with a bread knife. She was wearing a coveralls and a Halloween mask. The father tried to stop the attack, but the girl turned on him and he received several stabs to his head and arms. Before the man could react, the girl took off in the family’s car, a red Hyundai Pony. Danish police believes horror movies like Halloween may have inspired the girl. The girl was allegedly very interested in the occult, and according to her friends, she watched Halloween almost daily."
|
|
Read article...
|
|
Rush Limbaugh widely disliked
gallup.com | Submitted by: Arachnyd
"Radio talk-show host and commentator Rush Limbaugh is scheduled to return to his nationally syndicated show today. For the past five weeks, Limbaugh has been in a recovery program, after admitting to an addiction involving prescription painkillers... a new Gallup Poll conducted Nov. 10-12 shows that just 34% of Americans at this time hold a favorable view of Limbaugh, while 51% hold an unfavorable view."
|
|
Read article...
|
|
Utah mayor selected via dice roll
ksat.com | Submitted by: Cygnus 3
"Mark Allen won his third term as mayor of Washington Terrace, thanks to a roll of the dice. He and challenger Robert Garside tied in a Nov. 4 election with 724 votes each. According to Utah law, tie votes must be decided by drawing lots. Usually that means anything from flipping a coin to drawing a name out of a hat. But the city recorder said they felt that rolling dice was a more fair way to make a choice."
|
|
Read article...
|
|
Welcome back, banjo kid from Deliverance
Independent | Submitted by: hqm
"The acting career of Billy Redden has been somewhat quiet of late. In fact, he has not appeared in a film since his first and only role in 1972, when he made a memorable cameo performance as the banjo-playing child in Deliverance... Having been persuaded to come out of retirement by the director Tim Burton, Mr Redden, 47, will recreate his banjo-picking role in Big Fish."
|
|
Read article...
|
|
South American guillotine flies released in Florida
South Florida Sun-Sentinel | Submitted by: sTabby
"The Department of Agriculture is releasing South American phorid flies, a natural enemy of the fire ant, at the St. Lucie County International Airport.  The flies inject their eggs into the ants. When the eggs hatch, maggots crawl into the ant's head and grow, secreting a chemical that causes the ant's head to fall off. The maggot then eats everything in the head and uses it as a cocoon. Eventually, a fly emerges and hunts for another fire ant."
|
|
Read article...
|
|
Dyke kiss results in school suspensions
Planet Out | Submitted by: shauners
"A public same-sex kiss designed to call attention to discrimination against gay and lesbian students at a high school in Clarksville, Md., certainly got people talking; however, it also got the two students involved suspended... River Hill administrators suspended the two girls from school for two days. School officials said the girls were suspended because they disrupted the 'orderly operation' of the school. [What?] Haaser may also face disqualification from the National Honor Society."
|
|
Read article...
|
|
British restaurants selling ass curry
Guardian | Submitted by: Number-6
"When Sharwoods launched its latest product range earlier this month, it promised the 'deliciously rich' sauces based on a traditional northern Indian method of cooking would 'change the way consumers make curry.' ... What it failed to foresee was that bundh in Punjabi has an altogether less savoury meaning - the nearest English translation being, to put it bluntly, 'arse.'"
|
|
Read article...
|
|
|
|
|


That’s a typical situation. Imagine you’ve got one table
CREATE TABLE PUBLIC.TBUPSERTEXAMPLE
(
KEY1 CHARACTER VARYING(10) NOT NULL,
KEY2 CHARACTER VARYING(14) NOT NULL,
KEY3 CHARACTER VARYING(14) NOT NULL,
KEY4 CHARACTER VARYING(14) NOT NULL,
VALUE1 CHARACTER VARYING(20),
VALUE2 CHARACTER VARYING(20) NOT NULL,
VALUE3 CHARACTER VARYING(100),
VALUE4 CHARACTER VARYING(400),
VALUE5 CHARACTER VARYING(20),
CONSTRAINT TBUPSERTEXAMPLE_PKEY PRIMARY KEY (KEY1, KEY2, KEY3, KEY4)
)
And you need to update one record. You can perform a simple UPDATE statement but what happens the first time?
You cannot update the record basically because the record doesn’t exists. You need to create an INSERT statement instead. We can do it following different ways. You can create first a SELECT statement and, if the record exists, perform an UPDATE. If it doesn’t exists you perform an INSERT. We also can perform an UPDATE and see how many records are affected. If no records are affected then we perform an INSERT. Finally we can perform one INSERT and it it throws an error then perform an UPDATE.
All of these techniques works in one way or another but PostgreSQL gives us one cool way of doing this operation with one SQL sentence. We can use CTE (Common Table Expression) and execute something like this:
WITH upsert AS (
UPDATE PUBLIC.TBUPSERTEXAMPLE
SET
VALUE1 = :VALUE1,
VALUE2 = :VALUE2,
VALUE3 = :VALUE3,
VALUE4 = :VALUE4,
VALUE5 = :VALUE5
WHERE
KEY1 = :KEY1 AND
KEY2 = :KEY2 AND
KEY3 = :KEY3 AND
KEY4 = :KEY4
RETURNING *
)
INSERT INTO PUBLIC.TBUPSERTEXAMPLE(KEY1, KEY2, KEY3, KEY4, VALUE1, VALUE2, VALUE3, VALUE4, VALUE5)
SELECT
:KEY1, :KEY2, :KEY3, :KEY4, :VALUE1, :VALUE2, :VALUE3, :VALUE4, :VALUE5
WHERE
NOT EXISTS (SELECT 1 FROM upsert);
Since PostgreSQL 9.5 we also can do another technique to do this UPSERT operations. We can do something like this:
INSERT INTO PUBLIC.TBUPSERTEXAMPLE (key1, key2, key3, key4, value1, value2, value3, value4, value5)
VALUES ('key2', 'key2', 'key3', 'key4', 'value1', 'value2', 'value3', 'value4', 'value5')
ON CONFLICT (key1, key2, key3, key4)
DO UPDATE SET
value1 = 'value1',
value2 = 'value2',
value3 = 'value3',
value4 = 'value4',
value5 = 'value5'
WHERE
TBUPSERTEXAMPLE.key1 = 'key2' AND
TBUPSERTEXAMPLE.key2 = 'key2' AND
TBUPSERTEXAMPLE.key3 = 'key3' AND
TBUPSERTEXAMPLE.key4 = 'key4';
To help me writing this sentence I’ve created a simple PHP wrapper:
Here one example using PDO
use G\SqlUtils\Upsert;
$conn = new PDO('pgsql:dbname=gonzalo;host=localhost', 'username', 'password');
$conn->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION);
$conn->beginTransaction();
try {
Upsert::createFromPDO($conn)->exec('PUBLIC.TBUPSERTEXAMPLE', [
'KEY1' => 'key1',
'KEY2' => 'key2',
'KEY3' => 'key3',
'KEY4' => 'key4',
], [
'VALUE1' => 'value1',
'VALUE2' => 'value2',
'VALUE3' => 'value3',
'VALUE4' => 'value4',
'VALUE5' => 'value5',
]);
$conn->commit();
} catch (Exception $e) {
$conn->rollback();
throw $e;
}
And another one using DBAL
use Doctrine\DBAL\DriverManager;
use G\SqlUtils\Upsert;
$connectionParams = [
'dbname' => 'gonzalo',
'user' => 'username',
'password' => 'password',
'host' => 'localhost',
'driver' => 'pdo_pgsql',
];
$dbh = DriverManager::getConnection($connectionParams);
$dbh->transactional(function ($conn) {
Upsert::createFromDBAL($conn)->exec('PUBLIC.TBUPSERTEXAMPLE', [
'KEY1' => 'key1',
'KEY2' => 'key2',
'KEY3' => 'key3',
'KEY4' => 'key4',
], [
'VALUE1' => 'value1',
'VALUE2' => 'value2',
'VALUE3' => 'value3',
'VALUE4' => null,
'VALUE5' => 'value5',
]);
});
And that’s all. Library is available in my github and it’s also at packagist.


Viewing Hotmail customer service reviews
26 - 50 out of 763 << Previous ::
Next >>
I too am having trouble getting into my hotmail account. It asked to sign in and won't let me. I tried to reset the pass word and filled out the verification form and still I can not reset my password. When I click on the link to reset it it says microsoft account is temporarily not in service. That's now two days now!!! No one at Microsoft helps you as they say it is a hotmail problem and there is no live support for them even though they are now working with outlook which is a microsoft account. I can access my account only throuh my phone and ipad but not through my laptop. What the hell???!!! All my contacts and all my work is done through hotmail. Please, someone contact me at
insideoutfit 6/5/13 12:51PM
No number. No e-mail address. No way to reach a live person. I am the person that is the owner of my account and I can't get it working. I have completed 3 forms and still nothing. What else do I need to do? Please someone help me. I need help and don't know where to go!

Anonymous 6/2/13 4:04AM
sir
my id -
password not mind please request new password my new email id - send please .
Regards
Ravi Sharma
Ravi Sharma 5/29/13 12:26AM
YOOU NEED SOME TELEPHONE SERVICE TECH SUPPORT AND NOT JUST EMAIL.
I buy your products and would appreciate some free telephone support.
larry.walden74 5/22/13 9:25AM
I had no problem accessing my account this morning and now all of the sudden it claims their are others getting to my address. I followed the recomendations to reinstate my email with no luck. they provide no phone access for help. I will be using another email provider from now on. Microsoft sucks!!
 I cannot access my account or check email. The message I get is to have a code sent to my email account to access it so I can get into my email account. DUH! Is anyone intelligent in logic working there?
Does anyone know how to email customer service, or even better, change the foreign language computer I am on to English???
This whole frustrating episode makes me want to quit hotmail, outlook, or whatever else it is called. I hope the hotmail people realize KISS - Keep It Simple, Stupid. Not everyone is good with computers. At least have an obvious link to customer service, and how to change the language to English. This whole hotmail thing is a hot mess - this sucks!
Anonymous 5/9/13 1:10PM
Has anyone been able to solve this problem? I really would like my hotmail account back and usable. Help!! As you all know there is no help or customer service.
Ggvictor 5/8/13 1:30PM
what is the problem with hotmail? Wants me to change my password, changed to outlook which I do not like, I hate in in fact.
Now it wont let me open it. This is my email. I shouldnt have to fight it to see my own mail. I shouldnt be told to change my password. That is my business and no one else business. If I want a 8 letter password with no numbers and no upper case that is my business.
But I will not be told what to do with my own email!!
Anonymous 5/7/13 11:26PM
I have had Hotmail for over 10 years but now since last week its giveing me problem cannot open its want verifecation there only one option Email ID its allready close long time back plee give me my coad on my mobile phone my no is helpm me tomshortout my problem and have never had difficulty with it until it became Outlook. I used Hotmail just fine
Davinder Singh
Anonymous 5/7/13 11:17PM
I have had Hotmail for over 10 years and have never had difficulty with it until it became Outlook. I used Hotmail just fine on my Smart phone until Outlook took over. Now, I simply can not access my e-mail from my cell phone and I can not find any help either on-line or via telephone! I am ready to go to g-mail!!!! This is so frustratin. I have spent hours trying to get help!
Anonymous 5/7/13 9:29AM
JUST NOT BLOODY GOOD ENOUGH. I have tried for two days to access my emails and there is now way on this earth that I can find how to do it. All I have to say to Microsoft is - GET YOUR BLOODY ACT TOGETHER AND GIVE US OUR SERVICE BACK. I NEED TO URGENLTY ACCESS MY MESSAGES
R.A.H. 5/5/13 4:05AM
Very Very annoyed with the hotmail or outlook, whatever they wanna call themselves. After 11 years my email is hacked into and they want to to fix an email account that was free and now priceless to me bc it holds a ton of personal information. I am so pissed off that there is no real person on the hotmail/outlook team to contact. freaking loosers.
Anonymous 4/27/13 5:40AM
I am so-o- frustrated with this outlook. It deletes any attachments saying it has a virus when I know it does not. FIX THIS
ginnymcgowen
Anonymous 4/20/13 12:25PM
I had a hotmail address for over 10 year. All of a sudden it says the account does not exist. How can I recover this e-mail address. Is this caused by the new microsoft outlook management. Very disappointing.
janakard 4/10/13 4:16PM
I went to respond to the "member services" email about the "upgrade" to say thanks but no thanks, but it's turned out to be like handling "member services" and related "help desks" at the call center (and insurance company) I used to work for. The inability to contact them, to me, just shows they know their product and service is bad, so they're hiding behind the impenetrable wall of zero convenience contact info and a smile saying "Please enjoy."
No thanks. I'm even telling friends and family how ridiculous this is so they too will leave Hotmail/MSN behind for good.
Anonymous 4/3/13 1:58AM
Ever since switch Hotmail to outlook
I cant get email to open or it wont let me send
how can I get to switch it back to just live
Hotmail again if you email me send it to yahoo
please help me
Anonymous 4/2/13 5:42PM
New page for E-Mail............no choices anymore!!!!!!!!
Hate the new page!
Want my old system back!
Doesn't anyone think about asking if we WANT it changed??????????
Tried to'chat' to complain. That was impossible!
Judy Stuparitz 3/28/13 6:01PM
I tried since a few years to stop the subscription of Hotmail. It was registered in Switzerland while I was living there IN 2004. I have moved since and the automatic creditcard billing keeps followig me everwhere, while I never use the service anymore. It is up for renewal once again on 9 May 2013 and i want to stop it but I cannot contact Hotmail. It is a great rip off that even the creditcard company (Visa) cannot avoid.
I WANT TO CANCEL THE HOTMAIL SERVICES ONCE AND FOR ALL, BECAUSE I DONOT USE IT AT ALL SINCE A FEW YEARS NOW. PLEASE HELP ME.
<EMAIL_ADDRESS>3/28/13 1:56PM
My account got hacked, it was an old account and I just want the account frozen or deactivated, but I cannot get in, and I cannot recall the password and looking on the internet all I see is thousands of other people that have also been hacked, yet I cannot find any details to email hotmail, to explain the situation, nothing!
I managed to secure my FB account and email account in a short space of time, but not my hotmail - thanks hotmail you really are incompetent, unsafe and unreliable!
Anon 3/18/13 1:20AM
This is so stupid ..I have been trying to log in to my hotmail account but couldn't get through the last two weeks..it keep know saying that someone is using my account...how can this happen..they have told me that I typed the wrong password..I Had this hotmail account mire then ten years...and now there's s problem...keep on filling the form but said I have filled it wrong? I ring them two times they answered from India? And told me there's a fee of $90, 00..what a bull hit they the one who logged our accounts and wants our money
..I said why I need to paid this is not my problem...but they said if I want to delete my account then the fee is $49.00 only delete after I paid this money????? But then they will offer me another free account??? What a ripped off these people.What a shame...they the one who logged us not anyone is trying to use our accounts liars..
I haven't paid anything I just have to ignore them go to the other company...hotmail are useful..they know that we set our accounts more than 10 years so they ripped us because they know that we cannot remember the secret questions and answers that we have been set up in our accounts..
Hopeless HOTMAIL
Anonymous 3/4/13 2:10AM
... I've lost All my emails from my Father who died in 2011. I haven't been able to look at them because it has been to painful to re-experience. Now that I am finally ready to confront the emotions and meaning within them, I log into my Hotmail account, to find they are ALL GONE. I never gave permission for them to be deleted. Microsoft and Hotmail should be Disgusted with themselves. I wish I'd never used their product.
Anonymous 2/19/13 10:15PM
Same problem here. My Hotmail was hacked and blocked. I spent endless hours to get an email address for Hotmail support but they simply dont have one! I have tried 100 steps to receiver my account but they were all in vain.
Finally, I called the Sydney 1800 Hotmail support number Only TO be told That i need to pay for the service to unblock my account! I paid $189 Five days ago and guess what, they still can't get my account activated! So, I lost my money and I lost my Hotmail account with some irreplaceable documents and information! I'm so angry with Hotmail. How did they get to where they are today without even having an email support service!!!
Josh2013 1/31/13 4:26AM
The same thing happened to me. You can go in and have your email password changed. They will send it to however you set up your alternative contact. I had another email address and my son-in-law helped me. Use another computer to do this. Do not call a number you find on the web...they are hackers. I found out the hard way. Do not allow anyone access to your computer. There is no free help for a free email.
Marg 1/19/13 2:32PM
If it ain't broke, don't fix it!!! Newer is not always better!! I have had my Hotmail account since the inception of Hotmail and I can only remember one other time when Hotmail attempted to change their format...it didn't work then and it doesn't work now. One example is if you check-mark all the e-mails that you know you want to delete, all at once, with the "clear all checked," it doesn't work...this was a huge time saver for me before, and time is money! I also can no longer find on any e-mail that is over a day old the time the e-mail was sent?? This is very important when dealing with legal matters. And whoever came up with the "..." to find other options such as printing should no longer have a job!! I have stayed with Hotmail all these years because they weren't always changing things...I may have to re-think that??!!!


Xorus
gib coffee?
xiv-related
EngageTimer
Stopwatch / Countdown plugin for Dalamud
xivTrans
Just input an item name and get it in another language
other stuff
Music
Hey, at least I'm trying my best.


Blog Site Title
Archived Post
Welcome to the fake blog post. The content here is convince you into believing the post are actually real. It is a mind puzzling game. Enjoy all the reading and try to understand what is in the content and the context of the subject.
Example Blog Post 1
February 5, 2020
Read More
Example Blog Post 2
February 5, 2020
Read More
Example Blog Post 3
February 5, 2020
Read More
Example Blog Post 4
February 5, 2020
Read More
M1 Abrams Tank
February 5, 2020
Read More
Visit Us on FaceBook
Visit Us on Twitter
Visit Niagra Falls National Park
Visit Us the Grand Canyon USA


Alexander Gusev, National Transport University, associate professor department of airports, https://orcid.org/0000-0002-0420-0443
Irina Fedorenko, National Transport University Assistant Lecturer, Kyiv, Ukraine, ORCID ID: https://orcid.org/0000-0002-8690-5673
Abstract: The article is aimed at the development of measures for optimization of the product supply chain by using modern blockchane technology. The world statistics on counterfeit turnover, which is 3.3% per year, which is equivalent to $ 500 billion (2017), which is very relevant for Ukraine, is analyzed.
The technology and algorithms for supply chain optimization is achieved by analyzing data from each point and identifying problem processes and Points are considered.
The use of smart contract technology in the blockchain system is proposed to ensure the safety and security of the goods (cargo), to track the origin of the goods, route, stages of transportation and its originality, by creating records at each point of stay of the goods.
Article language: Ukrainian
Referenses:
Open Access: http://publications.ntu.edu.ua/avtodorogi_i_stroitelstvo/110/152.pdf
Online publication date: 25.02.2021
Print date: 01.02.2021


Wortmann, M., Bolch, T., Menz, C., Tong, J., Krysanova, V., 2018. Comparison and Correction of High-Mountain Precipitation Data Based on Glacio-Hydrological Modeling in the Tarim River Headwaters (High Asia). J. Hydrometeor. 19, 777-801.
https://doi.org/10.1175/JHM-D-17-0106.1
Wortmann, M., Bolch, T., Su, B., Krysanova, V., 2019. An efficient representation of glacier dynamics in a semi-distributed hydrological model to bridge glacier and river catchment scales. Journal of Hydrology 573, 136-152.
https://doi.org/10.1016/j.jhydrol.2019.03.006
Wortmann, M.S.J., 2017. Integrating glacier dynamics into hydrological modelling: A climate change impact assessment of the data-scarce headwaters of the Tarim River, Central Asia (Ph.D.). University College London, London, UK.
https://discovery.ucl.ac.uk/id/eprint/10052031/


Id = 4
Nombre Capitulo = Worldender's lair
Tipo = Planet
Dimension = unknown
Personaje = ['https://rickandmortyapi.com/api/character/10', 'https://rickandmortyapi.com/api/character/81', 'https://rickandmortyapi.com/api/character/208', 'https://rickandmortyapi.com/api/character/226', 'https://rickandmortyapi.com/api/character/382', 'https://rickandmortyapi.com/api/character/340', 'https://rickandmortyapi.com/api/character/362', 'https://rickandmortyapi.com/api/character/375', 'https://rickandmortyapi.com/api/character/395']
Numero Personaje = ['10', '81', '208', '226', '382', '340', '362', '375', '395']
URL Locacion = https://rickandmortyapi.com/api/location/4


Lelylan Nodes
√ Lelylan MQTT Node
Enable the connection of MQTT clients to Lelylan
Learn more about.


To enable a standardised structure to carry information regarding common end-to-end distribution requirements, two profiles have been defined, the ITK Message Bundle and the ITK Message Header that combine to make up the ITK Distribution Bundle.
The ITK Distribution Bundle may be used to wrap a payload. This provides a lightweight structure to carry information relating to the end-to-end technical distribution of payloads. The ITK Distribution Bundle is an autonomous and transport agnostic design, whilst enabling audit, access control and authentication as required by both sender and receivers.
This specification also defines an Infrastructure Acknowledgement and a Business Acknowledgement which may be used with the ITK Distribution Bundle.
The diagram below shows a schematic of the basic ITK Distribution Bundle structure.
The ITK message bundle is the container for the ITK message header and any payload. The message header contains information that pertains to the payload content. The Payload can be any data that is being sent to the recipient.
The diagram below is an example of a CDA on FHIR (COFE) document payload that may be used with the ITK Distribution Bundle. When sending FHIR documents a COFE bundle is used.
The diagram below is an example of an Infrastructure Acknowledgement. Note: there is no actual payload as all the information is carried in the message header resource.
The diagram below is an example of a Business Acknowledgement that may be used with the ITK message bundle.
This DMS is published as a 'work in progress' version and as such is subject to charge. It has been published to show the direction of travel and serve as a discussion document for parties involved with the implementation of FHIR based messages.
Further Information
This FHIR Document specification is based on and intended to be used alongside the published FHIR DSTU2 1.0.1 (October 2015) specification.


ht = HydratedTarget(
address=address,
adaptor=adaptor_type(
sources=EagerFilesetWithSpec("src/python", {"globs": []}, snapshot=mocked_snapshot),
name=name,
address=address,
),
include_sources: bool = True,
) -> HydratedTargetWithOrigin:
sources = Mock()
sources.snapshot = Mock()
sources.snapshot.files = ("f1",) if include_sources else ()
address = Address.parse(f"//:{name}")
ht = HydratedTarget(
address=address,


This page is used for course --- Web Software Technology, and the homework that I did would be uploaded to this page.
The picture below links to my personal webside (blog).
Listed below is my all homework.
I think "Chrome plug-in" belongs to "productivity and quality-oriented technologies".because they are designed to help us to surf the internet more smoothly so that creating quality web services. For example, preview-pdf-file plug-in makes it more convenient to quickily to get the information about the pdf online instead of waiting the downloading process over. So this is belongs to "productivivty and quality-oriented technologies".
Good Point:
After transmitting the document, the web server immediately closes the TCP, which can make server have more time to deal with other browsers' request, Moreover, Server TCP has the maximum number of connections, if not closed, too much visitor will lead to the server tcp port blocked.
Bad Point:
If we are browsering many websides which are very similiar with each other at the same time, the connecting repeatedly will also waste much time and transmite a lot of the same data, it's the bad point I can considered.
I think the server unable to know how many browsers are reading its document, because the server closes the TCP after transmitting the document data, which means that serve will not know when the browser closes the document. So I think the server unable to know how many browsers are reading the document.
| Homework about table | ||
|---|---|---|
| two blocks | test_one | test_two |
| result_one | result_two |
Here is my Third Homework
Here is my Fourth Homework
Here is my Fifth Homework
Here is my Sixth Homework
Here is my Seventh Homework
Here is my Eighth Homework
Here is my Nineth Homework
Here is my Tenth Homework


These are the rough meeting minutes of the first Tech Solidarity NL meeting which took place on 13 February 2017 in Amsterdam (read the original invitation). This is not an extensive and detailed report but should capture the main discussion. We adhere to the Chatham House Rule so information shared can be freely used but the identities and affiliations of participants shall not be disclosed.
The structure of the session was as follows:
Clusters (and amount of votes they got):
Download a zip file containing photos of the clusters.
The overton window is mentioned.
People vote for Wilders/Trump because they feel like it is the only way to bring about change.
One way to answer the question “why” is to do more listening. This was contrasted with a conversation. We should not even speak back at first. Try to understand the opponent. (This sentiment was later contested, for which see further below.)
People’s reasons for voting can be widely different.
PVV has succeeded in shifting the discourse to the right. Many parties have started promoting similar viewpoints in fear of otherwise losing voters.
There is an economic reason for voting PVV, and a social reason. Economic arguments seem to be less effective at swaying PVV voters. Undermining social arguments might be more effective.
Both Trump and Wilders are appealing because they present themselves as outsiders and anti-establishment figures.
Contrary to what people might believe PVV voters include those with a higher education.
The left is perceived by PVV voters as condescending. The very label ‘tech solidarity’ might put people off because it seems elitist. This is a dilemma. We want to be inclusive, but if we are too inclusive we stop standing for anything.
Parties like Denk and PVV are innovative in their approach to the political game, and should be considered sources of inspiration. Not for their message but for their tactics.
There is a tendency among the left to long for the restoration of the power of the left. But this is not a forward-looking stance. It is a conservative impulse. As with the new right, the left should attempt to reinvent itself as well.
An article is mentioned which describes the decline of free market economies due to the inevitable centralisation of power in them. Update: This is the article mentioned.
Things are changing under the influence of tech, and tech is also accelerating the rate of change.
The example of the recent dragnet law is mentioned and the plight of Astrid Oosenbrug. We are being governed by people with very little understanding of technology.
Some participants push back on the idea of the need to listen to and understand our opponents. The comparison with an abusive relationship is made. At some point it might be better to stop being submissive and to stand up for our values.
The book Can jokes bring down governments? is mentioned.
The importance of speaking out against the things we oppose is emphasised, as well as speaking out for the things we believe in.
If we believe PVV voters are in the majority we might be inclined to shut up because we consider ourselves the minority. But is this really the case? And should it matter?
The role of privatisation is mentioned. People still hold governments accountable for services, while the responsibility for those have been given to private companies. This has eroded trust in government and has in turn opened up the way for populists.
We can think about our relationship to the organisations we are part of and work to have them publicly support our agenda.
Designers are always interested in understanding the why. Engineers tend to be more interested in solutions. Maybe we can shift the conversation to some ideas for solutions at some point tonight or in future meetings.
If we want to have an impact before the election we need to think about how to reach a lot of people. How do we get on (well-known Dutch talk show) DWDD?
How can we make it safe for people to speak out against intolerance? Someone else points out maybe we should accept things are not always 100% safe and instead focus on building our resilience in the face of opposition and abuse.
Should we be focusing on changing the minds of our opponents, or should we instead appeal to those who are still in doubt or who are on our side already?
Someone asks what the Dutch equivalent of the ACLU is. (The thing that comes closest thing is the College voor de Rechten van de Mens.)
Someone proposes to make a list of projects that have kicked off in the US after Trump’s election, as a source of inspiration.
Concerns are voiced about not being coopted by groups with vested interests.
The left has stopped being radical in the post-war era and has in stead become centrist.
It is observed that Trump is merely the latest symptom of an illness that has been developing over a much longer period of time.
Someone proposes to build and share a reading list that might help others better understand what is going on.
Although comparing our situation to the one in the US can be helpful we should also try to understand the Dutch situation on its own terms.
To that previous point: so far the dangers we share are largely unspoken. What, exactly are we worried about, and what values do we share?
Although technology has contributed to prosperity, not everyone is sharing equally in its gains.
Technology does not automatically imply solidarity. The tech sector contributes to growing inequality. It produces shitty jobs (see the gig economy).
Someone mentions the example of efforts to open up government data in the municipality of Amsterdam. It is not a given that easier access to data about citizens only leads to good outcomes.
The majority of young people will vote PVV. Others suggest it is closer to 30%. It would be helpful to know the real number. In any case, the question is if focusing on young people makes sense.
One obvious next action is to work together on a our message.
We shouldn’t get caught up in researching the causes of things. We should build on the work of others in that area.
Someone points out there are other ways to be political aside from contributing to the current election campaign somehow. Start close to home, figure out what it is you can do in your direct surroundings.
The example of waaromkiesjij.nl is given. It is a web app that lets supporters of opposing political parties anonymously discuss things. It aims to help people break out of their filter bubble but also to figure out if they really hold the views they think they hold.
A lot of the discussion so far has centred on politics. We might want to leave that to the politicians. We should choose our own battles.
Someone expresses the desire to walk away with some ideas for simple small things they can do when they get home so that they can act.
The debacle surrounding the poor security of stemwijzer.nl is mentioned. It is also observed such a tool does not necessarily change views. It might merely help people reaffirm their preexisting beliefs.
The power of emotion is mentioned. We should not think we can simply change minds by offering facts. We need an appealing story as well.
Although it is easy to feel overwhelmed and ineffective, the very fact that we have chosen to come together and have this conversation is a good thing.
Looking towards the end of the conversation someone asks, can we make small bets? Small actionable ideas? Let’s survey the ideas in the ‘solutions’ cluster.
We should look for organizations who are already working towards the goals we embrace and listen to their needs. Tech people have a lot to offer but we should not be coming up with our own solutions in isolation.
Connect with people in your company and your peer network. Get them involved.
Think up weekend projects that can be of help.
Someone gives the example of building a website for a group of historians who were in need of one but could not afford to hire someone to build it.
We should be wary of duplicating efforts that are already out there. Let’s be smart about this.
Outline of a manifesto:
Can we answer the question what to vote? Is there a strategic vote?
Someone suggests telling stories based on data with evocative imagery that advance our cause.
Someone suggests creating a Cambridge Analytica of the left.
One of the attendees observes that tech people tend to speak the language of control, managing and solving problems. This isn’t bad per se but something to be aware of. It might be off-putting to those outside our circle.
Someone suggests doing a hackathon, but one that takes as its starting point the needs of organisations that are aligned with our interests.
Doing outreach to other organisations and getting them to speak at a next meeting would be good but it is going to be a lot of work.
Someone observes that there are a lot of small groups and organisations working towards similar goals to our own. We don’t need to start yet another group. We can be the organisation that works to connect them to each other.

If we want to influence the elections, we will have to act fast because March 15 is very near already.
Before we wrap up, some discussion is had about the need for a group chat system such as Slack or Signal.


## Projects
Co-developed Pebble application to pay contacts via Venmo.
Application consists of a Pebble application, an iOS companion application, website to register number with Venmo account, and Node.js server backend to handle traffic.
Developed majority of backend including Node.js server as well as the following services: MongoDB for storing and retrieving account information, Twilio for sending text messages as notifications. Co-wrote Venmo server-side authentication with teammate.
Completed application during Boilermake and won prize from Paypal for best use of Paypal/Venmo/Braintree payment platforms.
Featured on Purdue Science homepage on October 21st. Post is viewable here.
Challengepost link can be viewed here.
Co-developed a platform for authors to crowd-source novels at MHacks IV.
Application uses votes from community to choose which paragraphs/sections are chosen for inclusion in a given text
Application won best real-time hack, submission page can be viewed here. Also, Jot is now open-sourced and can be viewed here.
Wrote an autonomous logic controller for fish incorporating obstacale avoidance as well as motor functions
Led software development on the controller; designed controller by mapping out use cases and associating features with each case.
Used SCRUM to ensure features were pushed out on time and all core features were present.
Shown below is a quick video detailing the demonstration of our project and several phases in the design process
{% include video.html %}
A visualization client for Twitter that searches through database for search term
Displays results of users with public tweets and geolocation on map with username
Created in 36 hours for MHacks II
Android 4.x
Group collaborative note-taking software with syncing across a database
Group project completed using SCRUM
Created server backend for interfacing with notes
Source can be found on GitHub.
Windows Phone 7 and 8
Checkers Player vs Computer as well as Player vs Player
Group Project; Contributed by writing Networking functions to support Player vs. Player games over internet. However, networking version was discontinued due to server costs
Can find local version here, or the networked GitHub version.


We connect people around the world in the fight to end poverty. Working together, we invest in the lives of childrenand youth, build the healthy environments they need to thrive, and empower them to create lasting change in their own lives and communities.
Your support makes this possible even amid a global crisis. Learn more about how programs have been adapted to continue serving our children and families during the pandemic.


Go to the source code of this file.
Typedefs | |
| typedef struct le_pathIter_t * | le_pathIter_Ref_t |
Legato Path Iterator API include file.
Copyright (C) Sierra Wireless Inc. Use of this work is subject to license. license.
| typedef struct le_pathIter_t* le_pathIter_Ref_t |
Objects of this type are used to iterate and manipulate path strings.
| le_result_t le_pathIter_Append | ( | le_pathIter_Ref_t | iterRef, |
| const char * | pathStr | ||
| ) |
Take the new string path and combine it with the object's existing path.
| [in] | iterRef | The path object to write to. |
| [in] | pathStr | The new path segment to append. |
| le_pathIter_Ref_t le_pathIter_Clone | ( | le_pathIter_Ref_t | originalRef | ) |
Create a clone of an existing path iterator object.
| [in] | originalRef | The path object to duplicate. |
| le_pathIter_Ref_t le_pathIter_Create | ( | const char * | pathPtr, |
| const char * | separatorPtr, | ||
| const char * | parentSpecPtr, | ||
| const char * | currentSpecPtr | ||
| ) |
Create a new path iterator object. On creation, the default position of the iterator is at the end of the path.
| [in] | pathPtr | Optional. Pointer to the inital path to use. |
| [in] | separatorPtr | Required. Path separator to use. The separator can not be NULL or empty. |
| [in] | parentSpecPtr | Optional. Used to traverse upwards in a path. Leave as NULL or empty to not use. This acts like how ".." is used in a filesystem path. |
| [in] | currentSpecPtr | Optional. Used to refer to a current node. Much like how a '.' is used in a filesystem path. |
| le_pathIter_Ref_t le_pathIter_CreateForUnix | ( | const char * | pathPtr | ) |
Create a new path iterator object that is pre-configured for Unix styled paths. On creation, the default position of the iterator is at the end of the path.
The parameters are configured as follows:
| [in] | pathPtr | Optional. Create an iterator for this path, or start with an empty path. |
| void le_pathIter_Delete | ( | le_pathIter_Ref_t | iterRef | ) |
Delete an iterator object and free it's memory.
| [in] | iterRef | The iterator object to destroy. |
| le_result_t le_pathIter_GetCurrentNode | ( | le_pathIter_Ref_t | iterRef, |
| char * | bufferPtr, | ||
| size_t | bufferSize | ||
| ) |
Get the text for the node the itrator is pointing at.
| [in] | iterRef | The iterator object to read. |
| [out] | bufferPtr | The utf-8 formatted text buffer to write to. |
| [in] | bufferSize | The size in bytes of the text buffer. |
| le_result_t le_pathIter_GetCurrentSpecifier | ( | le_pathIter_Ref_t | iterRef, |
| char * | bufferPtr, | ||
| size_t | bufferSize | ||
| ) |
Read the iterators string for the current node specifier. For Unix style paths for this is ".". If an empty string is used, then this is ignored for the purposes of appending and normalizing paths.
| [in] | iterRef | The iterator object to read. |
| [out] | bufferPtr | The string buffer to write to. |
| [in] | bufferSize | The size of the string buffer being written to. |
| le_result_t le_pathIter_GetParentSpecifier | ( | le_pathIter_Ref_t | iterRef, |
| char * | bufferPtr, | ||
| size_t | bufferSize | ||
| ) |
Read the string that represents parent nodes in a path string. By for Unix style paths this is "..". If an empty string is used, then it is ignored for the purposes of appending and normalizing paths.
| [in] | iterRef | The iterator object to read. |
| [out] | bufferPtr | The string buffer to write to. |
| [in] | bufferSize | The size of the buffer being written to. |
| le_result_t le_pathIter_GetPath | ( | le_pathIter_Ref_t | iterRef, |
| char * | bufferPtr, | ||
| size_t | bufferSize | ||
| ) |
Get a copy of the path currently contained within the iterator.
| [in] | iterRef | The iterator object to read. |
| [out] | bufferPtr | The string buffer to write to. |
| [in] | bufferSize | The size of the buffer being written to. |
| le_result_t le_pathIter_GetSeparator | ( | le_pathIter_Ref_t | iterRef, |
| char * | bufferPtr, | ||
| size_t | bufferSize | ||
| ) |
Read the string that is being used to represent path separators in this iterator object.
| [in] | iterRef | The iterator object to read. |
| [out] | bufferPtr | The string buffer to write to. |
| [in] | bufferSize | The size of the buffer being written to. |
| le_result_t le_pathIter_GoToEnd | ( | le_pathIter_Ref_t | iterRef | ) |
Jump the iterator to the end of the path.
| [in] | iterRef | The iterator object to update. |
| le_result_t le_pathIter_GoToNext | ( | le_pathIter_Ref_t | iterRef | ) |
Move to the next node in the path.
| [in] | iterRef | The iterator object to update. |
| le_result_t le_pathIter_GoToPrev | ( | le_pathIter_Ref_t | iterRef | ) |
Move to the previous node in the path.
| [in] | iterRef | The iterator object to update. |
| le_result_t le_pathIter_GoToStart | ( | le_pathIter_Ref_t | iterRef | ) |
Jump the iterator to the beginning of the path.
| [in] | iterRef | The iterator object to update. |
| bool le_pathIter_IsAbsolute | ( | le_pathIter_Ref_t | iterRef | ) |
Is this an absolute or relative path?
| [in] | iterRef | The iterator object to read. |
| bool le_pathIter_IsEmpty | ( | le_pathIter_Ref_t | iterRef | ) |
Is the path object holding an empty string?
| iterRef | The path object to read. |
| void le_pathIter_Truncate | ( | le_pathIter_Ref_t | iterRef | ) |
Truncate the path at the current iterator node. If the iterator is at the beginning of the path, then the whole path is cleared. If the iterator is at the end of the path, then nothing happens.
Once done, then the iterator will be pointing at the new end of the path.
| [in] | iterRef | The iterator to update. |


Toggle navigation
Menu
Ruby on Rails Course Startup
Start
Showcase
Subscribe
Ruby On Rails Course
Learn by recreating famous applications!
Pre Build
Subscribe
Welcome Page
Close
Main Site
Close
Adding New Images
Close
User Wall
Close
Main Site 2
Close
Discover Pin
Close


////// not going to lie, but i thought this was due tomrrow night
Questions Go Here: I thought this was due tomorrow night... Opps. There are also a lack of git commits because I was not working from my PC Desktop due to the holiday. Setting up my entire workflow on a mac book wasn't a practical thing to do...


Hi, I'm Jordyn. I am a full-stack web developer.
I am naturally inquisitive and love figuring out how things work. I am a student at the Coding Bootcamp at Johns Hopkins University where I am building a solid foundation in web development. I have build web applications using HTML5, CSS3, JavaScript, jQuery, Bootstrap, Express.js, ReactJS, Node.js, MongoDB, Mongoose, MySQL, Sequelize.js, Command Line, REST APIs, Git and more. I am excited to be taking the plunge into a new field that marries my love of problem solving, design, and abstract thinking.
CHECK OUT MY WORK


Cookbook/tickdifferent
Contents |
tick different
a vanilla tick setup has a tickerplant (TP) logging to disk and publishing to an in-memory realtime database (RDB) - and at day end the RDB data is saved to disk as another day in the history database (HDB). Users typically query the RDB or HDB directly.
it doesn’t have to be that way, there are a *lot* of other ways of assembling the kdb+tick “building blocks” to reduce or share the load.
chained tickerplants
starting at the beginning with the TP: if this is running in zero-latency mode (i.e. all updates are published immediately to subscribers) it is completely over the top to have a client task that is only plotting graphs subscribe for instantaneous update - an update every few seconds would be quite adequate.
one way of doing this is to have a chained TP, or even a chain of them. The first TP would be a zero-latency TP - and would only have clients who truly need immediate update - it in turn would have as one of its clients a TP publishing bulk updates every 100ms, that in turn would have a chained tickerplant as client that only publishes updates every second. Clients then subscribe to the TP with granularity that suits their needs.
see chained tickerplant and rdb for kdb+tick
no RDB
next in the chain comes the RDB. An RDB is an in-memory database, and by day end that can be taking a lot of memory. If clients are querying that data intra-day then the memory cost is reasonable - but if the data’s only being collected to be able to add to the HDB at dayend the overhead is unreasonable. In such a case it would make sense to write the data to disk during the day so that it’s ready for dayend processing, but with only a small memory footprint to build bulk updates.
see write only alternative to rdb for kdb+tick
chained RDBs
the other extreme is when one RDB isn’t enough - then the same approach can be used with multiple chained RDBs. Depending on the sort of clients it has it may be enough for one of the chained RDBs to subscribe to a bulk-update TP rather than the fastest zero-latency one.
a chained RDB doesn’t have to subscribe to the whole “firehose”, it might be useful to have a TP with only the stocks building a particular Index, or perhaps only trades and no quotes.
see (again) chained tickerplant and rdb for kdb+tick
working with the TP logfile
the TP logs the updates published to subscribers to a file, in the event of a serious crash this file can be rescued using the utility functions in source:contrib/simon/tickrecover/rescuelog.q
c.q
another overlooked problem is that often users are fetching vast amounts of raw data to calculate something that could much better be built once, incrementally updated, and then made available to all interested clients. A simple example would be keeping a running Open/High/Low/Latest - much simpler to incrementally update with data from the TP each time something changes than to build from scratch. A much more interesting example is keeping a table of the latest trade and the associated quote for every stock - trivial to do realtime with the incremental updates from the TP, but impossible build from scratch in a timely fashion with the raw data.
see tick/c.q
clog.q
the default version of c.q linked to above connects to a TP and starts collecting data - sometimes that’s not enough and you want replay the log through the task first (to get the Open/High/Low for the day, not just since starting the task for example). For that use clog.q instead: source:contrib/simon/tick/clog.q
daily.q
by default the endofday processing simply saves the intra-day RDB down to disk after a little re-organisation - and example of additional processing (updating a permanent HLOC table and building an NBBO table from scratch) can be found in taq/daily.q


Please advertise the UC&R work to your networks and ask them to add to https://github.com/w3c/rdf-star/issues/. Don't worry about duplication - better to get more input and sort out later.
<scribe> scribe: AndyS
<pchampin> Meeting: RDF*
<pchampin> Chair: pchampin
<pchampin> Agenda: https://lists.w3.org/Archives/Public/public-rdf-star/2020Nov/0031.html
<pchampin> https://github.com/w3c/rdf-star/issues/22
pchampin: issue 22: "Do you need referential opacity?"
<scribe> ... done some testing existing implementations
pfps: Several choices here - impls seem to be doing what was easiest at the time.
<pfps> I think it is unlikely that there are implementations of the partial opacity that is not specific to blank nodes.
pchampin: Can a system replace one ground term by another if they know the terms entail.
... do blank nodes work like they do outside <<>>
<pchampin> << :s :p :o >> :p2 :o2.
<pchampin> ASK { << _:x :p :o >> :p2 :o2. }
andys: people find it difficult to engage in this discussion
... what would be good is to have a set of test cases
<pavel> +1 to test cases
<pfps> test cases might help, but you have to be very careful to not pull in intended semantics of the terms used
<gatemezing> +1 also to have test cases, hopefully we can agree on the different test case
AndyS: Blank nodes in SPARQL(*) will be variable-like.
<pfps> yes, one has to be very careful when using SPARQL(*) for this because of the status of blank nodes in queries
<pfps> asking entailment queries gives better answers (as long as the RDF store supports entailment questions)
gkellogg: Rerential f opacity : my impl does not do entailment
... regimes. Don't understand what the implications are for the abstract syntax level.
pchampin: need a semantics for the abstract syntax.
gkellogg: RDF semantics does not speak to owl:sameAs.
pchampin: literals are the similar
... D-entailment
<pchampin> "01"^^xsd:integer and "1"^^xsd:integer
pchampin: so two URIs will not be deduced to denote the same thing in RDF (only).
gkellogg: different terms (different lexical form). Causes two triples. Some places in SPARQL take account of values [ed: expressions]
pchampin: some systems store the value rather than the different lexical forms.
... like test cases idea.
AndyS: tests to define the decisions we have to make.
(scribe missed name)
??: javascript implementation
<pavel> graphy
<gatemezing> Graphy by Blake_Regalia
??: how does ref opaque relate to RDF* is "just" syntactic sugar and what are the combinations of choices.
pchampin: hard to answer the other questions before answering this for encoding RDF* in RDF.
... if we decide it is not opaque then it may be possible to use reification.
... (superman example)
<pchampin> _:x rdf:subject :superam; :superman owl:same :clark |= _:x rdf:subject :clark
<pfps> it is entirely possible to have an opaque semantics using RDF reification
<pchampin> << :lifeUniverseAndEverything :anwser "042"^^xsd:integer >> :accordingTo :deepThought.
<pchampin> AndyS: can we in parallel make progress for RDF* in the no-entailment case
<pfps> a simple way to have a very strong notion of referential opacity is simply to use a fresh IRI for each occurrence of a triple
<pchampin> << :lifeUniverseAndEverything :anwser "042"^^xsd:integer >> :accordingTo :deepThought.
<pchampin> ASK { << :lifeUniverseAndEverything :anwser "42"^^xsd:integer >> :accordingTo :deepThought. }
Data: :lifeUniverseAndEverything :anwser "042"^^xsd:integer and ASK { :lifeUniverseAndEverything :anwser "42"^^xsd:integer }
AndyS: Why would it be different to what the system does outside RDF*?
<pavel> it wouldn't. normally systems deal with this via some sort of literal canonicalisation
gkellogg: If we are using an abstract syntax where embedded triples are treated different, need an extended D-entailment.
+1 to pavel
Doerthe: collect examples of how we want is use RDF*
... work on N3 and RDF* - theoretical interest.
gkellogg: Gets back to original motivation. PG mode - graph includes triples. Can refer to that triple.
... would expect that entailment happens as it does to triple.
... could allow for different semantics and extend to work over entailed triples.
Olaf: original intention was use of RDF* to make statements about triples in a provenance sense => opaque
... query semantics more important to me.
... test case: voting on result may lead to inconsistent/un-consensus outcomes
pchampin: may be we focus on query
... how would it work under simple entailment and also other entail regimes.
<gatemezing> Are we talking about this document https://www.w3.org/TR/sparql11-entailment/#DEntRegime when referencing D-Entailment?
Olaf: under simple entailment none of these show up?
<pfps> but simple entailment isn't useful - even SPARQL does more than simple entailment
<pfps> ooh, my mistake then
AndyS: SPARQL triple matching is simple-entailment with values in expressions only.
gkellogg: Use graph isomorphism for tests so not SPARQL dependent
pchampin: I will start the setup for a test suite
<pchampin> ACTION: pchampin to start a test suite, similar to the rdf-mt suite
<pchampin> ACTION: Olaf to write a first draft of the query semantics in the report
Olaf: offer to put draft of query semantic into the spec. There is a GH issue.
<Olaf> https://github.com/w3c/rdf-star/issues/8
<rivettp> FYI next Friday is Thanksgiving weekend in the US and I will not be able to attend the call
<Olaf> Who can be here next week?
<pchampin> +1
<Olaf> +1
<gkellogg> +1
<gatemezing> +1
<thomas> +1
<blake> +1
<pavel> +1
<james> +1
+1
<pchampin> ok, let's keep next week call
<gatemezing> thanks all! bye
<Doerthe> thank you pierre-antoine :)
<pchampin> and thanks to AndyS for scribing