5.2. Contribution Procedure¶
We use the standard GitHub workflow for SIMP development with the exception that we use a Squash and Merge merge method for pulling in changes, in order to maintain a more legible commit history on master.
Search the SIMP JIRA for an open ticket that is relevant to the issue or open a new one.
Use the GitHub GUI to fork and clone the repository (we’ll use
pupmod-simp-iptables
for the rest of this walkthrough)Clone the repo you want to work on:
git clone git@github.com:<YOUR_GITHUB_NAME>/pupmod-simp-iptables iptables
Enter the directory and create a feature branch:
git checkout -b SIMP-XXXX
Do your work! (Including tests, of course)
Commit your work. We will squash your pull request into one commit when we merge it, so you can use as many commits as you’d like.
Important
The first commit should use the Commit Message Conventions
Push your changes to Github on your feature branch:
git push origin SIMP-XXXX
Using the GitHub GUI, create a pull request from your feature branch to the branch of the original repo that you want to contribute to. Leave the ‘Allow edits from maintainers‘ checkbox checked to let a team member add add commits to your pull request.
Travis-CI will run the spec tests for the branch and a member of the SIMP team will review your submission. You should receive emails from Github as the code reviews progress.
5.2.1. Commit Message Conventions¶
An example commit message that following the SIMP conventions:
(SIMP-999) Fix the broken thing [50 chars max] Discussion about the fix (if needed) [each line: 72 chars max] SIMP-998 #comment Comment on a related issue [72 chars max] SIMP-999 #close
The first commit message should be the following format:
- First line:
- Start with the Issue name in parentheses [e.g.,
(SIMP-999)
], followed by a summary of the change- No longer than 50 characters
- Followed by a line of white space
- Subsequent lines:
- Each line should be no longer than 72 characters
- Describe the previous behavior, why it was changed, and the changes in detail
- Issue references:
- JIRA issues can be referenced at the end of the commit message
- It is recommended to only use JIRA Smart Commit Tags
#comment
and#close
- Avoid
#resolve
and#time
as it will not update JIRA until after the issue is merged


code.InteractiveConsole¶
- class InteractiveConsole(locals=None, filename='<console>')[source]¶
Bases:
code.InteractiveInterpreter
Closely emulate the behavior of the interactive Python interpreter.
This class builds on InteractiveInterpreter and adds prompting using the familiar sys.ps1 and sys.ps2, and input buffering.
Constructor.
The optional locals argument will be passed to the InteractiveInterpreter base class.
The optional filename argument should specify the (file)name of the input stream; it will show up in tracebacks.
Methods
Closely emulate the interactive Python console.
Push a line to the interpreter.
Write a prompt and read a line.
Reset the input buffer.
Execute a code object.
Compile and run some source in the interpreter.
Display the syntax error that just occurred.
Display the exception that just occurred.
Write a string.
- interact(banner=None, exitmsg=None)[source]¶
Closely emulate the interactive Python console.
The optional banner argument specifies the banner to print before the first interaction; by default it prints a banner similar to the one printed by the real Python interpreter, followed by the current class name in parentheses (so as not to confuse this with the real interpreter – since it’s so close!).
The optional exitmsg argument specifies the exit message printed when exiting. Pass the empty string to suppress printing an exit message. If exitmsg is not given or None, a default message is printed.
- push(line)[source]¶
Push a line to the interpreter.
The line should not have a trailing newline; it may have internal newlines. The line is appended to a buffer and the interpreter’s runsource() method is called with the concatenated contents of the buffer as source. If this indicates that the command was executed or invalid, the buffer is reset; otherwise, the command is incomplete, and the buffer is left as it was after the line was appended. The return value is 1 if more input is required, 0 if the line was dealt with in some way (this is the same as runsource()).
- raw_input(prompt='')[source]¶
Write a prompt and read a line.
The returned line does not include the trailing newline. When the user enters the EOF key sequence, EOFError is raised.
The base implementation uses the built-in function input(); a subclass may replace this with a different implementation.
- runcode(code)¶
Execute a code object.
When an exception occurs, self.showtraceback() is called to display a traceback. All exceptions are caught except SystemExit, which is reraised.
A note about KeyboardInterrupt: this exception may occur elsewhere in this code, and may not always be caught. The caller should be prepared to deal with it.
- runsource(source, filename='<input>', symbol='single')¶
Compile and run some source in the interpreter.
Arguments are as for compile_command().
One several things can happen:
1) The input is incorrect; compile_command() raised an exception (SyntaxError or OverflowError). A syntax traceback will be printed by calling the showsyntaxerror() method.
2) The input is incomplete, and more input is required; compile_command() returned None. Nothing happens.
3) The input is complete; compile_command() returned a code object. The code is executed by calling self.runcode() (which also handles run-time exceptions, except for SystemExit).
The return value is True in case 2, False in the other cases (unless an exception is raised). The return value can be used to decide whether to use sys.ps1 or sys.ps2 to prompt the next line.
- showsyntaxerror(filename=None)¶
Display the syntax error that just occurred.
This doesn’t display a stack trace because there isn’t one.
If a filename is given, it is stuffed in the exception instead of what was there before (because Python’s parser always uses “<string>” when reading from a string).
The output is written by self.write(), below.
- showtraceback()¶
Display the exception that just occurred.
We remove the first stack item because it is our own code.
The output is written by self.write(), below.
- write(data)¶
Write a string.
The base implementation writes to sys.stderr; a subclass may replace this with a different implementation.


Most of our daily experiences, be it writing a blog post on a laptop or slicing bread with a knife, build on the enormous amount of knowledge and progress mankind has accumulated over the millennia. Most of the times, and quite understandably, we take all this for granted and live thinking about the future rather than the past. It is not worth recalling the iron age every time we use a fork, or all the people involved in the invention of the transistor every time we use a computer. Every now and then, though, it is hard not to be overwhelmed by the magnitude of past scientists.
It occurred to me some weeks ago with mathematicians, when I read a nice article by Davide Castelvecchi on Nature News. It reports an analysis done on the Mathematics Genealogy Project, a database aiming to list present and past mathematicians together with their advisor, in order to build a family tree of the advisor-advisee relationships. This analysis shows that two thirds of the over 200 thousand mathematicians present in the database can be assigned to one of only 24 families, the biggest of which founded by the Italian mathematician (physician and natural philosopher) Sigismondo Polcastro, who lived between 14th and 15th century.
Although I had already explored this database previously, after reading this article I decided to go further into the past, something easily done by clicking on the advisor link. While doing so I encountered many many big names, those that you meet multiple times when you study calculus. And I was somehow startled that they were in direct advisor-advisee relation! It is really not too difficult to end up on Euler (over 96 thousand descendants) meeting Dirichlet, Fourier and Lagrange on the path, to name a few.
So I decided to save some of these advisor-advisee relationship and plot them as a directed graph with d3. In the graph below an arrow from A to B means A was advisor of B. You can (and probably have to) drag the points around to clarify some links.
The selection of nodes is completely arbitrary, I only saved nodes that somehow struck me because something important in mathematics is named after them.
There should be other interesting cliques in the database. For example, where are Gauss, Riemann, Dedekind? And what about Cauchy and Hilbert?
Technical notes
I found the following links useful to draw the network:
- An A to Z of extra features for the D3 force layout, a tutorial by Simon Raper,
- a question on Stack Overflow, How to embed d3 in a jekyll blog post and references therein.
- Last but not least, this helped me correct a fundamental mistake I was making in selecting the relevant html element.
Header image from Flickr


"Effortlessly elegant, . . . Thoughtful in its looseness, . . ." New York Times - 4/8/2017
UNTITLED, Christine Shan Shan Hou - 4/13/2017
“A montage of facial expressions feels like a palindrome at the point of turning in on itself.” IDIOM Magazine - 4/15/2013
Interview, Time Out New York - 3/8/2013
Eva Yaa Asantewaa’s “Playing Favorites . . . of 2011” Group Dynamics and Visual Sensitivity and Ursula’s performance in It listed among the year’s best performances.
“Ms. Eagly is one of the few choreographers I can think of whose work actually frightens. She has a tall, unbelievably fluid body (her every joint looks double), a mane of blond hair and, in performance, the gaze of someone only pretending to be human. In Fields of Ida, surrounded by floor and table lamps from her apartment, she hinged and lunged, folding her long limbs in ways they should never be folded. She looked like a creature out of Blake’s fantastical engravings.”
The New York Times - 10/10/2009
“Ms. Eagly’s darkly humorous, often violent imagination is to be treasured, and cultivated. You want to follow her rabbit-hole logic, even when stymied by it.”
The New York Times - 1/30/2009
“spooky, languid…strange, bewitching”
The New York Times - 4/5/2008
“always quirky, fun, disturbing, funny and unexpected”
Culturebot - 4/2008
“quirky, with a bizarre, dark logic that is mysterious and intriguing”
Inquisitive Owl - 4/9/2008
Movement Research Critical Correspondence - 2006 Retrospective
Movement Research Critical Correspondence Interview - 4/8/2006
The Village Voice - 11/11/2005


{{story.name}}
{{story.text}}
> Learn--- layout: success-stories title: "Success Stories" intro: "Real world use cases about the transformative power of Spinnaker" description: "See how developers are the key change agents in their companies." sidebar: nav: success-stories ---
Want to share your Spinnaker Success Story? Click here!
{{quest.question}}
{{quest.answer}}
{% endfor %}Want to share your Spinnaker Success Story? Click here!


The Bhagavad Gita manuscript is found in the sixth book of the Mahabharata manuscripts – the Bhisma-parvan. Therein, in the third section, the Gita forms chapters 23–40, that is 6.3.23 to 6.3.40.
The Bhagavad Gita is often preserved and studied on its own, as an independent text with its chapters renumbered from 1 to 18.
{{ range .Pages.GroupByParam "chapter" "asc"}}
CHAPTER {{ .Key }}
{{ range .Pages.ByParam "sutra"}}
{{ end }}
{{ end }}


{% load user_display from account %}
First name: {{ user.first_name }}
Last name: {{ user.last_name }}
Groups that {% user_display user %} is in:
You can use search to find more users.


Headlines
In the Headlines section you can activate or deactivate headlines
boxes with news from other sites. Headlines boxes will be at
the left table of the site. Headlines grabber works only for
RDF/XML files, not for plain text. PHP-Nuke already includes
a rich headlines database so you only need to change the status
and active it. (Please read the Note at the bottom)
To add a new Headline to the database just write the site name,
the URL, the complete URL for the RDF/XML file and finaly the Status.
Status can be Active or Inactive. If active, you will see a new left box
with the selected headlines, if inactive you can add the resource to the
database but will not show anything for the user.
To change the status for one headline, just click on Edit
option and select the desired status or just edit the fields you need to
change.
To delete a headline just click on the Deleteoption.
Note: Headlines, when activated can slow down the server. All headlines
will be automaticaly updated every hour. Please don't edit the php code to
decrease the update time, the webmasters don't like that other webmaster
abuse of their bandwidth.


In this field, specify the path to the Git executable file. Type the path or click Browse and specify the path in the dialog
that opens.
IntelliJ IDEA supports Git from the Windows Subsystem for Linux 2 (WSL2), which is available in Windows
10 version 2004.
If Git is not installed on Windows, IntelliJ IDEA searches for Git in WSL and uses it from there. Also, IntelliJ
IDEA automatically switches to Git from WSL for projects that are opened when you use the \wsl$
path.


Verify an access token
----------------------
Endpoint:
https://auth.iudx.org.in/auth/v1/token/introspect
Description:
This API is used to verify an access token provided by a consumer.
Called by:
A "resource-server" with a valid class-1 certificate.
Note 1:
The "CN" of the resource-server certificate should be valid hostname
(FQDN) or IP address. And it must be ensured that the IP address of the
"CN" matches with the machine that makes the introspect call.
Tip:
If you do not have a domain yet and want to test the introspect API,
use "example.com" as your resource-server.
Note 2:
This API must be only called by the resource-server after ensuring that
the resource "id"s requested by consumer is valid. This reduces the
number of API calls to the Auth server.
Methods:
POST
Headers:
content-type : "application/json"
Body in JSON format:
{
"token" : <token presented by the consumer>
"server-token" : <server token presented by the consumer>
"request" : <the request that was sent by the consumer>
}
Fields:
1. "token"
The token which was presented by a consumer.
2. "server-token"
The server token presented by a consumer.
The server-token always starts with a resource-server
name and a "/" and random bytes.
For example:
"example.org/ebd8ae1de4a3be9b26a6173625df3d3f"
server-token is only required if a token is valid for
multiple resource-servers.
As a "token" can be valid of many resource-servers:
"server-token"s are used to prevent a malicious resource
server from presenting a consumer's "token" as its own
to another resource-server.
3. "request"
This is the exact data request sent by the consumer to
the resource-server.
If this field is presented:
then the auth server will exactly match this "request" field
with the "request" that was presented by the consumer during
the "/token" API.
If this field is not presented:
Then the auth server returns the "request" for which the
token is valid. The resource-server should then validate
the consumer's "request" itself.
This is useful in cases where there may be complex regular
expressions in "request" field.
Also in cases where the resource-server does not want to share
the user's request with Auth server for privacy reasons.
Checks before making the introspect API:
A valid IUDX token consist of 3 fields (delimited by '/'):
1. Who has issued the token (The Auth server)
2. To whom the token has been issued (The consumer)
3. Random string
For example:
<EMAIL_ADDRESS>NOTE:
It is important for a resource-server to check if the token
was issued by a trusted Auth server before making the introspect call.
That is - "NEVER" create the Auth server URL based on the token
provided by the consumer.
HTTP response code:
200
If the token is valid
403
If the token is invalid/expired
"OR"
The "CN" of the resource-server certificate does not match the
IP address of the machine which is calling this API.
429
If the resource-server makes too many requests
Using pyIUDX SDK:
Example 1:
# simple example
from pyIUDX.auth import auth
iudx_auth = auth.Auth(
"resource-server-certificate.pem","private-key.pem"
)
iudx_auth.introspect_token(
<EMAIL_ADDRESS>)
Example 2:
# dealing with multiple auth servers
from pyIUDX.auth import auth
cert = "resource-server-certificate.pem"
key = "private-key.pem"
my_trusted_auth_servers = {
"auth.iudx.org.in" : auth.Auth(cert,key,"auth.iudx.org.in"),
"my.auth.server.com" : auth.Auth(cert,key,"my.auth.server.com"),
"third.party.auth.com" : auth.Auth(cert,key,"third.party.auth.com"),
}
# received token from consumer
token =<EMAIL_ADDRESS>try:
token_auth_server = token.split("/")[0]
auth_server = my_trusted_auth_servers [token_auth_server]
print(valid_auth_server.introspect_token(token))
except:
print("Invalid token")
CURL example:
Request:
curl -XPOST https://auth.iudx.org.in/auth/v1/token/introspect
--cert resource-server-certificate.pem --key private-key.pem
-H 'content-type: application/json'
-d '{"token"<EMAIL_ADDRESS>Response:
200 OK
content-type : "application/json"
{
"consumer"<EMAIL_ADDRESS>"consumer-certificate-class" : 3
"expiry" : "2019-12-12T04:29:50.779Z",
"request" : [
{
"id" : "example.com/9cf2c2382cf661fc20a4776345a3be7a143a109c/rs1.com/r3",
"apis" : [
"/*"
],
"methods" : [
"*"
],
"body" : null
}
],
}
Response fields:
1. "consumer"
The consumer's email-id.
2. "consumer-certificate-class"
The class of certificate used by the consumer to get the
token.
3. "expiry"
Indicates till what time the token is valid.
4. "request"
The array of resource id's, methods, and APIs for which
the token is valid.
See also:
token API:
http://auth.iudx.org.in/token.html


Elder Evil Template
Borem’s Embrace (1/Day). The cultist touches one creature within 5 feet of it. The target must succeed on a DC 15 Dexterity saving throw or be coated in sticky, steaming mud. While it is coated in this way, the target’s speed is halved, it can’t use reactions, and it takes 10 (3d6) fire damage at the start of each of its turns. The effect lasts for 1 minute, until the cultist is incapacitated or dies, or until the target is immersed in water.
Gaze of Corruption (Recharge 6). The cultist targets one creature it can see within 30 feet of it. The target must succeed on a DC 15 Constitution saving throw or take 16 (3d10) necrotic damage and be poisoned for 1 minute. The poisoned target can repeat the saving throw at the end of each of its turns, ending the effect on itself on a success.
Haask’s Presence (1/Day). The cultist transforms into a Tiny, leech-like being and teleports onto the shoulder of a humanoid that it can see within 30 feet of it. The targeted humanoid must succeed on a DC 15 Charisma saving throw or be charmed by the cultist. While the target is charmed, the cultist has control of it on the target’s next turn. At the end of that turn, the cultist teleports to an unoccupied space it can see within 30 feet of it and returns to its normal form. The cultist can’t be targeted directly by any attack or other effect while it’s in the slug-like form, but it is subject to areas of effect as normal.
Radiant Flames (1/Day). Multihued flame surrounds the cultist for 1 minute, until the cultist is incapacitated or dies, or until the cultist extinguishes the flame (no action required). While inflamed, the cultist has telepathy with a range of 30 feet, and it can teleport as a bonus action up to 30 feet to an unoccupied space it can see. In addition, every creature that starts its turn within 5 feet of the cultist must make a DC 15 Dexterity saving throw, taking 16 (3d10) radiant damage on a failed save, or half as much damage on a successful one.
Tharizdun’s Spark (Recharge 6). As a bonus action, the cultist touches a simple or martial weapon or a natural weapon, if it has one. The next creature hit by the touched weapon must succeed on a DC 15 Wisdom saving throw or experience shortterm madness for 10 minutes. Consult the Short-Term Madness table (see “Madness Effects” in chapter 8 of the


TOGGLE
Home
About
Catalog
Contacts
TEST
quick view
Some cool productdasdasd
500$
quick view
Some cool product
500$
quick view
Some cool product
500$


//This should provide a notification icon that indicates that the //live streaming session has been established and the number of //viewers in the steam. {{__('Internet Streaming')}} {{status.stats.viewers}}/{{status.stats.pilots}}


Techqueria is a 501c3 nonprofit that empowers Latinx professionals with the resources and support that they need to thrive and become leaders in the tech industry.
To that end, we work with both tech companies and employee resource groups (ERGs) to build Latinx-centered spaces that revolve around career advice, technical talks, mentorship, open jobs, networking events, speaking opportunities, and open-source in order to comprehensively affect change in the tech industry.
Coming from all walks of life, we believe that the diversity of our community is the most reliable asset we have. Our space aims to be inclusive so we invite Latinx from the regions of the Caribbean, Haiti, and Brazil as well as those who identify as Afro-Latinx, Asian-Latinx or LGBTQIA. The term Latinx is used instead of Latino or Latina because it is a gender-neutral and inclusive term.


RT @Scobleizer: At @Rackspace we are proud to be part of this: Get further visibility into performance tools with New Relic Platform http:/…
6/19/2013, 11:56:32 AM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @Scobleizer: At @Rackspace we are proud to be part of this: Get further visibility into performance tools with New Relic Platform http:/…
6/19/2013, 11:56:32 AM
Favs: 0
Retweets: 0
link


The library has been tested using Agda version <IP_ADDRESS>.
Changes since 1.0.1:
Highlights
-
Large increases in performance for
Nat
,Integer
andRational
datatypes, particularly in compiled code. -
Generic n-ary programming (
projₙ
,congₙ
,substₙ
etc.) -
General argmin/argmax/min/max over
List
. -
New
Trie
datatype
Bug-fixes
_<_
in Data.Integer
-
The definition of
_<_
inData.Integer
often resulted in unsolved metas when Agda had to infer the first argument. This was because it was previously implemented in terms ofsuc
->_+_
->_⊖_
. - To fix this problem the implementation has therefore changed to:
data _<_ : ℤ → ℤ → Set where -<+ : ∀ {m n} → -[1+ m ] < + n -<- : ∀ {m n} → (n<m : n ℕ.< m) → -[1+ m ] < -[1+ n ] +<+ : ∀ {m n} → (m<n : m ℕ.< n) → + m < + n
which should allow many implicit parameters which previously had to be given explicitly to be removed.
-
All proofs involving
_<_
have been updated correspondingly -
For backwards compatibility the old relations still exist as primed versions
_<′_
as do all the old proofs, e.g.+-monoˡ-<
has become+-monoˡ-<′
, but these have all been deprecated and may be removed in some future version. - Migrating code might require lemmas relating
m < n
andm <′ n
/suc m ≤ n
; such lemmas have unfortunately only been added in 1.3.
Fixed wrong queries being exported by Data.Rational
Data.Rational
previously accidently exported queries fromData.Nat.Base
instead ofData.Rational.Base
. This has now been fixed.
Fixed inaccurate name in Data.Nat.Properties
- The proof
m+n∸m≡n
inData.Nat.Properties
was incorrectly named as it provedm + (n ∸ m) ≡ n
rather thanm + n ∸ m ≡ n
. It has therefore been renamedm+[n∸m]≡n
and the old name now refers to a new proof of the correct type.
Fixed operator precedents in Ring
-like structures
- The infix precedence of
_-_
in the recordGroup
fromAlgebra.Structures
was previously set such that when it was inherited by the recordsRing
,CommutativeRing
etc. it had the same predence as_*_
rather than_+_
. This lead tox - x * x
being ambigous instead of being parsed asx - (x * x)
. To fix this, the precedence of_-_
has been reduced from 7 to 6.
Fixed operator precedents in Reasoning
modules
- The infix precedence of the generic order reasoning combinators (
_∼⟨_⟩_
,_≈⟨_⟩_
, etc.) inRelation.Binary.Reasoning.Base.Double/Triple
were accidentally lowered when implementing new style reasoning inv1.0
. This lead to inconsistencies in modules that add custom combinators (e.g.StarReasoning
fromRelation.Binary.Construct.Closure.ReflexiveTransitive.Properties
) using the original fixity. The old fixity has now been restored.
Other non-backwards compatible changes
Improved performance of arithmetic decision procedures & operations
-
The functions
_≤?_
and<-cmp
inData.Nat.Properties
have been reimplemented uses only built-in primitives. Consequently this should result in a significant performance increase when these functions are compiled or when the generated proof is ignored. -
The function
show
inData.Nat.Show
has been reimplemented and, when compiled, now runs in timeO(log₁₀(n))
rather thanO(n)
. -
The functions
gcd
andlcm
inData.Nat.GCD
andData.Nat.LCM
have been reimplemented via the built-ins_/_
andmod
so that they run much faster when compiled and normalised. Their types have also been changed toℕ → ℕ → ℕ
instead of(m n : ℕ) → ∃ λ d → GCD/LCM m n d
. The old functions still exist and have been renamedmkGCD
/mkLCM
. The alternativegcd′
inData.Nat.Coprimality
has been deprecated. -
As a consequence of the above, the performance of all decidability procedures in
Data.Integer
andData.Rational
should also have improved. Normalisation speed inData.Rational
should receive a significant boost.
Better reduction behaviour for conversion functions in Data.Fin
- The implementation of the functions
fromℕ≤
andinject≤
inData.Fin.Base
has been changed so as to avoid pattern matching on them ≤ n
proof. This makes them significantly easier to use, as often it is inconvenient to pattern match on them ≤ n
proof directly.
Consistent field names in IsDistributiveLattice
- In order to match the conventions found elsewhere in the library, the module
IsDistributiveLattice
inAlgebra.Structures
has had its field renamed from∨-∧-distribʳ
to∨-distribʳ-∧
. To maximise backwards compatability, the record still exports∨-∧-distribʳ
but the name is deprecated.
Making categorical traversal functions easier to use
- Previously the functions
sequenceA
,mapA
,forA
,sequenceM
,mapM
andforM
in theData.X.Categorical
modules required theApplicative
/Monad
to be passed each time they were used. To avoid this they have now been placed in parameterised modules namedTraversableA
andTraversableM
. To recover the old behaviour simply writeopen TraversableA
. However you may now, for example, avoid passing the applicative every time by writingopen TraversableA app
. The change has occured in the following modules:Data.Maybe.Categorical Data.List.Categorical Data.List.NonEmpty.Categorical Data.Product.Categorical.(Left/Right) Data.Sum.Categorical.(Left/Right) Data.Vec.Categorical
Moved #_
within Data.Fin
.
- The function
#_
has been moved fromData.Fin.Base
toData.Fin
to break dependency cycles following the introduction of the moduleData.Product.N-ary.Heterogeneous
.
New modules
The following new modules have been added to the library:
- An algebraic construction for choosing between
x
andy
based on a comparison off x
andf y
.Algebra.Constructs.LiftedChoice
- The reader monad.
Category.Monad.Reader
- Non-empty AVL trees.
Data.AVL.NonEmpty Data.AVL.NonEmpty.Propositional
- Implementations of
argmin
,argmax
,min
andmax
for lists over arbitraryTotalOrder
s.Data.List.Extrema Data.List.Extrema.Nat Data.List.Extrema.Core
- Additional properties of membership with the
--with-k
option enabled.Data.List.Membership.Propositional.Properties.WithK
- A relation for lists that share no elements in common.
Data.List.Relation.Binary.Disjoint.Propositional Data.List.Relation.Binary.Disjoint.Setoid Data.List.Relation.Binary.Disjoint.Setoid.Properties
- A relation for lists that are permutations of one another with respect to a
Setoid
.Data.List.Relation.Binary.Permutation.Homogeneous Data.List.Relation.Binary.Permutation.Setoid Data.List.Relation.Binary.Permutation.Setoid.Properties
- A predicate for lists in which every pair of elements is related.
Data.List.Relation.Unary.AllPairs Data.List.Relation.Unary.AllPairs.Properties
- A predicate for lists in which every element is unique.
Data.List.Relation.Unary.Unique.Propositional Data.List.Relation.Unary.Unique.Propositional.Properties Data.List.Relation.Unary.Unique.Setoid Data.List.Relation.Unary.Unique.Setoid.Properties
- New generic n-ary programming primitives.
Data.Product.Nary.NonDependent Function.Nary.NonDependent Function.Nary.NonDependent.Base Relation.Nary
- Properties of the unit type.
Data.Unit.Properties
- Implementation of tries.
Data.Trie Data.Trie.NonEmpty
- New implementation of vectors of no more than length
n
.Data.Vec.Bounded.Base Data.Vec.Bounded
- Data types that are compiled to their Haskell equivalents.
Foreign.Haskell.Pair Foreign.Haskell.Maybe
- Properties of closures over binary relations.
Relation.Binary.Construct.Closure.Reflexive.Properties Relation.Binary.Construct.Closure.Reflexive.Properties.WithK Relation.Binary.Construct.Closure.Equivalence.Properties
- A formalisation of rewriting theory/transition systems.
Relation.Binary.Rewriting
- Utilities for formatting and printing strings.
Text.Format Text.Printf
Relocated modules
The following modules have been moved as part of a drive to improve usability and consistency across the library. The old modules still exist and therefore all existing code should still work, however they have been deprecated and, although not anticipated any time soon, they may eventually be removed in some future release of the library. After the next release of Agda automated warnings will be attached to these modules to discourage their use.
-
The induction machinery for
Nat
was commonly held to be one of the hardest modules to find in the library. Therefore the moduleInduction.Nat
has been split into two new modules:Data.Nat.Induction
andData.Fin.Induction
. This should improve findability and better matches the design of the rest of the library. The new modules also publicly re-exportAcc
andacc
, meaning that users no longer need to importData.Induction.WellFounded
as well. -
The module
Record
has been moved toData.Record
. -
The module
Universe
has been split intoData.Universe
andData.Universe.Indexed
. In the latterIndexed-universe
has been renamed toIndexedUniverse
to better follow the library conventions. -
The
Data.Product.N-ary
modules and their content have been moved toData.Vec.Recursive
to make place for properly heterogeneous n-ary products inData.Product.Nary
. -
The modules
Data.List.Relation.Binary.Permutation.Inductive(.Properties)
have been renamedData.List.Relation.Binary.Permutation.Propositional(.Properties)
to match the rest of the library.
Deprecated names
The following deprecations have occurred as part of a drive to improve consistency across the library. The deprecated names still exist and therefore all existing code should still work, however use of the new names is encouraged. Although not anticipated any time soon, they may eventually be removed in some future release of the library. Automated warnings are attached to all deprecated names to discourage their use.
- In
Algebra.Properties.BooleanAlgebra
:¬⊥=⊤ ↦ ⊥≉⊤ ¬⊤=⊥ ↦ ⊤≉⊥ ⊕-¬-distribˡ ↦ ¬-distribˡ-⊕ ⊕-¬-distribʳ ↦ ¬-distribʳ-⊕ isCommutativeRing ↦ ⊕-∧-isCommutativeRing commutativeRing ↦ ⊕-∧-commutativeRing
- In
Algebra.Properties.DistributiveLattice
:∨-∧-distribˡ ↦ ∨-distribˡ-∧ ∨-∧-distrib ↦ ∨-distrib-∧ ∧-∨-distribˡ ↦ ∧-distribˡ-∨ ∧-∨-distribʳ ↦ ∧-distribʳ-∨ ∧-∨-distrib ↦ ∧-distrib-∨
- In
Algebra.Properties.Group
:left-identity-unique ↦ identityˡ-unique right-identity-unique ↦ identityʳ-unique left-inverse-unique ↦ inverseˡ-unique right-inverse-unique ↦ inverseʳ-unique
- In
Algebra.Properties.Lattice
:∧-idempotent ↦ ∧-idem ∨-idempotent ↦ ∨-idem isOrderTheoreticLattice ↦ ∨-∧-isOrderTheoreticLattice orderTheoreticLattice ↦ ∨-∧-orderTheoreticLattice
- In
Algebra.Properties.Ring
:-‿*-distribˡ ↦ -‿distribˡ-* -‿*-distribʳ ↦ -‿distribʳ-*
NOTE: the direction of the equality is flipped for the new names and so you will need to replace
-‿*-distribˡ ...
withsym (-‿distribˡ-* ...)
. - In
Algebra.Properties.Semilattice
:isOrderTheoreticMeetSemilattice ↦ ∧-isOrderTheoreticMeetSemilattice isOrderTheoreticJoinSemilattice ↦ ∧-isOrderTheoreticJoinSemilattice orderTheoreticMeetSemilattice ↦ ∧-orderTheoreticMeetSemilattice orderTheoreticJoinSemilattice ↦ ∧-orderTheoreticJoinSemilattice
- In
Relation.Binary.Core
:Conn ↦ Connex
- In
Codata.Stream.Properties
:repeat-ap-identity ↦ ap-repeatˡ ap-repeat-identity ↦ ap-repeatʳ ap-repeat-commute ↦ ap-repeat map-repeat-commute ↦ map-repeat
- In
Data.Bool
(with the new name inData.Bool.Properties
):decSetoid ↦ ≡-decSetoid
-
In
Data.Fin.Properties
the operator_+′_
has been deprecated entirely as it was difficult to use, had unpredictable reduction behaviour and was very rarely used. - In
Data.Nat.Divisibility
:poset ↦ ∣-poset *-cong ↦ *-monoʳ-∣ /-cong ↦ *-cancelˡ-∣
- In
Data.Nat.DivMod
:a≡a%n+[a/n]*n ↦ m≡m%n+[m/n]*n a%1≡0 ↦ n%1≡0 a%n%n≡a%n ↦ m%n%n≡m%n [a+n]%n≡a%n ↦ [m+n]%n≡m%n [a+kn]%n≡a%n ↦ [m+kn]%n≡m%n kn%n≡0 ↦ m*n%n≡0 a%n<n ↦ m%n<n
- In
Data.Nat.Properties
:m≢0⇒suc[pred[m]]≡m ↦ suc[pred[n]]≡n i+1+j≢i ↦ m+1+n≢m i+j≡0⇒i≡0 ↦ m+n≡0⇒m≡0 i+j≡0⇒j≡0 ↦ m+n≡0⇒n≡0 i+1+j≰i ↦ m+1+n≰m i*j≡0⇒i≡0∨j≡0 ↦ m*n≡0⇒m≡0∨n≡0 i*j≡1⇒i≡1 ↦ m*n≡1⇒m≡1 i*j≡1⇒j≡1 ↦ m*n≡1⇒n≡1 i^j≡0⇒i≡0 ↦ m^n≡0⇒m≡0 i^j≡1⇒j≡0∨i≡1 ↦ m^n≡1⇒n≡0∨m≡1 [i+j]∸[i+k]≡j∸k ↦ [m+n]∸[m+o]≡n∸o n≡m⇒∣n-m∣≡0 ↦ m≡n⇒∣m-n∣≡0 ∣n-m∣≡0⇒n≡m ↦ ∣m-n∣≡0⇒m≡n ∣n-m∣≡n∸m⇒m≤n ↦ ∣m-n∣≡m∸n⇒n≤m ∣n-n+m∣≡m ↦ ∣m-m+n∣≡n ∣n+m-n+o∣≡∣m-o| ↦ ∣m+n-m+o∣≡∣n-o| n∸m≤∣n-m∣ ↦ m∸n≤∣m-n∣ ∣n-m∣≤n⊔m ↦ ∣m-n∣≤m⊔n n≤m+n ↦ m≤n+m n≤m+n∸m ↦ m≤n+m∸n ∣n-m∣≡[n∸m]∨[m∸n] ↦ ∣m-n∣≡[m∸n]∨[n∸m]
Note that in the case of the last three proofs, the order of the arguments will need to be swapped.
- In
Data.Unit
(with the new names inData.Unit.Properties
):setoid ↦ ≡-setoid decSetoid ↦ ≡-decSetoid total ↦ ≤-total poset ↦ ≤-poset decTotalOrder ↦ ≤-decTotalOrder
-
In
Data.Unit
the proofpreorder
has also been deprecated, but as it erroneously proved that_≡_
rather than_≤_
is a preorder with respect to_≡_
it does not have a new name inData.Unit.Properties
. -
In
Foreign.Haskell
the termsUnit
andunit
have been deprecated in favour of⊤
andtt
fromData.Unit
, as it turns out that the latter have been automatically mapped to the Haskell equivalent for quite some time. - In
Reflection
:returnTC ↦ return
- Renamed functions in
Data.Char.Base
:fromNat ↦ fromℕ toNat ↦ toℕ
- In
Data.(Char/String).Properties
:setoid ↦ ≡-setoid decSetoid ↦ ≡-decSetoid strictTotalOrder ↦ <-strictTotalOrder-≈ toNat-injective ↦ toℕ-injective
- In
Data.Vec.Properties
:lookup-++-inject+ ↦ lookup-++ˡ lookup-++-+′ ↦ lookup-++ʳ
- In
Data.Product.Relation.Binary.Pointwise.NonDependent
(with the new name inData.Product.Properties
).:≡?×≡?⇒≡? ↦ ≡-dec
Other minor additions
- Added new proofs in Data.Fin.Substitution.Lemmas:
weaken-↑ : weaken t / (ρ ↑) ≡ weaken (t / ρ) weaken-∷ : weaken t₁ / (t₂ ∷ ρ) ≡ t₁ / ρ weaken-sub : weaken t₁ / sub t₂ ≡ t₁ wk-⊙-∷ : wk ⊙ (t ∷ ρ) ≡ ρ
- Added new record to
Algebra
:SelectiveMagma c ℓ : Set (suc (c ⊔ ℓ))
- Added new record to
Algebra.Structure
:IsSelectiveMagma (∙ : Op₂ A) : Set (a ⊔ ℓ)
- Added new proof to
Algebra.Properties.AbelianGroup
:xyx⁻¹≈y : x ∙ y ∙ x ⁻¹ ≈ y
- Added new proofs to
Algebra.Properties.Group
:ε⁻¹≈ε : ε ⁻¹ ≈ ε ∙-cancelˡ : LeftCancellative _∙_ ∙-cancelʳ : RightCancellative _∙_ ∙-cancel : Cancellative _∙_
- Added new proofs to
Algebra.Properties.Lattice
:∧-isMagma : IsMagma _∧_ ∧-isSemigroup : IsSemigroup _∧_ ∧-isBand : IsBand _∧_ ∨-isMagma : IsMagma _∨_ ∨-isSemigroup : IsSemigroup _∨_ ∨-isBand : IsBand _∨_
- Added new proofs to
Codata.Stream.Properties
:splitAt-repeat-identity : splitAt n (repeat a) ≡ (Vec.replicate a , repeat a) replicate-repeat : i ⊢ List.replicate n a ++ repeat a ≈ repeat a cycle-replicate : i ⊢ cycle (List⁺.replicate n n≢0 a) ≈ repeat a map-cycle : i ⊢ map f (cycle as) ≈ cycle (List⁺.map f as) map-⁺++ : i ⊢ map f (as ⁺++ xs) ≈ List⁺.map f as ⁺++ Thunk.map (map f) xs map-++ : i ⊢ map f (as ++ xs) ≈ List.map f as ++ map f xs
- Added new function to
Data.AVL.Indexed
:toList : Tree V l u h → List (K& V)
- Added new relations to
Data.Bool
:_≤_ : Rel Bool 0ℓ _<_ : Rel Bool 0ℓ
- Added new proofs to
Data.Bool.Properties
:≡-setoid : Setoid 0ℓ 0ℓ ≤-reflexive : _≡_ ⇒ _≤_ ≤-refl : Reflexive _≤_ ≤-antisym : Antisymmetric _≡_ _≤_ ≤-trans : Transitive _≤_ ≤-total : Total _≤_ _≤?_  : Decidable _<_ <-resp₂-≡ : _<_ Respects₂ _≡_ <-irrelevant : B.Irrelevant _<_ <-isStrictPartialOrder : IsStrictPartialOrder _≡_ _<_ <-isStrictTotalOrder : IsStrictTotalOrder _≡_ _<_ <-strictPartialOrder : StrictPartialOrder 0ℓ 0ℓ 0ℓ <-strictTotalOrder : StrictTotalOrder 0ℓ 0ℓ 0ℓ
- Added new definitions to
Data.Char.Base
:_≈_ : Rel Char 0ℓ _<_ : Rel Char 0ℓ
- Added new properties to
Data.Char.Properties
:≈⇒≡ : _≈_ ⇒ _≡_ ≈-reflexive : _≡_ ⇒ _≈_ ≈-refl : Reflexive _≈_ ≈-sym : Symmetric _≈_ ≈-trans : Transitive _≈_ ≈-subst : Substitutive _≈_ ℓ _≈?_ : Decidable _≈_ ≈-isEquivalence : IsEquivalence _≈_ ≈-setoid : Setoid _ _ ≈-isDecEquivalence : IsDecEquivalence _≈_ ≈-decSetoid : DecSetoid _ _ _<?_ : Decidable _<_
- Added new function to
Data.Digit
:toNatDigits : (base : ℕ) {base≤16 : True (1 ≤? base)} → ℕ → List ℕ
- Added new patterns to
Data.Fin.Base
:pattern 0F = zero pattern 1F = suc 0F pattern 2F = suc 1F pattern 3F = suc 2F pattern 4F = suc 3F pattern 5F = suc 4F pattern 6F = suc 5F pattern 7F = suc 6F pattern 8F = suc 7F pattern 9F = suc 8F
- Added new proof to
Data.Fin.Properties
:inject≤-idempotent : inject≤ (inject≤ i m≤n) n≤k ≡ inject≤ i m≤k
- Added new pattern synonyms to
Data.Integer
:pattern +0 = + 0 pattern +[1+_] n = + (suc n)
- Added new proofs to
Data.Integer.Properties
:≡-setoid : Setoid 0ℓ 0ℓ ≤-totalOrder : TotalOrder 0ℓ 0ℓ 0ℓ _<?_ : Decidable _<_ +[1+-injective : +[1+ m ] ≡ +[1+ n ] → m ≡ n drop‿+<+ : + m < + n → m ℕ.< n drop‿-<- : -[1+ m ] < -[1+ n ] → n ℕ.< m -◃<+◃ : 0 < m → Sign.- ◃ m < Sign.+ ◃ n +◃≮- : Sign.+ ◃ m ≮ -[1+ n ] +◃-mono-< : m ℕ.< n → Sign.+ ◃ m < Sign.+ ◃ n +◃-cancel-< : Sign.+ ◃ m < Sign.+ ◃ n → m ℕ.< n neg◃-cancel-< : Sign.- ◃ m < Sign.- ◃ n → n ℕ.< m m⊖n≤m : m ⊖ n ≤ + m m⊖n<1+m : m ⊖ n < +[1+ m ] m⊖1+n<m : m ⊖ suc n < + m -[1+m]≤n⊖m+1 : -[1+ m ] ≤ n ⊖ suc m ⊖-monoʳ->-< : (p ⊖_) Preserves ℕ._>_ ⟶ _<_ ⊖-monoˡ-< : (_⊖ p) Preserves ℕ._<_ ⟶ _<_ *-distrib-+ : _*_ DistributesOver _+_ *-monoˡ-<-pos : (+[1+ n ] *_) Preserves _<_ ⟶ _<_ *-monoʳ-<-pos : (_* +[1+ n ]) Preserves _<_ ⟶ _<_ *-cancelˡ-<-non-neg : + m * n < + m * o → n < o *-cancelʳ-<-non-neg : m * + o < n * + o → m < n
- Added new proofs to
Data.List.Properties
:foldr-forcesᵇ : (P (f x y) → P x × P y) → P (foldr f e xs) → All P xs foldr-preservesᵇ : (P x → P y → P (f x y)) → P e → All P xs → P (foldr f e xs) foldr-preservesʳ : (P y → P (f x y)) → P e → P (foldr f e xs) foldr-preservesᵒ : (P x ⊎ P y → P (f x y)) → P e ⊎ Any P xs → P (foldr f e xs)
- Added a new proof in
Data.List.Relation.Binary.Permutation.Propositional.Properties
:shifts : xs ++ ys ++ zs ↭ ys ++ xs ++ zs
- Added new proofs to
Data.List.Relation.Binary.Pointwise
:++-cancelˡ : Pointwise _∼_ (xs ++ ys) (xs ++ zs) → Pointwise _∼_ ys zs ++-cancelʳ : Pointwise _∼_ (ys ++ xs) (zs ++ xs) → Pointwise _∼_ ys zs
- Added new proof to
Data.List.Relation.Binary.Sublist.Heterogeneous.Properties
:concat⁺ : Sublist (Sublist R) ass bss → Sublist R (concat ass) (concat bss)
- Added new proof to
Data.List.Membership.Setoid.Properties
:unique⇒irrelevant : Irrelevant _≈_ → Unique xs → Irrelevant (_∈ xs)
- Added new proofs to
Data.List.Relation.Binary.Sublist.Propositional.Properties
:All-resp-⊆ : (All P) Respects (flip _⊆_) Any-resp-⊆ : (Any P) Respects _⊆_
- Added new operations to
Data.List.Relation.Unary.All
:lookupAny : All P xs → (i : Any Q xs) → (P ∩ Q) (lookup i) lookupWith : ∀[ P ⇒ Q ⇒ R ] → All P xs → (i : Any Q xs) → R (lookup i) uncons : All P (x ∷ xs) → P x × All P xs reduce : (f : ∀ {x} → P x → B) → ∀ {xs} → All P xs → List B construct : (f : B → ∃ P) (xs : List B) → ∃ (All P) fromList : (xs : List (∃ P)) → All P (List.map proj₁ xs) toList : All P xs → List (∃ P) self : All (const A) xs
- Added new proofs to
Data.List.Relation.Unary.All.Properties
:All-swap : All (λ xs → All (xs ~_) ys) xss → All (λ y → All (_~ y) xss) ys applyDownFrom⁺₁ : (∀ {i} → i < n → P (f i)) → All P (applyDownFrom f n) applyDownFrom⁺₂ : (∀ i → P (f i)) → All P (applyDownFrom f n)
- Added new proofs to
Data.List.Relation.Unary.Any.Properties
:Any-Σ⁺ʳ : (∃ λ x → Any (_~ x) xs) → Any (∃ ∘ _~_) xs Any-Σ⁻ʳ : Any (∃ ∘ _~_) xs → ∃ λ x → Any (_~ x) xs gmap : P ⋐ Q ∘ f → Any P ⋐ Any Q ∘ map f
- Added new functions to
Data.Maybe.Base
:ap : Maybe (A → B) → Maybe A → Maybe B _>>=_ : Maybe A → (A → Maybe B) → Maybe B
- Added new proofs to
Data.Nat.Divisibility
:∣m∸n∣n⇒∣m : n ≤ m → i ∣ m ∸ n → i ∣ n → i ∣ m ∣n∣m%n⇒∣m : d ∣ n → d ∣ (m % n) → d ∣ m *-monoˡ-∣ : i ∣ j → i * k ∣ j * k %-presˡ-∣ : d ∣ m → d ∣ n → d ∣ (m % n) m/n∣m : n ∣ m → m / n ∣ m m*n∣o⇒m∣o/n : m * n ∣ o → m ∣ o / n m*n∣o⇒n∣o/m : m * n ∣ o → n ∣ o / m m∣n/o⇒m*o∣n : o ∣ n → m ∣ n / o → m * o ∣ n m∣n/o⇒o*m∣n : o ∣ n → m ∣ n / o → o * m ∣ n m/n∣o⇒m∣o*n : n ∣ m → m / n ∣ o → m ∣ o * n m∣n*o⇒m/n∣o : n ∣ m → m ∣ o * n → m / n ∣ o
- Added new operator and proofs to
Data.Nat.DivMod
:_/_ = _div_ m%n≤m : m % n ≤ m m≤n⇒m%n≡m : m ≤ n → m % n ≡ m %-remove-+ˡ : d ∣ m → (m + n) % d ≡ n % d %-remove-+ʳ : d ∣ n → (m + n) % d ≡ m % d %-pred-≡0 : suc m % n ≡ 0 → m % n ≡ n ∸ 1 m<[1+n%d]⇒m≤[n%d] : m < suc n % d → m ≤ n % d [1+m%d]≤1+n⇒[m%d]≤n : 0 < suc m % d → suc m % d ≤ suc n → m % d ≤ n 0/n≡0 : 0 / n ≡ 0 n/1≡n : n / 1 ≡ n n/n≡1 : n / n ≡ 1 m*n/n≡m : m * n / n ≡ m m/n*n≡m : n ∣ m → m / n * n ≡ m m*[n/m]≡n : m ∣ n → m * (n / m) ≡ n m/n*n≤m : m / n * n ≤ m m/n<m : m ≥ 1 → n ≥ 2 → m / n < m *-/-assoc : d ∣ n → (m * n) / d ≡ m * (n / d) +-distrib-/ : m % d + n % d < d → (m + n) / d ≡ m / d + n / d +-distrib-/-∣ˡ : d ∣ m → (m + n) / d ≡ m / d + n / d +-distrib-/-∣ʳ : d ∣ n → (m + n) / d ≡ m / d + n / d
Additionally the
{≢0 : False (divisor ℕ.≟ 0)}
argument to all the division and modulus functions has been marked irrelevant. One useful consequence of this is that the operations_%_
,_/_
etc. can now be used withcong
. - Added new proofs to
Data.Nat.GCD
:gcd[m,n]∣m : gcd m n ∣ m gcd[m,n]∣n : gcd m n ∣ n gcd-greatest : c ∣ m → c ∣ n → c ∣ gcd m n gcd[0,0]≡0 : gcd 0 0 ≡ 0 gcd[m,n]≢0 : m ≢ 0 ⊎ n ≢ 0 → gcd m n ≢ 0 gcd-comm : gcd m n ≡ gcd n m gcd-universality : (∀ {d} → d ∣ m × d ∣ n → d ∣ g) → (∀ {d} → d ∣ g → d ∣ m × d ∣ n) → g ≡ gcd m n gcd[cm,cn]/c≡gcd[m,n] : gcd (c * m) (c * n) / c ≡ gcd m n c*gcd[m,n]≡gcd[cm,cn] : c * gcd m n ≡ gcd (c * m) (c * n)
- Added new proofs to
Data.Nat.LCM
:m∣lcm[m,n] : m ∣ lcm m n n∣lcm[m,n] : n ∣ lcm m n lcm-least : m ∣ c → n ∣ c → lcm m n ∣ c lcm[0,n]≡0 : lcm 0 n ≡ 0 lcm[n,0]≡0 : lcm n 0 ≡ 0 lcm-comm : lcm m n ≡ lcm n m gcd*lcm : gcd m n * lcm m n ≡ m * n
- Added new proofs to
Data.Nat.Properties
:≤-<-connex : Connex _≤_ _<_ ≥->-connex : Connex _≥_ _>_ <-≤-connex : Connex _<_ _≤_ >-≥-connex : Connex _>_ _≥_ 1+n≢0 : suc n ≢ 0 <ᵇ⇒< : T (m <ᵇ n) → m < n <⇒<ᵇ : m < n → T (m <ᵇ n) n≢0⇒n>0 : n ≢ 0 → n > 0 m≤m*n : 0 < n → m ≤ m * n m<m*n : 0 < m → 1 < n → m < m * n m∸n≢0⇒n<m : m ∸ n ≢ 0 → n < m *-cancelʳ-< : RightCancellative _<_ _*_ *-cancelˡ-< : LeftCancellative _<_ _*_ *-cancel-< : Cancellative _<_ _*_ ⊔-least : m ≤ o → n ≤ o → m ⊔ n ≤ o ⊓-greatest : m ≥ o → n ≥ o → m ⊓ n ≥ o
- Added new function to
Data.Product
:zip′ : (A → B → C) → (D → E → F) → A × D → B × E → C × F
- Added new proofs to
Data.Product.Properties
:,-injectiveʳ : (a , b) ≡ (c , d) → b ≡ d ,-injective : (a , b) ≡ (c , d) → a ≡ c × b ≡ d ≡-dec : Decidable {A} _≡_ → Decidable {B} _≡_ → Decidable {A × B} _≡_
- Added new relations to
Data.Rational.Base
:_<_ : Rel ℚ 0ℓ _≥_ : Rel ℚ 0ℓ _>_ : Rel ℚ 0ℓ _≰_ : Rel ℚ 0ℓ _≱_ : Rel ℚ 0ℓ _≮_ : Rel ℚ 0ℓ _≯_ : Rel ℚ 0ℓ
- Added new proofs and modules to
Data.Rational.Properties
:≡-setoid : Setoid 0ℓ 0ℓ ≡-decSetoid : DecSetoid 0ℓ 0ℓ drop-*<* : p < q → (↥ p ℤ.* ↧ q) ℤ.< (↥ q ℤ.* ↧ p) <⇒≤ : _<_ ⇒ _≤_ <-irrefl : Irreflexive _≡_ _<_ <-asym : Asymmetric _<_ <-≤-trans : Trans _<_ _≤_ _<_ ≤-<-trans : Trans _≤_ _<_ _<_ <-trans : Transitive _<_ _<?_ : Decidable _<_ <-cmp : Trichotomous _≡_ _<_ <-irrelevant : Irrelevant _<_ <-respʳ-≡ : _<_ Respectsʳ _≡_ <-respˡ-≡ : _<_ Respectsˡ _≡_ <-resp-≡ : _<_ Respects₂ _≡_ <-isStrictPartialOrder : IsStrictPartialOrder _≡_ _<_ <-isStrictTotalOrder : IsStrictTotalOrder _≡_ _<_ <-strictPartialOrder : StrictPartialOrder 0ℓ 0ℓ 0ℓ <-strictTotalOrder : StrictTotalOrder 0ℓ 0ℓ 0ℓ module ≤-Reasoning
- Added new proofs to
Data.Sign.Properties
:≡-setoid : Setoid 0ℓ 0ℓ ≡-decSetoid : DecSetoid 0ℓ 0ℓ
- Added new definitions and functions to
Data.String.Base
:_≈_ : Rel String 0ℓ _<_ : Rel String 0ℓ fromChar : Char → String
- Added new properties to
Data.String.Properties
:≈⇒≡ : _≈_ ⇒ _≡_ ≈-reflexive : _≡_ ⇒ _≈_ ≈-refl : Reflexive _≈_ ≈-sym : Symmetric _≈_ ≈-trans : Transitive _≈_ ≈-subst : Substitutive _≈_ ℓ _≈?_ : Decidable _≈_ ≈-isEquivalence : IsEquivalence _≈_ ≈-setoid : Setoid _ _ ≈-isDecEquivalence : IsDecEquivalence _≈_ ≈-decSetoid : DecSetoid _ _ _<?_ : Decidable _<_
- Added new functions to
Data.Vec.Base
:restrictWith : (A → B → C) → Vec A m → Vec B n → Vec C (m ⊓ n) restrict : Vec A m → Vec B n → Vec (A × B) (m ⊓ n)
- Added new functions to
Data.Vec
:filter : Decidable P → Vec A n → Vec≤ A n takeWhile : Decidable P → Vec A n → Vec≤ A n dropWhile : Decidable P → Vec A n → Vec≤ A n
-
The special term
Setω
is now exported byLevel
. - Added new types, functions and proofs to
Reflection
:Names = List Name Args A = List (Arg A) map-Arg : (A → B) → Arg A → Arg B map-Args : (A → B) → Args A → Args B map-Abs : (A → B) → Abs A → Abs B reduce : Term → TC Term declarePostulate : Arg Name → Type → TC ⊤ commitTC : TC ⊤ isMacro : Name → TC Bool withNormalisation : Bool → TC A → TC A _>>=_ : TC A → (A → TC B) → TC B _>>_ : TC A → TC B → TC B assocˡ : Associativity assocʳ : Associativity non-assoc : Associativity unrelated : Precedence related : Int → Precedence fixity : Associativity → Precedence → Fixity getFixity : Name → Fixity vArg ty = arg (arg-info visible relevant) ty hArg ty = arg (arg-info hidden relevant) ty iArg ty = arg (arg-info instance′ relevant) ty vLam s t = lam visible (abs s t) hLam s t = lam hidden (abs s t) iLam s t = lam instance′ (abs s t) Π[_∶_]_ s a ty = pi a (abs s ty) vΠ[_∶_]_ s a ty = Π[ s ∶ (vArg a) ] ty hΠ[_∶_]_ s a ty = Π[ s ∶ (hArg a) ] ty iΠ[_∶_]_ s a ty = Π[ s ∶ (iArg a) ] ty
- Added new definition to
Setoid
inRelation.Binary
:x ≉ y = ¬ (x ≈ y)
- Added new definitions in
Relation.Binary.Core
:Universal _∼_ = ∀ x y → x ∼ y Recomputable _~_ = ∀ {x y} → .(x ~ y) → x ~ y
- Added new proof to
Relation.Binary.Consequences
:dec⟶recomputable : Decidable R → Recomputable R flip-Connex : Connex P Q → Connex Q P
- Added new proofs to
Relation.Binary.Construct.Add.(Infimum/Supremum/Extrema).NonStrict
:≤±-reflexive-≡ : (_≡_ ⇒ _≤_) → (_≡_ ⇒ _≤±_) ≤±-antisym-≡ : Antisymmetric _≡_ _≤_ → Antisymmetric _≡_ _≤±_ ≤±-isPreorder-≡ : IsPreorder _≡_ _≤_ → IsPreorder _≡_ _≤±_ ≤±-isPartialOrder-≡ : IsPartialOrder _≡_ _≤_ → IsPartialOrder _≡_ _≤±_ ≤±-isDecPartialOrder-≡ : IsDecPartialOrder _≡_ _≤_ → IsDecPartialOrder _≡_ _≤±_ ≤±-isTotalOrder-≡ : IsTotalOrder _≡_ _≤_ → IsTotalOrder _≡_ _≤±_ ≤±-isDecTotalOrder-≡ : IsDecTotalOrder _≡_ _≤_ → IsDecTotalOrder _≡_ _≤±_
- Added new proofs to
Relation.Binary.Construct.Add.(Infimum/Supremum/Extrema).Strict
:<±-respˡ-≡ : _<±_ Respectsˡ _≡_ <±-respʳ-≡ : _<±_ Respectsʳ _≡_ <±-resp-≡ : _<±_ Respects₂ _≡_ <±-cmp-≡ : Trichotomous _≡_ _<_ → Trichotomous _≡_ _<±_ <±-irrefl-≡ : Irreflexive _≡_ _<_ → Irreflexive _≡_ _<±_ <±-isStrictPartialOrder-≡ : IsStrictPartialOrder _≡_ _<_ → IsStrictPartialOrder _≡_ _<±_ <±-isDecStrictPartialOrder-≡ : IsDecStrictPartialOrder _≡_ _<_ → IsDecStrictPartialOrder _≡_ _<±_ <±-isStrictTotalOrder-≡ : IsStrictTotalOrder _≡_ _<_ → IsStrictTotalOrder _≡_ _<±_
-
In
Relation.Binary.HeterogeneousEquality
the relation_≅_
has been generalised so that the types of the two equal elements need not be at the same universe level. - Added new proof to
Relation.Binary.PropositionalEquality.Core
:≢-sym : Symmetric _≢_
- Added new proofs to
Relation.Nullary.Construct.Add.Point
:≡-dec : Decidable {A = A} _≡_ → Decidable {A = Pointed A} _≡_ []-injective : [ x ] ≡ [ y ] → x ≡ y
- Added new type and syntax to
Relation.Unary
:Recomputable P = ∀ {x} → .(P x) → P x syntax Satisfiable P = ∃⟨ P ⟩
- Added new proof to
Relation.Unary.Consequences
:dec⟶recomputable : Decidable R → Recomputable R
- Added new aliases for
IdempotentCommutativeMonoid
inAlgebra
:BoundedLattice = IdempotentCommutativeMonoid IsBoundedLattice = IsIdempotentCommutativeMonoid
- Added new functions to
Function
:_$- : ((x : A) → B x) → ({x : A} → B x) λ- : ({x : A} → B x) → ((x : A) → B x)
- Added new definition and proof to
Axiom.Extensionality.Propositional
:ExtensionalityImplicit = (∀ {x} → f {x} ≡ g {x}) → (λ {x} → f {x}) ≡ (λ {x} → g {x}) implicit-extensionality : Extensionality a b → ExtensionalityImplicit a b
- Added new definition in
Relation.Nullary
:Irrelevant P = ∀ (p₁ p₂ : P) → p₁ ≡ p₂
- Added new proofs to
Relation.Nullary.Decidable.Core
:dec-yes : (p? : Dec P) → P → ∃ λ p′ → p? ≡ yes p′ dec-no : (p? : Dec P) → ¬ P → ∃ λ ¬p′ → p? ≡ no ¬p′ dec-yes-irr : (p? : Dec P) → Irrelevant P → (p : P) → p? ≡ yes p


BetAndRuin
Purchase points
Payments
Cash out
Payment history
Id
Payment type
Amount in euros
Date
223
Take money out
-50
14-03-2019 23:14
221
Buy points
+50
12-03-2019 12:23


Utilities available in Bootstrap 4 with Arandom xiv
hola
hola
hola
hola
End of elements
This is a text
This is a text
This is a text
print("Hola mundo")
if(hola == "mundo") print("Hola mundo")
Crt + D
add bookmark


{% extends "starboardscanner_app/base.html" %} {% block starboardscanner_dashboard %}
{{ field.help_text|safe }}


Philippine COVID-19 Cases
Jan 30, 2020 - Present
This is a choropleth map that
shows the relative COVID-19 cases between municipalities and cities of the Philippines. The cases are
normalized with the population of each local government unit. This provides an objective
comparison of cases across boundaries, taking into account relative population densities.
This map aims
to make patterns visible and provide insights on the spread of the disease and the effects of the community and
government efforts. This only
provides a "big
picture" and does not have any interpretation of the data. This is left to you, the viewer.
All the data is free and comes from the public domain. The accuracy of the data will be done on
best-effort policy. I will not be held liable for any damages that result in the usage of this map. All data is
entered manually and that means this map
may
not be always up
to
date.


FileDrop is made to be dead simple to use. At minimum all you need to do is select the element you want to be able to drop files onto, and then provide a function to loop over the array of returned files.
$('html').fileDrop(function(fileCollection){ $.each(fileCollection, function(){ console.log(this); }); });
The file contents will be displayed over here
You may either pass in a function to loop over the collection of file (as in the example above) or you may pass in an option object if you need to be more specific. All the possible options are below.
| Name | Type | Default Value | Description |
|---|---|---|---|
onFileRead |
function |
null |
This option is required! You must provide a function to process the collection of file object that will be returned as the only argument. This function can optionally be the only argument passed if you do not need to specify any other options. |
overClass |
string |
'state-over' |
When files are dragged over the browser window, this is the CSS class that will be applied to the selected element or the element specified with the addClassTo option. |
addClassTo |
jQuery selector string or object | null |
This is the element that will have the CSS class set with the overClass option applied to it. By default whatever you select with jQuery to will also have addClassTo applied to it. Of course, you can specify a different element with this option if needed. |
removeDataUriScheme |
boolean |
true |
When JavaScript reads the file data, it comes back as base64 encoded data which begins with something like 'data:text/plain;base64,' . When this option is enabled, this will be removed from the base64 string so that the pure base64 data can be processed or sent to a server. It is recommended to keep this option enabled unless you need to work with dropped images in JavaScript. |
decodebase64 |
boolean |
false |
When JavaScript reads the file data, it comes back as base64 encoded data. Enabling this option will decode the base64 data into the raw file contents. This is useful for pure JavaScript applications where you might want to parse file contents directly in the browser. It is not recommended to use this option if you plan on sending the file contents to a server via AJAX. |
$('#myElement').fileDrop({ onFileRead : function(fileCollection){ $.each(fileCollection, function(){ //Do stuff with fileCollection here! }); }, overClass : 'my-custom-class', addClassTo : '#anotherElement', decodebase64 : true });
When implementing the onFileRead
function, it needs to loop over the array of files that have been dropped onto the browser window. Each of the returned File Objects will have several properties on them.
| Name | Type | Description |
|---|---|---|
data |
string |
This is the actual data of the file. Depending on the options you set, this will be either a base64 encoded string, or the raw file contents. |
lastModified |
Date object |
The date that the file was last modified on. |
name |
string |
The file name. |
size |
integer |
The size of the file, in bytes. |
type |
string |
The MIME type of the file. |
{ data: "/9j/4AAQSkCAgLCg … KKACiooooA//Z" lastModified: Tue Jul 30 2013 21:29:54 GMT-0500 (CDT) name: "fileName.jpg" size: 74196 type: "image/jpeg" }
{ data: "Hello World!" lastModified: Sat Aug 17 2013 15:04:20 GMT-0500 (CDT) name: "hello.txt" size: 12 type: "text/plain" }
| Name | Accepts | Returns | Description |
|---|---|---|---|
$.removeUriScheme('...') |
string |
string |
This will remove the data URI scheme from the beginning on the base64 string. Data URI schemes look like "data:text/plain;base64," |
window.atob('...') |
base64 string |
string |
This will decode a base64 encoded string. This is built into most browsers, but this plugin also enables this feature on browsers that do not support it natively. |
$.support.fileDrop |
N/A | boolean |
Tells you if the browser natively supports file drag-n-drop. This does not give support to the browser, it only detects support. |
If you need the flexibility of deciding when to base64 decode the file data, don't worry!
Let's say you have both the removeDataUriScheme
and decodebase64
options set to false
, and then you have a file dropped onto the page and it's data reads "data:text/plain;base64,SGVsbG8gV29ybGQh"
.
You can pass that string into the public method $.removeUriScheme('...');
and it will turn the above data string into "SGVsbG8gV29ybGQh"
which is now just pure base64 encoded data. If you need to actually decode the base64 data manually, just pass it into window.atob('...');
. This is native to most browsers, but this plugin will enable it for older browsers as well. After decoding you are left with the raw file contents, which in this case is Hello World!
Not all browsers support file drag-n-drop, and this plugin does not magically give drag-n-drop support to browsers. BUT at least there's an easy way to test for this.
When you include this plugin on your page, just call $.support.fileDrop
to find out if the browser supports file drag-n-drop or not. If so you can use this plugin, if not you will need to give your users other instructions.
if($.support.fileDrop){ $('html').fileDrop(function(fileCollection){ $.each(fileCollection, function(){ console.log(this); }); }); }else{ alert('Your browser does not support file drag-n-drop :('); }


Young Americans can’t afford to donate to campaigns and don’t vote... Why would Congress listen to us?
Since the Supreme Court’s decision in Citizens United v. Federal Elections Commission (2010) prohibited restriction on independent expenditure groups fundraising and spending, Super PACs have dominated the political climate. Millennial PAC provides a voice for millennials, by millennials. Young voters, young non-voters, and those too young to vote all need a voice in the world of independent expenditures. We run comprehensive political programs to represent the age demographic without representation in Congress.
Outside Spending by Cycle, Excluding Party Committees
Employment
Most unpaid internships do not comply with federal standards. They must be regulated according to the threshold outlined in the Fair Labor Standards Act so we do not perpetuate normalized free labor. Find out more.
Education
Student loans are now more of a financial burden for Americans than credit card debt. We need lower interest rates, more affordable tuition, and innovative scholarship programs so young Americans can start a life without insurmountable debt.
Safety
Millennial PAC supports the second amendment and common sense. Gun violence has surpassed car accidents as a leading cause of death for young Americans. Congress needs to change the law that prevents researching gun violence.
Get Out the Vote!
Our voice is good, our vote is better! Keep our elected officials accountable. Click here to register in your neck of the woods.


I have a file's location stored in a System::String. E.g.
String^ str = "C:\Test Folder\Test.rtf";
Note, this pathname is actually stored in a text file. I have the code sorted for calling this information and storing it in a string.
I have a richTextBox1 that needs to display the contents of Test.rtf. However, I cannot use richTextBox1->LoadFile(str) because of the slashes being seen as \ not \\.
Is there a quick an easy way to convert this string or to find and replace \ with \\ for the LoadFile() to work?
\\ is just the way you express the \ character in C/C++. If you specify \, that means expect some special code. For example, \t is tab, \r is carriage return, \n is line feed and \\ is \.
If you read a file that has the string: C:\Temp\names.txt, you can pass that to a file method directly.
nor does this: richTextBox1->LoadFile("C:\Test Folder\Test.rtf");
Remember, str is actually a line of text from a text file that stores the pathname.
The error message I get is:
An unhandled exception of type 'System.IO.FileNotFoundException' occurred in mscorlib.dll
Additional information: Could not find file 'C:\Test Folder\Test.rtf'.
If you are writing a string literal, '\\' represents a backslash. I don't see why you need to do this programmatically, though. Just use the search & replace function of whatever you favorite editor is to make those changes to the source.
String^ str = "C:\Test Folder\Test.rtf";
std::size_t found = str.find_first_of("\\");
while (found!=std::string::npos)
{
str[found] = '\\\\';
found = str.find_first_of("\\", found + 1);
}
richTextBox1->LoadFile(str);
This doesn't work. I may have the coding wrong from lines 2 to 7 but I'm pretty sure it's because the string is a System::String when I'm finding / replacing using a std::string method.... I'm unsure how to convert a System::String to a std::string (I know how to do it the other way around thought). I assume this could work if I convert from System to std?
Sorry if I haven't been clear. Essentially I'm trying to use a pathname that is stored within a text file which uses single backslashes. I know how to retrieve this and store it as a string (perhaps this approach isn't the right one). I see how the pathname needs to be a literal for the LoadFile() and I'm hoping I'm using the correct terminology here. But the line of text that I'm retrieving has single backslashes. I need to make this pathname so that it uses two.
Some background information that might assist.... I have two programs; one that writes info to a text file, the other reads from this text file. In the first program, there is a button used to ask the user to select a file. It opens a dialog box, the user selects the file (a rtf file in this case) and this pathname is then written to a particular line in the text file. The other program (the one that reads) has a richTextBox. When this program loads the richTextBox displays the rtf file.
If you are reading a line of text from a file, as kbw said, it will be fine if you just use it directly. The text file uses backslashes, therefore backslashes will be in the string that holds the data you read.
If you are using a string literal in code, you must escape the backslashes because string literals (not any string, nor string variable, just string literals) use backslashes for special purposes (escape characters).
I get this and this was initial thought but because it wasn't working I thought that there was some other issue. There must be something wrong my code somewhere. I'll investigate...
I am using ifstream to open the text file that has the pathname.
I had the code: richTextBox1->LoadFile(str);
placed before I closed the stream. Placing this line of code after I have closed the file made it work... Not sure if I understand why this is needed but it works. Thanks for your support and getting me to look at my coding again.


Our interactive investor page increases investor participation & sign-up by 80.2%.
Work with our team of experts to drive investors to your name.investorpitch.me page.
Get the conversation started. If no one is speaking to you, no one is listening either.
The most indepth share analysis tool in the market. Know exactly what's happening in your market!


PLANET SICK-BOY: http://www.sick-boy.com
The following is a conversation between PLANET SICK-BOY and former Israeli Prime Minister Golda Meir -
PSB - `Sholem aleichem' GM - `Aleichem sholem' PSB - `Thank you for coming. I understand that you have just seen the new film, A Price Above Rubies. GM - `I could plotz from the excitement. The last picture I saw was Up in Smoke and I needed that like a hole in the head' PSB - `So, did you enjoy it?' GM - `Did I enjoy it. Better you should ask another question' PSB - `Really? You didn't like it at all?' GM - (under her breath) `A real able momzer, this one is' PSB - `I'm sorry, what was that?' GM - `Bubeleh, it was just wonderful. I should live so long to see a better picture. Wait, I'm dead already' PSB - `Well, what didn't you like about it?' GM - `Again with the questions already' PSB - `Ok, let's just run through the basic story for the readers. Sonia (Renee Zellweger, Jerry Maguire) and Mendel (Glenn Fitzgerald, Flirting with Disaster), a young married couple with a new baby, move from Monsey to Boro Park. Much to the dismay of her friends and family, Sonia begins to stray from her simple life as a devoted housewife and sets out to experience the world on her own terms. Occasionally, she encounters and consoles in a bag lady, who Sonia thinks is the ghost of her deceased Grandmother' GM - (under her breath) `This plosher can really knock a teapot.' PSB - `Please speak into the microphone so we don't miss anything' GM - `Speak into what? Now he tells me' PSB - `So, were there certain parts of the story that you had a problem with?' GM - `That's no charley. Let's start with this director, a meshungener putz. A plague should seize him, may God prevent that' PSB - `But he also made the gritty urban drama Fresh with Tupac Shakur'
GM - `And if his bubbe had wheels, she would be a buggy. He is definitely not an M.O.T.' PSB - `What's an M.O.T.?' GM - `Member of Our Tribe. This nudnick don't know his toches from his elbow' PSB - `What about the characters?' GM - `Let's start with the shikse Sonia. She's too good for her husband all of a sudden and decides to shtup her way into a job' PSB - `You mean when Sender (Christopher Eccleston, Jude) offers her a job selling jewelry for him and he welcomes her aboard with a quick, unceremonious hump? GM - `Mnyeh, enough with that. What about her poor husband?' PSB - `Well, I guess that Sonia was turned off by Mendel's pre-futz praying and the unemotional way he made love to her. I guess you could say that he was unlucky in love' GM - ` Just like the old saying about mazel' PSB - `What's that?' GM - `When a man has mazel, even his rooster lays eggs' PSB - `I'm not sure how that fits into our discussion, butů' GM - (interrupting) `Feh! I'm telling you that Mendel has no eggs, excuse the expression' PSB - `Errr, so it turns out that Sonia is quite an expert in buying and selling jewelry and this skill allows her to meet Ramon (Allen Payne, New Jack City), a young artist who creates his own adornments' GM - `And right into his bed she hops, this yente luftmensch' PSB - `You don't seem to identify with the Sonia character very much at all' GM - `I was the Prime Minister of Israel, not a filthy good-for-bobkes.  Like a beet she should grow with her head in the ground' PSB - `And that is the basic moral of A Price Above Rubies. Thank you, Golda'
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


Arya Kshatriya Yuva Samithi (AKYS) is an Association of ARYA KSHATIRYA YOUTH who formed together for Welfare and Development of ARYA KSHATRIYA COMMUNITY! It’s a state wide common platform for ARYA KSHATRIYA/ ARE / AREVALLU to share their ideas and do service for the development of the community and society
To guide the youth regarding Education, Employment.
And to develop oneness among the community by conducting various events.


References
The following people,sites and sources have been instrumental in the crafting of this website:
http://www.freefavicon.com/ - TV favicon
http://www.colorpicker.com/ - Hex color codes
Enable-Javascript.com - Capture for users without Javascript
Browser-update.org - Script for detection of old browsers
jQuery - JavaScript library used for CSS3 transformations and event handling
http://simplephotoshop.com/ - Photoshop function research
Squidoo.com/3d-animated-gifs/ - Example gif image
https://www.youtube.com/watch?v=q6x69_6Gj1U - GD image doctor image manipulation
Wikipedia APNG article - Example animated png
Wikipedia Image compression article - JPG quality matrix
http://blog.lib.umn.edu/gray0239/architecture/the%20henge.bmp - Example bitmap image
http://qfxblog.files.wordpress.com/ - Nicolas Cage TIFF image
VectorMagic.com - Bitmap to Vector image
, University
http://www.w3.org/WAI/intro/wcag.php - W3 web Content Accessibility guidelines
Digital Multimedia (Nigel & Jenny Chapman,2009) - Chapter 3
Vid.ly - Video Accessibility
http://vozme.com/ - Voz Me Text to Speech
http://webanywhere.cs.washington.edu/beta/ - Web Anywhere Online Screen Reader
http://www.ctrlshift.net/project/markdowneditor/ - Markdown HTML syntax generator
Thanks to:
http://www.codecademy.com/ for helping be become a marginally less terrible coder
Accessibility:
All embedded images contain alternative text throughout these pages; to help users which may require a screen reader.
Also All video content is universal for users of devices which may or may not support flash video.
Has been tested to be browsable with only a keyboard.
Is fully compatible with screen readers and text to speech engines.
Unfortunately there is no workaround for lack of image support in certain browsers or CSS3 transformations hence why I have installed a warning system if you are using an out-of-date system.
All current versions of major browsers are supported


The emergence and growth of blogs in the late 1990s coincided with the advent of web publishing tools that facilitated the posting of content by non-technical users who did not have much experience with HTML or computer programming. Previously, a knowledge of such technologies as HTML and File Transfer Protocol had been required to publish content on the Web, and early Web users therefore tended to be hackers and computer enthusiasts. In the 2010s, the majority are interactive Web 2.0 websites, allowing visitors to leave online comments, and it is this interactivity that distinguishes them from other static websites.[2] In that sense, blogging can be seen as a form of social networking service. Indeed, bloggers not only produce content to post on their blogs but also often build social relations with their readers and other bloggers.[3] However, there are high-readership blogs which do not allow comments.


This particular combination is a first experience for me. I have a little previous experience with Yerba Mate but Ginkgo Biloba is the first time.
I swallowed the Ginkgo Biloba capsules and they took about an hour to kick in. I felt this clarity and like a state of interior purity. The mind was calm and focused. I could feel a warmth all over the skin as the circulation was stimulated towards the periferic regions and the brain.
After some time I took 3 cups of Mate tea with honey (about 1 liter of tea). Mate introduced a second sensation of well being, pleasure and exhilaration. Combined with the enhanced mental acuity of the Ginkgo pills they tend to be like a mild cannabis stoning, yet extremely pleasant and most of all, obtained with items from the shop in the corner of my street and very inexpensive.
Ginkgo enhances not only the mental clarity and power of concentration, but also the senses. More than any other sense, my sense of taste was almost as enhanced as when I eat while high on cannabis! Also the sense of hearing is superbly enhanced and my trance music seems 2-3 times better.
No bad effects so far, I am 10 hours into the experience and I have taken another dose already to prolong the sensations.
P.S. Also seems to be an excellent aphrodisiac.
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.


Functions
The following functions are available globally.
-
Appends a string object to a stream.
Declaration
Swift
public func += (lhs: ColorSetStream, rhs: String)
Parameters
lhs
The stream object.
rhs
The string object to append.
-
Appends a color object to a stream.
Declaration
Swift
public func += (lhs: ColorSetStream, rhs: NSColor)
Parameters
lhs
The stream object.
rhs
The color object to append.
-
Appends a
UInt8
value to a stream.Declaration
Swift
public func += (lhs: ColorSetStream, rhs: UInt8)
Parameters
lhs
The stream object.
rhs
The
UInt8
value to append. -
Appends a
UInt16
value to a stream.Declaration
Swift
public func += (lhs: ColorSetStream, rhs: UInt16)
Parameters
lhs
The stream object.
rhs
The
UInt16
value to append. -
Appends a
UInt32
value to a stream.Declaration
Swift
public func += (lhs: ColorSetStream, rhs: UInt32)
Parameters
lhs
The stream object.
rhs
The
UInt32
value to append. -
Appends a
UInt64
value to a stream.Declaration
Swift
public func += (lhs: ColorSetStream, rhs: UInt64)
Parameters
lhs
The stream object.
rhs
The
UInt64
value to append. -
Appends a float value to a stream.
Declaration
Swift
public func += (lhs: ColorSetStream, rhs: Float)
Parameters
lhs
The stream object.
rhs
The float value to append.
-
Appends a double value to a stream.
Declaration
Swift
public func += (lhs: ColorSetStream, rhs: Double)
Parameters
lhs
The stream object.
rhs
The double value to append.
-
Appends a boolean value to a stream.
Declaration
Swift
public func += (lhs: ColorSetStream, rhs: Bool)
Parameters
lhs
The stream object.
rhs
The boolean value to append.


--- layout: post authors: ["Naupaka Zimmerman"] title: "Teaching to the Workflow" date: 2015-09-15 time: "10:00:00" tags: ["Teaching"] ---
"Teaching to the test" has a deservedly bad reputation, but what about "teaching to the workflow"? A group of us came together at the NCEAS Open Science Codefest last year and put together a paper on open science in ecology. In it, we sketch three examples of possible open science workflows (Figure 2 in the paper). In response, I was asked what Software Carpentry should teach to prepare people for working in those ways. My top three things are (in order):
The idea that it's OK to be wrong in public. As long as people are honest about what they're trying to do and what they think what they've done means. And they try to make it right when they are wrong. And that everyone is wrong sometimes. And that a lot of people are willing to help fix honest mistakes or misunderstandings (see, e.g., Stack Overflow). And that this, it seems to me, is how science overall should (and sometimes does) work. We're all in this together. This is why I think it's so important for instructors to screw up when teaching and slowly talk through how they untangle themselves. No grad student or programmer starts out like Athena from the head of Zeus, fully formed and brilliant from the beginning. Because writing, documenting, and openly sharing scientific thinking and the code behind it—even with mistakes—is one of the best ways we have as scientists to be honest with ourselves and with others.
The idea of provenance. Not just in the formal sense but also in the broader sense, related to a whole ton of important ideas, including but not limited to: metadata, version control, code modularity, Don't Repeat Yourself, testing, open access, etc. Science is deeply and fundamentally about provenance of ideas and provenance of evidence. All scientists get this intuitively, but the ways to document this trail are changing and multiplying rapidly. Where is the idea from (articles, DOIs, open access)? What is the evidence for it (figures, tables, statistics)? How were the analyses done (code, version control, formal computational provenance)? Where did the data come from (metadata, data archiving, well-documented field or lab methods)? Software Carpentry has for a long time taught people how to structure and document code and make analyses reproducible, but I think a lot of people (myself included) also want and need to learn how to better structure, from start to finish, their project organizational schemes and filesystems (and their science!) with provenance in mind. Because the process of science is messy, it's not and will never be easy. But it seems to me that many of us want to know how to do it better.
The idea of structured data. This could be anything from how to use Excel responsibly, to munging/slicing/dicing in python/R, to designing bespoke SQLite databases, but the idea of it is crucial. This is very rarely taught in any formal setting and absolutely is the key enabling anything analytical that follows. Most people, in my experience, struggle through until they, by chance, hit upon the format that enables pivot tables/JMP/ggplot to work well. Structuring data well from the start leads to easier and less frustrating analyses, easier and less frustrating collaborations, and easier and less frustrating archiving. In the end, science and scientists win when data are well-structured. Format code for people and format data for machines.
What would you teach to prepare people to do the best science possible given the changing technological landscape?


--- layout: post status: publish published: true title: Podcast 3.10 - From Spring Training - 3/22/2011 author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 4386 wordpress_url: http://ivyenvy.com/?p=4386 date: '2011-03-22 20:26:21 +0000' date_gmt: '2011-03-23 01:26:21 +0000' categories: - The Cubs - Podcast - Spring Training tags: - Dodgers - Podcast - Spring Training - Chase Field - Camelback Ranch comments: [] ---
We took a tour of Chase Field and describe what the tour entails. The Cubs traveled to Camelback Ranch to play the Dodgers. We found it quite easy to be distracted by the absolutely gorgeous weather that the Valley of the Sun had today. Also, in discussing our experience at Camelback Ranch, we realize that we enjoy people watching and analyzing about as much as watching baseball. At the end of the episode, we tell you about an interview that we have coming up on tomorrow's episode.


I am a data scientist currently looking for opportunities. In 2019, I graduated from Thinkful data science program, a omprehensive bootcamp and mentorship centered around statistical analysis and machine learning algorithm theory and implementation. I enjoy problem solving with math and coding skills. I also enjoy communicating my findings to others.
The goal of this project is to predict the house price in the data set obtained from Kaggle competition. Three features elimination methods in combination with six machine learning algorithms have been used to perform the supervised learning analysis. The predicted results can be used by real estate companies to provide more accurate house price estimate to their customers.
Ten articles with similar topics from 10 different authors are obtained from Gutenberg Project. Bags of Word technique was used to extract features from the data set. Unsupervised learning and supervised learning approaches are used to classify the book author. The accurate classification can be utilized by online book reader provider for their customers to search for their favorite books.
The purpose of this project is to forecast energy consumption from a data set obtained from Kaggle. Traditional statistical and supervised learning approaches and Facebook Prophet have been used and compared. The accurate predicted results can be beneficial for power companies by either expand or downsize their power plants and eventually reduce their operating cost.


{% extends "base.html" %} {% block title %}
Medieval catalogues > SECULAR INSTITUTIONS: Secular Colleges > Ipswich > Inventory of church goods, 22 Feb. × 29 Oct. 1529
{% endif %}7 identified entries found.
All data was derived from the List of Identifications by Professor Richard Sharpe.
{% if not printing %}
A key to codes used in the List is available (opens in new tab).{% endif %}


|
|
void | loop () |
| | This is the real time thread that streams the data to/from the main board.
|
| |
| void | send_newest_command () |
| | Send the newest control stored in the time series. More...
|
| |
|
void | send_newest_controls () |
| | Send the newest control stored in the time series.
|
| |
|
| static THREAD_FUNCTION_RETURN_TYPE | loop (void *instance_pointer) |
| | Private methods. More...
|
| |
◆ SpiBus()
| blmc_drivers::SpiBus::SpiBus |
( |
std::shared_ptr< MasterBoardInterface > |
main_board_interface, |
|
|
const size_t & |
nb_udrivers, |
|
|
const size_t & |
history_length = 1000 |
|
) |
| |
Construct a new SpiBus object.
The constructor starts a real time thread: SpiBus::loop(). This thread streams the data back and forth collecting the sensor data and sends the control/commands.
- Parameters
-
| main_board_interface | is the object that communicate with the main board. The main board provides the hardware informations. |
| nb_udrivers | is the number udrivers plugged on the main board. |
| history_length | is the size of the buffer of messages stored. |
◆ ~SpiBus()
| blmc_drivers::SpiBus::~SpiBus |
( |
| ) |
|
Destroy the SpiBus object.
The destructor handles the proper shutdown of the class and the threads.
◆ get_command()
Get the commands to be send.
- Returns
- Ptr<const CommandTimeseries> is the list of the commands to be send. Inherited from MotorBoardInterface
◆ get_control()
input logs
input logs Get the controls to be send.
- Parameters
-
| index | define the kind of control we are looking for. |
- Returns
- Ptr<const ScalarTimeseries> is the list of the controls to be send. Inherited from MotorBoardInterface
◆ get_measurement()
Output and status.
Get the measurements from the main board.
- Parameters
-
| udriver_id | is the index of the spi port on the control board |
| index | |
- Returns
- std::shared_ptr<const MotorInterface::ScalarTimeseries>
◆ get_sent_command()
Get the sent commands.
- Returns
- Ptr<const CommandTimeseries> is the list of the commands sent recently. Inherited from MotorBoardInterface
◆ get_sent_control()
Get the sent controls.
- Parameters
-
| index | define the kind of control we are looking for. |
- Returns
- Ptr<const ScalarTimeseries> is the list of the controls sent recently. Inherited from MotorBoardInterface
◆ get_status()
Get the status of the motor board.
- Returns
- Ptr<const StatusTimeseries> is the list of the last status of the card. Inherited from MotorBoardInterface
◆ loop()
| static THREAD_FUNCTION_RETURN_TYPE blmc_drivers::SpiBus::loop |
( |
void * |
instance_pointer | ) |
|
|
inlinestaticprivate |
Private methods.
This is the helper function used for spawning the real time thread.
- Parameters
-
| instance_pointer | is the current object in this case. |
- Returns
- THREAD_FUNCTION_RETURN_TYPE depends on the current OS.
◆ send_if_input_changed()
| void blmc_drivers::SpiBus::send_if_input_changed |
( |
| ) |
|
|
virtual |
Actually send the commands and the controls.
Inherited from MotorBoardInterface. This particualr instance does not actually check if it is is a new command or control as the full status of the robot is exchange at every tick.
◆ send_newest_command()
| void blmc_drivers::SpiBus::send_newest_command |
( |
| ) |
|
|
private |
Send the newest control stored in the time series.
Some of the command are not implemented/will be implemented. A warning is issued upon miss-use.
◆ set_command()
| void blmc_drivers::SpiBus::set_command |
( |
const size_t |
udriver_id, |
|
|
const MotorBoardCommand & |
command |
|
) |
| |
|
virtual |
set_command save the command internally.
In order to actaully send the controls to the network please call "send_if_input_changed"
- Parameters
-
◆ set_control()
Setters.
Setters. set_control save the control internally. In order to actaully send the controls to the network please call "send_if_input_changed"
- Parameters
-
| control | is the value of the control. |
| index | define the kind of control we want to send. Inherited from MotorBoardInterface |
◆ control_
Inputs.
This is the buffer of the controls to be sent to card.
◆ is_loop_active_
| bool blmc_drivers::SpiBus::is_loop_active_ |
|
private |
Loop management.
This boolean makes sure that the loop is stopped upon destruction of this object.
◆ main_board_interface_
| std::shared_ptr<MasterBoardInterface> blmc_drivers::SpiBus::main_board_interface_ |
|
private |
◆ measurement_
Outputs.
All the measurements acquiered from the CAN board.
◆ motor_index_toggle_bits_
| std::array<bool, 12> blmc_drivers::SpiBus::motor_index_toggle_bits_ |
|
private |
Everytime a motor index is detected the corresponding bit change for the opposite value.
if (index detected on motor X)
{
}
◆ sent_control_
Log.
This is the history of the already sent controls.
The documentation for this class was generated from the following files:


listless: Convert Lists to Tidy Data Frames
A lightweight utility for converting lists to tidy data frames.
| Version: |
0.0-2 |
| Depends: |
R (≥ 3.0.0) |
| Imports: |
magrittr (≥ 1.5), tidyr (≥ 0.5.1) |
| Published: |
2016-08-12 |
| Author: |
Richard Cotton [cre, aut] |
| Maintainer: |
Richard Cotton <richierocks at gmail.com> |
| License: |
GPL-3 |
| NeedsCompilation: |
no |
| Materials: |
README |
| CRAN checks: |
listless results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=listless
to link to this page.


Create online animations quickly, easily and free!
Coming soon is an online application and community that allows
users to create and share their own animations in just seconds! Click here to go back to Wrapper Shop.
In the meantime, check out this awesome teaser trailer!


The body of both the public and private parts of a module is a sequence of top-level declarations. These declarations comprise


小知识备忘（不知道什么时候会整理）
标长(scale length): \(n(R) \sim exp(-R/h_{\rm R})\), \(h_{\rm R}\)为标长，即沿银盘方向向外移动\(h_{\rm R}\)，恒星密度下降e倍。
标高(scale height): 类似于标长，垂直于银盘方向，当恒星密度下降e倍时候的高度。薄盘指的是所有年轻大质量恒星所定义，而厚盘指的是其余恒星的定义。
银河系黑洞质量约为$4\times 10^{6}$M$_{\odot}$.
Galactic year (cosmic year): 太阳绕银心一周所需要的时间，\(\frac{2\pi \times 8.4\;kpc}{240\;\rm km/s} \sim 200 Myr\)。
Sonic scale taking B into account: \(\lambda_{\rm sonic} = L[\frac{c_{\rm s}}{\sigma_{\rm v,3D}}(1+\beta^{-1})]^{2} \) (Federrath2016)
主序恒星质量半径关系：\(R \sim R_{\odot}(\frac{M}{M_{\odot}})^{0.7}\), 主序恒星半径约为0.1--25R$_{\odot}$
主序恒星质量光度关系：\(L \sim L_{\odot}(\frac{M}{M_{\odot}})^{\alpha}\), 当$M\le M_{\odot}$时$\alpha \sim 5$, 当$M_{\odot}\le M\le 10M_{\odot}$时$\alpha \sim 3.9$, 当$M\gt 10M_{\odot}$时$\alpha \sim 2.2$.
黑体谱峰值位置： $\lambda_{\rm max}=[2.9/T(K)]$mm, 太阳6000K对应的是5000埃.
相对太阳的丰度： [A/B] = log$_{10}${$\frac{(N_{\rm A}/N_{\rm B})_{*}}{(N_{\rm A}/N_{\rm B})_{\odot}}$}, Z$_{\odot} \sim$0.02.
三角视差距离：以周年视差测距定义秒差距，即: 1"=$\frac{1AU}{1pc}$, 则在1kpc处1个角分的距离为60000AU或者是0.3 pc (1pc=206265AU).
Luminosity: \(L = 4 \pi D^{2} S\)
22 GHz water maser luminosity: \(L_{\rm H2O}/L_{\odot} = 2.3\times 10^{-8} [\frac{\int S_{\nu}dv}{\rm Jy\;km s^{-1}}][\frac{D}{\rm kpc}]^{2}\)
磁场： 尘埃消光：偏振平行磁场； 尘埃热辐射：偏振垂直于磁场。
啥是星际介质? 在太阳附近， 10 pc3内只有一颗恒星，而太阳直径仅仅10-7pc,所以大部分星际空间内是没有恒星的，但是它们充满了气体和尘埃，这就是我们所要研究的星际介质。
等强度线R25, B band, 25 mag,测量大小。
哈勃时间Hubble time, $t = 1/H_{0}$,约137亿年。
暗物质的可能来源是WIMP, 弱相互作用有质量的粒子，如，中微子等。
为什么早期宇宙中质子比反质子多一点？？？
宇宙微波背景辐射来着与正反质子湮灭产生的光子。
接收机系统
模数转换器即A/D转换器，或简称ADC，通常是指一个将模拟信号转变为数字信号的电子元件。模拟信号是一串连续分布的振幅，而数字信号是离散取值的分布，因而转换的时候是有压缩的。
NOEMA，4730欧元一小时。30米是1/3。From J.Z.Wang.
HEMT v.s. SiS接收机: HEMT就是低温低噪声放大器，直接把观测信号放大，然后再用低温或者常温的混频器，将观测信号下变频然后处理。HEMT因为自身有30dB的增益，所以链路后边噪声贡献很小，可以用常温混频器。优势是低温集成 不需要有超导混频器，不需要有本振功分器等，系统简单了很多。现在sis的噪声大概是HEMT的一半，这是唯一的优势。将来估计200GHz以内，HEMT都会主导。From Yuan Ren。
样条插值是使用一种名为样条的特殊分段多项式进行插值的形式。From Guangxing
CRRL and [CII] fine structure lines basically trace the same gas. The difference is mainly from the observed intensity. [CII] is much stronger. From K. M. Menten
For a new Macbook, in case of issues with gfortran ("ld: library not found for -lSystem"). Mac Xcode install and command line tools needed to be installed respectively.
What is the CO-dark gas?
Answer:: The mass of molecular gas in an interstellar cloud is often measured using line emission from low rotational levels of CO, which are sensitive to the CO mass, and then scaling to the assumed molecular hydrogen H2 mass. However, a significant H2 mass may lie outside the CO region, in the outer regions of the molecular cloud where the gas-phase carbon resides in C or C+. Here, H2 self-shields or is shielded by dust from UV photodissociation, whereas CO is photodissociated. This H2 gas is “dark” in molecular transitions because of the absence of CO and other trace molecules, and because H2 emits so weakly at temperatures 10 K < T < 100 K typical of this molecular component. This component has been indirectly observed through other tracers of mass such as gamma rays produced in cosmic-ray collisions with the gas and far-infrared/submillimeter wavelength dust continuum radiation.
巨星支在HR图中是垂直的，所以通过分光时差来测量距离的误差较大，最佳的情况下，绝对星等有0.5 m的误差，所以距离精度会达到25%。
RATRAN can be installed with CRETE github
radio recombination lines
The H109$\alpha$ line was first detected by P. Mezger in 1965, despite (incorrect) theoretical predictions that pressure broadening would smear out the lines in frequency and make them undetectable. It is true that atomic collisions in the interstellar medium significantly disturb the energy levels of large atoms, but this disturbance is about the same for adjacent energy levels, so the differential disturbance that alters the line frequency is actually much smaller. His advice: “Don’t abandon an observation just because you have been told that it will fail.”
The RRL has a Voigt profile with line width (Gordon & Sorochenko 2002):
$\Delta v_{\rm rrl} = 0.534\Delta v_{\rm pre} + (\Delta v_{\rm tur}^{2}+\Delta v_{\rm the}^{2}+0.217\Delta v_{\rm pre}^{2})^{1/2}$
where, "rrl", "pre", "tur", "the" represent the line width of radio recombination lines, pressure broadening, turbulence broadening, thermal broadening.
And the pressure broadening can be assessed with the formula of Brocklehurst & Seaton (1972):
$\Delta v_{\rm pre} = 4.287 (\frac{n}{100})^{7.4}(\frac{10^{4}}{T_{\rm e}})^{0.1}(\frac{n_{\rm e}}{10^{4}}) (km/s)$,
where n is the principle quantum number, Te is the electron temperature, and ne is the electron density.
Doppler tracking: velocity reference frames and the definition of different velocities used in radio astronomy.
天马65m
2012年10月26日 first light
接收机： 1-50 GHz， 8个波段
主动面板系统
虽然在L波段有RFI，但是OH可做，C波段完全没有问题。Chat with Yan Sun, 6 GHz 以下RFI非常严重，高频所受影响较小。
HI 第一次发现是通过frequency switch得到的，因为银道面附近有大量的HI发射，难以得到干净的off点，之前的position switch尝试并不好。
南极天文台
median PWV = 0.14 mm 南极， 1 mm Mauna Kea, 0.5 mm ALMA
For frequnecy switching of IRAM30m, the offsets of 7.14 MHz, 11.7 MHz, 14.28 MHz are the best values for E090, E150, and E230. from Pepe Cernicharo?
甘氨酸是最简单的氨基酸，所以是目前天体化学的圣杯，Glycine, NH3CH2COOH.
The system temperature of a telescope can be estimated with the equation,
$T_{\rm sys} = (T_{\rm r} + T_{\rm sky})/(exp(-\tau))$,
where $T_{\rm r}$ is the receiver temperature, $T_{\rm sky}$ is the sky temperature inside the atmosphere ($2.73*exp(-\tau)+T_{\rm a}*(1-exp(-\tau))$), $\tau$ is the opacity, and $T_{\rm a}$ is the atmosphere effective temperature.
SKYDIP (Tipping): measure the optical depth of atmosphere at zenith (Wilson, T. L., Tools of Radio Astronomy).
$T_{\rm abs}(z) = T_{\rm rx}+\eta T_{\rm atm}(1-e^{-\tau_{0} sec(z)})+T_{\rm amb}(1-\eta)$.
This can be converted to $V_{\rm abs}(z) = -V_{\rm atm} e^{-\tau_{0} sec(z)}+ (V_{\rm rx}+V_{\rm atm})$. With this equation and measurements of $V_{\rm abs}(z)$ and z at different zenith angles, we can fit $\tau_{0}$ and other constants.
A source can reach the highest EL: $EL=90-|\phi - \delta|$, where $\phi$ is the latitude and $\delta$ is the declination.
Calculating the size of fits files and data rates:
NXPIXEL x NYPIXEL x Channels x 4 bytes (data size)
Σ(Npol x basebands x Channels x 4 bytes)/tdump (data rate)
wiggle baselines: the distance between the primary and secondary focus is about 50m, leading to a standing wave with a period of 3e8/50/1e6 MHz in Effelsberg spectra.
The N2H+ ion is mainly formed through reactions between H3+ and N2. It is mainly destroyed by N2H+ + CO ---> HCO+ + N2.
The solid angle is 1.133$\theta^{2}$.
To upgrade packages of pip, pip install aplpy --upgrade.
To upgrade pip itself, pip install --upgrade pip.
In case that MAC OS lack python-dev, try "xcode-select --install".
down the whole directory, wget -c -r -np -k -L -p /the/directory/url/
for Synchrotron Emission which is highly linearly polarised, this emission is parallel to E, and thus perpendicular to B.
13C fractionation into CO at low temperatures due to the reaction:
13C+ + 12CO ---> 13CO + 12C+ erengy (35 K)
Notes on Imagemagick: create a gif movie
/usr/local/bin/convert -resize 50% -delay 5 -loop 0 *png try.gif
Main beam efficiencies change from compact sources to extended sources (increasing). Greve+1998
Notes on Linus command lines
replace a string in multiple files in Linux:
sed -i 's/foo/bar/g' *.txt
replace all "foo" in *.txt with "bar".
Merge pdf files
gs -q -dNOPAUSE -dBATCH -sDEVICE=pdfwrite -sOutputFile=merged.pdf *pdf
gs -sDEVICE=pdfwrite -sOutputFile="output.pdf" -dNOPAUSE -dEPSCrop -c "<> setpagedevice" -f *.eps -c quit
Using VNC:
vnc
vncserver -geometry 1360x850 -depth 16 :1
..password..
ssh -g -L 5902:ip1.ip2.ip3.ip4:5901 portal.mpifr-bonn.mpg.de -l ygong
..password..
command+K
vnc://localhost:5902
Planck data
Ionization potential and dissociation energy
H2CO -- 4.2e4 K (3.6eV).
Notes on Class projection none
If the projection is not defined, we can use the commands below
set variable position wirte
let R%HEAD%POS%PROJ 7
modify position 80.40 0.50
Notes on How to install RATRAN
1. download related files and tar the file
2. cd to the directory and ./configure
3. change "sky.make.lnx" with "MIRLISB = 'mirlibs' "
4. Install Miriad and configure Miriad
5. try with amc and sky.
Why can low-mass YSOs be used to derive parallax with VLBA?
Answer:: Low-mass young stars often generate non-thermal continuum emission produced by the interaction of free electrons with the intense magnetic fields that tend to exist near their surfaces (see the review, Feigelson & Montmerle 1999). This can make them very bright so that they can be detected by VLBI measurements.
Mass-loss rate of AGB stars
The formula to estimate the mass-loss rates using CO lines can be found in Ramstedt+2008, De Beck+2010, and the references therein.
Detection of CO in LMC AGB stars (Groenewegen+2016).
Ammonia
The formula to estimate the ammonia column density can be found in Harju+1993 and Mangum+1992
hot corinos: inside Class 0 low-mass stars, densities > 1e7 cm-3, temperature >100 K, and typical size of <150 AU (Ceccarelli, C.+2004).
spatial power spectra: L~1/lambda, the pixel resolution in the fft domain is determined by the maximum angular scale.
RFI: airborne radar from planes (4.1--4.3 GHz)
In case that the html created by the CASA pipeline does not work
1. firefox/chrome open the html file.
2. python3 -m http.server
3. localhost:8000 in the browser
uGMRT: 250-500 MHz
molecules: 3N-6 vibrational modes for a polyatomic molecule, and 3N-5 vibrational modes for a linear molecule
unsaturated and saturated masers (Colom+2018)
For single lines associated with an unsaturated maser, an increase in the flux density F is accompanied by
narrowing of the line : \(\Delta V \propto (ln F_{0})^{-1/2} \)
In the case of a saturated maser, \(\Delta V \propto F_{0}^{-1/2} \)
Here, F0 is the flux at the line center.
Four golden lessons by Steven Weinberg
1. No one knows everything, and you don't have to.
2. go for the messes.
3. forgive yourself for wasting time.
4. learn something about the history of science, or at a minimum the history of your own branch of science.
Tell students before they write paper
1. Do not copy, or it will affect your career.
2. Read your draft first, and then send it to your collaborators.
3. the minus line should be longer. e.g. -45 --> $-$45.
4. Only variables should be given in italic. Subscripts, superscripts, units, and constants should be given in Roman. e.g., $T_{ex}$ --> $T_{\rm ex}$.
Questions to be answered (collected from different talks and websites):
1. Formation of molecular clouds
2. Origin and statistical characteristics of ISM turbulence.
3. Star (cluster) formation in molecular clouds and at different scales.
4. Origin of stellar initial mass function.
a. where, when, and how do molecular clouds form?
b. what are molecular cloud properties?
c. how do stars form in their interior?
d. what determine the Kennicutt-Schmit (Gao-Solomon) relation?
e. What are the structure, dynamics, energy balance, and chemistry of the clouds?
f. What are the characterized scales of turbulence in the ISM？
g. Are there differences between low and high-mass star-forming clouds?
h. A census of star-forming cores.
i. the energy balance of gas heating and cooling.
j. the impact of sub-solar mentalities.
k. different phases of the ISM.
l. isotopic ratios (e.g., C/N/O/Si/S) to trace the chemical evolution of the Galaxy.
Observational notes for well-known sources
Orion KL, "hot core": J2000 RA=05:35:14.5, DEC=-05:22:30 (off: 900",0)
TMC-1 (CP): J2000 RA=04:41:42.5 , DEC = 25:41:2 (off: 720", 720")
IRC +10216: J2000 09:47:57.4 , DEC= 13:16:43.8 (off: 600", 0)
In case of Anaconda-gfortran crashed with gfortran-7, reconfigure Anaconda manually, put Anaconda--PATH in the last line
Zeeman effect
I should create an ADS library including published Zeeman measurements.
Here are some to be added,
Schwarz+1990, Killeen+1992, Plante+1995, Bourke+2001, Crutcher+1996, Crutcher+1996, Crutcher+1999, Crutcher+2012, Crutcher+2010, Crutcher+2000
6.7 GHz maser flare sources
M2O papers
G358.931-0.030
PAPERS
Monitoring
G24.33+0.14
PAPERS
info


--- layout: post title: Respect me and my freedom categories: - KDE - Software Libre tags: [] status: publish type: post published: true meta: _edit_last: '2' dsq_thread_id: '2226556179' author: login: afiestas email<EMAIL_ADDRESS>display_name: afiestas first_name: Àlex last_name: Fiestas ---
In my way to work I have been thinking in something that happened the other day, I was showing/explaining to a coworker some mobile applications made with web technologies and discussing about Android/MeeGo/iPhone development. After a few minutes of good conversation the next chat happened:
coworker: Maybe we can even create a Windows Phone application
me: I'm not going to install nor use Windows and even less I'm going to write an application for Windows Phone.
coworker: C'mon you should not be that radical
me: Excuses for being a radical
So, after thinking about this chat with a cold mind, I started to wonder the little respect that people have for others with different values, for example I know people that thinks that being a Vegetarian is stupid and foolish, or that everybody who have a religion is dumb. This issue is no different.
I can't do anything for those with closed minds, for those who currently don't respect anything beyond their values and beliefs but I can tell something to everybody else:
If you won't force a vegetarian to eat meat, if you won't force a Muslim to eat pork, if you won't force others to do what you do, please don't force me to use private software.
I (L) Freedom
I (L) My Computer Freedom.
Be happy.


This Functionality allows you to import the excel file containing Drivers information to the system
How do you want do deal with old values
Drop File:**The upload will start immediately after you select or drop the file| Surname | Other Name | Gender | Licence Number | Date of birth | Occupation | |
|---|---|---|---|---|---|---|
| {{ requi.surname }} | {{ requi.other_names }} | {{ requi.gender }} | {{ requi.driving_license_id }} | {{ requi.date_of_birth }} | {{ requi.occupation }} | New Value |
| Surname | Other Name | Gender | Licence Number | Date of birth | Occupation | |
|---|---|---|---|---|---|---|
| {{ requi.surname }} | {{ requi.other_names }} | {{ requi.gender }} | {{ requi.driving_license_id }} | {{ requi.date_of_birth }} | {{ requi.occupation }} | Updated |