FREQUENCY A film review by Mark R. Leeper
Capsule: An unusual solar phenomenon allows a 1999 police detective to talk to his father back in 1969, just days before the father's death. Can the past be changed and if so what will it do to the present. James Caviezel and Dennis Quaid star in a fast-paced and tense science fiction film that is strongly reminiscent of TIME AFTER TIME. The film is gripping, but the use of ideas do not bear close scrutiny. Rating: 7 (0 to 10), low +2 (-4 to +4)
One of the best science fiction films of the 1970s was Nicholas Meyer's TIME AFTER TIME. The rather fantastic and dubious premise of this film was that H. G. Wells was not only an unknowing friend of Jack the Ripper, he also had built a real, functioning time machine. The Ripper escapes the police by taking the time machine to 1979 and Wells has to follow and try to capture the Ripper. One would think that a time machine and the ability to retrieve knowledge from the future might be useful in capturing a serial killer, but Wells finds that it is a mixed blessing. These same ideas are revisited in FREQUENCY, albeit without a time machine.
The film begins October 10, 1999, at a time of solar flares and sunspot activity. (The real height of solar activity was April 7, 2000, just three weeks before the national release of FREQUENCY. Ironically that would have not been good for the script, however, which was contrived to take place during a World Series.) Commentators talking about the solar activity point out that string theory says that time is fluid. (What that has to do with sunspots and solar flares in the commentators' minds is not clear. But it does set the stage for the story.)
John Sullivan's life has been overshadowed by the loss of his beloved father when John was only six years old. Frank Sullivan (played by Dennis Quaid) was a heroic firefighter, a great baseball fan, and above all a very loving father. Two nights before the 30th anniversary of his father's death, John (James Caviezel), now a detective, pulls out his father's ham radio and starts a conversation with another ham. What he does not realize at first is that a freak solar phenomenon has provided him a radio channel across almost no distance, but across thirty years. He is speaking to his father sitting at the same desk exactly thirty years earlier. The two discuss the 1969 World Series, not realizing that it was for one an imminent occurrence, for the other a fond but distant memory. When John realizes what is happening and what he can now do, he gives his skeptical father the information that he will need to avoid being killed. But John will quickly figure out what science fiction fans have known all along, that tampering with the past is risky business. In a nifty Rube Goldbergism of time, saving Frank's life has allowed a serial killer to avoid a termination of his criminal career. And for reasons less coincidental than they first appear this particular serial killer is going to strike very near home. John has to try to manipulate the past through his father and then see how the world has changed in thirty years as a result of those changes.
The time warp that allows a series of conversations between father and son is acceptable as a reasonable premise for a science fiction film. For dramatic effect they have added that one is aware of the change if and only if one was involved in bringing it about. This is total bunkum. The physical universe does not care whose idea a change in the past was. Either everybody would remember the change or--much more likely--nobody would. But the first would completely change the plot and the second would rob the film of drama because John could not know of his own victories in changing the past. Towards the end even this rule breaks down and in the final scene John seems to remember the past he has changed out of, but not the new past he has brought about. Everyone else in the world remembers only the new past. The ideas need a little reconsidering. And then once the ideas are straightened out, put them in a movie with a more original plot than stopping a serial killer. To compound the credibility problem John is put onto a case with which he would be expected to be emotionally closely involved. It is an invitation to conflicts of interest and abuse of power. It is highly unlikely the police would allow that.
There is more than a little social comment in the interfacing of 1969 and 1999. In 1969 the elder Sullivan had a storybook, rose-covered-cottage sort of existence. He has the most totally functional family we have seen on the screen for a long time. Two parents and a child love the heck out of each other. The family gives the father strength to go out and risk his life for others with the complete support of his loved ones. Thirty years later John is separated from a woman to whom he never committed. He still lives in his parents' house. His life seems a mess. Of course, losing a father may have contributed to that, but it seems he should be emotionally further advanced.
One final complaint. I am less than thrilled to see the photography of scenes set in my sophomore year in college tinted a sepia tone as if to indicate great antiquity. 1969 was just not that long ago. FREQUENCY is better than most science fiction we see these days. It has ideas and good pacing. I give FREQUENCY a 7 on the 0 to 10 scale and a low +2 on the -4 to +4 scale.
Mark R. Leeper<EMAIL_ADDRESS>Copyright 2000 Mark R. Leeper
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Compressing the requirements
It's taken a while, but I've finally come up with a counterargument (by technological analogy) to my previously-held belief that a more powerful language would make me a more productive programmer. This is a hard kind of mindset to get out of, because the equation seems so obvious: productivity = (features delivered) / (development time). And if you can use a better language to decrease the development time for the same features, then you're more productive. Obviously.
So, with that said, here's a hand-wavy, ostensibly mathematical (but not really), don't-try-this-at-home analysis of software development economics.
Obviously the above equation is true, but it's capturing only the "coder" element of the software development supply chain. The full equation from the client's perspective would look more like this:
problems solved features value = --------------- x ---------------- features development time
This new term, (problems solved) / (features), is really important. It makes the "features" term disappear altogether in the final analysis, but more importantly it adds a factor that can be optimized.
Here's the reason this matters so much. Most of the time, for most applications that people will pay you to write, a signifcant fraction of the features make little or no sense. For example, the password-reset mechanism on every website you sign in to. Here's the technological absurdity of it:
Technological purist: Ok, so I'm making a website, and the user needs a password to prove their identity. Got it.
Real world representative: Yep, but sometimes the user forgets their password.
T: Forgets?
R: Yep, all the time, in fact. So we need a way for them to recover it, or at least to create a new one.
T: Ok wait, but they don't also forget their identity, right? They just forget their password.
R: Exactly, so we need to have another secondary way for them to prove their identity.
T: Like a second password, since statistically, the odds that they'll forget two passwords are lower than the odds that they'll forget just one.
R: No, that's too much work. Let's ask them something about their history instead.
T: Aha, so it's a new password, but the user didn't have to make it up!
R: Um, sure, whatever. But let's call it a "security question" instead, since it's not a password (T: Yes it is.), and the user will need to use it only when they forget their password.
T: Ok, wait. If the user has this magic "security question" that they'll never forget, and they can get or create a password by using it, then why not just use that instead of a password in the first place?
R: Because someone else might know it.
T: So anyone who knows their "security question", which I still claim is a password (R: No it isn't.), can assert that they're the user, and we know up-front that this "security question" is insecure enough that we can't use it for account access in the first place.
R: Yes.
T: Explain to me how this is anything other than a horrible idea.
R: Amazon does it* and is worth billions. Q.E.D.
T: Well played.
* This is not true (or at least not anymore), though I remember having to enter security questions for a number of websites in the past.
Now, you might argue (as I used to) that with a powerful language like Lisp, you can just write macros and such, and compress these complicated-seeming real world problems into compact implementations. In some cases this works, but in my experience the closer you are to the user, the less reliably you can factor your code by reusing logic. I want to justify this point by analogy.
 They're all different angles and moments in time of The Fonz jumping the shark, so there's some opportunity to reuse information across multiple images. What's the best strategy?
Let's approach the problem top-down first. You've got these images that may have shared structure, but you'll get a lot of mileage out of something obvious like JPEG. It's lossy, but most users won't care much. From there, you might be able to try stacking the images up and encoding it as a movie, or maybe gluing them all together and encoding it as a large JPEG. Worst-case, maybe you encode them separately, then bundle it up as a .tar.xz to get some small compression.
So that's the top-down approach: probably effective, not very technologically inspiring. Luckily the bottom-up approach is a lot more fun. We know the images are different camera angles of the same event, so from a 3D point of view we have a lot of shared structure. Sounds like a photorealistic rendering problem. So let's write a raytracer and describe the physical shapes in the scene, setting the camera angle and position as the primary variant. We can then make minor model adjustments and encode the inevitable small differences from the actual pixels, resulting in a space-efficient lossless encoding.
Aside from not being able to encode any images in under a decade, I'm not actually that convinced that the bottom-up solution would result in much better compression. And if you found this was the case and wanted to improve the compression ratio, it would be more difficult than it is for a straightforward strategy like JPEG. The compression artifacts would probably be more visible because the model has more degrees of freedom and because it maps nonlinearly onto the screen.
JPEG and the raytracer encoding differ philosophically in a significant way. The whole idea behind JPEG is that these images are being viewed by humans; and because of what we know about human perception, some features are more important than others. Notice where JPEG optimizes: it removes detail, which is analogous to a software developer realizing that some feature doesn't even need to be written.
Contrast this with the raytracer strategy, which is about feature encoding efficiency. The focus isn't on removing stuff, but on studying the features that do exist and finding a way to share information between them. The user's perception is an afterthought; we're encoding what exists, not the way in which the user will see it.
Here's what I think is so interesting about this difference. JPEG is clever in that it carefully encodes the degrees of freedom created by optical perception, allowing it to use a simple cosine-transform and still get great compression ratios. The real optimization was in the design, not the implementation.
JPEG happens to encode each image independently using cosines, but you could imagine a scenario where the encoder could refer to pieces of other images like a kind of codebook. If it worked this way, its compression efficiency would be largely dependent on the availability of applicable codebook entries, which in turn would depend on how much it could change the original image (and this, again, is a matter of optimizing the (problems solved) / (features) term).
By analogy, the same is mostly true of languages and libraries. A language doesn't exist to compress every problem to its ideal structural truth, it exists as a medium for people to build a large common codebook in the form of shared libraries. The real world is just too noisy to be reliably compressible, at least where end-users are concerned. And even when it is structurally compressible, understandably few people are going to be interested in betting their success on that proposition.


"""Modularity matrix of graphs.
"""
# Copyright (C) 2004-2018 by
# Aric Hagberg<EMAIL_ADDRESS># Dan Schult<EMAIL_ADDRESS># Pieter Swart<EMAIL_ADDRESS># All rights reserved.
# BSD license.
from __future__ import division
import networkx as nx
from networkx.utils import not_implemented_for
__author__ = "\n".join(['Aric Hagberg<EMAIL_ADDRESS>'Pieter Swart (swart@lanl.gov)',
'Dan Schult (dschult@colgate.edu)',
'Jean-Gabriel Young (Jean.gabriel.young@gmail.com)'])
__all__ = ['modularity_matrix', 'directed_modularity_matrix']
[docs]@not_implemented_for('directed')
@not_implemented_for('multigraph')
def modularity_matrix(G, nodelist=None, weight=None):
"""Return the modularity matrix of G.
The modularity matrix is the matrix B = A - <A>, where A is the adjacency
matrix and <A> is the average adjacency matrix, assuming that the graph
is described by the configuration model.
More specifically, the element B_ij of B is defined as
.. math::
A_{ij} - {k_i k_j m \over 2}
where k_i is the degree of node i, and were m is the number of edges
in the graph. When weight is set to a name of an attribute edge, Aij, k_i,
k_j and m are computed using its value.
Parameters
----------
G : Graph
A NetworkX graph
nodelist : list, optional
The rows and columns are ordered according to the nodes in nodelist.
If nodelist is None, then the ordering is produced by G.nodes().
weight : string or None, optional (default=None)
The edge attribute that holds the numerical value used for
the edge weight. If None then all edge weights are 1.
Returns
-------
B : Numpy matrix
The modularity matrix of G.
Examples
--------
>>> import networkx as nx
>>> k =[3, 2, 2, 1, 0]
>>> G = nx.havel_hakimi_graph(k)
>>> B = nx.modularity_matrix(G)
See Also
--------
to_numpy_matrix
adjacency_matrix
laplacian_matrix
directed_modularity_matrix
References
----------
.. [1] M. E. J. Newman, "Modularity and community structure in networks",
Proc. Natl. Acad. Sci. USA, vol. 103, pp. 8577-8582, 2006.
"""
if nodelist is None:
nodelist = list(G)
A = nx.to_scipy_sparse_matrix(G, nodelist=nodelist, weight=weight,
format='csr')
k = A.sum(axis=1)
m = k.sum() * 0.5
# Expected adjacency matrix
X = k * k.transpose() / (2 * m)
return A - X
[docs]@not_implemented_for('undirected')
@not_implemented_for('multigraph')
def directed_modularity_matrix(G, nodelist=None, weight=None):
"""Return the directed modularity matrix of G.
The modularity matrix is the matrix B = A - <A>, where A is the adjacency
matrix and <A> is the expected adjacency matrix, assuming that the graph
is described by the configuration model.
More specifically, the element B_ij of B is defined as
.. math::
B_{ij} = A_{ij} - k_i^{out} k_j^{in} / m
where :math:`k_i^{in}` is the in degree of node i, and :math:`k_j^{out}` is the out degree
of node j, with m the number of edges in the graph. When weight is set
to a name of an attribute edge, Aij, k_i, k_j and m are computed using
its value.
Parameters
----------
G : DiGraph
A NetworkX DiGraph
nodelist : list, optional
The rows and columns are ordered according to the nodes in nodelist.
If nodelist is None, then the ordering is produced by G.nodes().
weight : string or None, optional (default=None)
The edge attribute that holds the numerical value used for
the edge weight. If None then all edge weights are 1.
Returns
-------
B : Numpy matrix
The modularity matrix of G.
Examples
--------
>>> import networkx as nx
>>> G = nx.DiGraph()
>>> G.add_edges_from(((1,2), (1,3), (3,1), (3,2), (3,5), (4,5), (4,6),
... (5,4), (5,6), (6,4)))
>>> B = nx.directed_modularity_matrix(G)
Notes
-----
NetworkX defines the element A_ij of the adjacency matrix as 1 if there
is a link going from node i to node j. Leicht and Newman use the opposite
definition. This explains the different expression for B_ij.
See Also
--------
to_numpy_matrix
adjacency_matrix
laplacian_matrix
modularity_matrix
References
----------
.. [1] E. A. Leicht, M. E. J. Newman,
"Community structure in directed networks",
Phys. Rev Lett., vol. 100, no. 11, p. 118703, 2008.
"""
if nodelist is None:
nodelist = list(G)
A = nx.to_scipy_sparse_matrix(G, nodelist=nodelist, weight=weight,
format='csr')
k_in = A.sum(axis=0)
k_out = A.sum(axis=1)
m = k_in.sum()
# Expected adjacency matrix
X = k_out * k_in / m
return A - X
# fixture for nose tests
def setup_module(module):
from nose import SkipTest
try:
import numpy
import scipy
except:
raise SkipTest("NumPy not available")


HackEmory is the premier club at Emory for software and robotics projects. The club is made up of undergraduate students at Emory that have a passion for software and hacking. The club also throws an annual Hackathon at Emory. Check out our upcoming Hackathon and our current projects.


Pitometer Dynatrace Data Source: DYNATRACEURL
Pitometer connected to Mongo: MONGODB
Clear Database
Test Context: Groups your test results
Pitometer uses this name to store your test runs in Mongo
Perfspec file (file or url)
Either try ./samples/perfspec.json or a public URL
Tags: will replace TAG_PLACEHOLDER
Useful to specify Dynatrace Entity Tags!
Compare With
Options: EMPTY=compare w last good run; TESTRUNNAME; Pitometer Query
Single Run
Starttime
Endtime
Test Run Name
Multi Run
Starttime
Length of each evaluation (in ms)
Number of evaluations
Test Run Name Prefix
Test Run Name Index for first run
Report
New window?
Query for Report
Allowed values are number (=last X runs), string (=specific test run) or Query Object (e.g: { "find": { "result" :"pass"}, "sort" : {"timestamp" : 1}, "limit" :5})


--- layout: default ---
The MLAPI is a high level networking library built for the Unity game engine to abstract networking concept. This allows developers to focus on the game rather than low level protocols and networking frameworks. All this is provided for free under the permissive MIT Licence by the MLAPI collaborators. The MLAPI is open source with no attached costs or limitations.
The MLAPI is one of the oldest and most actively developed game networking library out there. As a direct result of this, it offers many more features than other libraries. A comparison between other libraries can be seen on the features page. But in short, the MLAPI's focus is to make networking simple to let you focus on what matters for your game.
Want to get started with the MLAPI? The community wiki is a great place to start!
The MLAPI is completeley free and open source, this means that it comes with no hidden CCU's or other limitations. Just a great networking library for you to use.
The MLAPI is a general purpose networking library designed to work with any game. High-performance, large scale games as well as small co-op games. Dedicated server applications or player hosted? The MLAPI does it all.


Filing deadline for state taxes, payments extended due to ransomware attack
by KNOEBATON ROUGE, La. (WAFB) - The Louisiana Department of Revenue (LDR) is extending the filing dates for state taxes that were initially due Nov. 20 due to Monday’s ransomware attack on the state’s computer system.
The due date has been changed to Monday, Nov. 25.
The new deadline affects the following taxes:
*Sales and Use Tax
*Prepaid Wireless Telecommunications 911 Service Charge
*Hotel Occupancy Tax
*Ernest N. Morial New Orleans Exhibition Hall Authority Food and Beverage Tax
*Beer Tax
*Tobacco Tax
*Terminal Operator Monthly Tax
*Distributer/Exporter/Blender Tax
*Motor Fuel Transporter Tax
*Fuel Backup Tax
*Transportation and Communication Tax - Monthly Return
LDR says the attack did not compromise any state tax returns or taxpayer information. Certain services were disrupted though, including the sales tax filing application, Parish E-File, and the Louisiana Taxpayer Access Point (LaTAP), which is the state’s tax account management portal.
Taxpayers do not need to request an extension in this case. Extensions will be applied automatically. LDR will waive any interest, delinquent filing penalty, or delinquent payment penalty for any eligible returns or payments submitted by the new Nov. 25 deadline.
Copyright 2019 WAFB. All rights reserved.


{% include head.html %}
{{ site.title }}
{{ site.description }}
Home
About
Tags
© 2020 Dushyant Mehta
{{ content }}


Home
chevron_right
News
chevron_right
FAQ
chevron_right
Sponsors
chevron_right
Events' Calendar
chevron_right
Our Friends !
chevron_right
Member Card
chevron_right
Settings
chevron_right
Logout
chevron_right
Become a member !
chevron_right
Login
chevron_right
Contact Us
chevron_right
Legal Notice
chevron_right
About this app
chevron_right
Version X.X.X
bars
Home
Welcome to your own Student App !
This app allows you to :
Functionnality 1.
Functionnality 2
Etc.
Just another card
Click here to learn more about this app !
Login
ID
Password
Login
Back
New Password
Previous Password
New Password
Repeat New Password
Change my password


The role of E-proteins in B- and T-lymphocyte development.
Abstract
Department of lymphocytes from hematopoietic stem cells is controlled, in part, by the activity of transcriptional regulatory proteins. In particular, one class of helix-loop-helix proteins, termed E-proteins, have been implicated in the regulation of gene expression during B-cell development. Recent analysis of gene-targeted mice has allowed a direct assessment of the functional roles of several E-protein family members in hematopoiesis. In this review we describe the defects in B- and T- lymphocyte development in mice carrying targeted mutations in the E-protein genes and discuss our current understanding of the role of these proteins in lymphoid development


syctask can be used to create, plan, prioritize and schedule tasks.
The application can be installed with
$ gem install syc-task
syctask provides basic task organizer functions as create, update, list and complete a task. Additional functions are to plan tasks you want to accomplish today. If you are not sure in which sequence to conduct the task you can prioritize them with a pair wise comparisson. You can time tasks with start and stop and you can finally extract tasks from a minutes of meetings file. The schedule task command will print a graphical timeline of the working day assigning the planned tasks to the timeline. Busy times are marked red. Meetings are listed with associated tasks that are assigned to the meetings. With the statistics command you can print statistical evaluation of tasks duration and count.
Create a new task in the default task directory ~/.tasks
$ syctask new "My first task"
Provide a description
$ syctask new "My first task" --description "Explanation of my first task"
Schedule a task with a follow-up and due date
$ syctask new "My first task" --follow-up "2013-02-25" --due "2013-03-11"
Set a proirity for a task
$ syctask new "My first task" --prio 3
Prompt for task input
$ syctask new
will prompt for task titles. Ctrl-D will end input.
Except for –description you can also provide short forms for the options.
When writing minutes of meetings tasks that should be followed up in syctask can be annotated so they will be recognized by the scan command. The following structure shows how to annotade tasks
Some text before @task; title;description;follow_up;due_date,prio Schedule meeting;Invite all developers;2016-09-12;2016-10-12;1 Write letter;Practice writing letters;;;3 Some text after
The above annotation will only scan the next task because of the singular ‘task’ where the task values are separated with ‘;’. The line after the annotation ‘@task’ lists the sequence of the fields of the task. It is also possible to list the tasks in a table, e.g. markdown
Some text before @tasks| title |description |follow_up |due_date |prio ----------------|--------------------------|----------|----------|---- Schedule meeting|Invite all developers |2016-09-12|2016-10-12|1 Write letter |Practice writing letters | | |3 Some text after Call partner |Ask for project's progress|2016-09-14| |1 Even more text
The example above scans all tasks due to the plural ‘tasks’. It also scans all tasks that are separated with non-task text and occur after the annotation and confirm to the field structure. Lines that start with ‘-’ will be ignored. So if you want to skip only a few tasks within a task list prepend them with ‘-’. If you have tasks with different fields then you have to add another annotation with the new field structure.
Possible fields are
title - the title of the task - mandatory field! description - the description of the task follow_up - the follow-up date of the task in the form yyyy-mm-dd due_date - the due-date of the task in the form yyyy-mm-dd prio - the priority of the task tags - tags the task is annotated with note - a note for the task
Note: follow_up and due_date can also be written as Follow-up and Due-Date. Also case is ignored.
As inidcated in the list the title column is mandatory. Without the title column scan will raise an error during a scan.
Fields that are not part of the above list will be ignored.
# | Title | Who - | ------------------------------------ | --- 1 | Schedule meeting with all developers | Me 2 | Write letter to practice writing | You
In the table only the column Title will be scanned. The ‘#’ and ‘Who’ column will be ignored during scan. This table is also a table for a minimum scan structure. You need at least to provide a title column so the scan function will recognize the table as a task list.
Scanning tasks from files
$ syctask scan 2016-09-10-mom.md 2016-09-09-mom.md
The plan command will print tasks and prompts whether to (a)dd or (s)kip the task. If (q)uit is selected the tasks already added will be add to the today’s task list. If ©omplete is selected the complete task will be printed and the user will be prompted again for adding the task.
Invoke plan without filter
$ syctask plan 1 - My first task (a)dd, (c)omplete, (s)kip, (q)uit? a Duration (1 = 15 minutes, return 30 minutes): 3 --> 1 task(s) planned
Invoke plan with a filter
$ syctask plan --id "1,3,5,8" 1 - My first task (a)dd, (c)omplete, (s)kip, (q)uit?
Move tasks to another days plan
$ syctask plan today --move tomorrow --id 3,5
This will move the tasks with ID 3 and 5 from the today’s plan to the tomorrow’s plan. The duration will be set to the remaining processing time but at least to 30 minutes.
Planned tasks can be prioritized in a pair wise comparisson. So each task is compared to all other tasks. The task with the highest priority will bubble on top followed by the task with the next highest priority and so on.
$ syctask prio 1: My first task 2: My second task Task 1 has (h)igher or (l)ower priority, or (q)uit: h 1: My first task 2: My third task Task 1 has (h)igher or (l)ower priority, or (q)uit: l 1: My third task 2: My fourth task Task 1 has (h)igher or (l)ower priority, or (q)uit: h ...
syctask schedule will then print tasks as follows
Tasks ----- 0: 10 - My fourth task 1: 7 - My third task 2: 3 - My first task 3: 9 - My second task ...
Instead of conducting pairwise comparisson the order of the tasks in the plan can be specified with the -o flag
$ syctask plan -o 7,3,10,9
The plan or schedule command will print the tasks in the specified order
Tasks ----- 0: 7 - My third task 1: 3 - My first task 2: 10 - My fourth task 3: 9 - My second task
If only a part of the tasks is provided the rest of the tasks is appended to the end of the task plan. If you specify a position flag the prioritized tasks are added at the provided position.
$ syctask plan -o 7,9 -p 2 Tasks ----- 0: 3 - My first task 1: 10 - My fourth task 2: 7 - My third task 3: 9 - My second task
The schedule command will print a graphical schedule with assigning the tasks selected with plan. When schedule command is invoked the planned tasks are added at or after the current time within the time schedule. Tasks that are done and scheduled in the future are not shown. Tasks done and in the past are shown with the actual processing time.
Create a schedule with working time from 8a.m. to 6p.m. and meetings between 9a.m. and 9.30a.m. and 1p.m. and 2.45p.m.
$ syctask schedule -w "8:00-18:00" -b "9:00-9:30,13:00-14:45"
Add titles to the meetings
$ syctask schedule -m "Project status,Management meeting"
The output will be
Meetings -------- A - Project status B - Management meeting A B xxx-///-|---|---|---///////-|---|---|---| 8 9 10 11 12 13 14 15 16 17 18 1 Tasks ----- 0 - 1: My first task
Adding a task to a meeting
$ syctask schedule -a "A:0"
will print
Meetings -------- A - Project status 1 - My first task B - Management meeting A B ----///-|---|---|---///////-|---|---|---| 8 9 10 11 12 13 14 15 16 17 18 Tasks ----- 0: 1 - My first task
A task that is re-scheduled with
$ syctask update 1 -f tomorrow
will be shown as done (green) in the schedule and instead of separator - it shows ~.
Tasks ---- 0: 1 ~ My first task
A started task will be indicated by *
$ syctask start 1 $ syctask sche Tasks ----- 0: 1 * My first task
List tasks that are not marked as done in short form
$ syctask list
List all tasks in long form
$ syctask list --all --complete
Search tasks that match a pattern
$ syctask list --id "<10" --follow_up ">2013-02-25" --title "My \w task"
Lists each unplanned task and allows to edit, delete, mark as done or plan for today or another day
$ syctask inspect 0016 Create command for inspection (e)dit, (d)one, de(l)ete, (p)lan, da(t)e, (c)omplete, (s)kip, (b)ack, (q)uit
Edit a task with ID 10 in vi
$ syctask edit 10
Except for title and id all values can be updated. Note and tags are not overridden rather supplemented with the update value.
Update task with ID 1 and provide some informative note
$ syctask update 1 --note "Some explanation about the progress on the task"
Complete the task with ID 1 and provide a final note
$ syctask done 1 --note "Finalize my first task"
Delete tasks with ID 1,3 and 5 from the default task directory
$ syctask delete --id 1,3,5
Delete tasks with ID 8 and 12 from the planned tasks of today. The tasks are only removed from the planned tasks and not physically deleted.
$ syctask delete --plan today --id 8,12
The settings command allows to define default values for task directory and to create general purpose tasks that can be used for tracking and later statistical evaluation.
Create general purpose tasks for phone and talk
$ syctask setting --general PHONE,TALK
List all settings
$ syctask setting --list
Info searches for the location of a task and lists all task directories
Search for task with id 102
$ syctask info --id 102
List all task directories
$ syctask info --taskdir
Shows statistics for work and meeting times as well as for task processing
Evaluate the complete log file
$ syctask statistics
Evaluate work times, meetings and tasks between 2013-01-01 and 2013-04-14
$ syctask statistics 2013-01-01 2013-04-14
Evaluate yesterday and today
$ syctask statistics yesterday today
The global options –taskdir and –project determine where the command finds or creates the tasks. The default task directory is ~/.tasks, so if no task directory is specified all commands obtain tasks from or create tasks in ~/.tasks. If a project is specified the tasks will be saved to or obtained from the task directories subdirectory specified with the –project flag.
--taskdir --project Tasks in - - default_task_dir x - task_dir - x default_task_dir/project x x task_dir/project
In the table the relation of commands to –taskdir and –project are listed.
Command --taskdir --project Comment delete x x deletes the tasks in taskdir/project done x x marks tasks in taskdir/project as done help - - inspect x x lists task to edit, done, delete, plan list x x lists tasks in taskdir/project new x x creates tasks in taskdir/project plan x x retrieves tasks to plan from taskdir/projekt prio - - input to prio are planned tasks (see plan) scan x x creates scanned tasks in taskdir/project schedule - - schedules the planned tasks (see plan) start - - starts task from planned tasks (see plan) statistics - - shows statistics of time and count stop - - stops task from planned task update x x updates task in taskdir/project
ID
id file contains the last issued id.
IDS
ids file contains all issued ids.
Task files
The tasks are named ID.task where ID is any Integer as 10.task. The files are saved as YAML files and can be edited directly.
Planned tasks files
The planned tasks are save to YYYY-MM-DD_planned_tasks in syctask’s system directory. Each task is saved with the task’s directory and the ID.
Schedule files
The schedule is saved to YYYY-MM-DD_time_schedule in the default task directory. The files are saved as YAML files and can be changed manually.
Log file
Creating schedule and task processings is logged to tasks.log. For example when a task is started and stopped this is action is saved to tasks.log.
Tracked file
A started task is saved to tracked_tasks. A semaphore file is created with ID.track when the task ID is started. When the task is stopped the semaphore file is deleted.
General purpose tasks
With syctask setting -g PHONE so called general purpose tasks can be created. These tasks can be used for time tracking and later statistic evaluation to determine the amount of disturbences e.g. by phone. These tasks are saved to default_tasks. The general purpose tasks itself are also saved to the .syc/syctask directory as regular task files.
Default task dir
The default task that is used e.g. with list is saved to default_tasks_dir. This can be set with the setting command.
To work with syctask and get the most out of it there is to follow a certain process.
In the morning before I start to work I scan my tasks with syctask list or syctask inspect to get an overview of my open tasks.
$ syctask list
Next I start the planning phase with syctask plan. If I have a specific schedule for the day I will filter for the respective tasks
$ syctask plan
If I want to process the tasks in a specific sequence I prioritize the tasks with
$ syctask prio
I create a schedule with my working hours and meetings that have been scheduled with
$ syctask -w "8:00-18:00" -b "9:00-10:00,14:30-16:00" -m "Team,Status"
I assign the topics I want to discuss in the meetings to the meetings with
syctask schedule -a "A:1,3,6;B:3,5"
To begin I start the first task in the schedule with syctask start -p ID (where ID is the ID of the planned (-p) tasks)
$ syctask start -p 10
To end the task I invoke
$ syctask stop
This will stop the last started task
If I cannot finish a task than I update the task with a new follow-up date
$ syctask update 23 -f tomorrow
The task will be shown in the today’s schedule as done.
When the task is done I call
$ syctask done 23
E-mails
If an e-mail creates a task I create a new task with syctask new title_of_task. The subject of the e-mail I prepend with the ID and move the e-mail to a open topics directory.
Files
If I create files in the course of a task I create a folder in the task directory with the ID and save the files in this directory. If there is an existing directory I link to the file from the ID directory
syc-task has been tested with 1.9.3. It also works in Windows using Cygwin.
To activate bash’s TAB-completion following lines have to be added to ~/.bashrc
complete -F get_syctask_commands syctask function get_syctask_commands { if [ -z $2 ] ; then COMPREPLY=(`syctask help -c`) else COMPREPLY=(`syctask help -c $2`) fi }
After ~/.bashrc has been updated the shell session has to be restarted with
$ source ~/.bashrc
Now syctask followed by TAB TAB will print
$ syctask <TAB><TAB> delete done list plan scan stop _doc help new prio schedule start update
To complete a command we can type
$ syctask sch<TAB>
which will complete to
$ syctask schedule
To print syctask’s output to a printer pipe the command to lpr
$ syctask schedule | lpr
This will print the schedule to the default printer.
To determine all available printer lpstat can be used with the lpstat -a command
$ lpstat -a Canon-LBP6650-3470 accepting requests since Sat 16 Mar 2013 04:26:15 PM CET Dell-B1160w-Mono accepting requests since Sat 16 Mar 2013 04:27:45 PM CET
To print to Dell-B1160w-Mono the following command can be used
$ syctask schedule | lpr -P Dell-B1160w-Mono
Implementation of new, update, list and done commands.
delete: deleting tasks or remove tasks from a task plan
plan: plan tasks and add them to the task plan
schedule: create a schedule with work and busy time and assign the tasks from the task plan to the free times
start: start a task and track the lead time
stop: stop the tracking and print the lead time of the task
start, stop: the task is logged in the ~/.tasks/task.log file when added and when stopped
prio: prioritize tasks in the task plan, that is specifying the sequence in that the tasks should be conducted
plan: –move flag added to move tasks from the specified plan to another days task plan
update, new: when a follow-up or a due date is provided the task is added to the provided dates task plan. If both dates are set the task is added to both dates task plans
updated rdoc
IDs are now unique independent of the task or project directory. After upgrading from a version 0.0.7 or older the user asked whether to re-index the tasks. It is adviced to tar the tasks before re-indexing with
$ tar cvfz tasks.tar.gz .tasks other_task_directories
start will now show a timer in the upper right corner of the screen when started with the -t (–timer) flag.
$ syctask start 10 -t
In order to use the task timer ncurses has to be installed as the task timer uses tput from the ncurses library.
The schedule has a heading with the schedule’s date and the working time
Planned tasks are now added at or after the current time if they are not done yet. Done tasks are shown in the past with the actual processing time. Tasks done before the start of the schedule are not shown in the schedule.
Meetings that are at the current time are indicated with a *. Active tasks are indicated with a star, re-scheduled tasks are indicated with a ~.
Assigning tasks to meetings in a schedule is now done with the task ID
Statistics show statistics about work time, meeting times, general purpose tasks and task processing. Total, min, max and average time and count is listed. If you have used version 0.0.7 it is adviced to delete tasks.log that lives in ~/.tasks before upgrading or in ~/.syc/syctask after upgrading. Otherwise the statistic results seem odd.
Meeting time in time line now shows correct duration
Info command searches for the location of a task and lists all task task directories with the tasks contained.
Plan move command sets the duration to the remaining processing time but at least to 15 minutes
With the setting command the default task directory can be set and general purpose tasks can be created. A general purpose task can be used for tracking to analyse how much time for phone calls is occupied. setting -l list all general purpose tasks and the default task directory
Prio command now takes a position flag together with the order flag to determine where to insert the newly ordered tasks
All commands that take an ID as argument (done, edit, start, update) look up the task file associated to the id in the ids file. If it is found the provided task directory is not considered for the task file. If the id is not contained in the ids file the task is looked up in the provided directory
Inspect command allows to list each today’s unplanned task to edit, delete, mark as done or plan
Update command now has a duration flag to set the task’s duration
Migrated from TestUnit to Minitest
Implemented timeleap which allows to specify additional time distances to yesterday, today tomorrow. Time distances come in two flavors as long and short forms.
Examples for long forms are - yesterday|today|tomorrow - next|previous_monday|tuesday|...|sunday - monday|tuesday|...|sunday_in|back_1_week|month|year - in|back_10_days|weeks|months|years Examples for short forms are - y|tod|tom - n|pmo|tu|..|su - mo|tu|...|sui|b1w|m|y - i|b10d|w|m|y
Fix a bug in `syctask delete –plan`
Add indicator ‘>’ to task list when task contains notes
Refactor migration from version 0.0.7 and when user has deleted system files. The user can now specify the directories where the tasks are located and can also define directories to be excluded. This is especially helpful to omit search in large mounted directories, like from NAS servers.
Add csv output spearated by ‘;’ to the list command
Fix bug when schedule file is empty
Add scan command to scan tasks from files
Fix bugs of missing class lib/syctask/scanner.rb
delete command can take now ranges of ids, e.g. 1,2,4-8,5,20-25
inspect can now go back in the task list
inspect will now show the updated task after making changes to the task in edit
inspect allows to specify a follow_up date
scan will ignore columns that are not part of a syctask task
scan recognizes ‘Follow-up’ as well as ‘follow_up’ now. That is an underscore can be replaced with ‘-’
Fix bug when scanning tables that have spaces between separator and column
When tasks.log file is missing `syctask inspect` prints warning with reason why statistics cannot be printed
Pull from Github and then run
$ bundle install
New classes have to be added to ‘lib/syctask.rb’
Debugging the interface can be done with GLI_DEBUG:
$ bundle exec env GLI_DEBUG=true bin/syctask
Building and pushing the gemfile to Rubygems
$ gem build syctask.gemspec $ gem push syc-task-0.2.1.gem
The test files live in the folder test and start with test_.
There is a rake file available to run all tests
$ rake test
The CLI is tested with Cucumber. To run the Cucumber features in verbose mode
$ cucumber
or if you prefer cleaner output run
$ rake features
syc-task is released under the MIT License
Source code on GitHub
RubyGems


Change Information Dialog
This dialog allows you to edit various informational text for either the scenario or the graphical tileset, as specified in the dialog’s title bar. This text will be shown to the player whenever a new game based on this scenario is started.
- Use the Author (Alt+A) field to enter or change the author name(s).
- Use the Version (Alt+V) field to enter or change the version number and/or creation date.
- Use the Copyright (Alt+C) field to enter or change legal information, such as trademarks or copyright statements.
- Use the large Informational Text (Alt+I) field to enter additional information about the scenario or graphical tileset. Text will wrap automatically to fit the display; you should only press Enter when you want to end a paragraph. You can also use blank lines (press Enter twice or more) to separate paragraphs.
- Choose OK or press Enter when the focus is not on the Informational Text field to accept any changes made and dismiss the dialog.
- Choose Cancel or press Escape to discard any changes made and dismiss the dialog. Closing the window using X (Close) or Alt+F4 has the same effect.
- Choose Help or press F1 to show this help page.
Remarks
This dialog is available for the Master and Images sections only. We assume that the same author(s) will be responsible for all subsection data used in any one scenario, except for the image files. If this is not the case, credits for any additional author(s) should be included in the scenario information.
The graphics information associated with the Images section is intended to store information about the graphical tileset and its creator(s). This information is stored separately because one graphical tileset, i.e. one set of image files, is likely to be used by many different scenario authors.


Choosing the wrong mobile tech stack sets you up for a world of pain. But how do you select the right one from a plethora of current options?
As an iOS developer I am convinced that a carefully designed native app provides the best user experience. So why would we choose Ionic2/Angular2 on Cordova (a bleeding edge Hybrid JavaScript framework) for our latest mobile App? In this short talk I will share our thinking and experiences on the current landscape of mobile stack options.
I will introduce the contenders: Native (iOS and Android) vs Semi-Native (Xamarin and React Native) vs Hybrid (Ionic2/Angular2 on Cordova) vs Web. We will then go through some of the prominent tradeoffs between the different options: cost, reuse, single language, speed and user experience, device support, learning curve.
This should give you some (opinionated) guidelines to choosing the right mobile stack for your particular App.
Speaker Bio:
I'm a software engineer who divides my time between coaching software development teams and building software products, mostly mobile.
Most of my experience has been in developing crucial font-end applications in the financial industries: online trading, online banking, insurance and branch banking.
The problem with new and shiny is that you might end up burning in lava.


Pluto (Dwarf Planet)
Once the ninth planet from the sun,
Pluto is unlike other planets in many respects.
It is smaller than Earth's moon.
Its orbit carries it inside the orbit
of Neptune and then way out
beyond that orbit. From 1979 until early 1999,
Pluto had actually been the eighth planet
from the sun. Then, on Feb. 11, 1999,
it crossed Neptune's path and once again
became the solar system's most distant
planet — until it was demoted to
dwarf planet status.
Pluto will stay beyond Neptune for 228 years.
Pluto’s orbit is tilted to the main plane
of the solar system — where the other
planets orbit — by 17.1 degrees.
It’s a cold, rocky world with only a very
ephemeral atmosphere. NASA's New Horizons mission
performed history's first flyby of the Pluto
system on July 14, 2015.
Diameter: 1,430 miles
(2,301 km)
Orbit: 248 Earth years
Day: 6.4 Earth day


{{>header}} {{message}} Plase enter information below to register: SIGNUP ALREADY SIGNED UP? LOGIN {{>footer}}
ALREADY SIGNED UP? LOGIN


|
MetaDrone
2.0
|
Implements the WebSocket interface. More...
Public Member Functions | |
| WebSocket (string url, params string[] protocols) | |
| Initializes a new instance of the WebSocket class with the specified WebSocket URL and subprotocols. More... | |
| void | Close () |
| Closes the WebSocket connection, and releases all associated resources. More... | |
| void | Close (ushort code) |
| Closes the WebSocket connection with the specified ushort, and releases all associated resources. More... | |
| void | Close (CloseStatusCode code) |
| Closes the WebSocket connection with the specified CloseStatusCode, and releases all associated resources. More... | |
| void | Close (ushort code, string reason) |
| Closes the WebSocket connection with the specified ushort and string, and releases all associated resources. More... | |
| void | Close (CloseStatusCode code, string reason) |
| Closes the WebSocket connection with the specified CloseStatusCode and string, and releases all associated resources. More... | |
| void | CloseAsync () |
| Closes the WebSocket connection asynchronously, and releases all associated resources. More... | |
| void | CloseAsync (ushort code) |
| Closes the WebSocket connection asynchronously with the specified ushort, and releases all associated resources. More... | |
| void | CloseAsync (CloseStatusCode code) |
| Closes the WebSocket connection asynchronously with the specified CloseStatusCode, and releases all associated resources. More... | |
| void | CloseAsync (ushort code, string reason) |
| Closes the WebSocket connection asynchronously with the specified ushort and string, and releases all associated resources. More... | |
| void | CloseAsync (CloseStatusCode code, string reason) |
| Closes the WebSocket connection asynchronously with the specified CloseStatusCode and string, and releases all associated resources. More... | |
| void | Connect () |
| Establishes a WebSocket connection. More... | |
| void | ConnectAsync () |
| Establishes a WebSocket connection asynchronously. More... | |
| bool | Ping () |
| Sends a Ping using the WebSocket connection. More... | |
| bool | Ping (string message) |
| Sends a Ping with the specified message using the WebSocket connection. More... | |
| void | Send (byte[] data) |
| Sends a binary data using the WebSocket connection. More... | |
| void | Send (FileInfo file) |
| Sends the specified file as a binary data using the WebSocket connection. More... | |
| void | Send (string data) |
| Sends a text data using the WebSocket connection. More... | |
| void | SendAsync (byte[] data, Action< bool > completed) |
| Sends a binary data asynchronously using the WebSocket connection. More... | |
| void | SendAsync (FileInfo file, Action< bool > completed) |
| Sends the specified file as a binary data asynchronously using the WebSocket connection. More... | |
| void | SendAsync (string data, Action< bool > completed) |
| Sends a text data asynchronously using the WebSocket connection. More... | |
| void | SendAsync (Stream stream, int length, Action< bool > completed) |
| Sends a binary data from the specified Stream asynchronously using the WebSocket connection. More... | |
| void | SetCookie (Cookie cookie) |
| Sets an HTTP cookie to send with the WebSocket connection request to the server. More... | |
| void | SetCredentials (string username, string password, bool preAuth) |
| Sets a pair of username and password for the HTTP authentication (Basic/Digest). More... | |
Properties | |
| CompressionMethod | Compression [get, set] |
| Gets or sets the compression method used to compress the message on the WebSocket connection. More... | |
| IEnumerable< Cookie > | Cookies [get] |
| Gets the HTTP cookies included in the WebSocket connection request and response. More... | |
| NetworkCredential | Credentials [get] |
| Gets the credentials for the HTTP authentication (Basic/Digest). More... | |
| string | Extensions [get] |
| Gets the WebSocket extensions selected by the server. More... | |
| bool | IsAlive [get] |
| Gets a value indicating whether the WebSocket connection is alive. More... | |
| bool | IsSecure [get] |
| Gets a value indicating whether the WebSocket connection is secure. More... | |
| Logger | Log [get, set] |
| Gets the logging functions. More... | |
| string | Origin [get, set] |
| Gets or sets the value of the Origin header to send with the WebSocket connection request to the server. More... | |
| string | Protocol [get, set] |
| Gets the WebSocket subprotocol selected by the server. More... | |
| WebSocketState | ReadyState [get] |
| Gets the state of the WebSocket connection. More... | |
| RemoteCertificateValidationCallback | ServerCertificateValidationCallback [get, set] |
| Gets or sets the callback used to validate the certificate supplied by the server. More... | |
| Uri | Url [get] |
| Gets the WebSocket URL to connect. More... | |
Events | |
| EventHandler< CloseEventArgs > | OnClose |
| Occurs when the WebSocket connection has been closed. More... | |
| EventHandler< ErrorEventArgs > | OnError |
| Occurs when the WebSocket gets an error. More... | |
| EventHandler< MessageEventArgs > | OnMessage |
| Occurs when the WebSocket receives a message. More... | |
| EventHandler | OnOpen |
| Occurs when the WebSocket connection has been established. More... | |
Implements the WebSocket interface.
The WebSocket class provides a set of methods and properties for two-way communication using the WebSocket protocol (RFC 6455
).
| WebSocketSharp.WebSocket.WebSocket | ( | string | url, |
| params string[] | protocols | ||
| ) |
Initializes a new instance of the WebSocket class with the specified WebSocket URL and subprotocols.
| url | A string that represents the WebSocket URL to connect. |
| protocols | An array of string that contains the WebSocket subprotocols if any. Each value of protocols must be a token defined in RFC 2616. |
| ArgumentException | url is invalid. -or- protocols is invalid. |
| ArgumentNullException | url is . |
| void WebSocketSharp.WebSocket.Close | ( | ) |
Closes the WebSocket connection, and releases all associated resources.
| void WebSocketSharp.WebSocket.Close | ( | ushort | code | ) |
| void WebSocketSharp.WebSocket.Close | ( | CloseStatusCode | code | ) |
Closes the WebSocket connection with the specified CloseStatusCode, and releases all associated resources.
| code | One of the CloseStatusCode enum values, represents the status code indicating the reason for closure. |
| void WebSocketSharp.WebSocket.Close | ( | ushort | code, |
| string | reason | ||
| ) |
Closes the WebSocket connection with the specified ushort and string, and releases all associated resources.
This method emits a OnError event if code isn't in the allowable range of the WebSocket close status code or the size of reason is greater than 123 bytes.
| code | A ushort that represents the status code indicating the reason for closure. |
| reason | A string that represents the reason for closure. |
| void WebSocketSharp.WebSocket.Close | ( | CloseStatusCode | code, |
| string | reason | ||
| ) |
Closes the WebSocket connection with the specified CloseStatusCode and string, and releases all associated resources.
This method emits a OnError event if the size of reason is greater than 123 bytes.
| code | One of the CloseStatusCode enum values, represents the status code indicating the reason for closure. |
| reason | A string that represents the reason for closure. |
| void WebSocketSharp.WebSocket.CloseAsync | ( | ) |
Closes the WebSocket connection asynchronously, and releases all associated resources.
This method doesn't wait for the close to be complete.
| void WebSocketSharp.WebSocket.CloseAsync | ( | ushort | code | ) |
Closes the WebSocket connection asynchronously with the specified ushort, and releases all associated resources.
This method doesn't wait for the close to be complete.
This method emits a OnError event if code isn't in the allowable range of the WebSocket close status code.
| code | A ushort that represents the status code indicating the reason for closure. |
| void WebSocketSharp.WebSocket.CloseAsync | ( | CloseStatusCode | code | ) |
Closes the WebSocket connection asynchronously with the specified CloseStatusCode, and releases all associated resources.
This method doesn't wait for the close to be complete.
| code | One of the CloseStatusCode enum values, represents the status code indicating the reason for closure. |
| void WebSocketSharp.WebSocket.CloseAsync | ( | ushort | code, |
| string | reason | ||
| ) |
Closes the WebSocket connection asynchronously with the specified ushort and string, and releases all associated resources.
This method doesn't wait for the close to be complete.
This method emits a OnError event if code isn't in the allowable range of the WebSocket close status code or the size of reason is greater than 123 bytes.
| code | A ushort that represents the status code indicating the reason for closure. |
| reason | A string that represents the reason for closure. |
| void WebSocketSharp.WebSocket.CloseAsync | ( | CloseStatusCode | code, |
| string | reason | ||
| ) |
Closes the WebSocket connection asynchronously with the specified CloseStatusCode and string, and releases all associated resources.
This method doesn't wait for the close to be complete.
This method emits a OnError event if the size of reason is greater than 123 bytes.
| code | One of the CloseStatusCode enum values, represents the status code indicating the reason for closure. |
| reason | A string that represents the reason for closure. |
| void WebSocketSharp.WebSocket.Connect | ( | ) |
Establishes a WebSocket connection.
| void WebSocketSharp.WebSocket.ConnectAsync | ( | ) |
Establishes a WebSocket connection asynchronously.
This method doesn't wait for the connect to be complete.
| bool WebSocketSharp.WebSocket.Ping | ( | ) |
| bool WebSocketSharp.WebSocket.Ping | ( | string | message | ) |
| void WebSocketSharp.WebSocket.Send | ( | byte[] | data | ) |
Sends a binary data using the WebSocket connection.
| data | An array of byte that represents the binary data to send. |
| void WebSocketSharp.WebSocket.Send | ( | FileInfo | file | ) |
Sends the specified file as a binary data using the WebSocket connection.
| file | A FileInfo that represents the file to send. |
| void WebSocketSharp.WebSocket.Send | ( | string | data | ) |
Sends a text data using the WebSocket connection.
| data | A string that represents the text data to send. |
| void WebSocketSharp.WebSocket.SendAsync | ( | byte[] | data, |
| Action< bool > | completed | ||
| ) |
Sends a binary data asynchronously using the WebSocket connection.
This method doesn't wait for the send to be complete.
| data | An array of byte that represents the binary data to send. |
| completed | An Action<bool> delegate that references the method(s) called when the send is complete. A bool passed to this delegate is true if the send is complete successfully; otherwise, false . |
| void WebSocketSharp.WebSocket.SendAsync | ( | FileInfo | file, |
| Action< bool > | completed | ||
| ) |
Sends the specified file as a binary data asynchronously using the WebSocket connection.
This method doesn't wait for the send to be complete.
| file | A FileInfo that represents the file to send. |
| completed | An Action<bool> delegate that references the method(s) called when the send is complete. A bool passed to this delegate is true if the send is complete successfully; otherwise, false . |
| void WebSocketSharp.WebSocket.SendAsync | ( | string | data, |
| Action< bool > | completed | ||
| ) |
Sends a text data asynchronously using the WebSocket connection.
This method doesn't wait for the send to be complete.
| data | A string that represents the text data to send. |
| completed | An Action<bool> delegate that references the method(s) called when the send is complete. A bool passed to this delegate is true if the send is complete successfully; otherwise, false . |
| void WebSocketSharp.WebSocket.SendAsync | ( | Stream | stream, |
| int | length, | ||
| Action< bool > | completed | ||
| ) |
Sends a binary data from the specified Stream asynchronously using the WebSocket connection.
This method doesn't wait for the send to be complete.
| stream | A Stream from which contains the binary data to send. |
| length | An int that represents the number of bytes to send. |
| completed | An Action<bool> delegate that references the method(s) called when the send is complete. A bool passed to this delegate is true if the send is complete successfully; otherwise, false . |
| void WebSocketSharp.WebSocket.SetCookie | ( | Cookie | cookie | ) |
Sets an HTTP cookie to send with the WebSocket connection request to the server.
| cookie | A Cookie that represents the cookie to send. |
| void WebSocketSharp.WebSocket.SetCredentials | ( | string | username, |
| string | password, | ||
| bool | preAuth | ||
| ) |
Sets a pair of username and password for the HTTP authentication (Basic/Digest).
| username | A string that represents the user name used to authenticate. |
| password | A string that represents the password for username used to authenticate. |
| preAuth | true if the WebSocket sends the Basic authentication credentials with the first connection request to the server; otherwise, false . |
|
getset |
Gets or sets the compression method used to compress the message on the WebSocket connection.
One of the CompressionMethod enum values, indicates the compression method used to compress the message. The default value is CompressionMethod.None.
|
get |
Gets the HTTP cookies included in the WebSocket connection request and response.
An IEnumerable<Cookie> instance that provides an enumerator which supports the iteration over the collection of the cookies.
|
get |
Gets the credentials for the HTTP authentication (Basic/Digest).
A NetworkCredential that represents the credentials for the HTTP authentication. The default value is .
|
get |
Gets the WebSocket extensions selected by the server.
A string that represents the extensions if any. The default value is String.Empty.
|
get |
Gets a value indicating whether the WebSocket connection is alive.
true
if the connection is alive; otherwise, false
.
|
get |
Gets a value indicating whether the WebSocket connection is secure.
true
if the connection is secure; otherwise, false
.
|
getset |
|
getset |
Gets or sets the value of the Origin header to send with the WebSocket connection request to the server.
The WebSocket sends the Origin header if this property has any.
A string that represents the value of the HTTP Origin header
to send. The default value is .
The Origin header has the following syntax: <scheme>://<host>[:<port>]
|
getset |
Gets the WebSocket subprotocol selected by the server.
A string that represents the subprotocol if any. The default value is String.Empty.
|
get |
Gets the state of the WebSocket connection.
One of the WebSocketState enum values, indicates the state of the WebSocket connection. The default value is WebSocketState.Connecting.
|
getset |
Gets or sets the callback used to validate the certificate supplied by the server.
If the value of this property is , the validation does nothing with the server certificate, always returns valid.
A RemoteCertificateValidationCallback delegate that references the method(s) used to validate the server certificate. The default value is .
|
get |
| EventHandler<CloseEventArgs> WebSocketSharp.WebSocket.OnClose |
Occurs when the WebSocket connection has been closed.
| EventHandler<ErrorEventArgs> WebSocketSharp.WebSocket.OnError |
Occurs when the WebSocket gets an error.
| EventHandler<MessageEventArgs> WebSocketSharp.WebSocket.OnMessage |
Occurs when the WebSocket receives a message.
| EventHandler WebSocketSharp.WebSocket.OnOpen |
Occurs when the WebSocket connection has been established.


npm install node-ansible
NOTE: I think it goes without saying, but I’ll mention it anyway - you MUST have ansible installed on the same machine on which your node process is going to run.
var Ansible = require('node-ansible');
Ansible supports two types of execution methods via its CLI: ad-hoc tasks and playbooks. node-ansible uses the builder pattern to provide a programmatic interface above Ansible’s CLI, that supports both methods.
new Ansible.AdHoc().hosts('prod-servers').module('ping');
The command above will use Ansible to ping all hosts under the prod-servers
group. As we said,
node-ansible only wraps Ansible’s CLI tool, so the above code in fact translates to the following shell execution:
> ansible prod-servers -m ping
Most modules accept and even require arguments when executed. The following line of code will build an ad-hoc
executor for the shell
module and pass a freeform argument to it:
new Ansible.AdHoc().hosts('prod-servers').module('shell').args('echo "hello world"');
Again, the command above actually translates to the following shell execution:
> ansible prod-servers -m shell -a 'echo "hello world"'
Obviously, node-ansible must support key-value arguments which are very common in Ansible modules. With node-ansible you can simply use JSON objects to represent key-value arguments:
new Ansible.AdHoc().hosts('prod-servers')
.module('shell')
.args({ chdir: "/tmp" }, 'echo "hello world"');
A probably more interesting use-case is the execution of playbooks. Building a playbook command in node-ansible is very similar to building ad-hoc commands:
new Ansible.Playbook().playbook('my-playbook');
The command above translates to the following shell execution: ansible-playbook my-playbook.yml
.
Playbook variables can be set as follows:
var command = new Ansible.Playbook().playbook('my-playbook')
.variables({ foo: 'bar' });
which translates to the following shell execution:
> ansible-playbook my-playbook.yml -e 'foo=bar'
Lets execute our command:
var promise = command.exec();
The exec command returns a promise object, from which we can get the result of the execution:
promise.then(function(result) {
console.log(result.code);
console.log(result.output);
})
An execution result contains the exit code of the ansible CLI execution and its output (Ansible pipes stderr to stdout). It’s also possible to handle execution errors:
promise.then(function() {/* arbitrary code */}, function(err) {
console.error(err);
})
Notice that the path of my-playbook.yml will be resolved relatively to the working directory of your node process. In many cases that won’t be preferable, in which case it is possible to explicitly set the working directory when executing the command:
command.exec({cwd:"/path/to/my/playbooks"})
Most of the flags available in the CLI can be set or turned on using builder functions available for both Playbook and Ad-Hoc commands:
-f 4
command.forks(4)
-u root
command.user('root')
-i /etc/ansible/hosts
command.inventory('/etc/ansible/hosts')
-U root
command.su('root');
-s
command.asSudo();
-k
command.askPass();
-K
command.askSudoPass();
verbose level: accepts any level supported by the CLI
command.verbose('v')


Installation and configuration
Edit (pull request)This section describe a deprecated manual installation and configuration of Alien 4 Cloud. We strongly recommend you to automate your installation using A4C Spray project (or alternatively use Yorc bootstrap).
Supported platforms
To get more informations about the supported platforms, please refer to this section.
Ports requirements
To get more informations about the ports requirements, please refer to this section.
Alien 4 Cloud configuration
Alien 4 Cloud contains a basic configuration that is good enough for test environment. However in order to move into production or in order to integrate with other systems (as LDAP for example), you need to define an advanced configuration.
In order to provide configuration to Alien 4 Cloud, you must place an Alien configuration file in a config folder along-side to the Alien 4 Cloud war.
├── alien4cloud-ui-{version}-standalone.war
├── config/alien4cloud-config.yml
├── config/elasticsearch.yml
You can find default configurations for both files in the GitHub repository:
You can also add a simple start script:
├── start.sh
├── alien4cloud-ui-{version}-standalone.war
├── config/alien4cloud-config.yml
├── config/elasticsearch.yml
cd `dirname $0`
JAVA_OPTIONS="-server -showversion -XX:+AggressiveOpts -Xmx2g -Xms2g -XX:MaxPermSize=512m -XX:+HeapDumpOnOutOfMemoryError"
java $JAVA_OPTIONS -jar alien4cloud-ui-{version}-standalone.war
JVM tunning
See JVM tunning section for advanced Alien4Cloud JVM options.
Logging configuration
If you need to customize log4j2 (in order to activate some loggers, change the log file location …) add a log4j2.xml in the config folder and specify the classpath for java :
java $JAVA_OPTIONS -cp config/:alien4cloud-ui-{version}-standalone.war org.springframework.boot.loader.WarLauncher
You can find a log4j2 sample configuration file at log4j2.xml
For example, to use Alien with the level debug :
Replace
<root level="info">
by
<root level="debug">
Specific appender for the deployment logs
Alien4Cloud offer the possibilty to see / search deployment logs from orchestrators. Since Alien 1.4, a specific logger is used for this events.
<logger name="DEPLOYMENT_LOGS_LOGGER" level="info" additivity="false">
<AppenderRef ref="DEPLOYMENT_LOGS_APPENDER" />
</logger>
You can enable this logger in alien4cloud-config.yml :
logs_deployment_appender:
enable: true
This logger has a rolling file appender, you can adapt it to your requirements. By default, logs older than 30 days are automatically deleted.
For example, you can change this time retention in the log4j2.xml config to 10mn:
Replace
<IfLastModified age="30d"/>
by
<IfLastModified age="10mn"/>
Audit configuration
You can personalize the operations audit in it’s configuration page. You can select for each controller the rest method to monitor.
Edit (pull request)


|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Function
implementations.
See:
Description
| Interface Summary | |
| AggregateFunction | An aggregate function, which evalutes a collection of
Row s. |
| ConcreteFunction | An executable Function , as opposed to a FunctionIdentifier . |
| ScalarFunction | A ConcreteFunction that evaluates a single
Row . |
| Class Summary | |
| Base64DecodeFunction | BASE64DECODE(string): returns a byte array representing the Base64 decoded value of the given string. |
| Base64EncodeFunction | BASE64ENCODE(byte[]): returns a string representing the Base64 encoded value of the given byte[] or Blob. |
| BaseFunction | An abstract base ConcreteFunction implementation. |
| CharFunction | CHAR(number) : returns the
character representing
the unicode value number. |
| CoalesceFunction | COALESCE([value]+) :
returns the first non-null value in the
argument list. |
| ConcatFunction | CONCAT(string [, string]*) :
concatenates one or more strings . |
| ContainsFunction | CONTAINS(string, string): returns a boolean
that indicates whether the second string is a substring of the first. |
| CountFunction | COUNT :
an aggregate function returning the number of rows. |
| FunctionIdentifier | A Selectable representing an unresolved Function . |
| IfThenFunction | IFTHEN(condition value) :
returns value if condition evalates to true; else,
it returns null. |
| LikeToRegexpFunction | |
| LowerFunction | LOWER(string): returns a string
containing the lower case version of the input string. |
| MatchesFunction | MATCHES(string, string): returns a boolean that indicates whether first string matches the regular
expression represented by the second string |
| MaxFunction | MAX(number) :
an aggregate function returning the largest of the
integer -valued inputs. |
| MinFunction | MIN(number) :
an aggregate function returning the least of the
integer -valued inputs. |
| NowFunction | |
| RowNumFunction | Returns an one-based index indicating the order in which a row was selected from a table, join, etc. |
| UpperFunction | UPPER(string): returns a string
representing the upper case version of the input string. |
Function
implementations.
|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


QredoConversation
@interface QredoConversation : NSObject
Represents a secure channel of communication between two app users
Objects of this class are never created directly, but returned by the Qredo SDK as a result of:
enumerating the list of Conversations that the current user is a party to by calling enumerateConversationsWithBlock
Note
When a Conversation is established between two parties, as a result of one user responding to a Rendezvous, a Diffie-Hellman key exchange takes place between the creator and the responder. These keys are randomly generated and used to derive a further set of keys that are used to encrypt messages in such a way that only the two parties in the Conversation are able to read the messages. All of this is handled behind the scenes by the Qredo SDK, but you can use the fingerprints of the public keys to authenticate the Conversation and ensure that there has not been a ‘man-in-the-middle’ attack. See the Authenticating a Conversation methods later in this section.
-
The current highwatermark for this Conversation. This is used when enumerating
QredoConversationMessages
.Declaration
Objective-C
@property (readonly, atomic) QredoConversationHighWatermark *highWatermark;
Swift
var highWatermark: QredoConversationHighWatermark! { get }
-
Declaration
Objective-C
- (QredoConversationMetadata *)metadata;
Swift
func metadata() -> QredoConversationMetadata!
Return Value
the
QredoConversationMetadata
for this Conversation. -
Resets the highwatermark to the start. Enumerating
QredoConversationMessages
will start from the beginning of theQredoConversation
.Declaration
Objective-C
- (void)resetHighWatermark;
Swift
func resetHighWatermark()
-
Sets up or updates the summaryValues stored in the
QredoConversationMetadata
for this Conversation.Note
When the update is successful, the
QredoConversationRef
will be updated so you will need to update any stored references to this value.See
Updating Conversation Metadata: Objective-C, Swift
Declaration
Objective-C
- (void)updateConversationWithSummaryValues:(NSDictionary *)summaryValues completionHandler: (void (^)(NSError *))completionHandler;
Swift
func update(withSummaryValues summaryValues: [AnyHashable : Any]!, completionHandler: ((Error?) -> Void)!)
Parameters
summaryValues
A dictionary of key/value pairs. This will replace any existing summaryValues.
completionHandler
When this method completes error will be non nil if an error occurs.
-
Send the specified message to the other party in the Conversation
See
Sending a Conversation Message: Objective-C, Swift
Declaration
Objective-C
- (void)publishMessage:(QredoConversationMessage *)message completionHandler:(void (^)(QredoConversationHighWatermark *, NSError *))completionHandler;
Swift
func publishMessage(_ message: QredoConversationMessage!, completionHandler: ((QredoConversationHighWatermark?, Error?) -> Void)!)
Parameters
message
The
QredoConversationMessage
to send.completionHandler
Returns the new
QredoConversationHighWatermark
within this Conversation. error will be non nil if an error occurs.
-
Listen for
QredoConversationMessage
received within a ConversationAdds an observer that adopts the
QredoConversationObserver
protocol. The qredoConversation method must be implemented.See
Listening for Conversation Messages: Objective-C, Swift
Declaration
Objective-C
- (void)addConversationObserver:(id<QredoConversationObserver>)observer;
Swift
func add(_ observer: QredoConversationObserver!)
Parameters
observer
The object that implements the QredoConversationObserver protocol.
-
Add Conversation listener, and in addition requests Push Notification Messages for the Apple Supplied DeviceToken specified. - note: Observers are automatically deleted when you close the connection to the
QredoClient
, but push notifications subscriptions are persistent across sessions. [Requires server VXX.XX.XX]Declaration
Objective-C
- (void)addConversationObserver:(id<QredoConversationObserver>)observer withPushNotifications:(NSData *)deviceToken;
Swift
func add(_ observer: QredoConversationObserver!, withPushNotifications deviceToken: Data!)
-
Stop listening for messages received in the Conversation and delete the observer object. - parameter: observer to remove
Note
Observers are automatically deleted when you close the connection to theQredoClient
.Declaration
Objective-C
- (void)removeConversationObserver:(id<QredoConversationObserver>)observer;
Swift
func remove(_ observer: QredoConversationObserver!)
Parameters
observer
to remove
-
Deletes the specified Conversation. No further messages can be sent and received within this Conversation.
Note
The Conversation will only be deleted from this user’s message queue, the other party will still be able to access the Conversation and all messages within it. The other party will be notified in qredoConversationOtherPartyHasLeft that the current user is no longer part of the Conversation.
Declaration
Objective-C
- (void)deleteConversationWithCompletionHandler: (void (^)(NSError *))completionHandler;
Swift
func delete(completionHandler: ((Error?) -> Void)!)
Parameters
completionHandler
error will be non nil if the Conversation cannot be deleted.
-
Goes through the messages received in a conversation and calls the specified code block for each one.
See
Listing Conversation Messages: Objective-C, Swift
Declaration
Objective-C
- (void)enumerateReceivedMessagesUsingBlock: (void (^)(QredoConversationMessage *, BOOL *))block since:(QredoConversationHighWatermark *) sinceWatermark completionHandler: (void (^)(NSError *))completionHandler;
Swift
func enumerateReceivedMessages(_ block: ((QredoConversationMessage?,
  UnsafeMutablePointer<ObjCBool>) -> Void)!,
  since: QredoConversationHighWatermark!,
 completionHandler: ((NSError!) -> Void)!)Parameters
block
Called for each
QredoConversationMessage
. Setstop
to YES to terminate the enumerationsinceWatermark
the point at which to start the search. Use
QredoConversationHighWatermarkOrigin
to start from the beginning of the ConversationcompletionHandler
will be called if an error occurs, such as when there is a problem connecting to the server. error will be no nil.
-
Goes through the messages sent in a conversation and calls the specified code block for each one.
See
Listing Conversation Messages: Objective-C, Swift
Declaration
Objective-C
- (void) enumerateSentMessagesUsingBlock:(void (^)(QredoConversationMessage *, BOOL *))block since:(QredoConversationHighWatermark *)sinceWatermark completionHandler:(void (^)(NSError *))completionHandler;
Swift
func enumerateSentMessages(_ block: ((QredoConversationMessage?,
  UnsafeMutablePointer<ObjCBool>) -> Void)!,
  since: QredoConversationHighWatermark!,
 completionHandler: ((NSError!) -> Void)!)Parameters
block
Called for each
QredoConversationMessage
. Setstop
to YES to terminate the enumerationsinceWatermark
the point at which to start the search. Use
QredoConversationHighWatermarkOrigin
to start from the beginning of the ConversationcompletionHandler
will be called if an error occurs, such as when there is a problem connecting to the server. error will be no nil.
-
Call if the other party in the Conversation confirms that they have the fingerprint to your Conversation public key
Declaration
Objective-C
- (void)otherPartyHasMyFingerPrint:(void (^)(NSError *))completionHandler;
Swift
func otherPartyHasMyFingerPrint(_ completionHandler: ((Error?) -> Void)!)
-
Call this if the other party to the Conversation confirms that you have their fingerprint
Declaration
Objective-C
- (void)iHaveRemoteFingerPrint:(void (^)(NSError *))completionHandler;
Swift
func iHaveRemoteFingerPrint(_ completionHandler: ((Error?) -> Void)!)
-
Retrieve the Conversation authentication status. This will be red if neither party has confirmed their fingerprint, amber if only one party has and green if both parties have confirmed their fingerprint and the conversation is fully authenticated
Declaration
Objective-C
- (QredoAuthenticationStatus)authTrafficLight;
Swift
func authTrafficLight() -> QredoAuthenticationStatus
Return Value
The Conversation authentication status: red, amber or green
-
Show my public key fingerprint as a hex string
Declaration
Objective-C
- (NSString *)showMyFingerPrint;
Swift
func showMyFingerPrint() -> String!
-
Show the other party’s public key fingerprint as a hex string
Declaration
Objective-C
- (NSString *)showRemoteFingerPrint;
Swift
func showRemoteFingerPrint() -> String!


| 1 |
Quilty_2020 |
Effectiveness of airport screening at detecting travellers infected with 2019-nCoV |
Billy Quilty; Sam Clifford; Stefan Flasche; Rosalind M Eggo |
2020 |
2020-02-02 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>19265 |
2wshgzjk |
0.714038 |
|
Quilty_2020, Kuan_2012, Tang_2020 |
| 2 |
Quilty_2020 |
Effectiveness of airport screening at detecting travellers infected with novel coronavirus (2019-nCoV) |
Quilty, Billy J; Clifford, Sam; Flasche, Stefan; Eggo, Rosalind M |
2020 |
2020-02-06 |
None |
Y |
PMC7014668 |
32046816.0 |
10.2807/1560-7917.es.2<IP_ADDRESS>0080 |
626ch774 |
0.703926 |
|
Quilty_2020, Kuan_2012, Gostic_2020 |
| 3 |
Gostic_2020 |
Estimated effectiveness of symptom and risk screening to prevent the spread of COVID-19 |
Gostic, Katelyn; Gomez, Ana CR; Mummah, Riley O; Kucharski, Adam J; Lloyd-Smith, James O |
2020 |
2020-02-24 |
COMM-USE |
Y |
PMC7060038 |
32091395.0 |
10.7554/elife.55570 |
oee19duz |
0.671495 |
|
Gostic_2020 |
| 4 |
Gold_2019 |
Health screening strategies for international air travelers during an epidemic or pandemic |
Gold, Lukas; Balal, Esmaeil; Horak, Tomas; Cheu, Ruey Long; Mehmetoglu, Tugba; Gurbuz, Okan |
2019 |
2019-03-31 |
PMC |
N |
PMC7147844 |
|
10.1016/j.jairtraman.2018.11.006 |
nppps1dh |
0.648746 |
|
Kuan_2012, Clifford_2020 |
| 5 |
Gostic_2020 |
Estimated effectiveness of traveller screening to prevent international spread of 2019 novel coronavirus (2019-nCoV) |
Katelyn Gostic; Ana C. R. Gomez; Riley O. Mummah; Adam J. Kucharski; James O. Lloyd-Smith |
2020 |
2020-01-30 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>19224 |
x22rc60j |
0.640901 |
|
Gostic_2020 |
| 6 |
Malone_2009 |
U.S. airport entry screening in response to pandemic influenza: Modeling and analysis |
Malone, John D.; Brigantic, Robert; Muller, George A.; Gadgil, Ashok; Delp, Woody; McMahon, Benjamin H.; Lee, Russell; Kulesz, Jim; Mihelic, F. Matthew |
2009 |
2009-07-31 |
PMC |
N |
|
19717097.0 |
10.1016/j.tmaid.2009.02.006 |
bhgw44iv |
0.601762 |
|
Kuan_2012 |
| 7 |
Clifford_2020 |
Interventions targeting air travellers early in the pandemic may delay local outbreaks of SARS-CoV-2 |
Samuel J Clifford; Carl A B Pearson; Petra Klepac; Kevin Van Zandvoort; Billy J Quilty; Rosalind M Eggo; Stefan Flasche |
2020 |
2020-02-13 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>22426 |
y7d3ux28 |
0.591024 |
|
Koo_J_2020, Mukherjee_2010, Kretzschmar_2020 |
| 8 |
Nishiura_2011 |
Fever screening during the influenza (H1N1-2009) pandemic at Narita International Airport, Japan |
Nishiura, Hiroshi; Kamiya, Kazuko |
2011 |
2011-05-03 |
COMM-USE |
N |
PMC3096599 |
21539735.0 |
10.1186/1471-2334-11-111 |
fn4gzsw1 |
0.573656 |
|
Kuan_2012 |
| 9 |
Kuan_2012 |
Airport sentinel surveillance and entry quarantine for dengue infections following a fever screening program in Taiwan |
Kuan, Mei-Mei; Chang, Feng-Yee |
2012 |
2012-08-06 |
COMM-USE |
N |
PMC3462143 |
22867003.0 |
10.1186/1471-2334-12-182 |
ong6f9al |
0.558648 |
|
Kuan_2010 |
| 10 |
John_2005 |
Border Screening for SARS |
St. John, Ronald K.; King, Arlene; de Jong, Dick; Bodie-Collins, Margaret; Squires, Susan G.; Tam, Theresa WS |
2005 |
2005-01-23 |
PMC |
N |
PMC3294328 |
15705315.0 |
10.3201/eid1101.040835 |
r8lv1zzx |
0.550137 |
|
Wilder-Smith_2006 |
| 11 |
Hale_2012 |
Screening for Influenza A(H1N1)pdm09, Auckland International Airport, New Zealand |
Hale, Michael J.; Hoskins, Richard S.; Baker, Michael G. |
2012 |
2012-05-23 |
PMC |
N |
PMC3358051 |
22516105.0 |
10.3201/eid1805.111080 |
pqpqayuv |
0.541221 |
|
|
| 12 |
Kuan_2010 |
Epidemiological trends and the effect of airport fever screening on prevention of domestic dengue fever outbreaks in Taiwan, 1998–2007 |
Kuan, Mei-Mei; Lin, Ting; Chuang, Jen-Hsiang; Wu, Ho-Sheng |
2010 |
2010-08-31 |
PMC |
N |
PMC7110484 |
20656647.0 |
10.1016/j.ijid.2009.12.010 |
itxy15vv |
0.515599 |
|
Kuan_2012 |
| 13 |
Caley_2007 |
The Waiting Time for Inter-Country Spread of Pandemic Influenza |
Caley, Peter; Becker, Niels G.; Philp, David J. |
2007 |
2007-01-03 |
COMM-USE |
N |
PMC1764036 |
17206278.0 |
10.1371/journal.pone.0000143 |
nzh87aux |
0.514081 |
|
Nishiura_2007, Kretzschmar_2020 |
| 14 |
Wilder-Smith_2006 |
The severe acute respiratory syndrome: Impact on travel and tourism |
Wilder-Smith, Annelies |
2006 |
2006-03-31 |
PMC |
N |
PMC7106206 |
16887725.0 |
10.1016/j.tmaid.2005.04.004 |
w826suri |
0.510627 |
|
|
| 15 |
Gostic_2015 |
Effectiveness of traveller screening for emerging pathogens is shaped by epidemiology and natural history of infection |
Gostic, Katelyn M; Kucharski, Adam J; Lloyd-Smith, James O |
2015 |
2015-02-19 |
COMM-USE |
N |
PMC4337724 |
25695520.0 |
10.7554/elife.05564 |
r16o0m14 |
0.505865 |
|
|
| 16 |
Wickramage_2019 |
Airport Entry and Exit Screening during the Ebola Virus Disease Outbreak in Sierra Leone, 2014 to 2016 |
Wickramage, Kolitha |
2019 |
2019-10-20 |
COMM-USE |
N |
PMC6930773 |
31915689.0 |
10.1155/2019/3832790 |
aidohvlu |
0.493697 |
|
Quilty_2020, Kuan_2012 |
| 17 |
Otsuki_2016 |
Reduced Risk of Importing Ebola Virus Disease because of Travel Restrictions in 2014: A Retrospective Epidemiological Modeling Study |
Otsuki, Shiori; Nishiura, Hiroshi |
2016 |
2016-09-22 |
COMM-USE |
N |
PMC5033593 |
27657544.0 |
10.1371/journal.pone.0163418 |
wur4ss99 |
0.439339 |
|
Cousien_2019, Yuan_2020 |
| 18 |
Bell_2004 |
Public Health Interventions and SARS Spread, 2003 |
Bell, David M. |
2004 |
2004-11-23 |
PMC |
N |
PMC3329045 |
15550198.0 |
10.3201/eid1011.040729 |
kitltmh7 |
0.407580 |
|
|
| 19 |
Timen_2012 |
Retrospective Evaluation of Control Measures for Contacts of Patient with Marburg Hemorrhagic Fever |
Timen, Aura; Isken, Leslie D.; Willemse, Patricia; van den Berkmortel, Franchette; Koopmans, Marion P.G.; van Oudheusden, Danielle E.C.; Bleeker-Rovers, Chantal P.; Brouwer, Annemarie E.; Grol, Richard P.T.M.; Hulscher, Marlies E.J.L.; van Dissel, Jaap T. |
2012 |
2012-07-23 |
PMC |
N |
PMC3376788 |
22710186.0 |
10.3201/eid1807.101638 |
mupt0so6 |
0.392112 |
|
|
| 20 |
Yen_M_2009 |
Taipei's Use of a Multi-Channel Mass Risk Communication Program to Rapidly Reverse an Epidemic of Highly Communicable Disease |
Yen, Muh-Yong; Wu, Tsung-Shu Joseph; Chiu, Allen Wen-Hsiang; Wong, Wing-Wai; Wang, Po-En; Chan, Ta-Chien; King, Chwan-Chuen |
2009 |
2009-11-23 |
COMM-USE |
N |
PMC2776508 |
19956722.0 |
10.1371/journal.pone.0007962 |
5iejckwx |
0.386554 |
|
Yuan_2020 |
| 21 |
Eichner_2009 |
Small islands and pandemic influenza: Potential benefits and limitations of travel volume reduction as a border control measure |
Eichner, Martin; Schwehm, Markus; Wilson, Nick; Baker, Michael G |
2009 |
2009-09-29 |
COMM-USE |
N |
PMC2761921 |
19788751.0 |
10.1186/1471-2334-9-160 |
qf8fxbpt |
0.369928 |
|
Boyd_2017, Wood_2007 |
| 22 |
Wembri_2008 |
Severe Infections in the Returning Traveler |
Wembri, Jacob P.; Schmid, Matthias L. |
2008 |
2008-01-01 |
PMC |
N |
PMC7122235 |
|
10.1007/978-1-84628-939-2_9 |
59gzz4ke |
0.368060 |
|
|
| 23 |
UNKNOWN_2006 |
Nonpharmaceutical Interventions for Pandemic Influenza, International Measures |
None |
2006 |
2006-01-23 |
PMC |
N |
PMC3291414 |
16494722.0 |
10.3201/eid1201.051370 |
jk79yj1c |
0.367232 |
|
|
| 24 |
Hollingsworth_2007 |
Frequent Travelers and Rate of Spread of Epidemics |
Hollingsworth, T. Déirdre; Ferguson, Neil M.; Anderson, Roy M. |
2007 |
2007-09-23 |
PMC |
N |
PMC2857283 |
18252097.0 |
10.3201/eid1309.070081 |
dxo8l9gu |
0.349868 |
|
|
| 25 |
Boldog_2020 |
Risk assessment of novel coronavirus COVID-19 outbreaks outside China |
Peter Boldog; Tamas Tekeli; Zsolt Vizi; Attila Denes; Ferenc Bartha; Gergely Rost |
2020 |
2020-02-05 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>20503 |
ecu579el |
0.337057 |
|
Yuan_2020 |
| 26 |
Cooper_2006 |
Delaying the International Spread of Pandemic Influenza |
Cooper, Ben S; Pitman, Richard J; Edmunds, W. John; Gay, Nigel J |
2006 |
2006-05-02 |
COMM-USE |
N |
PMC1450020 |
16640458.0 |
10.1371/journal.pmed.0030212 |
kzhj0efp |
0.328905 |
|
|
| 27 |
Mukherjee_2010 |
Epidemiology of Travel-associated Pandemic (H1N1) 2009 Infection in 116 Patients, Singapore |
Mukherjee, Pratik; Lim, Poh Lian; Chow, Angela; Barkham, Timothy; Seow, Eillyne; Win, Mar Kyaw; Chua, Arlene; Leo, Yee Sin; Chen, Mark I-Cheng |
2010 |
2010-01-23 |
PMC |
N |
PMC2874386 |
20031038.0 |
10.3201/eid1601.091376 |
be8v9kuu |
0.302679 |
|
Park_2016 |


Well, I found a little bottle of 5-MeO-MiPT, so I decided to give it a try, having read a few decent reports about it.
I decided to take a very small amount to acclimate myself to the effects. I always like to do this when trying new materials, even if I am very familiar with the typical doses reported. I tested 2 milligrams late in the evening.
I felt slightly off baseline after about 20 minutes; something was happening but I wasn't quite sure what yet. I was watching television, and noticed myself becoming more engrossed in the program I was viewing. By 45 minutes after ingestion, I could definitely tell that there was a tryptamine working its way through my system. My pupils were dilated as usual with a psychedelic, amd my eyes looked a bit glassy. I felt a bit chilled, and decided to go out for a walk.
Immediately upon going outdoors, I felt a mellow euphoria building. Even though some seriously horrible things have happened to me just recently which have been weighing dangerously heavily on my mind, I was perfectly at ease. I felt a familiar glow of self-awareness. I felt as if all of my surroundings were reaching up to me and wrapping me in a soft embrace. I felt great. I was surprised by the potency of this material, having taken such a tiny amount.
I noticed some slight time dilation as I walked, feeling as though I was able to 'think more thoughts' within a given stretch of time. My thinking was very sharp and clear, and I did not notice any shift of any kind into another level of thinking, just simply becoming slightly more introspective. Everything was smooth and gentle. 5-MeO-MiPT is definitely a smooth drug. There was absolutely no body load whatsoever, and everything felt very natural and clean. There wasn't anything about it that felt artificial. I noticed that my sense of smell was slightly heightened.
I walked back to my house, and sat down in the backyard, looking up at Mars, glowing brightly in the peaceful, clear night sky. I gazed up at the big trees softly flowing to a slight breeze. The more I looked at them, the more it became apparent that they were moving much more than they should be; swaying and flowing with energy. Everything seemed to be flowing inward, curling and breathing.
I was impressed with this effect as I hadn't expected any kind of visual effects whatsoever.
I was a bit drowsy, so I went inside and laid down on the couch and watched some TV. Again, I noticed I was slightly more analytical than usual in my observations of TV. After about an hour or so from the start of the effects, they seemed to quickly subside, but a lingering insomnia persisted for a few hours. At this dose, everything was generally similar to a small dose of psilocybe mushrooms.
All in all, I greatly enjoyed my first taste of 5-MeO-MiPT and will definitely be conducting more experiments at higher doses.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


this is the content of the index of the index.html file
the visualisation function will be achieved here


${extends "testHeader.html"} ${something great} Hello ${name}, great to meet you! ${for user in users} Coucou 0 ${name} ${forend}


State of New York
This is a catalog of datasets organized and made more accessible from the State of New York, providing simple dowloadable CSV and JSON files, as well as Postman Collections you can use as part of workflows and other automation.
Home
About
Tags
Feed
Local Data Index
Discover the breadth of data collected by the state which is local in nature. Search by county and municipality and discover, explore, and download local data. With a click, find local data across...
Local Area Unemployment Statistics (LAUS), Seasonally Adjusted Data Beginning 1976
The Local Area Unemployment Statistics program estimates labor force statistics (labor force, employed, unemployment, unemployment rate) for New York State civilian labor force aged 16 and up. Seas...
Local Area Unemployment Statistics Beginning 1976
The Local Area Unemployment Statistics program estimates labor force statistics (labor force, employed, unemployment, unemployment rate) for New York State civilian labor force aged 16 and up. Area...
Lobbyist Reportable Business Relationships with State Officials and Employees Beginning 2012
Data provided by Lobbyist in the Biennial Registration filings submitted to NYS Joint Commission on Public Ethics.
Lobbyist Disbursement of Public Monies Disclosures 7 Year Window
Data provided by Lobbyist in their Bi-monthly filings submitted to NYS Joint Commission on Public Ethics
Lobbying Clients Sources of Funding for Lobbying Activities Beginning 2012
Data provided by Clients in their Semi-Annual filings submitted to NYS Joint Commission on Public Ethics
Lobbying Clients Reportable Business Relationships with State Officials and Employees Beginning 2012
Data provided by Clients in their Semi-Annual filings submitted to NYS Joint Commission on Public Ethics.
Lobbying Clients Disclosures Four Biannual Period Window
Data provided by Lobbying Clients in their Semi-Annual filings submitted to the NYS Joint Commission on Public Ethics
Loan Forgiveness Awards Administered by Higher Education Services Corp Beginning 2011
This data includes the number of Loan Forgiveness recipients by program type and the region, as designated by the Department of Labor, in which they are employed beginning award year 2011 (for HESC...
Loaded Containers Monthly Imports and Exports Through Port Authority of NY NJ Maritime Terminals Beginning 2000
This dataset describes the total volume of Import and Export Loaded Containers moved through maritime terminals located within Port Authority property in the Port of New York and New Jersey in Twen...
Liquor Authority Quarterly List of Active Permits
This dataset contains a list of all active permits issued by the State Liquor Authority. Permits in this dataset are issued for 1-3 year terms. This dataset does not include temporary or single e...
Liquor Authority Pending Licenses
Currently Pending Licenses. A pending status indicates that the applicant has applied and a determination has not been made on the application yet.
Liquor Authority Inactive Licenses
List of inactivated licenses. An inactive status indicates that a license was surrendered.
Liquor Authority Expired Licenses
List of expired licenses. An expired status indicates that a license was not renewed prior to its expiration. There could be a renewal pending on an expired license.
Liquor Authority Current List of Active Licenses
Liquor Authority current list of all active licensees in NYS.
Life Insurance In Force in the State of New York Beginning 1996
Life insurance in force is the total value of life insurance policies that a company has issued. It is normally the sum of face amounts plus dividends outstanding that a company would have to pay ...
License Event Notification Service (LENS) Customers
The License Event Notification Service (LENS) is a tool that enables LENS customers to monitor a set of drivers’ qualifications, and to receive notifications of changes to drivers’ qualifications. ...
Law Enforcement Personnel by Agency Beginning 2007
The Division of Criminal Justice Services (DCJS) collects personnel statistics from more than 500 New York State police and sheriffs’ departments. In New York State, law enforcement agencies use th...
Large-scale Renewable Projects Reported by NYSERDA Beginning 2004
Large-scale Renewable Projects Reported by NYSERDA Beginning 2004 dataset includes information for projects completed, operational, cancelled, and under development. Projects under development are ...
Labor Market Regions
The New York State Department of Labor has ten labor market regions across the state. This dataset lists the counties and their corresponding labor market region.
Labor Market Regions Map
Labor Market Regions (LMRs) correspond to ten geographic areas of the state, which are defined by the New York State Department of Labor. Counties are the building blocks used to build progressivel...
Labor Market Analysts
The New York State Department of Labor has labor market analysts in 10 regions across the state. This data set outlines where the labor market analysts are located by labor market region.
Labor Force Status by Race and Ethnicity Beginning 2012
This dataset shows the population, civilian labor force, unemployed, and unemployment rate for people aged 16 years and older by race and ethnicity in New York State and its Labor Market Regions.
Key Credit Collection Beginning 2010
Quarterly snapshot of residential collection data submitted by New York State’s ten largest distribution utility companies.
Jobs By Industry Beginning 2012
This data shows jobs by industry, beginning in 2012, created from a dataset of economic profiles of the 10 Empire State Development (ESD) economic development regions. Refer to the About section fo...


Spymasters take turns giving one-word clues. A clue may relate to multiple words on the table. The Field Operatives try to guess which words their spymaster meant.
When a field operative selects a word, its secret identity is revealed. If the field operative guesses correctly, they may continue guessing, until they run out of ideas
for the given clue or until they hit a wrong person. Then it is the other team's turn to give a clue and guess.
The first team to contact all their agents wins the game.