Designing futures for Rust
I recently wrote about the importance of asynchronous I/O in Rust and the aims of the new futures library. This post deepens the story by explaining the core design of that library. If you’re looking for more on the use of the library, you’ll have to wait; we’re very actively working on the Tokio stack and will have more to say once that’s settled down a bit.
To recap, the aim is robust and ergonomic async I/O with no performance penalty:
Robust: the library should have a strong story for error handling, cancellation, timeouts, backpressure, and other typical concerns for writing robust servers. This being Rust, we’ll also of course guarantee thread safety.
Ergonomic: the library should make writing asynchronous code as painless as possible—ideally, as easy as writing synchronous code, but with greater expressivity. While the latter will require
async
/await
to fully achieve, the futures library provides a high-level way of expressing and combining asynchronous computation, similar to Rust’s successfulIterator
API.Zero cost: code written using the library should compile down to something equivalent (or better than) “hand-rolled” server implementations, which would typically use manual state machines and careful memory management.
Achieving these goals requires a mix of existing techniques in Rust, and some new ideas about how to build a futures library; this post will cover both. In a nutshell:
Leverage Rust’s traits and closures for ergonomics and cost-avoidance. Traits and closures in Rust do not require heap allocation or dynamic dispatch—facts we take heavy advantage of. We also use the trait system to package up the futures API in a simple and convenient way.
Design the core
Future
abstraction to be demand-driven, rather than callback-oriented. (In async I/O terms, follow the “readiness” style rather than the “completion” style.) That means that composing futures together does not involve creating intermediate callbacks. As we’ll see, the approach also has benefits for backpressure and cancellation.Provide a task abstraction, similar to a green thread, that drives a future to completion. Housing futures within a task is what enables the library code to compile down to the traditional model, i.e., with big state machines that can serve as a callback for a large number of underlying events.
Let’s dive in!
Background: traits in Rust
We’ll start with a quick review of traits in Rust. If you want more reading on these topics, you might check out the longer overview of traits.
To understand how the futures design works, you need to have a basic grasp on Rust’s traits. I won’t attempt a complete introduction here, but I’ll try to hit the most relevant highlights for making sense of what’s going on.
Traits provide Rust’s sole notion of interface, meaning that a trait is an abstraction that can apply to many concrete types. For example, here’s a simplified trait for hashing:
trait Hash {
fn hash(&self) -> u64;
}
This trait stipulates that the type implementing it must provide a hash
method, which
borrows
self
and produces a u64
. To implement the trait, you have to give a concrete
definition for the method, like the following simple-minded one:
impl Hash for bool {
fn hash(&self) -> u64 {
if *self { 0 } else { 1 }
}
}
impl Hash for i32 { ... } // etc
Once these implementations are in place, you can make calls like true.hash()
to invoke the method directly. But often the methods are called via generics,
which is where traits truly act as an abstraction:
fn print_hash<T: Hash>(t: &T) {
println!("The hash is {}", t.hash())
}
The print_hash
function is generic over an unknown type T
, but requires that
T
implements the Hash
trait. That means we can use it with bool
and i32
values:
print_hash(&true); // instantiates T = bool
print_hash(&12); // instantiates T = i32
Generics are compiled away, resulting in static dispatch. That is, as with
C++ templates, the compiler will generate two copies of the print_hash
method to handle the above code, one for each concrete argument type. That in
turn means that the internal call to t.hash()
—the point where the
abstraction is actually used—has zero cost: it will be compiled to a direct,
static call to the relevant implementation:
// The compiled code:
__print_hash_bool(&true); // invoke specialized bool version directly
__print_hash_i32(&12); // invoke specialized i32 version directly
Compiling down to non-generic code is essential for making an abstraction like futures work without overhead: most of the time, that non-generic code will also be inlined, letting the compiler produce and optimize large blocks of code that resemble what you might have written in a low-level, “hand-rolled” style.
Closures in Rust work the same way—in fact, they’re just traits. That means, in
particular, that creating a closure does not entail heap allocation, and calling
a closure can be statically-dispatched, just like the hash
method above.
Finally, traits can also be used as “objects”, which cause the trait methods to be dynamically dispatched (so the compiler doesn’t immediately know what implementation a call will use). The benefit to trait objects is for heterogeneous collections, where you need to group together a number of objects which may have different underlying types but all implement the same trait. Trait objects must always be behind a pointer, which in practice usually requires heap allocation.
Defining futures
Now, let’s turn to futures. The earlier post gave an informal definition of a future:
In essence, a future represents a value that might not be ready yet. Usually, the future becomes complete (the value is ready) due to an event happening somewhere else.
Clearly, we’ll want futures to be some kind of trait, since there will be many different kinds of “values that aren’t ready yet” (e.g. data on a socket, the return value from an RPC call, etc.). But how do we represent the “not ready yet” part?
False start: the callback (aka completion-based) approach
There’s a very standard way to describe futures, which we found in every existing futures implementation we inspected: as a function that subscribes a callback for notification that the future is complete.
- Note: In the async I/O world, this kind of interface is sometimes referred to as completion-based, because events are signaled on completion of operations; Windows’s IOCP is based on this model.
In Rust terms, the callback model leads to a trait like the following:
trait Future {
// The type of value produced by the future
type Item;
// Tell the future to invoke the given callback on completion
fn schedule<F>(self, f: F) where F: FnOnce(Self::Item);
}
The FnOnce
here is a trait for closures that will be invoked at most
once. Because schedule
is using generics, it will statically dispatch any
calls to that closure.
Unfortunately, this approach nevertheless forces allocation at almost every point of future composition, and often imposes dynamic dispatch, despite our best efforts to avoid such overhead.
To see why, let’s consider a basic way of combining two futures:
fn join<F, G>(f: F, g: G) -> impl Future<Item = (F::Item, G::Item)>
where F: Future, G: Future
This function takes two futures, f
and g
, and returns a new future that
yields a pair with results from both. The join
ed future completes only when
both of the underlying futures complete, but allows the underlying futures to
execute concurrently until then.
How would we implement join
using the above definition of Future
? The
join
ed future will be given a single callback both_done
which expects a
pair. But the underlying futures each want their own callbacks f_done
and
g_done
, taking just their own results. Clearly, we need some kind of sharing
here: we need to construct f_done
and g_done
so that either can invoke
both_done
, and make sure to include appropriate synchronization as well. Given
the type signatures involved, there’s simply no way to do this without
allocating (in Rust, we’d use an Arc
here).
This kind of problem was repeated in many of the future combinators.
Another problem is that event sources like event loops need to invoke callbacks of arbitrary, different types—a case of the heterogeneity mentioned above. As a concrete example, when a socket is ready for reading, that event will need to be dispatched to some callback, and in general you’ll need a mix of different futures to be in play with different sockets. To make this work, you end up needing to heap-allocate callbacks for the event loop at every point the future wants to listen for an event, and dynamically dispatch notifications to those callbacks.
TL;DR, we were unable to make the “standard” future abstraction provide zero-cost composition of futures, and we know of no “standard” implementation that does so.
What worked: the demand-driven (aka readiness-based) approach
After much soul-searching, we arrived at a new “demand-driven” definition of futures. Here’s a simplified version that ignores the error handling of the real trait:
// A *simplified* version of the trait, without error-handling
trait Future {
// The type of value produced on success
type Item;
// Polls the future, resolving to a value if possible
fn poll(&mut self) -> Async<Self::Item>;
}
enum Async<T> {
/// Represents that a value is immediately ready.
Ready(T),
/// Represents that a value is not ready yet, but may be so later.
NotReady,
}
The API shift here is straightforward: rather than the future proactively
invoking a callback on completion, an external party must poll the future to
drive it to completion. The future can signal that it’s not yet ready and must
be polled again at some later point by returning Async::NotReady
(an
abstraction of EWOULDBLOCK
).
- Note: In the async I/O world, this kind of interface is sometimes referred to as readiness-based, because events are signaled based on “readiness” of operations (e.g. bytes on a socket being ready) followed by an attempt to complete an operation; Linux’s epoll is based on this model. (This model can also express completion, by treating the completion of an operation as the signal that the future is ready for polling.)
By eliminating all the intermediate callbacks, we’ve addressed some of the key
problems of the previous version of the trait. But we’ve introduced a new one:
after NotReady
is returned, who polls the future, and when do they do so?
Let’s take a concrete example. If a future is attempting to read bytes from a
socket, that socket may not be ready for reading, in which case the future can
return NotReady
. Somehow, we must arrange for the future to later be “woken
up” (by calling poll
) once the socket becomes ready. That kind of wakeup is
the job of the event loop. But now we need some way to connect the signal at the
event loop back to continuing to poll the future.
The solution forms the other main component of the design: tasks.
The cornerstone: tasks
A task is a future that is being executed. That future is almost always made up of a chain of other futures, as in the example from the original post:
id_rpc(&my_server).and_then(|id| {
get_row(id)
}).map(|row| {
json::encode(row)
}).and_then(|encoded| {
write_string(my_socket, encoded)
})
The key point is that there’s a difference between functions like and_then
,
map
and join
, which combine futures into bigger futures, and functions that
execute futures, like:
The
wait
method, which simply runs the future as a task pinned to the current thread, blocking that thread until a result is produced and returned.The
spawn
method on a thread pool, which launches a future as an independent task on the pool.
These execution functions create a task that contains the future and is
responsible for polling it. In the case of wait
, polling takes place
immediately; for spawn
, polling happens once the task is scheduled onto a
worker thread.
However polling begins, if any of the interior futures produced a NotReady
result, it can grind the whole task to a halt—the task may need to wait for
some event to occur before it can continue. In synchronous I/O, this is where a
thread would block. Tasks provide an equivalent to this model: the task “blocks”
by yielding back to its executor, after installing itself as a callback for
the events it’s waiting on.
Returning to the example of reading from a socket, on a NotReady
result the
task can be added to the event loop’s dispatch table, so that it will be woken
up when the socket becomes ready, at which point it will re-poll
its future.
Crucially, though, the task instance stays fixed for the lifetime of the future
it is executing—so no allocation is needed to create or install this callback.
Completing the analogy with threads, tasks provide a park
/unpark
API for
“blocking” and wakeup:
/// Returns a handle to the current task to call unpark at a later date.
fn park() -> Task;
impl Task {
/// Indicate that the task should attempt to poll its future in a timely fashion.
fn unpark(&self);
}
Blocking a future is a matter of using park
to get a handle to its task,
putting the resulting Task
in some wakeup queue for the event of interest, and
returning NotReady
. When the event of interest occurs, the Task
handle can
be used to wake back up the task, e.g. by rescheduling it for execution on a
thread pool. The precise mechanics of park
/unpark
vary by task executor.
In a way, the task model is an instance of “green” (aka lightweight) threading: we schedule a potentially large number of asynchronous tasks onto a much smaller number of real OS threads, and most of those tasks are blocked on some event most of the time. There’s an essential difference from Rust’s old green threading model, however: tasks do not require their own stack. In fact, all of the data needed by a task is contained within its future. That means we can neatly sidestep problems of dynamic stack growth and stack swapping, giving us truly lightweight tasks without any runtime system implications.
Perhaps surprisingly, the future within a task compiles down to a state
machine, so that every time the task wakes up to continue polling, it
continues execution from the current state—working just like hand-rolled code
based on mio. This point is most easily seen
by example, so let’s revisit join
.
Example: join
in the demand-driven model
To implement the join
function, we’ll introduce a new concrete type, Join
,
that tracks the necessary state:
fn join<F: Future, G: Future>(f: F, g: G) -> Join<F, G> {
Join::BothRunning(f, g)
}
enum Join<F: Future, G: Future> {
BothRunning(F, G),
FirstDone(F::Item, G),
SecondDone(F, G::Item),
Done,
}
impl<F, G> Future for Join<F, G> where F: Future, G: Future {
type Item = (F::Item, G::Item);
fn poll(&mut self) -> Async<Self::Item> {
// navigate the state machine
}
}
The first thing to notice is that Join
is an enum, whose variants represent
states in the “join state machine”:
BothRunning
: the two underlying futures are both still executing.FirstDone
: the first future has yielded a value, but the second is still executing.SecondDone
: the second future has yielded a value, but the first is still executing.Done
: both futures completed, and their values have been returned.
Enums in Rust are represented without requiring any pointers or heap allocation; instead, the size of the enum is the size of the largest variant. That’s exactly what we want—that size represents the “high water mark” of this little state machine.
The poll
method here will attempt to make progress through the state machine
by poll
ing the underlying futures as appropriate.
Recall that the aim of join
is to allow its two futures to proceed
concurrently, racing to finish. For example, the two futures might each
represent subtasks running in parallel on a thread pool. When those subtasks are
still running, poll
ing their futures will return NotReady
, effectively
“blocking” the Join
future, while stashing a handle to the ambient Task
for
waking it back up when they finish. The two subtasks can then race to wake up
the Task
, but that’s fine: the unpark
method for waking a task is
threadsafe, and guarantees that the task will poll
its future at least once
after any unpark
call. Thus, synchronization is handled once and for all at
the task level, without requiring combinators like join
to allocate or handle
synchronization themselves.
- You may have noticed that
poll
takes&mut self
, which means that a given future cannot bepoll
ed concurrently—the future has unique access to its contents while polling. Theunpark
synchronization guarantees it.
One final point. Combinators like join
embody “small” state machines, but
because some of those states involve additional futures, they allow additional
state machines to be nested. In other words, poll
ing one of the underlying
futures for join
may involve stepping through its state machine, before
taking steps in the Join
state machine. The fact that the use of the
Future
trait does not entail heap allocation or dynamic dispatch is key to
making this work efficiently.
In general, the “big” future being run by a task—made up of a large chain of
futures connected by combinators—embodies a “big” nested state machine in just
this way. Once more, Rust’s enum representation means that the space required is
the size of the state in the “big” machine with the largest footprint. The space
for this “big” future is allocated in one shot by the task, either on the
stack (for the wait
executor) or on the heap (for spawn
). After all, the
data has to live somewhere—but the key is to avoid constant allocations as
the state machine progresses, by instead making space for the entire thing up
front.
Futures at scale
We’ve seen the basics of demand-driven futures, but there are a number of concerns about robustness that we also want to cover. It turns out that these concerns are addressed naturally by the demand-driven model. Let’s take a look at a few of the most important.
Cancellation
Futures are often used to represent substantial work that is running concurrently. Sometimes it will become clear that this work is no longer needed, perhaps because a timeout occurred, or the client closed a connection, or the needed answer was found in some other way.
In situations like these, you want some form of cancellation: the ability to tell a future to stop executing because you’re no longer interested in its result.
In the demand-driven model, cancellation largely “falls out”. All you have to do
is stop polling the future, instead “dropping” it (Rust’s term for destroying
the data). And doing so is usually a natural consequence of nested state
machines like Join
. Futures whose computation requires some special effort to
cancel (such as canceling an RPC call) can provide this logic as part of their
Drop
implementation.
Backpressure
Another essential aspect of at-scale use of futures (and their close relative, streams) is backpressure: the ability of an overloaded component in one part of a system to slow down input from other components. For example, if a server has a backlog of database transactions for servicing outstanding requests, it should slow down taking new requests.
Like cancellation, backpressure largely falls out of our model for futures and
streams. That’s because tasks can be indefinitely “blocked” by a future/stream
returning NotReady
, and notified to continue polling at a later time. For the
example of database transactions, if enqueuing a transaction is itself
represented as a future, the database service can return NotReady
to slow down
requests. Often, such NotReady
results cascade backward through a system,
e.g. allowing backpressure to flow from the database service back to a
particular client connection then back to the overall connection manager. Such
cascades are a natural consequence of the demand-driven model.
Communicating the cause of a wakeup
If you’re familiar with interfaces like
epoll, you may have noticed
something missing from the park
/unpark
model: it provides no way for a task
to know why it was woken up.
That can be a problem for certain kinds futures that involve polling a large number of other futures concurrently—you don’t want to have to re-poll everything to discover which sub-future is actually able to make progress.
To deal with this problem, the library offers a kind of “epoll for everyone”:
the ability to associate “unpark events” with a given Task
handle. That is,
there may be various handles to the same task floating around, all of which can
be used to wake the task up, but each of which carries different unpark events.
When woken, the future within the task can inspect these unpark events to
determine what happened. See
the docs
for more detail.
Wrapping up
We’ve now seen the core design principles behind the Rust futures and streams library. To recap, it boils down to a few key ideas:
Encapsulate running futures into tasks, which serve as a single, permanent “callback” for the future.
Implement futures in a demand-driven, rather than callback-oriented, style.
Use Rust’s trait system to allow composed futures to flatten into big state machines.
Together, these ideas yield a robust, ergonomic, zero cost futures library.
As I mentioned at the outset of the post, we’re very actively working on the layers above the basic futures library—layers that incorporate particular I/O models (like mio) and also provide yet-higher-level tools for building servers. These layers are part of the Tokio project, and you can read more about the overall vision in my earlier post. As those APIs stabilize, expect to see more posts describing them!


Wash your hands often with soap and water for at least 20 seconds especially after you have been in a public place, or after blowing your nose, coughing, or sneezing.
2
Avoid Close Contact
Avoid close contact with people who are sick. Put distance between yourself and other people if COVID-19 is spreading in your community. This is especially important for people who are at higher risk of getting very sick.
3
Stay At Home
Stay home if you are sick, except to get medical care.  This includes tables, doorknobs, light switches, countertops, handles, desks, phones, keyboards, toilets, faucets, and sinks.
Symptoms
These symptoms may appear 2-14 days after exposure (based on the incubation period of MERS-CoV viruses).


Navbar
Home
(current)
Features
Pricing
Dropdown link
Action
Another action
Something else here
Alex B's personal webpage
Who and why.
About me
It is not my photo
My name is Alexander
I am from Russia
Email me
Find me IRL
Win95.CSS
Classic cloud background
Yeah thats cool
Like in Windows 98
Welcome to 90s
Made with
Win95.css
I have winamp on my site
You can play your own tracks
More info
here
Send me e-mail
Your e-mail:
Your name:
Message content:
Check it if you are spamer
Yes, I am spamer
Send this email.


I got an Atari 400 for my Bar Mitzva and learned Atari Basic, 6502, pascal, Fortran, c, Ada, c++, Java and now I code in python. I've served in the Israeli Air Force for 5 years where I've maintained the F16 flight simultor in Fortran and later worked on System V.2 unix box from cromemco and learned to use my favorite editor VI. After the army I worked for five years in a startup that developed TCP/IP acceleration software. I than started working on my own product "The Cloud" a WAN Emulator lunched in 1998. I was the CEO, bootstraping the company, Shunra Software LTD, to 60 employees with positive cash flow. Since I cashed out about 8 years ago I've been learning to code for the web and develop open source code.


For now, nub:2 is a test to see how much dramatic whiz bang visual effect I can apply to a site with zero, zip... NADA in the way of actual graphics. No, .png files, .gifs or .jpgs. In fact, not even an SVG!!! At least... for now.
Yours, M
Future home of the best damn website on the internet.


This page is forked from ConvNetJS made by @karpathy.It trains a Convolutional Neural Network to recognize Logo in your browser, with nothing but Javascript. The dataset is fairly easy and one should expect to get somewhere around 99% accuracy within few minutes.
This network takes a 32x32 Logo image and crops a random 28x28 window before training on it (this technique is called data augmentation and improves generalization). Similarly to do prediction, 4 random crops are sampled and the probabilities across all crops are averaged to produce final predictions. The network runs at about 5ms for both forward and backward pass on my reasonably decent Ubuntu+Chrome machine.
By default, in this demo we're using Adadelta which is one of per-parameter adaptive step size methods, so we don't have to worry about changing learning rates or momentum over time. However, I still included the text fields for changing these if you'd like to play around with SGD+Momentum trainer.
Report questions/bugs/suggestions to @Boris Town.


{% extends "base_site.html" %} {% load markup recordingtags sitevars tagging_tags %} {% block title %}collections{% endblock %} {% block body %}id="collections"{% endblock %} {% block content %}
These are our collections in order of addition to RareTunes. You can also see a full list of collections.
{% else %}Collections hold playlists, albums, and recordings & performers, composers from particular sources or grouped round a theme.
No collections found.
{% endif %}


-
TAG
-
In information systems, a tag is a keyword or term assigned to a piece of information (such as an Internet bookmark,
digital image, database record, or computer file). This kind of metadata helps describe an item and allows it to be
found again by browsing or searching.[1] Tags are generally chosen informally and personally by the item's creator
or by its viewer, depending on the system, although they may also be chosen from a controlled vocabulary.[2]
-
ATTRIBUTE
-
HTML attributes are special words used inside the opening tag to control the element's behaviour. HTML attributes
are a modifier of an HTML element type. An attribute either modifies the default functionality of an element type or
provides functionality to certain element types unable to function correctly without them. In HTML syntax, an
attribute is added to an HTML start tag.
-
ELEMENT
-
An HTML element is an individual component of an HTML (Hypertext Markup Language) document or web page.[vague] HTML
is composed of a tree of HTML nodes, such as text nodes. Each node can have HTML attributes specified. Nodes can
also have content, including other nodes and text. Many HTML nodes represent semantics, or meaning. For example, the
<title> node represents the title of the document.
[1] Some users, however, see tags not as metadata but as "just more content": Berendt, Bettina; Hanser, Christoph
(2007). "Tags are not metadata, but 'just more content'—to some people" (PDF). Proceedings of the International
Conference on Weblogs and Social Media (ICWSM), Boulder, Colorado, USA, March 26–28, 2007. Menlo Park, CA:
International Joint Conferences on Artificial Intelligence. OCLC 799635928.
[2] Smith, Gene (2008). Tagging: people-powered metadata for the social web. Berkeley: New Riders Press. ISBN
9780321529176. OCLC 154806677.


Nucleator CLI Reference
nucleator-account(1) Manual Page
NAME
nucleator-account - implement AWS Account setup best practices
SYNOPSIS
nucleator account setup [options]
nucleator account rolespec list [options] nucleator account rolespec provision [options] nucleator account rolespec validate [options]
DESCRIPTION
Implements AWS Account setup best practices by providing Nucleator commands that:
-
enable Account-level best practices by establishing pre-requisite AWS resources for Nucleator usage and recommended Account-level AWS Services such as CloudTrail, detailed billing and (future) AWS Config;
-
consistently use IAM Roles to establish minimally permissive access policies, together with required trust policies, that enable devops automation to span multiple AWS Accounts;
-
provide consistent mechanisms to concisely and transparently specify required IAM Roles within Nucleator Stacksets;
-
conveniently provision specified IAM Roles within an AWS Account, and validate that cross-account delegation via IAM Roles is functioning as expected.
SUBCOMMANDS
Subcommands provide for Account-level setup and role maintenance activities that result in the creation of IAM Roles required for proper functioning of Nucleator Stacksets.
ACCOUNT SETUP
nucleator account setup conveniently adds resources to the specified AWS Account that enable best-practice usage of account-level AWS Services and that are required to suppor Nucleator’s use of AWS CloudFormation.
For usage details, refer to nucleator-account-setup(1)
IAM ROLE SPECIFICATION AND MAINTENANCE
nucleator account rolespec can be used to:
-
list the specifications of IAM Roles and their associated access and trust policies that are required for usage of all installed Nucleator Stacksets, or a specified Nucleator Stackset.
-
provision the IAM Roles required by all installed Nucleator Stacksets, or a specified Nucleator Stackset, into the specified AWS Account.
-
validate that provisioned IAM Roles can be assumed and that temporary credentials can be obtained from the AWS Secure Token Service as required for Nucleator to operate across AWS Account boundaries in a secure manner, without requiring cross-account sharing of IAM User credentials.
For usage details, refer to nucleator-account-rolespec(1)
NUCLEATOR
Part of the nucleator(1) suite


All available ride offers
Drivers' name:
Jonh
Date & Time:
20th December at 11:30 AM
Lorem, ipsum dolor sit amet consectetur adipisicing elit. Saepe, reprehenderit placeat consectetur, optio.
Join the rideDrivers' name:
Susan
Date & Time:
25th December at 12:00 PM
Lorem ipsum dolor sit amet consectetur adipisicing elit. Incidunt, ea omnis unde qui accusantium nemo suscipit earum. Obcaecati, aliquam?
Join the rideDrivers' name:
Kim
Date & Time:
30th December at 5:00 PM
Lorem ipsum dolor sit amet consectetur adipisicing elit. Labore magni ut et ex dicta, quam totam .
Join the rideDrivers' name:
Jimmy
Date & Time:
2nd January at 8:00 AM
Lorem, ipsum dolor sit amet consectetur adipisicing elit. Non, ex enim nam deserunt esse natus libero totam fugiat!
Join the rideDrivers' name:
Hannah
Date & Time:
7th January at 12:40 PM
Lorem ipsum dolor sit amet consectetur adipisicing elit. Dolore accusamus hic, sunt maiores perferendis m voluptatibus unde doloribus?
Join the rideDrivers' name:
Derick
Date & Time:
1st February at 7:00 AM
Lorem ipsum dolor sit amet consectetur adipisicing elit. Ex veniam adipisci ut, ipsum tempora quis odit sint sunt?
Join the ride


PrimeTimeTwitter
Login
Sign Out
Share your thoughts with the world...
140
Tweet
What would you like to say?
×


You can customize any color theme
that comes with PHP Generator adding or changing just a few lines of code. The theme created for the page below is based on the standard
Facebook theme and is used in our MySQL Schema Browser demo
to make it look like one of the previous versions of MySQL.com website.


1)Name the elf who was a key to find the locket of slytherin:
Kreacher
Dobby
Winky
Trelawny
2)What is full form of R.A.B.?
Rufes A. Black
Regulas A. Bond
Regulas A. Black
Ronald A. Blue
3)Nick name of James Potter was?
Mooney
Wormtail
Prongs
Padfoot
4)Spell which became identity of Harry Potter
Stupefy
Alohomora
Sectum Sempra
Expelliarmus
5)After Fudge who became the minister of magic?
P. Thikness
Scrimguer
Shackelbolt
Harry Potter


It’s very tempting to want to use SystemD with Docker.
Instead a great alternative is to use Supervisord. Supervisord makes it really easy to get off the ground running and daemonise processes. It will also do fancy things restart the process if it quits unexpectedly.
Example - Running an SSH Server
Here is a simple example that runs a basic SSH server in a Ubuntu 16.04 container.
FROM ubuntu:16.04
EXPOSE 22
RUN apt-get update
RUN apt-get -y install openssh-server
RUN mkdir -p /var/run/sshd
RUN echo 'root:password' | chpasswd
RUN sed -i 's/PermitRootLogin prohibit-password/PermitRootLogin yes/' /etc/ssh/sshd_config
RUN apt-get -y install supervisor && \
mkdir -p /var/log/supervisor
RUN mkdir -p /etc/supervisor/conf.d/
RUN echo "[supervisord] \n\
nodaemon=true \n\
[include] \n\
files = /etc/supervisor/conf.d/*.conf" > /etc/supervisor.conf
RUN echo "[program:ssh] \n\
command=/usr/sbin/sshd -D \n\
autorestart=true \n\
autostart=true \n\
redirect_stderr=true" > /etc/supervisor/conf.d/ssh.conf
CMD ["supervisord", "-c", "/etc/supervisor.conf"]
- Build:
docker build -t ssh_server .
- Run:
docker run -p <IP_ADDRESS>:22:22 -i -t ssh_server
- Login:
ssh<EMAIL_ADDRESS>This will bind the SSH server to the localhost interface on the host machine. If you are running a SSH server on your host then you may want to change the port the container binds to on the host.
Notes:
- Additional config files can be added to the
/etc/supervisor/conf.d
directory - Supervisord is designed to work with processes that run in the forground, hence the
-D
switch tells SSH Daemon to run in the foreground. - If a given process won’t run in the foreground, then a process proxy will be required.
comments powered by Disqus


A web application that gives you buy/sell/hold recommendations about your stocks based on technical analysis and sends you a text message when sentiment towards one of your stocks drastically changes on Twitter. Financial data pulled from BlackRock's API, sentiment analysis done through Google Cloud API, text message sent via Twilio API. Won best use of BlackRock API at LA Hacks 2018.
Built with: node.js, Python/Flask, Google Cloud ML API, Twitter API, Twilio API, BlackRock API
A tetris AI that moves on its own! Makes decisions by checking possible moves and selecting the least costly one, determined by the state of the board. Built using open source C++ Tetris game.
Built with: C++
Website for FTC 2017, a 700-attendee event for Circle K International clubs from California, Nevada, and Hawaii.
Built with: HTML, CSS, Bootstrap, some JavaScript, Illustrator
jonathanchu78.github.io/Mesh | GitHub
An event schedule app meant to replace paper pamphlets at large-scale events.
Built with: HTML, CSS, Bootstrap, JavaScript, Firebase
CS M152A: Digital Design Lab | TA: Gu | GitHub
A 2-player face-off between tanks launching projectiles at each other. Display rendered through VGA port on FPGA.
Built with: Verilog // FPGA
Machine Learning (Coursera) | Prof. Ng
A 3-layer neural network trained with 4000 examples using backpropagation and a given minimization algorithm.
Built with: Octave
EE M16: Logic Design of Digital Systems | Prof. Mehta | GitHub
A hardware neural network taking as input a 1-bit morse signal and that determines letters represented by the signal.
Built with: Verilog
CS 32: Introductory Data Structures & Algorithms | Prof. Nachenberg | Spec | Sample Code
A game in which each player is assigned an anthill and given the task of programming their ants to maximize their anthill's size. Interactions all game objects (ants, antills, other bugs, rocks, etc) were considered.
Built with: C++ (Inheritance, Polymorphism)


https://github.com/cstieg/MovieWebsite
https://github.com/cstieg/Stieg-Chess-Engine
https://github.com/cstieg/MultiUser-Blog
https://github.com/cstieg/Neighborhood-Map


{% extends "app/layout.html" %} {% block content %}
This work resulted from the SNAP: Science for Nature and People Water Transactions Working Group at the National Center for Ecological Analysis and Synthesis, a Center funded by the Gordon and Betty Moore Foundation, the University of California, Santa Barbara, and the State of California.
For more information on the working group, including a list of its participants and their organizations, please visit the SNAP project description page and the the project page at NCEAS .
{% endblock %}


ASICS Drops Cream-Colored Woolen GEL-PTG MT Sneakers
An atmos exclusive.
by Charlie ZhangFollowing a low-cut translucent iteration of the GEL-PTG MT, ASICS is back with the latest revamp of the silhouette. This time around, the sneakers come in a high-top build, covered in delicate cream-colored wool for the current winter season.
Boasting a mix of wool, rubber and suede textiles, the sneakers are a modern take of the original 1983 “FABREPOINTGETTER” mold. The top of the shoe is stamped with “ASICS” branding over crisp white suede, followed by tonal laces that cross over the forefoot. Soft fleece textiles cover the uppers, from the collars to the midsole. Contrasting the beige material, the upper heel counter is thinly embroidered with navy “GEL” branding. One defining feature is the bright red sidestripes, accenting the body all the way from the heel to the forefoot. The toebox comes in white suede, accented with subtle perforations. All of these details sit atop a tonal white midsole, equipped with an Ortholite insole and fuzeGEL at the heel wedge for enhanced cushioning.
The ASICS GEL-PTG MT is exclusively available at atmos-tokyo.com for $129 USD.
Elsewhere, Hender Scheme has unveiled its refined SS20 collection.
ASICS GEL-PTG MT “Beige”
Release Date
November 21, 2019 - 12:00 am EST (TBC)
Price
129 USD


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
1 Court No. - 2 Case :- PUBLIC INTEREST LITIGATION (PIL) No. - 4003 of 2006 Petitioner :- Re: Ganga Pollution Respondent :- State Of U.P. And Others Petitioner Counsel :- Vijay Chandra Srivastava,A.K. Gupta,A.K. Srivastava,Anil Tiwari,Arun Kumar,Arvind Agarwal,Baij Nath Yadav,Baleshwar Chaturvedi,D.B. Mishra,D.S. Mishra,Jagdish Tewari,K.C. Pandey,P.N. Mishra,S.K. Srivastava,Shailesh Singh,Sharad Kr. Srivastava,Sunita Sharma,V.B. Singh,V.C. Mishra,Vivek Mishra Respondent Counsel :- C.S.C.,A.K. Mishra,Ajay Bhanot,Anjani Kumar Mishra,C.L.Pandey,Chandan Sharma,Dr. H.N.Tripathi,H.N. Singh,Hem Pratap Singh,Iqbal Ahmad,M.C. Chaturvedi,N. Misra,P.S. Baghel,R.B. Shukla,Rajiv Lochan Shukla,S.A. Lari,S.M.A. Kazmi,S.P. Kesharwani,S.P. Singh,T.M.Khan,Vivek Birla,Vivek Verma,W.A. Hashmi Hon.Ashok Bhushan, J.
Hon.Arun Tandon,J.
Repeatedly the Additional Advocate General on the instructions of the officers, has been informing the Court that because of acute shortage of water at Narora Barrage adequate quantity of water is not being released so as to ensure that the river down stream till Allahabad has reasonable quantity and quality of water. The Court is sorry to note that the state respondents have deliberately not disclosed that the main stream of river Ganges enters into the State of Uttar Pradesh in the district of Bijnore; the water is diverted by canals even before it reaches Narora Barrage. The result is that the main stream at Allahabad has been rendered a mere 'Nala'. We have been informed that the water level at the canals is near the danger mark. We feel that a serious issue has arisen as to upto what extent the State can draw water from the main and normal stream of river Ganges to feed the canals. The issues are:
(a) Can the State draw unlimited quantity of water from a river even to the extent of rendering its main stream a dry zone?
(b) Can the State because of drawl of water from upper portion of river Ganges render its quantity or quality of water completely unfit for human use even for bathing purposes?
(c) Can the natural resources like river Ganges be permitted to be completely destroyed by drawing unlimited quantity of water for irrigation purposes?
Let a personal affidavit by the Chief Secretary of the State be filed explaining the stand of the State on the said three legal issues. He will also indicate as to how the level of the water is recorded in various districts after examining the Irrigation Manual of the State of U.P. and what is the minimum 2 quantity of water required to maintain the main stream of river Ganges downstream.
The Chief Secretary shall also file a plan depicting the main stream of the river Ganges as it flows through the State of Uttar Pradesh, the number of canals constructed thereon and the total quantity of water drawn from the main stream for various canals.
In the matter of shifting of tanneries, the Additional Advocate General submitted that State has now changed its plan and wants to permit reopening of the tanneries at Kanpur. He stated that the STP of 36 MLD, which has been established, would be exclusively earmarked for the treatment of the discharge from the tanneries. The stand so taken is contrary to what was stated in earlier affidavits of the State.
At present the total discharge of dirty water in Kanpur is 409 MLD and the treating capacity of STPs at Kanpur is only 106 MLD, yet the State wants to suggest that STP of 36 MLD shall be exclusively used for the purposes of treatment of discharge from tanneries meaning thereby Kanpur Nagar will continue to discharge 303 MLD untreated sewage water in the river Ganges.
As early as on 23rd January, 2006 a Division Bench of this Court passed following order:-
"We, therefore, direct the Chief Secretary of the State of Uttar Pradesh to file a detailed counter affidavit disclosing the steps taken and also the proposed steps to be taken by the State Government for permanent solution. The Member Secretary of the U.P. State Pollution Control Board shall also file an affidavit on behalf of respondent no.5 giving details regarding steps taken by the U.P. State Pollution Control Board for prevention and control of pollution in holy river Ganga."
We cannot approve of the scheme as suggested for opening of the tanneries by the State Government. The Chief Secretary of the State of U.P. must ensure immediate shifting of the tanneries and the STP at Kanpur shall be utilised for treatment of the sewage water as is being done till date.
The Chief Secretary must also visit the city of Allahabad himself for overseeing the laying of the sewer lines as well as the state of the roads, which have been dug for laying down the sewer to be connected with the new STP to be established. The Court has been informed today by the Additional Advocate General that the work of repairing of the roads after sewer pipeline is laid by the 3 contractor is to be done by the Nagar Nigam and the Public Works Department. Learned counsel for the Nagar Nigam submits that the roads cannot be repaired as rainy season is forthcoming and the repairing shall be done only after the rains when dug out mud settles down.
The contention so raised does not appeal to us. The roads for laying down the sewage pipeline have been dug in the City of Allahabad for last more than four months and the authorities are waiting for the rainy season to be over before repairing the road, only to avoid the manual filling of the dug portion of the road. The Court has also been informed that the earth which was dug out for laying the pipes has been removed by the contractor.
The Chief Secretary shall examine as to under which authority the earth has been removed by the contractor, with reference to the contract entered, for the purpose he shall indicate as to who is responsible for the state of affairs and as to what appropriate action is to be taken in this regard.
The Defence Department has been offered State land i.e., Plot Nos.614 and 615, total area 1055.60 square metres situate at Mehdauri, Allahabad, which is adjoining cantonment area in lieu of land provided at Mori Gate. Let the competent Military authority examine the offer and if the land is acceptable they may give their consent in writing. The competent Military authority shall, however, hand over the possession of the land at Mori Gate for establishment of the pumping station immediately as we have been assured on behalf of the State that it shall provide equivalent land, as asked for by the defence authority, adjoining any existing cantonment area. The competent Military authority may file an affidavit in respect of suitability of the land now offered by the next date.
The competent defence authority shall also file an affidavit stating as to when the STP at Fort New Cantt. and Old Cantt. shall be established and made operational, separate dates for the purpose may be indicated.
The Court has been informed that I.I.T., Kanpur has established its own STP and the discharge of used water is up to the standard prescribed. Further notices have been issued by the U.P. Pollution Control Board to the H.R.I., Allahabad, B.H.U., Varanasi, Allahabad University, Allahabad and other such institutions. In case no reply is received, appropriate action in accordance with the provisions of the Pollution Act shall be taken.
The U.P. Pollution Control Board shall file an affidavit disclosing the test report of the water as available in river Ganges at Allahabad on date.
Impleadment application filed today is allowed. Let M/s VIRCL 4 Infrastructure & Project Limited be impleaded as respondent No.18. Learned Standing Counsel may inform the newly impleaded respondent about the proceedings pending before this Court. A copy of the application filed today may also be forwarded to the newly impleaded respondent so that the said respondent may file its affidavit disclosing the progress report of sewer work and establishment of STP.
This Court by its order dated 26.3.2010 had permitted the three tanneries; M/s Renates Eastern Export Jajmau, Kanpur, M/s Imperial Leather Finishers Pvt. Ltd. Jajmau, Kanpur and M/s Salik Leather Finishers Jajmau, Kanpur to operate for a period of four weeks so as to unable the U.P .Pollution Control Board to monitor their functioning by drawing samples of the discharge. In the affidavit filed on behalf of U.P. Pollution Control Board, it has been submitted that samples of the effluent were drawn. The discharge from M/s Renates Eastern Export Jajmau, Kanpur and M/s Salik Leather Finishers Jajmau, Kanpur satisfies the norms. In view of the aforesaid stand taken by the U.P. Pollution Control Board, it may permit the running of the aforesaid tanneries subject to regular inspection and monitoring of the discharge. In respect of the third tannery M/s Imperial Leather Finishers, the Pollution Board may submit a fresh report by the next date.
Apart from the above, it has been stated in paragraph 20 of the affidavit of the U.P. Pollution Control Board that 12 tanneries submitted applications that they have removed their shortcomings and may be inspected. Out of the 12, five have removed their short comings as per the inspection report of the U.P. Pollution Control Board. These five tanneries are M/s Tanners Company, 91A, Wazidpur, Jajmau, Kanpur, M/s New Era International, 60C, Gajjupurwa, Jajmau, Kanpur, M/s Roshan Leather Industry, 10, Gajjupurwa, Jajmau, Kanpur, Ms.Sartaj Tanners, Wazidpur, Jajmau, Kanpur, and M/s Leather Tan ( Faiyaz Tanners), D.T.S.Road,Jajmau, Kanpur. The aforesaid five tanneries may be permitted by the Pollution Control Board to become operational subject to continuous monitoring and inspection by the Pollution Control Board and subject to the necessary report being filed by the next date.
M/s. Upper India Tannery Pvt. Ltd, have submitted an application that they will not adopt wet process and will operate the dry process only, let the Tannery file a proper affidavit and undertaking before the U.P. Pollution Control Board who may take appropriate action thereon.
U.P. Pollution Control Board may further inspect M/s Crown tanneries and submit a report by the next date. We however make it clear that the permission to be granted to U.P. Pollution Control Board is only conditional subject to review 5 and monitoring from time to time and if any deficiency/shortcoming is found, it shall be open to the U.P. Pollution Control Board to close the tannery immediately.
We also direct the respondent State authority to file an affidavit disclosing various steps taken in pursuance of our directions issued from time to time in this Public Interest Litigation and what are the proposed steps in that regard.
After having heard learned counsel for the parties and perusing the record, we have an impression that various departments of the State Government have not been coordinating amongst themselves resulting in slow progress in the matter and execution of projects. The Chief Secretary of the State has to intervene and take the command.
We hope and trust that the Chief Secretary of the State shall monitor the progress and compliance of the orders passed earlier in the matter. The pollution in the river Ganges is increasing alarmingly day by day, which effects the life of the common man of the State at large. The magnitude of the pollution in the river Ganges and its effect are not only being felt by the people of the State and country alone but by the international community as a whole. We may refer to an article in the magazine 'Time' ( July, 2010), where it has been stated as follows:-
" From the Himalayas to the plains, rampant growth is turning the Ganges into a toxic sewer. It is not too late to put things right."
We are of the view that serious efforts by the State Government can still restore the river Ganges to its earlier glory. We have been told that in other countries also rivers had been facing same problems. Their Governments have taken appropriate steps and the pollutants have been removed. Reference be had to the case of river Thames in U.K. It is for the Chief Secretary to assist the Court by his presence in the matter by effective and valuable suggestions and contributions towards the pious project which is to be implemented for cleaning the Ganges.
Let affidavits be filed within three weeks.
List on 13th August, 2010, on which date we request the Advocate General and the Chief Secretary of the State of U.P. to appear and assist the Court in the matter.
Let a copy of this order be supplied to the learned Standing counsel by the office.
13/7/2010 sm/Rakesh


Toggle navigation
My Tube
Upload
Notification
Login
Please Upload your file here.
Upload files
Clear
Browse
Upload
Or drag and drop files here
60% Complete


Qatar rejects false accusations by Eritrean Information Ministry
The State of Qatar has totally rejected false accusations contained in a statement by the Eritrean Ministry of Information, stressing that Qatar has nothing to do with any factions or groups in Eritrea, a matter which the Eritrean government knows very well.
In a statement yesterday, the Ministry of Foreign Affairs was surprised by the sudden issuance of the Eritrean statement by the Ministry of Information, instead of resorting to the diplomatic and legal channels that are recognised in the international community. This raises suspicion about the real intentions and the parties behind this unrealistic statement”, the Ministry’s statement noted.
The statement said that the State of Qatar had delivered a protest note in April to the Ambassador of the Republic of Eritrea to Qatar, expressing its disapproval and surprise at a similar statement issued by the Eritrean Ministry of Information.
The statement said that the Ambassador of the Republic of Eritrea to the African Union had called on the State of Qatar to mediate between his country and Djibouti in their border dispute in 2017, considering the State of Qatar was the main negotiator of the peace agreement signed between the two countries in 2010, if the Eritrean government had any doubt about the truth of these ridiculous allegations issued by the Ministry of Information,it would not have made this request.”
The Ministry of Foreign Affairs called on the Eritrean Ministry of Information to consider the facts and the roots of the problems, rather than accusations and falsification of the facts of a country where the friendly Eritrean people only have full respect and appreciation.
Read also
Read More
Qatar welcomes another mega ship with 5,800 aboard
“MSC Bellissima arrived on its maiden call to DohaPort with 5,817 passengers and crew on-board. Welcome to Qatar,” tweeted Mwani Qatar yesterday.
Read More
Indian university education available in Qatar next year
DPS MIS Group says they are opening colleges offering courses in arts, science, commerce and liberal arts in 2020.
Read More
Facebook, Instagram down for 'maintenance'
It is not the first time the social media company has had connectivity problems on its platforms.


new Seq(seq, alphabet, features, topology, length_unit, strand_type, residue_type)
An object representing a biological sequence
Parameters:
| Name | Type | Argument | Default | Description |
|---|---|---|---|---|
seq |
string | the sequence as a string | ||
alphabet |
string | the alphabet, one of seqJS.Alphabets, either 'DNA', 'aDNA', 'RNA', 'aRNA', 'PROT' or 'aPROT' | ||
features |
Array |
<optional> |
new Array() | an array of seqJS.Feature objects referring to the sequence |
topology |
string |
<optional> |
'linear' | sequence topology, 'linear' or 'circular' |
length_unit |
string |
<optional> |
taken from alphabet | the length unit of the sequence, one of 'bp', 'aa' or 'rc' |
strand_type |
string |
<optional> |
'' | type of strand, e.g. 'ss', 'ds'. default is '' - unknown |
residue_type |
string |
<optional> |
'' | type of each residue e.g. 'DNA', 'RNA' |
Methods
-
alphabet() → {string}
-
Get the sequence alphabet
Returns:
sequence alphabet, one of seqJS.Alphabets- Type
- string
-
alphabetType() → {string}
-
Get the alphabet type - i.e. for `alphabet`='aDNA' return 'DNA'
Returns:
alphabet type- Type
- string
-
append(rhs) → {seqJS.Seq}
-
Append a sequence to the end of the sequence
Parameters:
Name Type Description rhs
seqJS.Seq A linear sequence Returns:
this- Type
- seqJS.Seq
-
circularize() → {seqJs.Seq}
-
Set the topology to 'circular'
Returns:
this- Type
- seqJs.Seq
-
extract(feat, extract_features) → {seqJS.Seq}
-
Extract the sequence that the feature refers to
Parameters:
Name Type Argument Default Description feat
seqJS.Feature The feature whose underlying sequence we want to extract extract_features
boolean <optional>
false Whether or not to include cropped features in the output seqJS.Seq. If 'feat' is a multi-span feature, then features which are present in multiple spans are kept as single features, with the spans merged using the 'order' merge operator. For example, if a seq has a feature whose location is 1..50, and you extract a feature whose location is join(10..19,30..39), the location of the resulting feature is order(1..10,11..20) Returns:
A new sequence representing that of the feature- Type
- seqJS.Seq
-
features(start, end, intersect) → {Array}
-
Get a list of features within the range [start,end], or all features if they are not given
Parameters:
Name Type Argument Default Description start
int <optional>
the first position end
int <optional>
start the second position intersect
boolean <optional>
false if true, return features which intersect with [start,end], rather than just features which are wholly contained by [start,end] Returns:
an array of seqJS.Feature objects- Type
- Array
-
isAmbiguous() → {bool}
-
Return true if the alphabet is ambiguous
Returns:
- Type
- bool
-
length() → {number}
-
Get the sequence length (this.seq().length)
Returns:
sequence length- Type
- number
-
lengthUnit() → {string}
-
Get the length unit
Returns:
length unit ('bp','aa','rc')- Type
- string
-
linearize() → {seqJS.Seq}
-
Set the topology to 'linear'
Returns:
this- Type
- seqJS.Seq
-
residueType() → {string}
-
Get the residue type
Returns:
residue type ('DNA', 'RNA', etc)- Type
- string
-
reverseComplement() → {seqJS.Seq}
-
Return a new Seq which is the reverse complement of this sequence
Returns:
the new sequence- Type
- seqJS.Seq
-
seq() → {string}
-
Get the sequence
Returns:
the raw sequence- Type
- string
-
setAmbiguous(ambiguous) → {seqJS.Seq}
-
Set whether or not the alphabet should be ambiguous
Parameters:
Name Type Argument Default Description ambiguous
bool <optional>
True Whether to set ambiguous Returns:
this- Type
- seqJS.Seq
-
strandType() → {string}
-
Get the strand type
Returns:
strand type ('ss','ds','')- Type
- string
-
subseq(start, end, feats) → {seqJS.Seq}
-
Return a substring from start to end. 'start' and 'end' must be of the same type. subseq works much the same as String.substring - e.g. s.subseq(5,7) returns a Seq with two bases, those at positions 5 and 6
Parameters:
Name Type Argument Default Description start
seqJS.Location | int The position to start at end
seqJS.Location | int The position to end at feats
bool <optional>
false Whether to include features Returns:
The sub-sequence- Type
- seqJS.Seq
-
topology() → {string}
-
Get the topology of the molecule
Returns:
either 'linear' or 'circular'- Type
- string
-
toString() → {String}
-
String representation for debugging
Returns:
a string- Type
- String


{% extends 'orfik/home.html' %}
{% block head %}
{% endblock %}
{% block body %}
Instructions
- The hunt begins sharp at 0000 Hours on Feb 10, 2017 and ends on Feb 10 at 23:59 Hours.
- Each participant can make a single login using a username of their choice.
- Once the game begins you will be faced by a series of questions.
- All answers are to be entered in lower case characters with no special characters.
- You can only see one question at a time and will only progress when you answer the question correctly.
- You can have infinite tries on each question until you get the right answer.
- All levels are of equal weightage. There is no negative marking.
- You can also see the leader board at any time to see your progress relative to others.
- Ranks are based on the time the question is answered; with the individual answering first placed higher.
- The CompSoc shall be the sole authority to decide on anything. Any decision made by CompSoc or its representatives is final and irrevocable.
- Any individual found to use any unfair means will be disqualified with immediate effect.
- The use of the internet, searching the source code etc. are all allowed to arrive at the answer.
- Any queries regarding the event will be answered on the CompSoc facebook page. Use the Help option in the menu to access that.
- Use of any sort of foul language while communicating with the organisers on the facebook page. Using foul language will lead to an immediate disqualification.
Start playing!
{% endblock %}


When deployed on Chromebooks, SecureQuiz:
- Prevents students from browsing the web by loading an additional tab or a second browser.
- Prevents students from viewing page source or answers shown in source code.
- Displays a lime green bar at the top of the screen - visual verification that Secure Quiz is active.
- Provides students with quick access to quizzes via a short “access code”
- Supports 92 languages via a virtual keyboard. (¡Viva el español!) (लंबे समय तक नहीं रहो!)
- Provides a ‘time elapsed’ clock in the corner so they can’t exit out and then back in once started.
- Prevents access to external storage, screenshots and the ability to print.
- Eujon A. (Troy City Schools, AL)
- Courtney D. (Anderson, SC)
Your school's GSuite Admin will deploy the SecureQuiz app to managed Chromebooks. Once the app is deployed, individual teachers can create and administer quizzes easily.
Create your quiz as a Google Form.
Use bit.ly to shorten the url of the quiz you have created. The last 6 url characters are the access code you will use in SecureQuiz.
Students launch the SecureQuiz app on their Chromebooks and enter the 6 digit access code to start the quiz. A quick glance at any screen signals when SecureQuiz is active.
Create codes for alternate quizzes in seconds.


Hugo Video Starter
Hugo Video Starter
The only starter you need for a Website containing videos rather than Youtube or Vimeo.
See Example


Before Change
env.sos_dict["_runtime"][k] = v
//
// prepare task variables
env.sos_dict["_runtime"]["cur_dir"] = os.getcwd()
// we need to record the verbosity and sigmode of task during creation because
// they might be changed while the task is in the queue waiting to be
// submitted (this happens when tasks are submitted from Jupyter)
env.sos_dict["_runtime"]["verbosity"] = env.verbosity
After Change
"run_mode", "run")
if "workdir" not in env.sos_dict["_runtime"]:
env.sos_dict["_runtime"]["workdir"] = path.cwd()
elif "TASK" in env.config["SOS_DEBUG"]:
env.log_to_file("TASK", f"Using specified workdir {env.sos_dict["_runtime"]["workdir"]}")


Lean On Me Launches at HackMIT
26 September 2015Hello reader, thank you for joining us on this adventure! We are Lean On Me, an SMS-based peer support network created by three students: Linda, Nikhil, and Andy. Our vision is to connect people so no one has to struggle alone. To this end, our current mission is to build a painless, personalized, and private texting service, beginning with our home at MIT.
Like many college campuses, the MIT community has been struggling with mental health and related services. In recent history, we've had a record number of suicides and attempted suicides on campus. The Lean On Me team surveyed 170 students to figure out how to tackle these challenges. We came out of these conversations with some key insights.
At the core of the problem is a disconnect between students and their perceived ability to seek help. The campus-wide Healthy Minds Study of last spring showed that 49% of undergraduates polled question the seriousness of their needs as a barrier to obtaining support. The process for getting help on campus begins with calling or walking to the MIT Medical building for an appointment, already an obstacle for someone wanting to be alone and seeking immediate support. Furthermore, students sometimes fear that they'll be forced to leave school if they seek help. A call-in service called Nightline used to exist on campus, but it shut down several years ago due to its the inability to handle spammers. After surveying our classmates, we came to the conclusion that even friends are scared to reach out to one another when they both seem too busy. Lean On Me is our attempt to overcome these roadblocks and lower the barrier to entry for getting help from a caring listener.
We've built an anonymous texting platform on top of Twilio that connects students to peer supporters. Students just text the hotline with a problem and an NLP algorithm extracts some key indicators that we use to make an optimal match based on peer counselor profile and availability. All messages are exchanged in memory, so no conversation ever hits a system hard drive. Privacy is key in a service such as this one.
We're currently piloting the system on MIT's campus, and once we have something that works well, we will begin to explore bringing our tool to college campuses and high schools throughout the country to help everyone get the support they need.


Room Traders
UNL Login
Price ▽
Campus ▽
Rooms ▽
Pets ▽
Lease Length ▽
Landlord Rating ▽
__ Min __ Max
☐ City ☐ East
__ Min __ Max
☐ Yes ☐ No
__ Min __ Max
☆ ☆ ☆ ☆ ☆
Name
E-mail
Major
Year In School
Last Name
Phone
SUBMIT


The following tests have been selected:
BMC-PHY-TX-EYE
BMC-PHY-RX-INT-REJ
BMC-PHY-RX-BUSIDL
BMC-PHY-TERM
BMC-PHY-MSG
Installed Plug-In PDT-BT3 meets USB-IF requirements for these tests.
UUT declared to meet Rev 3.0
Cable marker is emulated where appropriate.
Establish PD Mode...
Initial request accepted...
BIST request actioned...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
Setting Signal to Parameters Tx Group 1 (UUT as Sink)...
Sending Multiple BIST Test Data messages...
This phase will take 20-30 seconds...
All BIST messages acknowledged - pass...
Setting Signal to Parameters Tx Group 2 (UUT as Sink)...
Sending Multiple BIST Test Data messages...
This phase will take 20-30 seconds...
All BIST messages acknowledged - pass...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
Setting Signal to Parameters Tx Group 1 (UUT as Source)...
Sending Multiple BIST Test Data messages...
This phase will take 20-30 seconds...
All BIST messages acknowledged - pass...
Setting Signal to Parameters Tx Group 3 (UUT as Source)...
Sending Multiple BIST Test Data messages...
This phase will take 20-30 seconds...
All BIST messages acknowledged - pass...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
CC Voltage = 1610mV
Tester acting as Source (Rp=4k7)
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending Get_Source_Caps...
Get_Source_Cap received...
Sending Get_Source_Caps...
Get_Source_Cap received...
Sending Cable Reset...
Sending Get_Source_Caps...
Get_Source_Cap received...
Sending Cable Reset...
Sending Get_Source_Caps...
Get_Source_Cap received...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending Get_Source_Caps...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Sending BIST Test Data message...
BIST request acknowledged, now in test mode...
Simulating Detach From UUT...
Establish PD Mode...
Initial request accepted...
Simulating Detach From UUT...
End of Tests. Duration: 00:03:49
| Event #19 | VBUS turned on | |
| Events #24-25 | PD Sequence Start (Announce Source Capabilities) | |
| Event #24 | PD Message - Source Capabilities (from Tester) | |
| Event #25 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #26-32 | PD Sequence Start (Power Transition Request) | |
| Event #26 | PD Message - Request (from UUT) (SOP) | |
| Event #27 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #28 | PD Message - Accept (from Tester) (SOP) | |
| Event #29 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #31 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #32 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #40-41 | PD Sequence Start (BIST Test Sequence) | |
| Event #40 | PD Message - BIST (from Tester) (SOP) | |
| Event #41 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #42-42 | PD Sequence Start (Unknown PD Function) | |
| Event #42 | PD Continuous Data | |
| Event #50 | VBUS turned off |
Capture #2 BMC Eye Diagram
| UI = 3320ns | ||
| Ref Freq (fBitRate)= 301204Hz | ||
| Risetime = 431.1ns | ||
| Falltime = 369.5ns | ||
| pBitRate = 0.008% | ||
| Eye diagram fits at attempt #1. (0.601V) | ||
| Eye diagram is valid. |
| Event #132 | VBUS turned on | |
| Events #137-138 | PD Sequence Start (Announce Source Capabilities) | |
| Event #137 | PD Message - Source Capabilities (from Tester) | |
| Event #138 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #139-145 | PD Sequence Start (Power Transition Request) | |
| Event #139 | PD Message - Request (from UUT) (SOP) | |
| Event #140 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #141 | PD Message - Accept (from Tester) (SOP) | |
| Event #142 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #144 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #145 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #153-154 | PD Sequence Start (BIST Test Sequence) | |
| Event #153 | PD Message - BIST (from Tester) (SOP) | |
| Event #154 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #158-159 | PD Sequence Start (BIST Test Sequence) | |
| Event #158 | PD Message - BIST (from Tester) (SOP) | |
| Event #159 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #160-161 | PD Sequence Start (BIST Test Sequence) | |
| Event #160 | PD Message - BIST (from Tester) (SOP) | |
| Event #161 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #162-163 | PD Sequence Start (BIST Test Sequence) | |
| Event #162 | PD Message - BIST (from Tester) (SOP) | |
| Event #163 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #164-165 | PD Sequence Start (BIST Test Sequence) | |
| Event #164 | PD Message - BIST (from Tester) (SOP) | |
| Event #165 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #166-167 | PD Sequence Start (BIST Test Sequence) | |
| Event #166 | PD Message - BIST (from Tester) (SOP) |
...Suppressing multiple event reporting...
| 13362 BIST Test messages were successfully responded to |
| Events #27222-27223 | PD Sequence Start (BIST Test Sequence) | |
| Event #27222 | PD Message - BIST (from Tester) (SOP) | |
| Event #27223 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #27224-27225 | PD Sequence Start (BIST Test Sequence) | |
| Event #27224 | PD Message - BIST (from Tester) (SOP) | |
| Event #27225 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #27226-27227 | PD Sequence Start (BIST Test Sequence) | |
| Event #27226 | PD Message - BIST (from Tester) (SOP) | |
| Event #27227 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #27228-27229 | PD Sequence Start (BIST Test Sequence) | |
| Event #27228 | PD Message - BIST (from Tester) (SOP) | |
| Event #27229 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #27230-27231 | PD Sequence Start (BIST Test Sequence) | |
| Event #27230 | PD Message - BIST (from Tester) (SOP) |
...Suppressing multiple event reporting...
| 13362 BIST Test messages were successfully responded to |
| Event #54247 | Detached | |
| Event #54253 | VBUS turned off |
| Event #54314 | VBUS turned on | |
| Events #54317-54320 | PD Sequence Start (VDM Discover ID) | |
| Event #54317 | PD Message - VDM - Discover ID REQ (Rev 3.0) (from Cable or UUT) (SOP') | |
| Event #54318 | PD Message - GoodCRC (from Emulated Marker) (SOP') | |
| Event #54319 | PD Message - VDM - Discover ID ACK (from Emulated Marker) (SOP') | |
| ID Header B15:B0 - (Vendor ID) is not VIF specified value. | ||
| Product VDO B31:B16 - (PID) is not VIF specified value. | ||
| Cable VDO B31:28 - (HW Version) is not VIF specified value. | ||
| Cable VDO B27:24 - (Firmware Version) is not VIF specified value. | ||
| Cable VDO B19:18 - (Type-C to Type-A/B/C) is not VIF specified value. | ||
| Cable VDO B16:B13 - (Cable Latency) is not VIF specified value. | ||
| Cable VDO B6:B5 - (VBUS Current Handling Capability) is not VIF specified value. | ||
| Cable VDO B4 - (VBUS through cable) is not VIF specified value. | ||
| Cable VDO B2:B0 - (USB Superspeed Signaling Support) is not VIF specified value. | ||
| Event #54320 | PD Message - GoodCRC (from Cable or UUT) (SOP') | |
| Events #54321-54322 | PD Sequence Start (Announce Source Capabilities) | |
| Event #54321 | PD Message - Source Capabilities (from UUT) | |
| Event #54322 | PD Message - GoodCRC (from Tester) (SOP) | |
| Events #54323-54329 | PD Sequence Start (Power Transition Request) | |
| Event #54323 | PD Message - Request (from Tester) (SOP) | |
| Event #54324 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #54325 | PD Message - Accept (from UUT) (SOP) | |
| Event #54326 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #54328 | PD Message - PS_RDY (from UUT) (SOP) | |
| Event #54329 | PD Message - GoodCRC (from Tester) (SOP) | |
| Events #54330-54333 | PD Sequence Start (VDM Discover ID) | |
| Event #54330 | PD Message - VDM - Discover ID REQ (Rev 2.0) (from UUT) (SOP) | |
| Event #54331 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #54332 | PD Message - VDM - Discover ID ACK (from Tester) (SOP) | |
| VDM Header B14:13 - (Structured VDM Version) is not correct | ||
| ID Header B30 - (Data Capable as USB Device) is not VIF specified value. | ||
| ID Header B29:B27 - (Product Type) is not VIF specified value. | ||
| ID Header B26 - (Modal Operation supported) is not VIF specified value. | ||
| ID Header B15:B0 - (Vendor ID) is not VIF specified value. | ||
| Product VDO B31:B16 - (PID) is not VIF specified value. | ||
| Product VDO B15:B0 - (bcdDevice) is not VIF specified value. | ||
| Event #54333 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #54341-54342 | PD Sequence Start (BIST Test Sequence) | |
| Event #54341 | PD Message - BIST (from Tester) (SOP) | |
| Event #54342 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #54345-54346 | PD Sequence Start (BIST Test Sequence) | |
| Event #54345 | PD Message - BIST (from Tester) (SOP) | |
| Event #54346 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #54347-54348 | PD Sequence Start (BIST Test Sequence) | |
| Event #54347 | PD Message - BIST (from Tester) (SOP) | |
| Event #54348 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #54349-54350 | PD Sequence Start (BIST Test Sequence) | |
| Event #54349 | PD Message - BIST (from Tester) (SOP) | |
| Event #54350 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #54351-54352 | PD Sequence Start (BIST Test Sequence) | |
| Event #54351 | PD Message - BIST (from Tester) (SOP) | |
| Event #54352 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #54353-54354 | PD Sequence Start (BIST Test Sequence) | |
| Event #54353 | PD Message - BIST (from Tester) (SOP) |
...Suppressing multiple event reporting...
| 13362 BIST Test messages were successfully responded to |
| Events #81387-81388 | PD Sequence Start (BIST Test Sequence) | |
| Event #81387 | PD Message - BIST (from Tester) (SOP) | |
| Event #81388 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #81389-81390 | PD Sequence Start (BIST Test Sequence) | |
| Event #81389 | PD Message - BIST (from Tester) (SOP) | |
| Event #81390 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #81391-81392 | PD Sequence Start (BIST Test Sequence) | |
| Event #81391 | PD Message - BIST (from Tester) (SOP) | |
| Event #81392 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #81393-81394 | PD Sequence Start (BIST Test Sequence) | |
| Event #81393 | PD Message - BIST (from Tester) (SOP) | |
| Event #81394 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #81395-81396 | PD Sequence Start (BIST Test Sequence) | |
| Event #81395 | PD Message - BIST (from Tester) (SOP) |
...Suppressing multiple event reporting...
| 13362 BIST Test messages were successfully responded to |
| Event #108392 | Detached | |
| Event #108394 | VBUS turned off |
| Event #108457 | VBUS turned on | |
| Events #108462-108463 | PD Sequence Start (Announce Source Capabilities) | |
| Event #108462 | PD Message - Source Capabilities (from Tester) | |
| Event #108463 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #108464-108470 | PD Sequence Start (Power Transition Request) | |
| Event #108464 | PD Message - Request (from UUT) (SOP) | |
| Event #108465 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #108466 | PD Message - Accept (from Tester) (SOP) | |
| Event #108467 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108469 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #108470 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108477-108478 | PD Sequence Start (BIST Test Sequence) | |
| Event #108477 | PD Message - BIST (from Tester) (SOP) | |
| Event #108478 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108481-108481 | PD Sequence Start (BIST Test Sequence) | |
| Event #108481 | PD Message - BIST (from Tester) (SOP) |
| Events #108483-108484 | PD Sequence Start (BIST Test Sequence) | |
| Event #108483 | PD Message - BIST (from Tester) (SOP) | |
| Event #108484 | PD Message Fragment - assuming last part of GoodCRC (from UUT) |
| Event #108487 | Detached | |
| Event #108493 | VBUS turned off |
| Event #108556 | VBUS turned on | |
| Events #108561-108562 | PD Sequence Start (Announce Source Capabilities) | |
| Event #108561 | PD Message - Source Capabilities (from Tester) | |
| Event #108562 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #108563-108569 | PD Sequence Start (Power Transition Request) | |
| Event #108563 | PD Message - Request (from UUT) (SOP) | |
| Event #108564 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #108565 | PD Message - Accept (from Tester) (SOP) | |
| Event #108566 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108568 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #108569 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108577-108578 | PD Sequence Start (BIST Test Sequence) | |
| Event #108577 | PD Message - BIST (from Tester) (SOP) | |
| Event #108578 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #108580 | Tester acting as Source (Rp=4k7) | |
| Measured 1652 mV (in range) |
| Event #108586 | Detached | |
| Event #108592 | VBUS turned off |
| Event #108664 | VBUS turned on | |
| Events #108669-108670 | PD Sequence Start (Announce Source Capabilities) | |
| Event #108669 | PD Message - Source Capabilities (from Tester) | |
| Event #108670 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #108671-108677 | PD Sequence Start (Power Transition Request) | |
| Event #108671 | PD Message - Request (from UUT) (SOP) | |
| Event #108672 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #108673 | PD Message - Accept (from Tester) (SOP) | |
| Event #108674 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108676 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #108677 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108685-108695 | PD Sequence Start (BIST Test Sequence) | |
| Event #108685 | PD Message - BIST (from Tester) (SOP) | |
| Event #108686 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #108688 | PD Message - BIST (from Tester) (SOP') |
| Event #108691 | PD Message - BIST (from Tester) (SOP'') |
| Event #108693 | PD Message - BIST (from Tester) (SOP'_debug) |
| Event #108695 | PD Message - BIST (from Tester) (SOP''_debug) |
| Event #108697 | Detached | |
| Event #108704 | VBUS turned off |
| Event #108774 | VBUS turned on | |
| Events #108780-108781 | PD Sequence Start (Announce Source Capabilities) | |
| Event #108780 | PD Message - Source Capabilities (from Tester) | |
| Event #108781 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #108782-108788 | PD Sequence Start (Power Transition Request) | |
| Event #108782 | PD Message - Request (from UUT) (SOP) | |
| Event #108783 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #108784 | PD Message - Accept (from Tester) (SOP) | |
| Event #108785 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108787 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #108788 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108795-108811 | PD Sequence Start (Request Source Capabilities) | |
| Event #108795 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| Event #108796 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108797 | PD Message - Source Capabilities (from UUT) | |
| Event #108798 | PD Message - GoodCRC (from Tester) (SOP) |
| Event #108800 | PD Message - Get_Src_Cap (from Tester) (SOP) |
| Event #108806 | PD Spurious Data (from Tester) |
| Event #108809 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| MessageID is not one greater than that previously sent. |
| Event #108811 | PD Spurious Data (from Tester) |
| Event #108812 | Detached | |
| Event #108819 | VBUS turned off |
| Event #108889 | VBUS turned on | |
| Events #108895-108896 | PD Sequence Start (Announce Source Capabilities) | |
| Event #108895 | PD Message - Source Capabilities (from Tester) | |
| Event #108896 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #108897-108903 | PD Sequence Start (Power Transition Request) | |
| Event #108897 | PD Message - Request (from UUT) (SOP) | |
| Event #108898 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #108899 | PD Message - Accept (from Tester) (SOP) | |
| Event #108900 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108902 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #108903 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #108910-108913 | PD Sequence Start (Request Source Capabilities) | |
| Event #108910 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| Event #108911 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108912 | PD Message - Source Capabilities (from UUT) | |
| Event #108913 | PD Message - GoodCRC (from Tester) (SOP) |
| Events #108914-108918 | PD Sequence Start (Request Source Capabilities) | |
| Event #108914 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| Event #108915 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108917 | PD Message - Source Capabilities (from UUT) | |
| Event #108918 | PD Message - GoodCRC (from Tester) (SOP) | |
| Events #108919-108919 | PD Sequence Start (Cable Reset) | |
| Event #108919 | PD Cable Reset (from Tester) | |
| Events #108921-108924 | PD Sequence Start (Request Source Capabilities) | |
| Event #108921 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| Event #108922 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108923 | PD Message - Source Capabilities (from UUT) | |
| Event #108924 | PD Message - GoodCRC (from Tester) (SOP) | |
| Events #108925-108925 | PD Sequence Start (Cable Reset) | |
| Event #108925 | PD Cable Reset (from Tester) | |
| Events #108928-108931 | PD Sequence Start (Request Source Capabilities) | |
| Event #108928 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| Event #108929 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #108930 | PD Message - Source Capabilities (from UUT) | |
| Event #108931 | PD Message - GoodCRC (from Tester) (SOP) |
| Event #108932 | Detached | |
| Event #108939 | VBUS turned off |
| Event #109000 | VBUS turned on | |
| Events #109005-109006 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109005 | PD Message - Source Capabilities (from Tester) | |
| Event #109006 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109007-109013 | PD Sequence Start (Power Transition Request) | |
| Event #109007 | PD Message - Request (from UUT) (SOP) | |
| Event #109008 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109009 | PD Message - Accept (from Tester) (SOP) | |
| Event #109010 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109012 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109013 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #109020-109096 | PD Sequence Start (Request Source Capabilities) | |
| Event #109020 | PD Message - Get_Src_Cap (from Tester) (SOP) | |
| MessageID is not one greater than that previously sent. | ||
| Event #109021 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #109022 | Detached | |
| Event #109029 | VBUS turned off |
| Event #109090 | VBUS turned on | |
| Event #109095 | PD Message - Source Capabilities (from Tester) | |
| Event #109096 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109097-109103 | PD Sequence Start (Power Transition Request) | |
| Event #109097 | PD Message - Request (from UUT) (SOP) | |
| Event #109098 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109099 | PD Message - Accept (from Tester) (SOP) | |
| Event #109100 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109102 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109103 | PD Message - GoodCRC (from UUT) (SOP) |
| Scope Capture #1 | VBUS Measurement - Hard Reset | |
| VBUS plot is valid. | ||
| tSrcRecover = 741882us (0.66s to 1s) | ||
| Events #109110-0 | PD Sequence Start (Hard Reset) | |
| Event #109110 | PD Hard Reset (from Tester) | |
| Event #109111 | VBUS turned off | |
| Event #109112 | VBUS turned on | |
| Events #109113-109114 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109113 | PD Message - Source Capabilities (from Tester) | |
| Event #109114 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109115-109121 | PD Sequence Start (Power Transition Request) | |
| Event #109115 | PD Message - Request (from UUT) (SOP) | |
| Event #109116 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109117 | PD Message - Accept (from Tester) (SOP) | |
| Event #109118 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109120 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109121 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #109162 | Detached | |
| Event #109168 | VBUS turned off |
| Event #109229 | VBUS turned on | |
| Events #109234-109235 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109234 | PD Message - Source Capabilities (from Tester) | |
| Event #109235 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109236-109243 | PD Sequence Start (Power Transition Request) | |
| Event #109236 | PD Message - Request (from UUT) (SOP) | |
| Event #109237 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109238 | PD Message - Accept (from Tester) (SOP) | |
| Event #109239 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109242 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109243 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #109249-109252 | PD Sequence Start (Soft Reset) | |
| Event #109249 | PD Message - Soft Reset (from Tester) (SOP) | |
| WARNING: This message was not expected in the current context. | ||
| Event #109250 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109251 | PD Message - Accept (from UUT) (SOP) | |
| Event #109252 | PD Message - GoodCRC (from Tester) (SOP) | |
| Events #109253-109254 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109253 | PD Message - Source Capabilities (from Tester) | |
| Event #109254 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109255-109261 | PD Sequence Start (Power Transition Request) | |
| Event #109255 | PD Message - Request (from UUT) (SOP) | |
| Event #109256 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109257 | PD Message - Accept (from Tester) (SOP) | |
| Event #109258 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109260 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109261 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #109311 | Detached | |
| Event #109317 | VBUS turned off |
| Event #109389 | VBUS turned on | |
| Events #109394-109395 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109394 | PD Message - Source Capabilities (from Tester) | |
| Event #109395 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109396-109402 | PD Sequence Start (Power Transition Request) | |
| Event #109396 | PD Message - Request (from UUT) (SOP) | |
| Event #109397 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109398 | PD Message - Accept (from Tester) (SOP) | |
| Event #109399 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109401 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109402 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #109410-109414 | PD Sequence Start (BIST Test Sequence) | |
| Event #109410 | PD Message - BIST (from Tester) (SOP) | |
| Event #109411 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #109413 | PD Message - Reserved (from Tester) (SOP) | |
| Reserved message type used | ||
| No of data bytes after header does not match data objects. | ||
| MessageID is not one greater than that previously sent. | ||
| Rev 1.0. This version does not permit BMC. | ||
| Explicit Contract Revision is 2.0 | ||
| Event #109414 | PD Message - GoodCRC (from UUT) (SOP) |
| Event #109423 | VBUS turned off |
| Event #109424 | Detached |
| Event #109496 | VBUS turned on | |
| Events #109501-109502 | PD Sequence Start (Announce Source Capabilities) | |
| Event #109501 | PD Message - Source Capabilities (from Tester) | |
| Event #109502 | PD Message - GoodCRC (from UUT) (SOP) | |
| Events #109503-109509 | PD Sequence Start (Power Transition Request) | |
| Event #109503 | PD Message - Request (from UUT) (SOP) | |
| Event #109504 | PD Message - GoodCRC (from Tester) (SOP) | |
| Event #109505 | PD Message - Accept (from Tester) (SOP) | |
| Event #109506 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109508 | PD Message - PS_RDY (from Tester) (SOP) | |
| Event #109509 | PD Message - GoodCRC (from UUT) (SOP) |
| Events #109515-109516 | PD Sequence Start (Request Manufacturer Info) | |
| Event #109515 | PD Message - Get_Manufacturer_Info (from Tester) (SOP) | |
| Event #109516 | PD Message - GoodCRC (from UUT) (SOP) | |
| Event #109524 | VBUS turned off | |
| Event #109535 | VBUS turned on | |
| Events #109544-0 | PD Sequence Start (Hard Reset) | |
| Event #109544 | PD Hard Reset (from UUT) | |
| Events #109555-0 | PD Sequence Start (Hard Reset) | |
| Event #109555 | PD Hard Reset (from UUT) |
| Event #109557 | Detached | |
| Event #109564 | VBUS turned off |
For Information Only:
0 Retries by UUT using SOP
0 Retries by UUT using SOP'
0 Retries by Tester using SOP
0 Retries by Tester using SOP'
No Post-Run Errors found.
0 Runtime Errors
BMC-PHY-TX-EYE Primary - PASS
BMC-PHY-TX-EYE Secondary - PASS
BMC-PHY-RX-INT-REJ - PASS
BMC-PHY-RX-INT-REJ Secondary - PASS
BMC-PHY-RX-BUSIDL - PASS
BMC-PHY-RX-BUSIDL Secondary - PASS
BMC-PHY-TERM - PASS
BMC-PHY-TERM Secondary - PASS
BMC-PHY-MSG - PASS
BMC-PHY-MSG Secondary - PASS
BMC PHY Tx: PASS
BMC PHY Rx: PASS
BMC PHY Misc: PASS
Protocol Specific: [Required]
Power Specific: [Required]
Secondary: PASS


com.zjgsu.abroadStu.service
Classes
AdminService
(N/A)
AdminServiceImpl
(0%)
ClassroomService
(N/A)
ClassroomServiceImpl
(0%)
CourseService
(N/A)
CourseServiceImpl
(0%)
StudentService
(N/A)
StudentServiceImpl
(0%)
TeacherService
(N/A)
TeacherServiceImpl
(0%)


Main settings
Devices
disabled
Web Instance
(
Used for TTS
)
Update of elapsed time(ms):
Fade in (text2speech)(ms):
Fade out (text2speech)(ms):
add
search
Search
Name
IP Address
Room


Edit - before
Sreenadh TC
coder | volunteer | backpacker
- Malayaleee
- KVian
- BTech
- Python Dev @ Hashwave Technologies Inc
Edit - before
coder | volunteer | backpacker
| Language/Frameworks | Level |
|---|---|
| C/C++ | 4/5 |
| Python | 4/5 |
| JavaScript | 4/5 |
| Ruby on Rails | 3/5 |
| Django - Python | 3.5/5 |
| Flask - Python | 4/5 |
Social


Class: Aws::TranscribeService::Types::CreateLanguageModelRequest
| Relationships & Source Files | |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
Struct
|
|
|
Instance Chain:
self,
::Aws::Structure ,
Struct
|
|
| Inherits: |
Struct
|
| Defined in: | gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb |
Overview
Constant Summary
Instance Attribute Summary
-
#base_model_name ⇒ String
rw
The Amazon Transcribe standard language model, or base model, used to create your custom language model.
-
#input_data_config ⇒ Types::InputDataConfig
rw
Contains the Amazon S3 location of the training data you want to use to create a new custom language model, and permissions to access this location.
-
#language_code ⇒ String
rw
The language code that represents the language of your model.
-
#model_name ⇒ String
rw
A unique name, chosen by you, for your custom language model.
-
#tags ⇒ Array<Types::Tag>
rw
Adds one or more custom tags, each in the form of a key:value pair, to a new custom language model at the time you create this new model.
Instance Method Summary
::Aws::Structure
- Included
| #to_hash | Alias for Structure#to_h. |
Instance Attribute Details
#base_model_name ⇒ String
(rw)
The Amazon Transcribe standard language model, or base model, used to create your custom language model. Amazon Transcribe offers two options for base models: Wideband and Narrowband.
If the audio you want to transcribe has a sample rate of 16,000 Hz
or greater, choose WideBand
. To transcribe audio with a sample
rate less than 16,000 Hz, choose NarrowBand
.
# File 'gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb', line 712
class CreateLanguageModelRequest < Struct.new( :language_code, :base_model_name, :model_name, :input_data_config, : ) SENSITIVE = [] include Aws::Structure end
#input_data_config ⇒ Types::InputDataConfig (rw)
Contains the Amazon S3 location of the training data you want to use to create a new custom language model, and permissions to access this location.
When using InputDataConfig
, you must include these sub-parameters:
S3Uri
, which is the Amazon S3 location of your training data, and
DataAccessRoleArn
, which is the Amazon Resource Name (ARN) of the
role that has permission to access your specified Amazon S3
location. You can optionally include TuningDataS3Uri
, which is the
Amazon S3 location of your tuning data. If you specify different
Amazon S3 locations for training and tuning data, the ::Aws::ARN
you use
must have permissions to access both locations.
# File 'gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb', line 712
class CreateLanguageModelRequest < Struct.new( :language_code, :base_model_name, :model_name, :input_data_config, : ) SENSITIVE = [] include Aws::Structure end
#language_code ⇒ String
(rw)
The language code that represents the language of your model. Each custom language model must contain terms in only one language, and the language you select for your custom language model must match the language of your training and tuning data.
For a list of supported languages and their associated language
codes, refer to the Supported languages table. Note that US
English (en-US
) is the only language supported with Amazon
Transcribe Medical.
A custom language model can only be used to transcribe files in the
same language as the model. For example, if you create a custom
language model using US English (en-US
), you can only apply this
model to files that contain English audio.
# File 'gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb', line 712
class CreateLanguageModelRequest < Struct.new( :language_code, :base_model_name, :model_name, :input_data_config, : ) SENSITIVE = [] include Aws::Structure end
#model_name ⇒ String
(rw)
A unique name, chosen by you, for your custom language model.
This name is case sensitive, cannot contain spaces, and must be
unique within an Amazon Web Services account. If you try to create a
new custom language model with the same name as an existing custom
language model, you get a ConflictException
error.
# File 'gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb', line 712
class CreateLanguageModelRequest < Struct.new( :language_code, :base_model_name, :model_name, :input_data_config, : ) SENSITIVE = [] include Aws::Structure end
#tags ⇒ Array
<Types::Tag> (rw)
Adds one or more custom tags, each in the form of a key:value pair, to a new custom language model at the time you create this new model.
To learn more about using tags with Amazon Transcribe, refer to Tagging resources.
# File 'gems/aws-sdk-transcribeservice/lib/aws-sdk-transcribeservice/types.rb', line 712
class CreateLanguageModelRequest < Struct.new( :language_code, :base_model_name, :model_name, :input_data_config, : ) SENSITIVE = [] include Aws::Structure end