Bounds for parameters of codes#
This module provided some upper and lower bounds for the parameters of codes.
AUTHORS:
David Joyner (2006-07): initial implementation.
William Stein (2006-07): minor editing of docs and code (fixed bug in elias_bound_asymp)
David Joyner (2006-07): fixed dimension_upper_bound to return an integer, added example to elias_bound_asymp.
“ (2009-05): removed all calls to Guava but left it as an option.
Dima Pasechnik (2012-10): added LP bounds.
Let \(F\) be a finite set of size \(q\). A subset \(C\) of \(V=F^n\) is called a code of length \(n\). Often one considers the case where \(F\) is a finite field, denoted by \(\GF{q}\). Then \(V\) is an \(F\)-vector space. A subspace of \(V\) (with the standard basis) is called a linear code of length \(n\). If its dimension is denoted \(k\) then we typically store a basis of \(C\) as a \(k\times n\) matrix (the rows are the basis vectors). If \(F=\GF{2}\) then \(C\) is called a binary code. If \(F\) has \(q\) elements then \(C\) is called a \(q\)-ary code. The elements of a code \(C\) are called codewords. The information rate of \(C\) is
where \(\vert C\vert\) denotes the number of elements of \(C\). If \({\bf v}=(v_1,v_2,...,v_n)\), \({\bf w}=(w_1,w_2,...,w_n)\) are elements of \(V=F^n\) then we define
to be the Hamming distance between \({\bf v}\) and \({\bf w}\). The function \(d:V\times V\rightarrow \Bold{N}\) is called the Hamming metric. The weight of an element (in the Hamming metric) is \(d({\bf v},{\bf 0})\), where \(0\) is a distinguished element of \(F\); in particular it is \(0\) of the field if \(F\) is a field. The minimum distance of a linear code is the smallest non-zero weight of a codeword in \(C\). The relatively minimum distance is denoted
A linear code with length \(n\), dimension \(k\), and minimum distance \(d\) is called an \([n,k,d]_q\)-code and \(n,k,d\) are called its parameters. A (not necessarily linear) code \(C\) with length \(n\), size \(M=|C|\), and minimum distance \(d\) is called an \((n,M,d)_q\)-code (using parentheses instead of square brackets). Of course, \(k=\log_q(M)\) for linear codes.
What is the “best” code of a given length? Let \(A_q(n,d)\) denote the largest \(M\) such that there exists a \((n,M,d)\) code in \(F^n\). Let \(B_q(n,d)\) (also denoted \(A^{lin}_q(n,d)\)) denote the largest \(k\) such that there exists a \([n,k,d]\) code in \(F^n\). (Of course, \(A_q(n,d)\geq B_q(n,d)\).) Determining \(A_q(n,d)\) and \(B_q(n,d)\) is one of the main problems in the theory of error-correcting codes. For more details see [HP2003] and [Lin1999].
These quantities related to solving a generalization of the childhood game of “20 questions”.
GAME: Player 1 secretly chooses a number from \(1\) to \(M\) (\(M\) is large but fixed). Player 2 asks a series of “yes/no questions” in an attempt to determine that number. Player 1 may lie at most \(e\) times (\(e\geq 0\) is fixed). What is the minimum number of “yes/no questions” Player 2 must ask to (always) be able to correctly determine the number Player 1 chose?
If feedback is not allowed (the only situation considered here), call this minimum number \(g(M,e)\).
Lemma: For fixed \(e\) and \(M\), \(g(M,e)\) is the smallest \(n\) such that \(A_2(n,2e+1)\geq M\).
Thus, solving the solving a generalization of the game of “20 questions” is equivalent to determining \(A_2(n,d)\)! Using Sage, you can determine the best known estimates for this number in 2 ways:
Indirectly, using
best_known_linear_code_www(n, k, F)
, which connects to the website http://www.codetables.de by Markus Grassl;codesize_upper_bound(n,d,q)
,dimension_upper_bound(n,d,q)
, andbest_known_linear_code(n, k, F)
.
The output of best_known_linear_code()
,
best_known_linear_code_www()
, or dimension_upper_bound()
would
give only special solutions to the GAME because the bounds are applicable
to only linear codes. The output of codesize_upper_bound()
would give
the best possible solution, that may belong to a linear or nonlinear code.
This module implements:
codesize_upper_bound(n,d,q)
, for the best known (as of May, 2006) upper bound \(A(n,d)\) for the size of a code of length \(n\), minimum distance \(d\) over a field of size \(q\).dimension_upper_bound(n,d,q)
, an upper bound \(B(n,d)=B_q(n,d)\) for the dimension of a linear code of length \(n\), minimum distance \(d\) over a field of size \(q\).gilbert_lower_bound(n,q,d)
, a lower bound for number of elements in the largest code of min distance \(d\) in \(\GF{q}^n\).gv_info_rate(n,delta,q)
, \(log_q(GLB)/n\), where GLB is the Gilbert lower bound and \(\delta = d/n\).gv_bound_asymp(delta,q)
, asymptotic analog of Gilbert lower bound.plotkin_upper_bound(n,q,d)
plotkin_bound_asymp(delta,q)
, asymptotic analog of Plotkin bound.griesmer_upper_bound(n,q,d)
elias_upper_bound(n,q,d)
elias_bound_asymp(delta,q)
, asymptotic analog of Elias bound.hamming_upper_bound(n,q,d)
hamming_bound_asymp(delta,q)
, asymptotic analog of Hamming bound.singleton_upper_bound(n,q,d)
singleton_bound_asymp(delta,q)
, asymptotic analog of Singleton bound.mrrw1_bound_asymp(delta,q)
, “first” asymptotic McEliese-Rumsey-Rodemich-Welsh bound for the information rate.Delsarte (a.k.a. Linear Programming (LP)) upper bounds.
PROBLEM: In this module we shall typically either (a) seek bounds on \(k\), given \(n\), \(d\), \(q\), (b) seek bounds on \(R\), \(\delta\), \(q\) (assuming \(n\) is “infinity”).
Todo
Johnson bounds for binary codes.
mrrw2_bound_asymp(delta,q), “second” asymptotic McEliese-Rumsey-Rodemich-Welsh bound for the information rate.
- sage.coding.code_bounds.codesize_upper_bound(n, d, q, algorithm=None)#
Return an upper bound on the number of codewords in a (possibly non-linear) code.
This function computes the minimum value of the upper bounds of Singleton, Hamming, Plotkin, and Elias.
If
algorithm="gap"
, then this returns the best known upper bound \(A(n,d)=A_q(n,d)\) for the size of a code of length \(n\), minimum distance \(d\) over a field of size \(q\). The function first checks for trivial cases (like \(d=1\) or \(n=d\)), and if the value is in the built-in table. Then it calculates the minimum value of the upper bound using the algorithms of Singleton, Hamming, Johnson, Plotkin and Elias. If the code is binary, \(A(n, 2\ell-1) = A(n+1,2\ell)\), so the function takes the minimum of the values obtained from all algorithms for the parameters \((n, 2\ell-1)\) and \((n+1, 2\ell)\). This wraps GUAVA’s (i.e. GAP’s package Guava)UpperBound(n, d, q)
.If
algorithm="LP"
, then this returns the Delsarte (a.k.a. Linear Programming) upper bound.EXAMPLES:
sage: codes.bounds.codesize_upper_bound(10,3,2) 93 sage: codes.bounds.codesize_upper_bound(24,8,2,algorithm="LP") 4096 sage: codes.bounds.codesize_upper_bound(10,3,2,algorithm="gap") # optional - gap_package_guava 85 sage: codes.bounds.codesize_upper_bound(11,3,4,algorithm=None) 123361 sage: codes.bounds.codesize_upper_bound(11,3,4,algorithm="gap") # optional - gap_package_guava 123361 sage: codes.bounds.codesize_upper_bound(11,3,4,algorithm="LP") 109226
- sage.coding.code_bounds.dimension_upper_bound(n, d, q, algorithm=None)#
Return an upper bound for the dimension of a linear code.
Return an upper bound \(B(n,d) = B_q(n,d)\) for the dimension of a linear code of length \(n\), minimum distance \(d\) over a field of size \(q\).
Parameter
algorithm
has the same meaning as incodesize_upper_bound()
EXAMPLES:
sage: codes.bounds.dimension_upper_bound(10,3,2) 6 sage: codes.bounds.dimension_upper_bound(30,15,4) 13 sage: codes.bounds.dimension_upper_bound(30,15,4,algorithm="LP") 12
- sage.coding.code_bounds.elias_bound_asymp(delta, q)#
The asymptotic Elias bound for the information rate.
This only makes sense when \(0 < \delta < 1-1/q\).
EXAMPLES:
sage: codes.bounds.elias_bound_asymp(1/4,2) 0.39912396330...
- sage.coding.code_bounds.elias_upper_bound(n, q, d, algorithm=None)#
Return the Elias upper bound.
Return the Elias upper bound for number of elements in the largest code of minimum distance \(d\) in \(\GF{q}^n\), cf. [HP2003]. If
algorithm="gap"
, it wraps GAP’sUpperBoundElias
.EXAMPLES:
sage: codes.bounds.elias_upper_bound(10,2,3) 232 sage: codes.bounds.elias_upper_bound(10,2,3,algorithm="gap") # optional - gap_package_guava 232
- sage.coding.code_bounds.entropy(x, q=2)#
Compute the entropy at \(x\) on the \(q\)-ary symmetric channel.
INPUT:
x
– real number in the interval \([0, 1]\).q
– (default: 2) integer greater than 1. This is the base of the logarithm.
EXAMPLES:
sage: codes.bounds.entropy(0, 2) 0 sage: codes.bounds.entropy(1/5,4).factor() # optional - sage.symbolic 1/10*(log(3) - 4*log(4/5) - log(1/5))/log(2) sage: codes.bounds.entropy(1, 3) # optional - sage.symbolic log(2)/log(3)
Check that values not within the limits are properly handled:
sage: codes.bounds.entropy(1.1, 2) Traceback (most recent call last): ... ValueError: The entropy function is defined only for x in the interval [0, 1] sage: codes.bounds.entropy(1, 1) Traceback (most recent call last): ... ValueError: The value q must be an integer greater than 1
- sage.coding.code_bounds.entropy_inverse(x, q=2)#
Find the inverse of the \(q\)-ary entropy function at the point
x
.INPUT:
x
– real number in the interval \([0, 1]\).q
- (default: 2) integer greater than 1. This is the base of the logarithm.
OUTPUT:
Real number in the interval \([0, 1-1/q]\). The function has multiple values if we include the entire interval \([0, 1]\); hence only the values in the above interval is returned.
EXAMPLES:
sage: from sage.coding.code_bounds import entropy_inverse sage: entropy_inverse(0.1) 0.012986862055... sage: entropy_inverse(1) 1/2 sage: entropy_inverse(0, 3) 0 sage: entropy_inverse(1, 3) 2/3
- sage.coding.code_bounds.gilbert_lower_bound(n, q, d)#
Return the Gilbert-Varshamov lower bound.
Return the Gilbert-Varshamov lower bound for number of elements in a largest code of minimum distance d in \(\GF{q}^n\). See Wikipedia article Gilbert-Varshamov_bound
EXAMPLES:
sage: codes.bounds.gilbert_lower_bound(10,2,3) 128/7
- sage.coding.code_bounds.griesmer_upper_bound(n, q, d, algorithm=None)#
Return the Griesmer upper bound.
Return the Griesmer upper bound for the number of elements in a largest linear code of minimum distance \(d\) in \(\GF{q}^n\), cf. [HP2003]. If the method is “gap”, it wraps GAP’s
UpperBoundGriesmer
.The bound states:
\[`n\geq \sum_{i=0}^{k-1} \lceil d/q^i \rceil.`\]EXAMPLES:
The bound is reached for the ternary Golay codes:
sage: codes.bounds.griesmer_upper_bound(12,3,6) 729 sage: codes.bounds.griesmer_upper_bound(11,3,5) 729
sage: codes.bounds.griesmer_upper_bound(10,2,3) 128 sage: codes.bounds.griesmer_upper_bound(10,2,3,algorithm="gap") # optional - gap_package_guava 128
- sage.coding.code_bounds.gv_bound_asymp(delta, q)#
The asymptotic Gilbert-Varshamov bound for the information rate, R.
EXAMPLES:
sage: RDF(codes.bounds.gv_bound_asymp(1/4,2)) 0.18872187554086... sage: f = lambda x: codes.bounds.gv_bound_asymp(x,2) sage: plot(f,0,1) Graphics object consisting of 1 graphics primitive
- sage.coding.code_bounds.gv_info_rate(n, delta, q)#
The Gilbert-Varshamov lower bound for information rate.
The Gilbert-Varshamov lower bound for information rate of a \(q\)-ary code of length \(n\) and minimum distance \(n\delta\).
EXAMPLES:
sage: RDF(codes.bounds.gv_info_rate(100,1/4,3)) # abs tol 1e-15 0.36704992608261894
- sage.coding.code_bounds.hamming_bound_asymp(delta, q)#
The asymptotic Hamming bound for the information rate.
EXAMPLES:
sage: RDF(codes.bounds.hamming_bound_asymp(1/4,2)) 0.456435556800... sage: f = lambda x: codes.bounds.hamming_bound_asymp(x,2) sage: plot(f,0,1) Graphics object consisting of 1 graphics primitive
- sage.coding.code_bounds.hamming_upper_bound(n, q, d)#
Return the Hamming upper bound.
Return the Hamming upper bound for number of elements in the largest code of length \(n\) and minimum distance \(d\) over alphabet of size \(q\).
The Hamming bound (also known as the sphere packing bound) returns an upper bound on the size of a code of length \(n\), minimum distance \(d\), over an alphabet of size \(q\). The Hamming bound is obtained by dividing the contents of the entire Hamming space \(q^n\) by the contents of a ball with radius \(floor((d-1)/2)\). As all these balls are disjoint, they can never contain more than the whole vector space.
\[M \leq \frac{q^n}{V(n,e)},\]where \(M\) is the maximum number of codewords and \(V(n,e)\) is equal to the contents of a ball of radius \(e\). This bound is useful for small values of \(d\). Codes for which equality holds are called perfect. See e.g. [HP2003].
EXAMPLES:
sage: codes.bounds.hamming_upper_bound(10,2,3) 93
- sage.coding.code_bounds.mrrw1_bound_asymp(delta, q)#
The first asymptotic McEliese-Rumsey-Rodemich-Welsh bound.
This only makes sense when \(0 < \delta < 1-1/q\).
EXAMPLES:
sage: codes.bounds.mrrw1_bound_asymp(1/4,2) # abs tol 4e-16 0.3545789026652697
- sage.coding.code_bounds.plotkin_bound_asymp(delta, q)#
The asymptotic Plotkin bound for the information rate.
This only makes sense when \(0 < \delta < 1-1/q\).
EXAMPLES:
sage: codes.bounds.plotkin_bound_asymp(1/4,2) 1/2
- sage.coding.code_bounds.plotkin_upper_bound(n, q, d, algorithm=None)#
Return the Plotkin upper bound.
Return the Plotkin upper bound for the number of elements in a largest code of minimum distance \(d\) in \(\GF{q}^n\). More precisely this is a generalization of Plotkin’s result for \(q=2\) to bigger \(q\) due to Berlekamp.
The
algorithm="gap"
option wraps Guava’sUpperBoundPlotkin
.EXAMPLES:
sage: codes.bounds.plotkin_upper_bound(10,2,3) 192 sage: codes.bounds.plotkin_upper_bound(10,2,3,algorithm="gap") # optional - gap_package_guava 192
- sage.coding.code_bounds.singleton_bound_asymp(delta, q)#
The asymptotic Singleton bound for the information rate.
EXAMPLES:
sage: codes.bounds.singleton_bound_asymp(1/4,2) 3/4 sage: f = lambda x: codes.bounds.singleton_bound_asymp(x,2) sage: plot(f,0,1) Graphics object consisting of 1 graphics primitive
- sage.coding.code_bounds.singleton_upper_bound(n, q, d)#
Return the Singleton upper bound.
Return the Singleton upper bound for number of elements in a largest code of minimum distance \(d\) in \(\GF{q}^n\).
This bound is based on the shortening of codes. By shortening an \((n, M, d)\) code \(d-1\) times, an \((n-d+1,M,1)\) code results, with \(M \leq q^n-d+1\). Thus
\[M \leq q^{n-d+1}.\]Codes that meet this bound are called maximum distance separable (MDS).
EXAMPLES:
sage: codes.bounds.singleton_upper_bound(10,2,3) 256
- sage.coding.code_bounds.volume_hamming(n, q, r)#
Return the number of elements in a Hamming ball.
Return the number of elements in a Hamming ball of radius \(r\) in \(\GF{q}^n\).
EXAMPLES:
sage: codes.bounds.volume_hamming(10,2,3) 176


2 overrides of ThreadOptions
System.Management.Automation (2)
engine\hostifaces\LocalConnection.cs (1)
138
public override PSThreadOptions
ThreadOptions
engine\remoting\client\remoterunspace.cs (1)
284
public override PSThreadOptions
ThreadOptions
4 writes to ThreadOptions
System.Management.Automation (4)
engine\hostifaces\ConnectionBase.cs (2)
79
this.
ThreadOptions
= initialSessionState.ThreadOptions;
125
this.
ThreadOptions
= initialSessionState.ThreadOptions;
engine\hostifaces\RunspacePoolInternal.cs (1)
1257
result.
ThreadOptions
= this.ThreadOptions == PSThreadOptions.Default ? PSThreadOptions.ReuseThread : this.ThreadOptions;
engine\parser\Parser.cs (1)
2951
localRunspace.
ThreadOptions
= Runspaces.PSThreadOptions.UseCurrentThread;
1 reference to ThreadOptions
System.Management.Automation (1)
engine\hostifaces\PowerShell.cs (1)
4578
VerifyThreadSettings(settings, rsToUse.ApartmentState, rsToUse.
ThreadOptions
, false);


0?'haveevents':'')): 'void_day'"
[style.background-image]="day? ('linear-gradient(120deg, '+day.colors+',#fff)'):''" class="day" [outsideClick]="true"
[popover]="yearcalendarpoptemplate" placement="right" (onShown)="dayindex=i;getTodayEvents(day,m)">
{{day?.day}}


Provides the Book-Crossing Dataset for the package recommenderlab.
| Version: | 0.1-1 |
| Depends: | R (≥ 2.10), recommenderlab (≥ 0.1.3) |
| Published: | 2015-07-14 |
| Author: | Michael Hahsler |
| Maintainer: | Michael Hahsler <mhahsler at smu.edu> |
| License: | GPL-2 |
| Copyright: | Data is freely available for research use when acknowledged with the following reference: Improving Recommendation Lists Through Topic Diversification, Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, Georg Lausen; Proceedings of the 14th International World Wide Web Conference (WWW '05), May 10-14, 2005, Chiba, Japan. To appear. |
| URL: | http://lyle.smu.edu/IDA/recommenderlab/ |
| NeedsCompilation: | no |
| CRAN checks: | recommenderlabBX results |
| Reference manual: | recommenderlabBX.pdf |
| Package source: | recommenderlabBX_0.1-1.tar.gz |
| Windows binaries: | r-devel: recommenderlabBX_0.1-1.zip, r-release: recommenderlabBX_0.1-1.zip, r-oldrel: recommenderlabBX_0.1-1.zip |
| OS X binaries: | r-release: recommenderlabBX_0.1-1.tgz, r-oldrel: recommenderlabBX_0.1-1.tgz |
| Old sources: | recommenderlabBX archive |
Please use the canonical form https://CRAN.R-project.org/package=recommenderlabBX to link to this page.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/identity.20type.20and.20refl.html ---
Is it possible to pattern match on the refl constructor of the identity type (eq.refl) in Lean similar to what one can do in Agda? I tried defining one by pattern matching but it didn't seem to work.
yes, there are several ways
subst
and cases
both work, as does the pattern matcher
note that one side of the equality must be a variable and must participate in the pattern match (be right of the colon) for it to work
Can you give an example of code you expect to work but doesn't?
def subst {A : Type ℓ}(P : A → Type ℓ'){a b : A} : a = b → P a → P b := assume p : a = b, assume x : P a, show P b, from eq.cases_on p x
works fine
but then
def subst_const {A : Type ℓ} {B : Type ℓ'} {x y : A} : Π (p : x = y) (b : B) , --------------------- subst (λ _ , B) p b = b | (eq.refl) _ := eq.refl
doesn't work
This is something I've used a lot in Agda, and I figured if I try to do some of these "basic" things in Lean that could help me learn it, but I think that maybe I don't understand the basic syntax well enough yet...
Yes, that is because the requirement "one side of the equality must be a variable and must participate in the pattern match (be right of the colon)" (or in this case, below the colon :slight_smile:) is not met
y
needs to move past the colon, and the last line should read | _ (eq.refl _) _ := eq.refl _
or replace eq.refl _
with rfl
okay, got it, can I still keep y implicit?
it seems I can
thank you very much for your help!! ^_^
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Search
Retro and Modern Sylvanian Families Collectibles
Home
Collection
Other
Blog
eBay
Forums
Links
News
Contact
Back
Rabbits
Babblebrook Rabbit Family
Blackberry Rabbit Family
Brighteyes Rabbit Family
Butterglove Rabbit Family
Chocolate Rabbit Family
Cinnamon Rabbit Family
Columbus Rabbit Family
Corntop Rabbit Family
Cottontail Rabbit Family
Dandelion Rabbit Family
Dappledawn Fawn Rabbit Family
Garden Rabbit Family
Grey Rabbit Family
Hollywood Rabbit Family
Hopkins Champagne Rabbit Family
Hoppinset Rabbit Family
Hopscotch Rabbit Family
Ivory Rabbit Family
Lavender Rabbit Family
Marguerite Rabbit Family
Nightingale Rabbit Family
Ocher Rabbit Family
Periwinkle Milk Rabbit Family
Seabreeze Rabbit Family
Snow Rabbit Family
Snowbunny Rabbit Family
Snow-Warren Rabbit Family
Sparkle Rabbit Family
Sunny Rabbit Family
Sweetpea Rabbit Family
Wildflower Rabbit Family
Wildwood Rabbit Family
Windward Rabbit Family


Résumé
I do not compete with others, the only competition that challenges me is myself
As a fighter, friend and an employee I am known as contemplative, tortured and driven.
Experience
Recent
-
2018
- Amongst many fighters of the past was featured in the movie "Ready Player One". Ryu ready always!
-
2017
- United with unknown until then to me Power Rangers to defeat resurrected M.Bison.Damn good fighters they are, even not knowing karate ways!
-
2016
- In "Street Fighter V" once and for all erased M.Bison from the earth and tamed my inner Evil Ryu. I also spent some time on a side-project, mini-series "Street Fighter: Resurrection".
-
2014
- Filmed in a martial arts tutorial "Street Fighter: Assassin's Fist", revealing to the audience forgotten art of Ansatsuken.
-
2012
- The gods of the internet concluded me in the animated movie "Wreck-It Ralph", but rewarded me with a good drink for it!
-
2008
- My evil alters ego sneaked out of control and became a boss in "Street Fighter IV".
-
2006
- Borrowed my famous ripped gi to Soki in "Onimusha: Dawn of Dreams", gods informed me he needed that for the battle.
-
1998
- Defeated M. Bison in "Street Fighter Alpha 2", bastard wanted to use my heroic body for his evil intentions but retreated with shame. Also this year I encountered Marvel universe in "Marvel vs. Capcom: Clash of Super-Heroes" fighter, loyal to my employer, Capcom, of course.
-
1997
- Reunited with Ken, my friend, and opponent in "Street Fighter III". Men's friendship works mysteriously. Also helped with Arika project "Street Fighter EX"
-
1996
- Took care of villainous Akuma in "Street Fighter Alpha 2". As a freelance on "Super Puzzle Fighter II Turbo" I tried me in a new genre, puzzle games. Let the wrath of seven heavens come upon these malicious enigmas, never again!
-
1995
- Kept fighting in "Street Fighter Alpha: Warriors' Dreams".
-
1995
- Screened in the movie "Street Fighter" so that the battles of the past would not be forgotten by the millennial generation.
-
1991
- Was promoted to "Street Fighter II". I didn't stay there for long, celebrations and office dwelling is not for me!
-
1987
- I started working for the Capcom project "Street Fighter". My partner was Ken Masters, the boss'name was Sagat.
Publications
-
2011
- The true and humble story of me under pseudonym Tyler Wilde in an article "The evolution of Ken and Ryu"
-
2003-2018
- For 15 years I have published comic books with Udon Entertainment depicting my adventures, bitter lessons, and great victories.
Achievements
-
- #1 in "Top 25 Street Fighter Characters" by IGN, who also called me "fancy", "icon" and "a testament to the virtue of simplicity"
-
- #1 in "Top 25 Street Fighter Characters" by IGN, who also called me "fancy", "icon" and "a testament to the virtue of simplicity"
-
- #2 in "Top 20 Street Fighter Characters of All Time" by GameDaily, the same council found me worth of #6 places in "Top 25 Capcom Characters of All Time", which I proudly share with my partner Ken
-
- I was named "5th Most Powerful Street Fighter Character" by Screen Rant-san
-
- #71 in "Top 100 Heroes of All Time" by UGO Networks, also recognized #2 in their list of "Top 50 Street Fighter Characters"
-
- In a survey of 4000 online matches for Super Street Fighter IV, I got to be the most popular character, with 16.6% of players choosing my side


Your task in this exercise is to show the
behavior for some code.
The following lines of code will set up the picture
below:
Original Code: Link first; Link { public Object value; public Link next; }
Now, modify the picture below to show the effects of
executing the following lines of code.
[pointerEX3PRO.userInput]
if (!pointerEX3PRO.checkAnswer() && !guess[0]) {
return ""; // User did not click, and correct answer is not
// initial array state
} else {return pointerEX3PRO.checkAnswer();}


CosmoloPy is a package of basic cosmology routines for Python, designed for use with NumPy and SciPy. Features currently include: calculation of cosmological distance measures, perturbation-theory-based calculation of the matter power spectrum and halo collapse fraction (courtesy of Eisenstein & Hu's transfer function code), and integration of simple reionization models and the resulting electron scattering optical depth due to reionization. I hope it will prove useful to the increasing number of astronomers turning to Python.
Using CosmoloPy is as simple as setting up a dictionary of cosmological parameters (some WMAP5 parameters are provided for convenience incosmolopy.parameters
) and passing it to
the functions you want to use. For instance, we could quickly calculate the comoving distance to redshift 6 like this:
>>> import cosmolopy.distance as cd >>> cosmo = {'omega_M_0' : 0.3, ... 'omega_lambda_0' : 0.7, ... 'h' : 0.72} >>> d_co, err = cd.comoving_distance(z=6., **cosmo) >>> print "Comoving distance to z=6 is %.1f Mpc" % (d_co) Comoving distance to z=6 is 8017.8 MpcA few more lines of code, and you can produce a plot like the one shown above.
CosmoloPy is released under the MIT software license, which allows it to be freely used and modified. So please download it, use it, and request or add features you'd like to see included (and point out bugs we need to fix). Anyone can access the git repository, so please edit the code and send in useful changes and additions. All questions about use or development can be posted to the developer discussion group.


Day 13
Victims of human trafficking and slavery
13
Our hearts cry rivers of tears for the children who are victims of human trafficking. How long, O’ Lord? How long will this terror continue? How long will the wicked steal the souls and bodies of our children? Act, O’ Father. In Your name bring justice for them. Crush the evil works and bring liberty to the enslaved.Grant the organizations that You have raised up to fight this devilish work to have favor with governing authorities. Use them as tools of righteousness and justice. Lead them where to go to bring release to the captives. Yes, Lord, it is time to act. From Your compassion, rescue these prisoners of man’s lust and greed. Rescue them; rescue them.
Also, Father, we ask that healing be poured into these broken and ravished lives. You are able to heal and mend together what evil has torn apart. In the name of Jesus, let healing flow into every fiber of their being. Strengthen and provide for those who are weeping with these children. Fill their homes with heavenly peace and with joy unspeakable and full of glory.
Jesus, be their King! Conquer their captors, and lead them out of bondage. Heal their brokenness. Fill them with Your love.  Hide them in Your everlasting arms. Raise Your victory banner high over them. Amen. (Psalm 10; Isaiah 61:1-3)


Ryanair’s court action against Bellew will not go ahead this week
Action centres on Peter Bellew’s decision to leave company and join rival airline Easyjet
Ryanair’s High Court action against its chief operations officer Peter Bellew will not go ahead this week. The case was listed for hearing on Tuesday and had been expected to last for several days.
When the matter was mentioned before Ms Justice Leonie Reynolds on Monday, she was informed an issue had arisen and the case could not proceed as scheduled on Tuesday.
A new hearing date will be fixed later this week.
The action centres on Mr Bellew’s decision earlier this year to leave the company in December and join rival airline Easyjet as its chief operating officer.
Ryanair claims Mr Bellew has a clause in his contract that prevents him working for a rival for a period of 12 months after the end of his employment with Ryanair.
Ryanair’s claims are denied by Mr Bellew, who has held a number of senior roles in the aviation industry. He was previously Malaysia Airline’s chief executive and Ryanair’s director of flight operations. The case was initiated last August.


--- layout: base title: Portfolio subtitle: "Here I show you my works." use-site-title: true js: "/js/portfolio.js" ---


Here is a list of all class members with links to the classes they belong to:
- a -
- c -
- d -
- g -
- h -
- i -
- IDevice()
: ish::IDevice< Type, Input >
- IniHandler()
: ish::IniHandler
- Initialize()
: ish::InputManager
, ish::ISH
, ish::IDevice< Type, Input >
, ish::WinKeyboard
, ish::XboxPad
- IsConnected()
: ish::XboxPad
- IsDown()
: ish::IDevice< Type, Input >
, ish::WinKeyboard
, ish::XboxPad
- IsPressed()
: ish::IDevice< Type, Input >
, ish::WinKeyboard
, ish::XboxPad
- IsReleased()
: ish::IDevice< Type, Input >
, ish::WinKeyboard
, ish::XboxPad
- IsUp()
: ish::IDevice< Type, Input >
, ish::XboxPad
, ish::WinKeyboard
- k -
- l -
- o -
- r -
- s -
- t -
- u -
- w -
- x -
- ~ -


Online Order Status Tracking Tool
We built this project for internal purpose for CISCO. Where user can track the status of his order online and do modifications if needed through helpdesk but can't change data. There were 3 user roles, 1) Viewer : Can view and export the sheet, But can't make any data changes. 2) Editor : Can edit the row data. 3) Admin : Can Manage the sheet and dependency settings. This was my first project and I worked as a shadow resource for an UI developer. Technologies Involved : ExtJS, Java, MySQL, AJAX etc.,
Online Mortgage Loan
This was my first Angular JS project, Where user can login to the application, Check his eligibility against various factors for mortgage loan and apply for the loan online. We made this application for a bank called FELIX in US. This project was the actual transition phase for me from the typical HTML/CSS developer to Angular JS developer. Technologies Involved : Angular JS 1.3, dotNet, SQL, Bootstrap 3 etc.,
Replica Of AWS
We made a replica of AWS i.e, Amazon Web Services when I was working with Huawei through Innominds. We had a team of 8-9 UI developers and we have built 5 portals in total. I have worked with this team for around one year and learnt some strong debugging skills, Gained knowledge about Iaas, Saas and Paas. Technologies Involved : Angular JS 1.5, Angular Material Design, Underscore JS, D3 JS, SASS etc.,
Banking Applications
Currently working in banking domain. Making applications for bank. Working in both internet and intranet applications. Here, I had a good opportunity to work in Angular 2 and React JS. Gained some amount of knowledge on ES6 syntax, transpilers, features of Angular 2, React concepts like virtual DOM, State, Props, Store. Current technologies : React JS, Angular JS 1.6, Angular JS 2, SASS, ES6,Angular material design, Bootstrap 3 etc.,


We aggregate metrics!
- reinvent next-generation e-business
- iterate frictionless systems
- enhance customized vortals
- unleash world-class platforms
- repurpose cross-platform models
- repurpose innovative users
- expedite efficient synergies
- redefine e-business channels
- enhance bleeding-edge mindshare
- unleash robust markets
- reintermediate ubiquitous content


Almost a CMS aka AaCMS is a simple visual editor for live static websites written in PHP and JavaScript. It's easy to install (just copy the editor.php on your web server) and to use (load it in the web browser).
Use it to update static web pages and also create new pages using the Save As feature
Being simple means that it's also limited in many aspects, including security stuff. So don't forget to check out the Warnings section to find out more about how you can secure your installation.
editor.php
and set a user and password. Multiple users can be added editor.php
in the root folder of your website Point your browser to
http(s)://yourwebsiteaddress/editor.php?file=filetoedit.html and start editing.
You will notice a toolbox-like floating window that you can move around the page. By default it displays a "File menu" which you can use to save the file, save the file under a new name, reload or go to original file.
By moving the mouse over the page the hovered elements will be highlighted with a dashed border. Clicking on the hovered element will enter the edit mode.
Depending on the selected element type, you will get 2 standard menus and a selection dependent menu
- edit: use this menu to perform copy/cut & paste operations
- traverse: use the buttons from this menu to navigate through the elements tree. Useful especially for selecting elements which cannot be selected with a click, like: FORM, TABLE, FIELDSET, UL and so on
- text: this menu becomes active when clicking an element which can be edited as text, like DIV, P, TD, LI and so on. Once the element is selected you can start to edit it. Also, it provides some basic styling options: bold, italic, increase/decrease font size, and so on. The styling will be applied only to the text selection and not on the entire selected element.
- image: this menu becomes active when the selected element is an image and displays a form which can be used to modify the basic image properties
- link: this menu becomes active when the selected element is a link and displays a form to edit the link properties
This tool is like a knife: it's simple and straightforward (not much fanciness inside) and you can do useful stuff with it, but you can also cut yourself pretty bad. Therefore there are a few things which you should keep in mind when using it on your website:
The security of this script is pretty low by itself. It uses Basic Auth to authenticate users which transmits password in clear. This means that you should NEVER use this on a live website without HTTPS enabled.
The information about the users is hard coded in the script itself, so not a very flexible approach. Of course, you are free to implement your own methods. A quick improvement could be to create a separate PHP file where you store the users info placed outside the website DocRoot and include it in the script.
This script, being run by the web server, it will access files with the web server user. On a typical Linux systems this is "www-data". Therefore, you should decide in advance which files/directories you want to allow to be edited and set their access rights or ownership accordingly.
Do this either in Linux console by using any of the approaches bellow
- set access rights: chmod u+w your_file_or_directory_name
or
- change ownership files to match the web server user: chown www-data your_file_or_directory_name
Or by using your favorite FTP client change either the access rights or the ownership of the files
Feel free to make feature requests, suggestions or signal any issues using the project GIT Hub Issues:
https://github.com/vsergione/AaCMS


Kenya story building collapse: 10 dead, 20 inured, 30 missing - Police
Kenyan rescuers digging through the rubble of a six-story building found two survivors alive Sunday, two days after it collapsed in Nairobi, as the death toll rose to 10.
When the survivors of Friday’s building collapse were found Sunday morning, a crowd of onlookers burst into cheers and claps.
A military member at the scene told The Associated Press they had been communicating with people believed to have been trapped in pockets of debris. He said some were screaming for help but the sounds of their voices had died down as time wore on. He insisted on anonymity because he was not authorized to speak with the media.
Nairobi Police Chief Philip Ndolo said four bodies were recovered from the scene Sunday including that of a child, while a fifth person died in a hospital. According to authorities, that brings the overall toll to 10 dead, 30 injured and 20 missing.
Ndolo said the rescue of a man and a woman had invigorated emergency workers with hopes of finding other survivors. He said the two were in stable condition in a hospital.
“Given we have rescued two people two days after the incident, we hope to find more survivors. Remember there is more than 20 people missing,” he said.
He said the heavy rains that Kenya was experiencing, more than 300% above normal, were slowing the rescue operation. It was not immediately clear what caused the building, which the Red Cross said housed 22 families, to collapse.
But building collapses are common in Nairobi, where housing is in high demand and unscrupulous developers often bypass regulations.
On Saturday, one person died and others were injured when the balcony of single-story building in Chuka in central Kenya collapsed.
In September, a school collapsed in Nairobi, killing at least seven primary students.
After eight buildings collapsed and killed 15 people in Kenya in 2015, President Uhuru Kenyatta ordered an audit of all the country’s buildings to see if they were up to code. The National Construction Authority found that 58% of the buildings in Nairobi were unfit for habitation.
AP