De-interlacing filter. More...
Public Member Functions | |
| PvDeInterlacer () | |
| Constructor. | |
| virtual | ~PvDeInterlacer () |
| Destructor. | |
| PvResult | Apply (const PvBuffer *aIn, PvBuffer *aOut) |
| De-interlaces an image from a PvBuffer containing both fields. More... | |
| PvResult | Apply (const PvBuffer *aInOdd, const PvBuffer *aInEven, PvBuffer *aOut) |
| De-interlaces an image from a a pair of PvBuffer, one Even and one Odd field. More... | |
| PvResult | ApplyOdd (const PvBuffer *aIn, PvBuffer *aOut) |
| De-interlaces an image from a PvBuffer containing an odd field. More... | |
| PvResult | ApplyEven (const PvBuffer *aIn, PvBuffer *aOut) |
| De-interlaces an image from a PvBuffer containing an even field. More... | |
| PvResult | ApplyDoubling (const PvBuffer *aIn, PvBuffer *aOut) |
| Doubles lines of the field to the output field. More... | |
| PvResult | ApplyBlending (const PvBuffer *aInOdd, const PvBuffer *aInEven, PvBuffer *aOut) |
| Blends (averages) even and odd lines. The result is doubled into the output buffer. More... | |
| bool | GetFieldInversion () const |
| Retrieves the deinterlacer configuration for field inversion. More... | |
| void | SetFieldInversion (bool aInvert) |
| Configures the deinterlacer for 1-2 or 2-1 fields order. More... | |
De-interlacing filter.
This class only supports non-destructive (non-in-place) filtering on buffers with an image payload type.
It is possible to deinterlace a buffer containing both fields using the Apply method only taking a single input PvBuffer as parameter. With this method, field inversion can be controlled through SetFieldInversion.
The other Apply method takes two independent PvBuffer objects each containing a field. Even and Odd interlaced fields are required for reconstructions. SetFieldInversion is ignored when deinterlacing with this Apply method, the user can simply swap the parameters to obtain the same effect.
To deinterlace an image:
De-interlaces an image from a PvBuffer containing both fields.
| PvResult PvDeInterlacer::Apply | ( | const PvBuffer * | aInOdd, |
| const PvBuffer * | aInEven, | ||
| PvBuffer * | aOut | ||
| ) |
De-interlaces an image from a a pair of PvBuffer, one Even and one Odd field.
| [in] | aInOdd | PvBuffer used as Odd field source. |
| [in] | aInEven | PvBuffer used as Even field source. |
| [out] | aOut | PvBuffer used as destination for the operation. |
| PvResult PvDeInterlacer::ApplyBlending | ( | const PvBuffer * | aInOdd, |
| const PvBuffer * | aInEven, | ||
| PvBuffer * | aOut | ||
| ) |
Blends (averages) even and odd lines. The result is doubled into the output buffer.
| [in] | aInOdd | PvBuffer used as Odd field source. |
| [in] | aInEven | PvBuffer used as Even field source. |
| [out] | aOut | PvBuffer used as destination for the operation. |
Doubles lines of the field to the output field.
De-interlaces an image from a PvBuffer containing an even field.
De-interlaces an image from a PvBuffer containing an odd field.
| bool PvDeInterlacer::GetFieldInversion | ( | ) | const |
Retrieves the deinterlacer configuration for field inversion.
| void PvDeInterlacer::SetFieldInversion | ( | bool | aInvert | ) |
Configures the deinterlacer for 1-2 or 2-1 fields order.
| [in] | aInvert | False for 1-2 field order (default) or true for 2-1. |
Copyright (c) 2002-2015 Pleora Technologies Inc.
www.pleora.com


Measure out all the spices except the cumin seeds and put them in a small bowl.
Let the ghee (clarified butter) melt in a small saucepan over medium-low heat. (Ghee is the traditional Indian choice, but you can substitute butter and a splash of olive oil if you can’t find ghee.) Once the ghee begins to sizzle, add the cumin seeds and stir for about 5 seconds.
Add the onion and sauté for 2 minutes. Add the garlic and cook for 1 minute. Add the ginger and jalapeño and cook for 1 more minute. Add the spices and then the puréed tomatoes. Mix, then put a lid on the pan and let everything cook down for 5 to 10 minutes.
Once the tomato has reduced and the ghee starts to separate from the sauce, add the chickspeas and water.
Mix, then bring it to a boil before reducing to a simmer. Cook for 10 minutes, then squish a few chickpeas with a spoon to thicken the sauce. Garnish with yogurt and cilantro. For a full meal, serve over rice or with roti.


Tap 'Start' to start timing the video recording activity.
To wrap up the entire in-class activity, tap 'Finish' for each group you have reviewed their video.


Faqs
Product and description
ART 1
Thousands of products online are ready to be purchased by you
Name
E-mail
Phone


Dow, S&P finish at records despite trade deal doubts
NEW YORK: The Dow and S&P 500 floated higher on Wednesday (Nov 13), inching to fresh records despite multiplying reports that US and Chinese trade officials are still struggling to conclude a partial bargain.
Meanwhile, Federal Reserve Chairman Jerome Powell largely met investor expectations for the first of two days of congressional testimony.
READ: Fed's Powell urges Congress to focus on debt, deficit
House lawmakers also opened the first day of televised impeachment hearings during which the top US diplomat in Ukraine levelled fresh accusations about President Donald Trump's conduct that country.
READ: New revelation at historic Trump impeachment hearing
The benchmark Dow Jones Industrial Average rose 92.10 points (0.33 per cent) to finish the session at 27,783.59, lifted by soaring Disney shares.
The Walt Disney Co shot more than seven per cent higher, its biggest one-day gain since April, after reporting that its streaming service Disney+ had attracted 10 million subscribers on its first day.
Meanwhile, the S&P 500 scraped by with a positive close, finishing essentially flat at 3,094.04. The tech-heavy Nasdaq fell 3.99 points (0.05 per cent) to 8,482.10.
Markets quickly pared gains in mid-afternoon following a new report by The Wall Street Journal saying Chinese officials hesitated to agree formally to making gigantic purchases of American farm exports.
Trump last month announced a "phase one" deal had been agreed but efforts to commit the deal to paper appear to have hit roadblocks.
The two sides have already differed publicly on whether and when to remove tariffs imposed in their year-and-a-half-old trade war.
In a briefing on Wednesday after markets closed, Trump said "our trade agreement with China is moving along very rapidly."
Meanwhile, in his testimony, Powell reaffirmed that the central bank is on hold after cutting the benchmark lending rate three times this year.
"He did not deliver anything new but he delivered his message clearly: no need for more easing but they would ease if they needed to," Karl Haeling of LBBW told AFP.


Thomas Stanley Mowle
Democrat
Self-Employed -- owner of Rampart Professional Solutions, LLC. Primary lines of work are academic editing and dissertation coaching for doctoral candidates.
PhD, Political Science, Ohio State, 1996 MA, International Affairs, Dayton, 1990 BS, Electrical and Computer Engineering, Notre Dame, 1987 BA, Government, Notre Dame, 1987
80920
The longest and broadest example of such advocacy stems from my service to the Public Trustee Association of Colorado, on its board and on its legislative committee. Working with representatives of all 64 Colorado counties helped me develop a deeper understanding of the variety of interests in different parts of the state. While I represented a very large county, I recognized that proposals that might make sense in Colorado Springs would not meet the needs of rural counties. At the same time, I also learned how to help the elected officials in those counties understand the needs of the larger and urban counties. Since 2007, I have also advocated for the protection of public lands in Colorado. I helped lead an effort to map out the boundaries of a large roadless area in the Rampart Range and promote awareness of the recreational opportunities in that area. My work resulted in the addition of over 1000 acres to the roadless area by discovering mapping errors. I have continued my advocacy through developing and coordinating public comments on Forest Service and Bureau of Land Management proposals and by helping Wild Connections develop reports on lands with wilderness characteristics. I also take direct action in this area: as a certified trail crew leader, I have led teams to design, build, and repair trails in El Paso, Teller, and Douglas counties. From 2008-2014, I served as an at-large member of the Community Advisory Committee to the Pikes Peak Area Council of Governments. In that role, I heard the concerns of different groups within the region and helped evaluate priorities for infrastructure and parks.
I ran for El Paso County Clerk and Recorder in 2010 (lost). I was a Democratic Party precinct chair from 2008-2010. DONATIONS: 2020 cycle: Elizabeth Warren, Joe Biden for President. Cal Cunningham, Mark Kelly, Sara Gideon, John Hickenlooper, Steve Bullock, Theresa Greenfield for Senate. Dan O'Neil, Kelly Breen, and Barb Anness for Michigan House; Felicia French, Ajlan "AJ" Kurdoglu, and Douglas Ervin for Arizona Senate; Coral Evans for Arizona House; Terri LeGrand for North Carolina Senate; Gail Young for North Carolina House; and Sharon Hirsch for Texas House. Also Fair Fight and Florida Rights Restoration. 2018 cycle: Jared Polis for Governor, Pete Lee and Tony Exum for State Legislature 2017: Yolanda Avila, Jill Gaebler, and Richard Skorman for Colorado Springs City Council 2016 cycle: Pete Lee, Tony Exum, Rachel Zenzinger, Daniel Kagan for State Legislature, Michael Bennet for Senate. Probably Hillary Clinton for President also though I can't find a record of doing so. Organizations: Not sure what qualifies for the list or if this is complete, but donated to ACLU, Sierra Club, Wild Connections, Trails and Open Space Coalition, Planned Parenthood, NARAL
Throughout the period, Conservation Chair of the Pikes Peak Group of the Colorado Mountain Club 2018-2019 Member of the Board of the Public Trustee Association of Colorado. Also served on the board earlier in the decade, and a member of the association throughout. 2008-2019 Public Trustee for El Paso County (appointed by Governors Ritter, Hickenlooper, and Polis)
I want to serve on the commission because I believe I that fair redistricting is a cornerstone of representative democracy and because my soft and hard skills will both contribute to a process that will serve the people of Colorado. I have been interested in redistricting since college, when I participated in a 1985 project led by Common Cause in Indiana. I demonstrated that it was possible to create a city council district in South Bend, Indiana, that united much of the central-city African American community in one district rather than dispersing the members of that community among districts that extended from the center to outlying neighborhoods. I continued working with Common Cause in Indiana in a citizen-led effort to show how single-member state legislative districts could be created that respected jurisdictional boundaries. At that time, in the early 1990s, Indiana used multimember districts around some major cities that diluted the voting power of certain communities by merging them with outlying areas that would drown out their voice. I resumed engaging with redistricting after my retirement from the Air Force. I provided comments on El Paso County Commissioner districts, where the process was particularly disturbing. The county would tweak its maps frequently, shuffling precincts to ensure that one party would win every seat. Sometimes a precinct would be swapped so frequently that its citizens would not be able to vote for commissioner for several cycles. In recent years, the county has gone to extremes to imagine communities of interest that are not based on the real identities of local citizens. My dismay at this process was one of the reasons I ran for County Clerk and Recorder in 2010. After being defeated by Wayne Williams for county office, I actively participated in the public comments for 2010 statewide redistricting and also became involved in a successful effort to reduce the proportion of at-large city council seats from 5 of 9 to 3 of 9. Prior to this, no city council members were living in the central areas of the city. I then engaged with community groups to argue for a district that would unify the southeastern portion of the community, with its distinct interests, rather than splitting and dispersing that community among several districts. My overall takeaway from these experiences is that elected officials have an inherent conflict of interest in redistricting: preserving their own power and that of their political party. These override an important principle of living in a democratic republic: that the voters select their representatives, not the other way around.
I demonstrated my ability to be fair and impartial while I was serving as Public Trustee for El Paso County for 11 years. In that role, I had to ensure that my deputies and I administered foreclosure law fairly and equitably, setting aside any personal feelings about particular cases or how we might wish the law were different. I will be able to promote consensus and contribute to creating agreement because I am good at listening to others and understanding their interests and preferences. That allows me to reflect on their argument and show good faith by reconsidering my own positions and where they could be more in alignment with those of others. At the same time, I am able to couch my own views in ways that appeal to the values that others hold. This was particularly useful as a member of the Public Trustee Association Board and Legislative Committee, during which time most of my colleagues were elected officials of another political party and had been representing rural counties for many years. My ability to promote consensus in those ways largely stems from my Air Force career, as described in more detail in the next answer. In most assignments, I was by rank the junior person even when I was a peer on the organization chart. That meant that the only way I could promote safety, design decisions, or a wartime engagement strategy was by persuasive discussion and making sure that I had data to back up my position. I also found it helpful to let others take credit for my ideas as if they were their own rather than merely coming into agreement with me. These experiences also taught me to engage when I thought it really mattered and hold off from trying to get my way for its own sake. I have also used these skills to build coalitions during public lands discussion periods. While environmental groups share broad common goals, they do differ in their priorities. It was important to find ways to get several groups to sign on to a single letter rather than taking divergent positions that would not help land managers reach the decision we preferred. The comments I developed for these federal decisions were always richly detailed in maps and coordinates that provided rich detail about facts on the ground that were the basis of our response.
I have strong mathematical and linguistic skills. I taught research methods for several years at the Air Force Academy and now coach graduate students through the development and execution of research projects. This requires me to help them use logic and reason to develop methods that will answer their questions. While my graduate degrees are in political science, I am trained as an engineer. My Air Force acquisition assignments fell into the realm of systems engineering, which is defined by bringing logic and reason to problems. Early on, I conducted a safety analysis of the Air Force One wiring system that became the basis for a high-level decision not to retrofit the system because the risk was acceptable. Soon after that, I helped Strategic Air Command develop workable solutions to a problem with isocyanate hazards in missile maintenance facilities. Toward the end of my time in weapons system acquisition, I was in charge of ensuring that the implementation and installation of a new pilot training management system would meet the needs of the Air Force and the country. I spent fall 2004 in Baghdad, where I served as the political strategist for the military coalition. To an even greater extent than other assignments, this work required me to obtain and synthesize a vast amount of information—on militias, the campaign plan, the Iraqi election, a Sunni Arab engagement strategy, and many other topics—and develop succinct summaries and recommendations for command. As one of the most junior officers in the strategy office, I had to rely on tight logic and reason when presenting information that was often not what senior leaders wanted to hear. This work was also conducted in a fairly high-stress environment. A particular strength that sets me apart from others in these areas is my skill at mapping and spatial representation. While it may not translate directly to the work of a commission member, I am very good at understanding geographic relationships. Beyond my comments to public lands management plans, I am a skilled land navigator in the backcountry and have designed and constructed new trail alignments in the forest. Both of those tasks require an agility at abstract manipulation of space to understand how to best create a route, either for the day’s hike or for a trail. Similar abstract manipulations may be helpful in envisioning options for develop legislative districts that serve the interests of the people of Colorado.
cismale


{% extends 'users/users_home.html' %} {% comment %} Copyright 2013, 2014 Ricardo Tubio-Pardavila Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. {% endcomment %} {% load i18n %} {% load staticfiles %} {% block head %} {% endblock %} {% block content %}
The table below permits the visualization of the messages reported in passive mode by any of the groundstations registered with this user.
{{ m.groundstation.identifier }}
{{ m.retrieved }}
{{ m.doppler_shift }}
{{ m.groundstation_timestamp }}
{{ m.message|length }}
{{ m.message }}
(no messages received)


It was a dark and stormy night…
There was a priest, living on Terminus. He didn't much like being a priest, but it paid the bills.
The end.


Kisumu Lakefront Ltd
Docking at Milimani Beach Resort every Friday, Saturday and Sunday
Tel: 0769-331125
Email<EMAIL_ADDRESS>Address: P. O. Box 2009, 40100, Kisumu, Kenya
Website: www.kisumulakefront.com


--- layout: post title: '[iPhone SDK] Avoid target="_blank" problem' categories: - blog tags: - Blog - "開発日記" status: publish type: post published: true meta: {} author: login: sonson email<EMAIL_ADDRESS>display_name: sonson first_name: '' last_name: '' ---
This is @norio_nomura's hack, this is his great work.
In fact, WebView passes "webView:createWebViewWithRequest:" method to UIWebViewWebViewDelegate before the new window opening. It is called for deciding which webview will be used as view to open a next URL. However UIWebView's UIWebViewWebViewDelegate returns nil for "webView:createWebViewWithRequest:" because it isn't implemented, default.
Therefore, to avoid target="_blank" problem, we should implement this method into "
UIWebViewWebViewDelegate" class with dynamic programming style. So, following code.
static id webViewcreateWebViewWithRequestIMP(id self, SEL _cmd, id sender, id request) { return [sender retain]; } + (void)installNewWindowDelegateHook { Class klass = objc_getClass( "UIWebViewWebViewDelegate" ); if( klass == nil ) return; // unfortunately, UIWebViewWebViewDelegate has gone... class_addMethod( klass, @selector(webView:createWebViewWithRequest:), (IMP)webViewcreateWebViewWithRequestIMP, "@@:@@" ); }
Already done!
Thank you, @norio_nomura.


| Figure 1 |
(a) Number of papers based on the three approaches from 1991 ... |
| Figure 2 |
Number of case studies that predicted decrease or increase i ... |
| Figure 3 |
Invader range size responses in percentage at world, large a ... |
| Figure 4 |
Number of case studies predicted to either decrease or incre ... |


Module: Concurrent::Dereferenceable
- Included in:
- Agent, MVar, Obligation, TimerTask
- Defined in:
- lib/concurrent/dereferenceable.rb
Overview
Object references in Ruby are mutable. This can lead to serious problems when
the #value
of a concurrent object is a mutable reference. Which is always the
case unless the value is a Fixnum
, Symbol
, or similar "primitive" data type.
Most classes in this library that expose a #value
getter method do so using the
Dereferenceable
mixin module.
Objects with this mixin can be configured with a few options that can help protect the program from potentially dangerous operations.
:dup_on_deref
when true will call the#dup
method on thevalue
object every time the#value
method is called (default: false):freeze_on_deref
when true will call the#freeze
method on thevalue
object every time the#value
method is called (default: false):copy_on_deref
when given aProc
object theProc
will be run every time the#value
method is called. TheProc
will be given the currentvalue
as its only parameter and the result returned by the block will be the return value of the#value
call. Whennil
this option will be ignored (default: nil)
Instance Method Summary (collapse)
-
- (Object) init_mutex
protected
Initializes the internal
Mutex
. -
- (Mutex) mutex
protected
A mutex lock used for synchronizing thread-safe operations.
-
- (Object) set_deref_options(opts = {})
protected
Set the options which define the operations #value performs before returning data to the caller (dereferencing).
-
- (Object) value
(also: #deref)
Return the value this object represents after applying the options specified by the
#set_deref_options
method. -
- (Object) value=(val)
protected
Set the internal value of this object.
Instance Method Details
- (Object) init_mutex (protected)
This method must be called from within the constructor of the including class.
Initializes the internal Mutex
.
77 78 79 |
# File 'lib/concurrent/dereferenceable.rb', line 77 def init_mutex @mutex = Mutex.new end |
- (Mutex) mutex (protected)
A mutex lock used for synchronizing thread-safe operations. Methods defined
by Dereferenceable
are synchronized using the Mutex
returned from this
method. Operations performed by the including class that operate on the
@value
instance variable should be locked with this Mutex
.
68 69 70 |
# File 'lib/concurrent/dereferenceable.rb', line 68 def mutex @mutex end |
- (Object) set_deref_options(opts = {}) (protected)
Most classes that include this module will call #set_deref_options
Set the options which define the operations #value performs before returning data to the caller (dereferencing).
from within the constructor, thus allowing these options to be set at object creation.
93 94 95 96 97 98 99 100 101 102 |
# File 'lib/concurrent/dereferenceable.rb', line 93 def (opts = {}) mutex.lock @dup_on_deref = opts[:dup_on_deref] || opts[:dup] @freeze_on_deref = opts[:freeze_on_deref] || opts[:freeze] @copy_on_deref = opts[:copy_on_deref] || opts[:copy] @do_nothing_on_deref = !(@dup_on_deref || @freeze_on_deref || @copy_on_deref) nil ensure mutex.unlock end |
- (Object) value Also known as: deref
Return the value this object represents after applying the options specified
by the #set_deref_options
method.
When multiple deref options are set the order of operations is strictly defined. The order of deref operations is:
:copy_on_deref
:dup_on_deref
:freeze_on_deref
Because of this ordering there is no need to #freeze
an object created by a
provided :copy_on_deref
block. Simply set :freeze_on_deref
to true
.
Setting both :dup_on_deref
to true
and :freeze_on_deref
to true
is
as close to the behavior of a "pure" functional language (like Erlang, Clojure,
or Haskell) as we are likely to get in Ruby.
This method is thread-safe and synchronized with the internal #mutex
.
41 42 43 44 45 46 |
# File 'lib/concurrent/dereferenceable.rb', line 41 def value mutex.lock (@value) ensure mutex.unlock end |
- (Object) value=(val) (protected)
Set the internal value of this object
55 56 57 58 59 60 |
# File 'lib/concurrent/dereferenceable.rb', line 55 def value=(val) mutex.lock @value = val ensure mutex.unlock end |


Today's web technologies are evolving at near-light speed, bringing the promise of a seamless Internet ever closer to reality. When users can browse the Web on a three-inch phone screen as easily as on a fifty-inch HDTV, what's a developer to do?
Peter Gasston's The Modern Web will guide you through the latest and most important tools of device-agnostic web development, including HTML5, CSS3, and JavaScript. His plain-English explanations and practical examples emphasize the techniques, principles, and practices that you'll need to easily transcend individual browser quirks and stay relevant as these technologies are updated.
We are in a time of unprecedented innovation on the Web. Not too long ago, one company, Microsoft, dominated the web landscape: in 2003, Internet Explorer was used some 95 percent of computers worldwide. This domination brought the advantage of a stable market for developers, but there was also a serious drawback: Microsoft chose to end nonessential work in IE, and innovation on the Web stagnated - a consequence of a lack of competition and a closed environment.


Spectrum¶
-
class
Data_Reduction.
Spectrum
¶ Bases:
Data_Reduction.Observation
Class for spectra
Methods Summary
freq_to_chan
(bandwidth, n_chans)Returns the channel number where a given frequency is to be found.
get_freq_array
(bandwidth, n_chans)Create an array of frequencies for the channels of a backend
get_num_chans
(linefreq, bandwidth, max_vel_width)compute the base 2 number of output channels for the specified resolution
get_smoothed_bandshape
([degree, poly_order])Do a Gaussian smoothing of the spectrum and then fit a polynomial.
reduce_spectrum_channels
(refval, refpix, delta)Reduce the number of channels in the spectrum.
Methods Documentation
-
freq_to_chan
(bandwidth, n_chans)¶ Returns the channel number where a given frequency is to be found.
:param frequency : frequency of channel in sane units as bandwidth. :type frequency : float
:param bandwidth : upper limit of spectrometer passband :type bandwidth : float
:param n_chans : number of channels in the spectrometer :type n_chans : int
- Returns
channel number (int)
-
get_freq_array
(bandwidth, n_chans)¶ Create an array of frequencies for the channels of a backend
:param bandwidth : bandwidth :type bandwidth : float
:param n_chans : number of channels :type n_chans : int
- Returns
frequency of each channel in same units as bandwidth
-
get_num_chans
(linefreq, bandwidth, max_vel_width)¶ compute the base 2 number of output channels for the specified resolution
-
get_smoothed_bandshape
(degree=None, poly_order=15)¶ Do a Gaussian smoothing of the spectrum and then fit a polynomial. Optionally, the raw and smoothed data and the fitted polynomial can be plotted.
Note
numpy.polyfit(x, y, deg, rcond=None, full=False, w=None, cov=False)
Least squares polynomial fit. Fit a polynomial:p(x) = p[0] * x**deg + ... + p[deg]
of degree deg to points (x, y). Returns a vector of coefficients p that minimises the squared error.
:param spectrum : input data :type spectrum : list of float
:param degree : number of samples to smoothed (Gaussian FWHM) :type degree : int
:param poly_order : order of the polynomial :type poly_order : int
:param plot : plotting option :type plot : boolean
- return
(polynomial_coefficient, smoothed_spectrum)
-
reduce_spectrum_channels
(refval, refpix, delta, num_chan=1024, axis=0)¶ Reduce the number of channels in the spectrum.
The default option is to reduce the spectrum to a specified number of channels with a default of 1024. The input spectrum is presumed to have 2**N channels so that num_chan/num_chan_in is an integer.
If ‘spectrum’ is an N-D array, then the spectrum axis is given by ‘axis’ which defaults to 0.
‘delta’ is negative for lower sideband or reversed double sideband spectra.
:param spectrum : spectrum values :type spectrum : list or nparray
:param refval : X-axis value at the reference pixel of ‘spectrum’ :type refval : float
:param refpix : reference pixel for ‘spectrum’ :type refpix : int
:param delta : interval between pixels on the X-axis :type delta : float
:param num_chan : optional number of channels to be returned (default: 2^10) :type num_chan : int
- Returns
numpy.array
-


Modern JavaScript libraries: the isomorphic way
06 May 2015Algolia's DNA is really about performance. We want our search engine to answer relevant results as fast as possible.
To achieve the best end-to-end performance we've decided to go with JavaScript since the total beginning of Algolia. Our end-users search using our REST API directly from their browser - with JavaScript - without going through the websites' backends.
Our JavaScript & Node.js API clients were implemented 2 years ago and were now lacking of all modern best practices:
- not following the error-first or callback-last conventions;
- inconsistent API between the Node.js and the browser implementations;
- no Promise support;
- Node.js module named algolia-search, browser module named algoliasearch;
- cannot use the same module in Node.js or the browser (obviously);
- browser module could not be used with browserify or webpack. It was exporting multiple properties directly in the window object.
This blog post is a summary of the three main challenges we faced while modernizing our JavaScript client.
tl;dr;
Now the good news: we have a new isomorphic JavaScript API client.
Isomorphic JavaScript apps are JavaScript applications that can run both client-side and server-side.
The backend and frontend share the same code.
Here are the main features of this new API client:
- works in Node.js 0.10, 0.12, iojs and from Internet Explorer 8 up to modern browsers;
- has a Promise + callback API;
- is available at npmjs.com/algoliasearch and on cdn.jsdelivr.net;
- has builds for jQuery, AngularJS and Parse.com;
- is compatible with all module loaders like browserify or webpack;
- is fully tested in all supported environments.
If you were using our previous libraries, we have migration guides for both Node.js and the browser.
Challenge #1: testing
Before being able to merge the Node.js and browser module, we had to remember how the current code is working. An easy way to understand what a code is doing is to read the tests. Unfortunately, in the previous version of the library, we had only one test. One test was not enough to rewrite our library. Let's go testing!
Unit? Integration?
When no tests are written on a library of ~1500+ LOC, what are the tests you should write first?
Unit testing would be too close to the implementation. As we are going to rewrite a lot of code later on, we better not go too far on this road right now.
Here's the flow of our JavaScript library when doing a search:
- initialize the library with
algoliasearch()
- call
index.search('something', callback)
- browser issue an HTTP request
callback(err, content)
From a testing point of view, this can be summarized as:
- input: method call
- output: HTTP request
Integration testing for a JavaScript library doing HTTP calls is interesting but does not scale well.
Indeed, having to reach Algolia servers in each test would introduce a shared testing state amongst developers and continuous integration. It would also have a slow TDD feedback because of heavy network usage.
Our strategy for testing our JavaScript API client was to mock (do not run away right now) the XMLHttpRequest object. This allowed us to test our module as a black box, providing a good base for a complete rewrite later on.
This is not unit testing nor integration testing, but in between. We also planned in the coming weeks on doing a separate full integration testing suite that will go from the browser to our servers.
faux-jax to the rescue
Two serious candidates showed up to help in testing HTTP request based libraries
Unfortunately, none of them met all our requirements. Not to mention, the AlgoliaSearch JavaScript client had a really smart failover request strategy:
- use XMLHttpRequest for browsers supporting CORS,
- or use XDomainRequest for IE < 10,
- or use JSONP in situations where none of the preceding is available.
This seems complex but we really want to be available and compatible with every browser environment.
- Nock works by mocking calls to the Node.js http module, but we directly use the XMLHttpRequest object.
- Sinon.js was doing a good job but was lacking some XDomainRequest feature detections. Also it was really tied to Sinon.js.
As a result, we created algolia/faux-jax. It is now pretty stable and can mock XMLHttpRequest, XDomainRequest and even http module from Node.js. It means faux-jax is an isomorphic HTTP mock testing tool. It was not designed to be isomorphic. It was easy to add the Node.js support thanks to moll/node-mitm.
Testing stack
The testing stack is composed of:
- substack/tape, isomorphic testing and assertion framework
- defunctzombie/zuul, local and continuous integration test runner
- algolia/faux-jax, isomorphic HTTP mocking library
The fun part is done, now onto the tedious one: writing tests.
Spliting tests cases
We divided our tests in two categories:
- simple test cases: check that an API command will generate the corresponding HTTP call
- advanced tests: timeouts, keep-alive, JSONP, request strategy, DNS fallback, ..
Simple test cases
Simple test cases were written as table driven tests:
It's a simple JavaScript file, exporting test cases as an array
Creating a testing stack that understands theses test-cases was some work. But the reward was worth it: the TDD feedback loop is great. Adding a new feature is easy: fire editor, add test, implement annnnnd done.
Advanced tests
Complex test cases like JSONP fallback, timeouts and errors, were handled in separate, more advanced tests:
Here we test that we are using JSONP when XHR fails
Testing workflow
To be able to run our tests we chose defunctzombie/zuul.
Local development
For local development, we have an npm test task that will:
You can see the task in the package.json. Once run it looks like this:
640 passing assertions and counting!
But phantomjs is no real browser so it should not be the only answer to "Is my module working in browsers?". To solve this, we have an npm run dev task that will expose our tests in a simple web server accessible by any browser:
All of theses features are provided by defunctzombie/zuul
Finally, if you have virtual machines, you can test in any browser you want, all locally:
Here's a VirtualBox setup created with xdissent/ievms
What comes next after setting up a good local development workflow? Continuous integration setup!
Continuous integration
defunctzombie/zuul supports running tests using Saucelabs browsers. Saucelabs provides browsers as a service (manual testing or Selenium automation). It also has a nice OSS plan called Opensauce. We patched our .zuul.yml configuration file to specify what browsers we want to test. You can find all the details in zuul's wiki.
Now there's only one missing piece: Travis CI. Travis runs our tests in all browsers defined in our .zuul.yml file. Our travis.yml looks like this:
All platforms are tested using a travis build matrix
Right now tests are taking a bit too long so we will soon split them between desktop and mobile.
We also want to to tests on pull requests using only latest stable versions of all browsers. So that it does not takes too long. As a reward, we get a nice badge to display in our Github readme:
Gray color means the test is currently running
Challenge #2: redesign and rewrite
Once we had a usable testing stack, we started our rewrite, the V3 milestone on Github.
Initialization
We dropped the new AlgoliaSearch() usage in favor of just algoliasearch(). It allows us to hide implementation details to our API users.
Before:
new AlgoliaSearch(applicationID, apiKey, opts);
After:
algoliasearch(applicationID, apiKey, opts);
Callback convention
Our JavaScript client now follows the error- first and callback-last conventions. We had to break some methods to do so.
Before:
client.method(param, callback, param, param);
After:
client.method(params, param, param, params, callback);
This allows our callback lovers to use libraries like caolan/async very easily.
Promises and callbacks support
Promises are a great way to handle the asynchronous flow of your application.
Promise partisan? Callback connoisseur? My API now lets you switch between the two! http://t.co/uPhej2yAwF (thanks @NickColley!)
— pouchdb (@pouchdb) March 10, 2015
We implemented both promises and callbacks, it was nearly a no-brainer. In every command, if you do not provide a callback, you get a Promise. We use native promises in compatible environments and jakearchibald/es6-promise as a polyfill.
AlgoliaSearchHelper removal
The main library was also previously exporting window.AlgoliaSearchHelper to ease the development of awesome search UIs. We externalized this project and it now has now has a new home at algolia/algoliasearch-helper- js.
UMD
UMD: JavaScript modules that run anywhere
The previous version was directly exporting multiple properties in the window object. As we wanted our new library to be easily compatible with a broad range of module loaders, we made it UMD compatible. It means our library can be used:
- with a simple
<script>
, it will export algoliasearch in the window object - using browserify, webpack, requirejs: any module loader
- in Node.js
This was achieved by writing our code in a CommonJS style and then use the standalone build feature of browserify.
see browserify usage
Multiple builds
Our JavaScript client isn't only one build, we have multiple builds:
- vanilla JavaScript using native xhrs and Promises
- jQuery build using jQuery.ajax and returns jQuery promises
- AngularJS build is using $http service and returns AngularJS promises
- Parse.com build is using parse cloud http and promises
- Node.js, iojs are using the http module and native Promises
Previously this was all handled in the main JavaScript file, leading to unsafe code like this:
How do we solve this? Using inheritance! JavaScript prototypal inheritance is the new code smell in 2015. For us it was a good way to share most of the code between our builds. As a result every entry point of our builds are inheriting from the src/AlgoliaSearch.js.
Every build then need to define how to:
- do http request through AlgoliaSearch.prototype._request
- return promises with AlgoliaSearch.prototype._promise
- use a request fallback where needed with AlgoliaSearch.prototype._request.fallback
Using a simple inheritance pattern we were able to solve a great challenge.
Example of the vanilla JavaScript build
Finally, we have a build script that will generate all the needed files for each environment.
Challenge #3: backward compatibility
We could not completely modernize our JavaScript clients while keeping a full backward compatibility between versions. We had to break some of the previous usages to level up our JavaScript stack.
But we also wanted to provide a good experience for our previous users when they wanted to upgrade:
- we re-exported previous constructors like window.AlgoliaSearch. But we now *throw** if it's used
- we wrote a clear migration guide for our existing Node.js and JavaScript users
- we used npm deprecate on our previous Node.js module to inform our current user base that we moved to a new client
- we created legacy branches so that we can continue to push critical updates to previous versions when needed
Make it isomorphic!
Our final step was to make our JavaScript client work in both Node.js and the browser.
Having separated the builds implementation helped us a lot, because the Node.js build is a regular build only using the http module from Node.js.
Then we only had to tell module loaders to load index.js on the server and src/browser/.. in browsers.
This last step was done by configuring browserify in our package.json:
the browser field from browserify also works in webpack
If you are using the algoliasearch module with browserify or webpack, you will get our browser implementation automatically.
The faux-jax library is released under MIT like all our open source projects. Any feedback or improvement idea are welcome, we are dedicated to make our JS client your best friend :)


Public Member Functions | |
Destructor | |
| virtual | ~XMLDocumentHandler () |
The document handler interface | |
| virtual void | docCharacters (const XMLCh *const chars, const XMLSize_t length, const bool cdataSection)=0 |
| Receive notification of character data. | |
| virtual void | docComment (const XMLCh *const comment)=0 |
| Receive notification of comments in the XML content being parsed. | |
| virtual void | docPI (const XMLCh *const target, const XMLCh *const data)=0 |
| Receive notification of PI's parsed in the XML content. | |
| virtual void | endDocument ()=0 |
| Receive notification after the scanner has parsed the end of the document. | |
| virtual void | endElement (const XMLElementDecl &elemDecl, const unsigned int uriId, const bool isRoot, const XMLCh *const prefixName=0)=0 |
| Receive notification of the end of an element. | |
| virtual void | endEntityReference (const XMLEntityDecl &entDecl)=0 |
| Receive notification when a referenced entity's content ends. | |
| virtual void | ignorableWhitespace (const XMLCh *const chars, const XMLSize_t length, const bool cdataSection)=0 |
| Receive notification of ignorable whitespace in element content. | |
| virtual void | resetDocument ()=0 |
| Reset the document handler's state, if required. | |
| virtual void | startDocument ()=0 |
| Receive notification of the start of a new document. | |
| virtual void | startElement (const XMLElementDecl &elemDecl, const unsigned int uriId, const XMLCh *const prefixName, const RefVectorOf< XMLAttr > &attrList, const XMLSize_t attrCount, const bool isEmpty, const bool isRoot)=0 |
| Receive notification of a new start tag. | |
| virtual void | startEntityReference (const XMLEntityDecl &entDecl)=0 |
| Receive notification when the scanner hits an entity reference. | |
| virtual void | XMLDecl (const XMLCh *const versionStr, const XMLCh *const encodingStr, const XMLCh *const standaloneStr, const XMLCh *const autoEncodingStr)=0 |
| Receive notification of an XML declaration. | |
Protected Member Functions | |
| XMLDocumentHandler () |
The interface is very similar to org.sax.DocumentHandler, but has some extra methods required to get all the data out.
| virtual XMLDocumentHandler::~XMLDocumentHandler | ( | ) | [virtual] |
| XMLDocumentHandler::XMLDocumentHandler | ( | ) | [protected] |
| virtual void XMLDocumentHandler::docCharacters | ( | const XMLCh *const | chars, | |
| const XMLSize_t | length, | |||
| const bool | cdataSection | |||
| ) | [pure virtual] |
Receive notification of character data.
The scanner will call this method to report each chunk of character data. The scanner may return all contiguous character data in a single chunk, or they may split it into several chunks; however, all of the characters in any single event will come from the same external entity, so that the Locator provides useful information.
The parser must not attempt to read from the array outside of the specified range.
| chars | The content (characters) between markup from the XML document. | |
| length | The number of characters to read from the array. | |
| cdataSection | Indicates that this data is inside a CDATA section. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::docComment | ( | const XMLCh *const | comment | ) | [pure virtual] |
Receive notification of comments in the XML content being parsed.
This scanner will call this method for any comments found in the content of the document.
| comment | The text of the comment. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::docPI | ( | const XMLCh *const | target, | |
| const XMLCh *const | data | |||
| ) | [pure virtual] |
Receive notification of PI's parsed in the XML content.
The scanner will call this method for any PIs it finds within the content of the document.
| target | The name of the PI. | |
| data | The body of the PI. This may be an empty string since the body is optional. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::endDocument | ( | ) | [pure virtual] |
Receive notification after the scanner has parsed the end of the document.
The scanner will call this method when the current document has been fully parsed. The handler may use this opportunity to do something with the data, clean up temporary data, etc...
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::endElement | ( | const XMLElementDecl & | elemDecl, | |
| const unsigned int | uriId, | |||
| const bool | isRoot, | |||
| const XMLCh *const | prefixName = 0 | |||
| ) | [pure virtual] |
Receive notification of the end of an element.
This method is called when scanner encounters the end of element tag. There will be a corresponding startElement() event for every endElement() event, but not necessarily the other way around. For empty tags, there is only a startElement() call.
| elemDecl | The name of the element whose end tag was just parsed. | |
| uriId | The ID of the URI in the URI pool (only valid if name spaces is enabled) | |
| isRoot | Indicates if this is the root element. | |
| prefixName | The string representing the prefix name |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::endEntityReference | ( | const XMLEntityDecl & | entDecl | ) | [pure virtual] |
Receive notification when a referenced entity's content ends.
This method is called when scanner encounters the end of an entity reference.
| entDecl | The name of the entity reference just scanned. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::ignorableWhitespace | ( | const XMLCh *const | chars, | |
| const XMLSize_t | length, | |||
| const bool | cdataSection | |||
| ) | [pure virtual] |
Receive notification of ignorable whitespace in element content.
Validating Parsers must use this method to report each chunk of ignorable whitespace (see the W3C XML 1.0 recommendation, section 2.10): non-validating parsers may also use this method if they are capable of parsing and using content models.
The scanner may return all contiguous whitespace in a single chunk, or it may split it into several chunks; however, all of the characters in any single event will come from the same external entity, so that the Locator provides useful information.
The parser must not attempt to read from the array outside of the specified range.
| chars | The whitespace characters from the XML document. | |
| length | The number of characters to read from the array. | |
| cdataSection | Indicates that this data is inside a CDATA section. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::resetDocument | ( | ) | [pure virtual] |
Reset the document handler's state, if required.
This method is used to give the registered document handler a chance to reset itself. Its called by the scanner at the start of every parse.
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::startDocument | ( | ) | [pure virtual] |
Receive notification of the start of a new document.
This method is the first callback called the scanner at the start of every parse. This is before any content is parsed.
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::startElement | ( | const XMLElementDecl & | elemDecl, | |
| const unsigned int | uriId, | |||
| const XMLCh *const | prefixName, | |||
| const RefVectorOf< XMLAttr > & | attrList, | |||
| const XMLSize_t | attrCount, | |||
| const bool | isEmpty, | |||
| const bool | isRoot | |||
| ) | [pure virtual] |
Receive notification of a new start tag.
This method is called when scanner encounters the start of an element tag. All elements must always have a startElement() tag. Empty tags will only have the startElement() tag and no endElement() tag.
| elemDecl | The name of the element whose start tag was just parsed. | |
| uriId | The ID of the URI in the URI pool (only valid if name spaces is enabled) | |
| prefixName | The string representing the prefix name | |
| attrList | List of attributes in the element | |
| attrCount | Count of the attributes in the element | |
| isEmpty | Indicates if the element is empty, in which case you should not expect an endElement() event. | |
| isRoot | Indicates if this is the root element. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::startEntityReference | ( | const XMLEntityDecl & | entDecl | ) | [pure virtual] |
Receive notification when the scanner hits an entity reference.
This is currently useful only to DOM parser configurations as SAX does not provide any api to return this information.
| entDecl | The name of the entity that was referenced. |
Implemented in AbstractDOMParser, and SAXParser.
| virtual void XMLDocumentHandler::XMLDecl | ( | const XMLCh *const | versionStr, | |
| const XMLCh *const | encodingStr, | |||
| const XMLCh *const | standaloneStr, | |||
| const XMLCh *const | autoEncodingStr | |||
| ) | [pure virtual] |
Receive notification of an XML declaration.
Currently neither DOM nor SAX provide API's to return back this information.
| versionStr | The value of the version pseudoattribute of the XML decl. | |
| encodingStr | The value of the encoding pseudoattribute of the XML decl. | |
| standaloneStr | The value of the standalone pseudoattribute of the XML decl. | |
| autoEncodingStr | The encoding string auto-detected by the scanner. In absence of any 'encoding' attribute in the XML decl, the XML standard specifies how a parser can auto-detect. If there is no encodingStr this is what will be used to try to decode the file. |
Implemented in AbstractDOMParser, and SAXParser.


Filters
Select country
Cameroon
Ethiopia
Morocco
Mozambique
Uganda
Select a state
Valid
Not valid
Phone Number
unfold_more
Country
unfold_more
Country Code
unfold_more
State
unfold_more
+


Cloud 20°
aaa
{{direction.text}}
November 5, 1955
Wait a minute. Wait a minute, Doc. Uhhh... Are you telling me that you built a time machine... out of a DeLorean?! Whoa. This is heavy.
Chart3
{{card.currentCondition}}


Employee With Custom Client Report
Download CSV
Id
Name
Division
Salary
Suspended
Hired On
1
MOUSTAFA MCMANN
Zany Inventions
30000
0
2010-10-02
2
JIMMY JACKALOPE, JR.
Tedious Toiling
20000
1
2013-01-11
3
ELISE ELDERBERRY
Corporate Malfeasance
99000
0
2013-01-11


Selenium setup is quite different from the setup of other commercial tools. You don’t install a tool using Selenium binaries but rather set up your test automation project to use such binaries in the language of your choice. The Selenium binary you would need depends on the browsers you want to run your tests upon.
If you want to run tests only in a specific browser, you can add the dependency for that browser in your pom.xml file. For example, you should add following dependency in your pom.xml file to run your tests only in Firefox:
<dependency>
<groupId>org.seleniumhq.selenium</groupId>
<artifactId>selenium-firefox-driver</artifactId>
<version>3.X</version>
</dependency>
In a similar manner, if you want to run tests only in Chrome, you should add the following dependency:
<dependency>
<groupId>org.seleniumhq.selenium</groupId>
<artifactId>selenium-chrome-driver</artifactId>
<version>3.X</version>
</dependency>
More often than not you would need to run tests on more than one browser. Hence you would use selenium-java Maven dependency in your project. The selenium-java JAR contains the language bindings and the drivers but not the server side piece.
<dependency>
<groupId>org.seleniumhq.selenium</groupId>
<artifactId>selenium-java</artifactId>
<version>3.X</version>
</dependency>
If you plan to use Selenium Grid then you should download selenium-server-standalone JAR file. Selenium-server-standalone jar is never uploaded, but all the components are available via selenium-server. The standalone JAR contains everything, including the remote Selenium server and the client-side bindings. This means that if you use the selenium-server-standalone jar in your project, then you don't have to add selenium-java or a browser specific jar.


WWW fun roulette
This page randomly selects banners of websites devoted to fun,
humor, games, and entertainment from
the ">TrafficX Exchange
(Sometimes, unrelated sites are mixed in; I am trying to fix it)
I also invite you to visit my collections of the best
humor,
Web Services,
animated backgrounds, and
Frontier and Most intelligent websites of all kinds.
In any case, have fun!
[Please reload the page to see another list of sites]
Please reload the page to see another list of sites!


@(formsUrl: Option[String])
Sorry, the google form is not available at this time. Please check back later.


12 Billion Years and Counting
STS has an unmatched array of options for customers to choose from when selecting their stars.

Here are just a few options available to you as an STS customer:
- Choose from a near infinite amount of pre-existing, unclaimed stars
- Find stars of all types and sizes, from brand new stars to long dead ones
- Request special colors for your stars (don't worry about how that works, just trust us)
- Select special shipping instructions and express shipping to have your order delivered just the way you want
Pricing Information
Generally speaking, pre-made stars will be cheaper than custom-made, though prices may vary depending on availability. In addition, older stars will usually be more expensive than newer ones (unless they are pre-made white or black dwarfs, which are usually left-over stock), and larger stars will also be more expensive than smaller ones. Below is a table to act as a general reference for pricing comparisons, with each representing around $5 billion USD
| Star Type/Age | Base Price | Larger version (Large or extra large) | Custom Ordered | Large and Custom Ordered |
|---|---|---|---|---|
| Standard Star | ||||
| Red Giant | ||||
| Neutron Star | ||||
| White Dwarf | ||||
| Black Dwarf |
What makes us special?
Not only are we one of the oldest star markets out there, we were the first to ever develop techniques to create our own stars. We have perfected our craft throughout the company's long lifetime and we produce stars that are unmatched in both quality and price. If you're interested to see some reviews from past customers and some images of our products, feel free to visit our gallery!


Welcome to the most simple game ever! Please try to avoid hitting the number. The aim is to guess around that number and have that number as the last number standing. As you guess you'll be helped by the range shrinking. This can be fun if you play with others and see who is the one that hits the !


The Best Man (1999) 3 1/2 stars out of 4. Starring Taye Diggs, Nia Long, Morris Chestnut, Sanaa Lathan, Harold Perrineau, Terrence Howard, Monica Calhoun and Melissa De Sousa. Written and directed by Malcolm D. Lee
You know a script is strong and universal when, after seeing a movie, you believe that the story will work with any group of actors of any nationality or ethnicity.
Thus is the case of "The Best Man," an impressive movie debut from writer-director Malcolm D. Lee. And, yes, he's related to that other Lee - Spike.
But nepotism was no factor here.
Malcolm D. Lee has written a romantic comedy that features some very well-defined, likable, but flawed characters.
The set-up for "The Best Man" is simple. Harper Stewart (Taye Diggs) has just learned that his first novel, a fictitious account of his friends and their times together at college, has been chosen to be an Oprah book of the month.
He is headed from Chicago to New York not only to celebrate his success, but to stand as best man to one of his college buddies, Lance (Morris Chestnut).
Unfortunately, Harper also learns that Jordan (Nia Long), another of his college-crowd friends, has obtained an advance copy of the book and that it is making the rounds of all his old gang.
An easy-to-digest premise that could have fallen flat if not handled correctly. But Lee displays a wonderful ear for dialogue and a deft pen for characterization that holds the audience and makes them care about these people.
What is interesting is despite the fact that all the main characters are black, color really is not an issue.
The point is the situations and characters are easily recognizable and are common to the human condition.
The cast works together very smoothly, reacting off each other with the timing and precision of an Army drill team.
Diggs, of course, is one of the sexiest men in movies today. His Harper is a man walking a tightrope, waiting for the shoe to drop as his book is passed from friend to friend, revealing secrets that should have remained buried.
He is a man fearful of commitment. Despite being in a two-year, loving relationship with his girlfriend, Robin (Sanaa Lathan), he cannot take that final step toward marriage.
Long's Jordan is a career-driven woman regretting her one missed opportunity with Harper. She is a goal-oriented, self-assured person who also is not afraid to reveal a vulnerability.
Chestnut's Lance is a God-fearing, Bible-quoting football megastar. His is a character that could have been caricature, but Chestnut fleshes him out, showing not only his strength, but his pride and his weaknesses.
Rounding out the cast are Harold Perrineau, Terrence Howard, Monica Calhoun and Melissa De Sousa. This is the prettiest cast of actors to hit the screen in a long time. Yet their looks do not obscure their finely honed performances.
"The Best Man" is a most enjoyable motion picture, a date movie that will have you laughing as well as bring a tear or two to your eyes.
It is lively, it sparkles and is one of the most life-affirming movies to hit the screen in a long time. "The Best Man" is a gem - treasure it.
Bob Bloom is the movie critic at the Journal and Courier in Lafayette, IN. He can be reached by e-mail at<EMAIL_ADDRESS>or a<EMAIL_ADDRESS>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


Lobbyist Lookup API
Usage
-
Load /api/ with parameters
| Parameter |
Description |
| surname |
Lobbyist surname |
| organization |
Organization name |
| client |
Client name |
-
Results are returned in a JSON array of matching lobbyist organization registration informations.
Source
http://github.com/ansonl/lobbyist-lookup


Peyman Firouzi Naeim Ph.D. Economics
|
|
I am a research fellow in the department of Economics at the University of New South Wales (UNSW) and the ARC Centre for Excellence in Population Ageing Research (CEPAR), working with Professor Michael Keane.
My work is at the intersection of labor economics and public economics.
Address: 223 Anzac Parade, South Wing, Level 3 Kensington NSW 2033 Tel: +61 (41) 111 2717 +1<PHONE_NUMBER> Email<EMAIL_ADDRESS><EMAIL_ADDRESS>|
|


"NEW TESTAMENT "(Luke 22:20), rather “New Covenant,” in contrast to the old covenant of works, which is superseded. “The covenant of grace is called new; it succeeds to the old broken covenant of works. It is ever fresh, flourishing, and excellent; and under the gospel it is dispensed in a more clear, spiritual, extensive, and powerful manner than of old” (Brown of Haddington). Hence is derived the name given to the latter portion of the Bible. (See TESTAMENT.)
"NEW TESTAMENT "(Luke 22:20), rather “New Covenant,” in contrast to the old covenant of works, which is superseded. “The covenant of grace is called new; it succeeds to the old broken covenant of works. It is ever fresh, flourishing, and excellent; and under the gospel it is dispensed in a more clear, spiritual, extensive, and powerful manner than of old” (Brown of Haddington). Hence is derived the name given to the latter portion of the Bible. (See TESTAMENT.)


The GUI of the WSO2 Carbon facilitates the management and control of user accounts and roles at different levels. The key functionalities of this component include:
Figure 1: User/Role Management
Any user who has login permission can change their password by clicking on "Change My Password" link. It will require the current password inorder to change it. If you have forgotten your current password please contact your administrator who can reset it without the current password.
Users link is only visible to users with "admin" permission. Refer the context sensitive help available on Users page to add new user accounts, modify existing accounts, or delete existing accounts.
Roles link is only visible to users with "admin" permission. Refer the context sensitive help available on Roles page to add new roles, modify roles and their permissions.


{# Speed up automatic testing by skipping the loading of CSS resources #} {% if not testing_skip_css %} {% endif %}


Black to Play 14
b0-w0/5
pips Black=132 White=136
(CorrectAnswer= 0/0, ErrorScore= 0)
1. 8/4* 5/4 Eq.: 0.201 0.7% 22.4% 50.8% 49.2% 11.9% 0.8% 2. 8/4* 8/7 Eq.: 0.133 (-0.068) 0.6% 19.6% 50.1% 49.9% 11.4% 0.7% 3. 22/21 8/4* Eq.: 0.127 (-0.074) 0.7% 20.9% 49.3% 50.7% 12.3% 0.8% 4. 8/4* 6/5 Eq.: 0.116 (-0.085) 0.6% 20.7% 49.1% 50.9% 11.9% 0.8% 5. 24/23 8/4* Eq.: 0.111 (-0.090) 0.6% 20.4% 48.9% 51.1% 12.2% 0.7% 6. 8/4*/3 Eq.: 0.104 (-0.097) 0.6% 20.1% 49.0% 51.0% 11.6% 0.7%


Login with HopeLine
Email address
Password
Remember me
Forgot Password
Sign in
Login as Guest
Sign-up


|
|
CS229
Machine Learning
Autumn 2016
|
[09/25/16] Welcome to CS229! We look forward to meeting you tomorrow at 9:30 AM!
[09/27/16] The venue for Friday discussion sections has been changed.
The sections will be held in Gates B01 from 4:30 PM to 5:20 PM. They will be recorded and attendance is optional
[09/27/16] Non-SCPD students can watch the recorded videos here
[09/28/16] Problem Set 0 has been posted and is due on 10/5 at 11:00 AM. This assignment is not graded, but we encourage you to try the Gradescope submission proces
[09/29/16] Assignments will be submitted through Gradescope. Sign up for the course using entry code 9GK339
[09/29/16] Please join the course Piazza forum for fastest access to all course announcements
[09/29/16] Check the Project FAQs page for common project related queries
[10/03/16] If you are unable to take the midterm on November 9th due of some emergency, please email us at<EMAIL_ADDRESS>by October 14. State the reason and available times (as wide a range as possible) for the alternative midterm.
[10/05/16] Problem Set 1 has been posted on the materials page. It is due on 10/19 at 11:00 AM.
[10/05/16] Solutions to Problem Set 0 have been posted on the materials page.
[10/12/16] Checkout project ideas and suggestions from shared with us by research groups/professors/phd students/postdocs from various departments here
[10/19/16] Problem Set 2 has been posted on the materials page. It is due on 11/02 at 11:00 AM.
[10/19/16] Prof. John Duchi holds office hours between 11:00 AM and 12:00 PM on Wednesdays after the class in his office @ Sequoia 126
[10/24/16] Solutions to Problem Set 1 have been posted on the materials page.
[10/26/16] Practice Midterms have been posted on the materials page.
[10/26/16] Poster session will be held at Arrillaga Center for Sports and Recreation (ACSR) on December 13, 2016 from 8:30 AM to 11:30 AM
[11/02/16] Problem Set 3 has been posted on the materials page. It is due on 11/16 at 11:00 AM.
[11/02/16] Please check the updated midterm information on the course information page!
[11/02/16] Prof. John Duchi will hold his office hours in Packard 277 from November 9, 2016 from 11:00 AM to 12:00 PM
[11/16/16] Problem Set 4 has been posted on the materials page. It is due on 12/07 at 11:00 AM.
Unless otherwise noted, all items are posted on the
materials section of the website.
Instructors:
Andrew Ng, John Duchi
Lectures:
3-4 units. MW 9:30 AM - 10:50 AM,
NVIDIA Auditorium
(Huang Engineering Center)
Discussion sections: Fridays, 4:30 PM - 5:20 PM,
Gates B01 (recorded, optional attendance)
Email address:
If you are enrolled in 229 at Stanford and have a question, for you to
get a response quickly we strongly encourage you to post it on
our Piazza
forum. For private matters, please make a private note visible only to the course instructors. If Piazza does not work, you can also email the course staff at<EMAIL_ADDRESS>Information and Handouts:
- Course Information
- Syllabus and Course Schedule
- Handouts and Materials
- Office Hours
- Project Ideas 2016
- Recent years' projects:
2016,
2016 spring,
2015,
2014,
2013,
2012,
2011,
2010,
2009,
2008,
2007,
2006,
2005,
2004.
- Frequently Asked Questions
- Project FAQs


To Do List
Search Friend
Feeding cat
Truss a turkey
Sleep
Play List
Learn Blurbs Framework with rubi
Learn Math Cos & Tan With ruby
Django Tutorial
Learn IBM RPG IV
Learn Mikrotik with tobu
Rubi
lorem ipsum ne!
Jack Spears
Toteli owsom


Lotto
问题描述 :
In the German Lotto you have to select 6 numbers from the set {1,2,…,49}. A popular strategy to play Lotto – although it doesn’t increase your chance of winning – is to select a subset S containing k (k > 6) of these 49 numbers, and then play several games with choosing numbers only from S. For example, for k=8 and S = {1,2,3,5,8,13,21,34} there are 28 possible games: [1,2,3,5,8,13], [1,2,3,5,8,21], [1,2,3,5,8,34], [1,2,3,5,13,21], … [3,5,8,13,21,34].
Your job is to write a program that reads in the number k and the set S and then prints all possible games choosing numbers only from S.
输入:
The input will contain one or more test cases. Each test case consists of one line containing several integers separated from each other by spaces. The first integer on the line will be the number k (6 < k < 13). Then k integers, specifying the set S, will follow in ascending order. Input will be terminated by a value of zero (0) for k.
输出:
For each test case, print all possible games, each game on one line. The numbers of each game have to be sorted in ascending order and separated from each other by exactly one space. The games themselves have to be sorted lexicographically, that means sorted by the lowest number first, then by the second lowest and so on, as demonstrated in the sample output below. The test cases have to be separated from each other by exactly one blank line. Do not put a blank line after the last test case.
样例输入:
7 1 2 3 4 5 6 7 8 1 2 3 5 8 13 21 34 0
样例输出:
1 2 3 4 5 6 1 2 3 4 5 7 1 2 3 4 6 7 1 2 3 5 6 7 1 2 4 5 6 7 1 3 4 5 6 7 2 3 4 5 6 7 1 2 3 5 8 13 1 2 3 5 8 21 1 2 3 5 8 34 1 2 3 5 13 21 1 2 3 5 13 34 1 2 3 5 21 34 1 2 3 8 13 21 1 2 3 8 13 34 1 2 3 8 21 34 1 2 3 13 21 34 1 2 5 8 13 21 1 2 5 8 13 34 1 2 5 8 21 34 1 2 5 13 21 34 1 2 8 13 21 34 1 3 5 8 13 21 1 3 5 8 13 34 1 3 5 8 21 34 1 3 5 13 21 34 1 3 8 13 21 34 1 5 8 13 21 34 2 3 5 8 13 21 2 3 5 8 13 34 2 3 5 8 21 34 2 3 5 13 21 34 2 3 8 13 21 34 2 5 8 13 21 34 3 5 8 13 21 34
解题代码:
//* @author<EMAIL_ADDRESS>import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int count=0; while(true) { count++; if(count!=1) System.out.println(); int a=in.nextInt(); if(a==0) break; int[] b=new int[a]; for(int i=0;i< a;i++) b[i]=in.nextInt(); for(int a1=0;a1< a-5;a1++) for(int a2=a1+1;a2< a-4;a2++) for(int a3=a2+1;a3< a-3;a3++) for(int a4=a3+1;a4< a-2;a4++) for(int a5=a4+1;a5< a-1;a5++) for(int a6=a5+1; a6< a; a6++){ System.out.println(b[a1]+" "+b[a2]+" "+b[a3]+" "+b[a4]+" "+b[a5]+" "+b[a6]); } } } }
(adsbygoogle = window.adsbygoogle || []).push({});
终于AC了！next数组还是不好理解啊，mark
很高兴你会喜欢这个网站。目前还没有一个开发团队，网站是我一个人在维护，都是用的开源系统，也没有太多需要开发的部分，主要是内容整理。非常感谢你的关注。
,,,,,,,,,,,,,,,
大致看了下，算法的时间复杂度没有很本性的提升，算不上高效。
有意思，有难度
妈呀！这个Dijkstra模板好长OwQ！


No-one performs like Thomas and Trippier
by BeSoccer'Bleacher Report' has highlighted the high quality of two Atletico Madrid men. Kieran Trippier and Thomas have improved considerably in their performances with respect to last season. Only Harit and Smalling have improved more.
Trippier has done well to disembark to Atletico Madrid, there is no doubt about it.
Thomas, on his part, was already at the club, but this season he is having some great performances. His performances on the pitch are improving by the minute.
Featured links
- Ballon d'Or winner already been decided
- The latest football transfers news and rumours
- Possible 'Clasico' in the Spanish Supercup final
- Who has the most free-kicks goals: Messi or Cristiano?
Thomas and Trippier's good work has led them to be on 'Bleacher Report's list of the players who have improved their performance the most this year. They are third and fourth respectively. Just ahead are Harit, of Schalke 04 in first place, and Smalling, a Roma player who remains in second place.
This publication explains the possible causes of Trippier's great performances. "The first evidences suggest that he needed a change. His level has increased drastically. He has returned to being the danger that he was again and has honed himself unto Simeone's teachings. It's in his environment," 'Bleacher Report' stated.
In Thomas' case, there is no trick: his effort and perseverance have made him a key player in Atletico's team. "The Ghanaian is an absolute triumph of work. He has been with Atletico since 2012, waiting for his moment. Now at last, he has got it. His touch and passes give confidence. His ability to change the point of attack and enable the wings is impressive," the publication concludes.


Toggle navigation
March
Home
My Blog
Create a Blog
Login
(
Forbidden
Admin
)
Admin
My profile
Log out


Prestress¶
prestress_cables¶
-
actions.prestress.prestress_cables.
post_stress_elem_line
(preprocessor, tag_line, tension)¶ Introduces a post-tension on the elements in a line
Parameters: - preprocessor – preprocessor
- tag_line – line number
- tension – tension value
-
actions.prestress.prestress_cables.
pre_stress_elem_line
(preprocessor, tag_line, tension)¶ Introduces a prestressing tension on the elements in a line
Parameters: - preprocessor – preprocessor
- tag_line – line number
- tension – tension value
-
actions.prestress.prestress_cables.
re_stress_elem_lines
(set_lines, umbral, tension)¶


lingvo.core.py_utils module¶
Common utilities.
-
lingvo.core.py_utils.
CheckNumerics
(inp, message=None, *args, **kwargs)[source]¶ Check numerics for tensors in inp.
-
lingvo.core.py_utils.
HasRank
(tensor, expected_rank)[source]¶ Syntactic sugar for asserting that tensor has the expected rank.
-
lingvo.core.py_utils.
HasShape
(tensor, expected_shape)[source]¶ Syntactic sugar for asserting that tensor has the expected shape.
-
lingvo.core.py_utils.
GetShape
(tensor, ndims=None)[source]¶ Returns tensor’s shape as a list which can be unpacked, unlike tf.shape.
Tries to return static shape if it’s available. Note that this means some of the outputs will be ints while the rest will be Tensors.
Parameters: - tensor – The input tensor.
- ndims – If not None, returns the shapes for the first
ndims
dimensions.
-
lingvo.core.py_utils.
SessionConfig
(soft_placement=True, inline=True)[source]¶ Returns a session config proto.
Parameters: - soft_placement – Turns allow_soft_placement on iff True.
- inline – Turns do_function_inlining on iff True.
Returns: A TF session config proto.
-
class
lingvo.core.py_utils.
NestedMap
(*args, **kwargs)[source]¶ Bases:
dict
A simpler helper to maintain a dict.
E.g.:
>>> foo = NestedMap() >>> foo['x'] = 10 >>> foo.y = 20 >>> assert foo.x * 2 == foo.y
-
_HAS_DYNAMIC_ATTRIBUTES
= True¶
-
FlattenItems
()[source]¶ Flatten the nested map and returns <key, value> pairs in a list.
Returns: A list of <key, value> pairs, where keys for nested entries will be represented in the form of foo.bar
.
-
-
class
lingvo.core.py_utils.
_Unique
[source]¶ Bases:
object
A helper to uniqify variables in a NestedMap.
-
lingvo.core.py_utils.
ToUniqueList
(nmap)[source]¶ Returns the flattened
nmap
with duplicates removed.
-
lingvo.core.py_utils.
ReadOnlyAttrDictView
(backing)[source]¶ Wraps a dict to provide a read-only view of its contents.
Dict keys can also be accessed by attribute.
Parameters: backing – Dict-like object to wrap. Returns: Read-only Mapping that can be accessed by index ([‘foo’]) or attr (d.foo).
-
class
lingvo.core.py_utils.
WeightInit
[source]¶ Bases:
object
Static class providing weight initialization config params.
-
static
Xavier
(scale=1.0, seed=None)[source]¶ Xavier initialization (x = sqrt(6. / (in + out)); [-x, x]).
-
static
UniformSqrtDim
(scale=1.0, seed=None)[source]¶ scale * tf.uniform(-1 / sqrt(dim0), 1 / sqrt(dim0)).
-
static
-
lingvo.core.py_utils.
WeightParams
(shape, init=None, dtype=None, collections=None)[source]¶ Returns a hyperparams for a weight variable given the shape/init/dtype.
-
lingvo.core.py_utils.
FindNeeded
(endpoints)[source]¶ List names of tensors and operations required to compute endpoints.
-
lingvo.core.py_utils.
FindNeededInList
(tensor_list, endpoints)[source]¶ Return tensors from tensor_list needed to compute any of endpoints.
-
class
lingvo.core.py_utils.
_CollectionGetter
(key, default_factory)[source]¶ Bases:
object
Get graph local value from a defined collection.
-
lingvo.core.py_utils.
VariableRenameScope
(*args, **kwds)[source]¶ Append the renaming rules to the stack of renames.
Parameters: renames – pairs of (regexp, new_name_format). If the regexp matches, the new_name_format will be interpolated using the matched groups. Yields: scope in which the renaming rules are applied
-
lingvo.core.py_utils.
GetVariableName
(name)[source]¶ Get variable name after application of all renaming rules.
Parameters: name – untransformed variable name with scope_name prepended Returns: name possibly modified using renaming rules
-
lingvo.core.py_utils.
CreateVariable
(name, params, reuse=None, trainable=True, init_wrapper=None, collections=None)[source]¶ Creates tf.Variable according to param_config.
Parameters: - name – A string, name of the variable.
- params – A WeightParams specifying the details of how this variable should be constructed and initialized.
- reuse – Whether or not to reuse an existing variable. It has the same semantics as the reuse arg in tf.variable_scope.
- trainable – Whether or not the variable is trainable.
- init_wrapper – a callback which takes a tf initializer callable and returns a tensor. It is used when shape of the variable isn’t statically determinable.
- collections – Override the default variable collection ( tf.GraphKeys.GLOBAL_VARIABLES).
Returns: tf.identity(var), var pair. The tf.identity() node is colocated with var.
-
lingvo.core.py_utils.
CreateTaskGlobalStep
(params, task_name)[source]¶ Create if needed and return the global_step.
-
lingvo.core.py_utils.
_LogPlacement
(label, theta, copy)[source]¶ Logs theta and its copy’s device placement.
-
lingvo.core.py_utils.
CreateLocalTheta
(theta, device_list=None, label=None)[source]¶ Creates local copy of theta and shards across devices device list.
Leaves variables intact.
Parameters: - theta – a NestedMap of variables.
- device_list – list of devices to shard across. If None, defaults to a list [‘’].
- label – Logging label.
Returns: A
NestedMap
of identity() wrapped theta
-
lingvo.core.py_utils.
_GetVarsToLoad
(all_vars, variable_loading_rules, var_ignore_rules)[source]¶ Determines variables to load and their names in checkpoint.
-
lingvo.core.py_utils.
_OverrideVarsFromCheckpoint
(sess, all_vars, checkpoint_path, variable_loading_rules, var_ignore_rules)[source]¶ Overrides variables from a provided checkpoint.
-
lingvo.core.py_utils.
OverrideVarsFromCheckpoints
(session, all_vars, ckpts_loading_rules)[source]¶ Overrides model variables from checkpoints.
Parameters: - session – Tensorflow session.
- all_vars – List of all the parameters in the model.
- ckpts_loading_rules – A dictionary of checkpoint path: loading rules. Checkpoint path must be a path to a pretrained model, and loading rules is expected to be a tuple of two lists: the first consisting of tuples of strings defining (regex to match parameter names in the model to override, format string to determine the corresponding var in the checkpoint), and the second list consisting of a list of regexes to match parameter names in the model which should not be overridden, even if they match those in the loading rules.
Raises: ValueError
– if colliding vars exist or loading rules is not a list.
-
lingvo.core.py_utils.
_ComputeGradientsTpu
(loss, all_vars)[source]¶ Computes gradients for local loss across whole TPU cluster.
-
lingvo.core.py_utils.
ComputeGradients
(loss, vmap)[source]¶ Computes gradients of variables in vmap w.r.t. to loss.
Parameters: - loss – A scalar Tensor.
- vmap – A
NestedMap
of variables.
Returns: var_grad - a NestedMap of (variable, gradient). You can view var_grad as an ordered list of (key, (var, grad)) tuples. Every key of var_grad exists in vmap. Every variable in vmap that contributes to loss must exist in var_grad. Every var of var_grad must exist in vmap. grad is the corresponding gradient computed for var. grad is guaranteed to be not None.
-
lingvo.core.py_utils.
ApplyGradMultiplier
(vs_gs_scale, grad_scale=None)[source]¶ Scale gradients by grad_scale on same device as corresponding variables.
Parameters: - vs_gs_scale – A
NestedMap
of (variable, gradient, scale). - grad_scale – If None, each vs_gs entry has the scale. Otherwise, grad_scale applies to every entry.
Returns: A
NestedMap
of (variable, gradient * grad_scale). In particular, if grad_scale is 0, the result gradient is always 0, even if the input gradient is inf or nan.- vs_gs_scale – A
-
lingvo.core.py_utils.
AdjustGradientsWithL2Loss
(var_grads, l2_regularizer_weight)[source]¶ Adjusts the map of (var, grad) with L2 regularization.
Parameters: - var_grads – a NestedMap of (variable, gradient).
- l2_regularizer_weight – L2 regularization weight.
Returns: A tuple (l2_loss, var_grads).
- l2_loss: A scalar. The l2 loss.
- var_grads: a NestedMap of (variable, gradient) regulated by L2.
-
lingvo.core.py_utils.
SplitRecursively
(x, num_splits, axis=-1)[source]¶ Splits Tensors in ‘x’ recursively.
Parameters: - x – a Tensor, or a list or NestMap containing Tensors to split.
- num_splits – number of splits per Tensor.
- axis – the split axis.
Returns: A list of split values of length ‘num_splits’.
- If ‘x’ is a Tensor, a list of split Tensors.
- If ‘x’ is a list, a list of lists, where each sublist has the same length as ‘x’ and the k’th element in each sublist corresponds to a split of the k’th element from ‘x’.
- If ‘x’ is a NestedMap, a list of
NestedMap
, where each field corresponds to a split from the same field of ‘x’.
-
lingvo.core.py_utils.
ConcatRecursively
(splits, axis=-1)[source]¶ Concatenates tensors from ‘splits’.
This is the inverse function of SplitRecursively.
Parameters: Returns: Concatenated data.
- If input ‘splits’ are Tensors, returns a concatenated Tensor.
- If input ‘splits’ are lists, returns a list of the same length where the k’th element represents concatenated data of the k’th element from each split.
- If input ‘splits’ are
NestedMap
, returns a NestedMap with each field concatenated from corresponding fields of input splits.
Raises: TypeError
– if ‘splits’ is not a list or elements of ‘splits’ do not have known or matching types.ValueError
– if ‘splits’ is empty or elements of ‘splits’ do not have matching structures.
-
lingvo.core.py_utils.
AddToPruningCollections
(weight, mask, threshold)[source]¶ Add mask, threshold, and weight vars to their respective collections.
-
lingvo.core.py_utils.
WeightedAvg
(values, weights, sum_reduction_fn=<function reduce_sum>)[source]¶ Computes weighted average of values from a tensor.
Parameters: - values – a tensor of values
- weights – a tensor of weights
- sum_reduction_fn – called to reduce the values and weights to single value.
Returns: A tuple (avg, total_weight).
- avg: weighted average value
- total_weight: sum of all weights
-
lingvo.core.py_utils.
WeightedAvgOfMetrics
(metrics)[source]¶ Computes the weighted average of metrics in the list.
Parameters: metrics – list of dictionaries of metrics Returns: ret_dict - dictionary of weighted averages of each metrics.
-
lingvo.core.py_utils.
CombineMetrics
(loss_metric_weight_pairs)[source]¶ Combines metrics from
loss_metric_weight_pairs
according to weights.Keys must either exist in all metrics, in which it will be processed as a weighted sum, or exist in only one metrics, in which case it will be copied.
Parameters: loss_metric_weight_pairs – a list of (metrics, weight) pairs, where each weight is a float and each metrics is a dict with str keys and (metric_value, target_weight) values. Returns: A dict with the same set of keys as input metrics and values of (weighted_sum(metric_value), weighted_sum(target_weight)). Raises: ValueError
– if there exists a metric that exists in more than one element ofloss_metric_weight_pairs
but not in all of them.
-
lingvo.core.py_utils.
AddGlobalVN
(params, weights)[source]¶ Adds variational noise to weights if specified by params.
-
lingvo.core.py_utils.
AddPerStepVN
(params, weights, step=None)[source]¶ Adds per-setp variational noise to weights if specified by params.
-
lingvo.core.py_utils.
VariationalNoiseParams
(scale, global_vn=False, per_step_vn=False, seed=None)[source]¶ Returns a hyperparams for variational noise.
-
lingvo.core.py_utils.
ResetStepSeed
(graph=None, seed=0)[source]¶ Resets step_seed to specified value.
-
lingvo.core.py_utils.
GetOpSeedPair
(op_seed=None, graph=None)[source]¶ Returns the seed pair for an operation given op_seed.
-
lingvo.core.py_utils.
DeterministicDropout
(x, keep_prob, seeds, name=None)[source]¶ Similar to
tf.nn.dropout()
, but fully deterministic.Parameters: - x – A float Tensor on which to apply dropout.
- keep_prob – A scalar of keep probability.
- seeds – A Tensor of shape [2]. 2 seeds for deterministic random number generator.
- name – An optional name for this operation.
Returns: A Tensor with the same shape as
x
.Raises: InvalidArgumentError
– if keep_prob is invalid.
-
lingvo.core.py_utils.
UpdateBatchNormVars
(batch_norm_var, batch_norm_stats, decay)[source]¶ Update batch normalization moving averages.
-
lingvo.core.py_utils.
FindRelevantBatchNormUpdates
(loss, batch_norm_updates)[source]¶ Finds and returns a list of relevant batch-normalization updates.
Parameters: - loss – The loss that is being optimized for.
- batch_norm_updates – A list of batch normalization updates.
Returns: A pair of lists. The first list contains all the batch normalization updates that are relevant to the loss being optimized, and the second list contains all in batch_norm_updates but not in the first list.
-
lingvo.core.py_utils.
SampleStep
(*args, **kwds)[source]¶ A context for a sample step during decoding.
Example usage:
with py_utils.SampleStep(step): sample = self.DecodeOneStep()
Parameters: step – the step tensor. Yields: a context manager for the step scope.
-
lingvo.core.py_utils.
AddDebugTensor
(tensor, summarize=None, name=None)[source]¶ Adds
tensor
to the debug collection.Prints the tensor if
--print_debug_tensors
is True.Parameters: - tensor – A tensor.
- summarize – Only print this many entries of each tensor. If None, then a maximum of 3 elements are printed per input tensor.
- name – An optional name for the tensor.
Returns: A Tensor that evaluates to the same value as the input tensor.
-
lingvo.core.py_utils.
ArgMax
(inputs)[source]¶ tf.argmax wrapper.
Parameters: inputs – A tensor, whose last dimension is being reduced on. Returns: A tensor of rank tf.rank(logits)-1. If i == ret[indices], logits[indices, i] is the maximum among logits[indices, :].
-
lingvo.core.py_utils.
Matmul
(x, y, *args, **kwargs)[source]¶ tf.matmul wrapper expecting x and y are actually matrices.
-
lingvo.core.py_utils.
PiecewiseConstant
(x_in, boundaries, values, vdtype)[source]¶ Returns the piecewise value of x_in.
-
lingvo.core.py_utils.
PadSequenceDimension
(x, length, pad_val, shape=None)[source]¶ Pads x to
length
usingpad_val
along the second dim.Assumes
x
is a tensor with rank >= 2, and it only padsx
tolength
along the second dim. Explicitly sets the returned tensor shape toshape
if given. Raises runtime errors if x.shape[1] > length or x.shape[i] != shape[i] where i != 1.Parameters: - x – the tensor to be padded with shape [batch, seq_len, …].
- length – an int to specify the length to pad x to.
- pad_val – an int or float used to pad x.
- shape – an int array specifying the shape of the padded tensor if specified.
Returns: The padded tensor with shape [batch, seq_len, …], where ret[:, :seq_len, …] == x.
-
lingvo.core.py_utils.
ApplyPadding
(padding, x, padded=None, broadcast=True)[source]¶ Applies padding to a tensor.
This is preferable to using arithmetic means for masking out padded values such as:
# Equiv to ApplyPadding(padding, x)) x *= 1.0 - padding # Equiv to ApplyPadding(padding, new, old) new = old * padding + new * (1 - padding)
Aside from just being easier to read and reason about, using this function is friendly to quantized representations because it does not mix arithmetic on the padding values with the values in the tensor being padded (which can have a very different range than the 0..1 padding tensor).
In addition, this works around issues in quantized schemes where we are guaranteed to have an exact 0 but not necessarily any other number (i.e. 1).
Parameters: - padding – Tensor of padding values where 0 == keep and 1 == pad.
- x – Tensor to apply padding to.
- padded – Optional. Values to include for padded elements. Defaults to zeros. Must be the same shape as ‘x’ if specified.
- broadcast – Whether to broadcast the padding shape to the shape of ‘x’. You almost certainly want this to be true as it matches how padding would be expanded if applied arithmetically.
Returns: A tensor with the same shape as x with padded values masked.
-
lingvo.core.py_utils.
PadOrTrimTo
(x, shape)[source]¶ Pad and slice x to the given shape.
Parameters: - x – A tensor.
- shape – The shape of the returned tensor.
Returns: ‘x’ is padded with zeros and sliced so that the result has the given shape.
-
lingvo.core.py_utils.
StackTensorsRecursively
(values)[source]¶ Recursively stacks Tensors in a list of
NestedMap
.Parameters: values – a list of NestedMap
or Tensors to stacks.Returns: A NestedMap
with stacked values or a stacked Tensor.
-
lingvo.core.py_utils.
MixByWeight
(inputs_with_weights)[source]¶ Returns a weighted random choice from the give inputs.
Parameters: inputs_with_weights – a list of (fn, weight) pairs, where each fn returns a tf.Tensor or a nested structure containing tf.Tensor and weight is a float > 0. Function return types must be consistent across elements. The tf.Operation to compute the result tensor will only be invoked for one input at a time. For example, if each fn represents an input record stream, a record will be drawn only from a selected stream while the other streams will remain unchanged. Returns: A probablistic sample from the inputs proportional to the weights. The return type will be the same as return type of individual ‘fn’ from the inputs.
-
lingvo.core.py_utils.
CheckShapes
(shapes)[source]¶ Asserts that shapes is a tuple of fully defined tf.TensorShape.


--- layout: post title: "The Business of Ed-Tech: August 2017 Funding Data" date: 2017-09-01 13:55:00 +0000 tags: image: https://s3.amazonaws.com/hackedu/2017-03-01-money.jpg imagecredits: https://www.flickr.com/photos/chrisdlugosz/3403776466 ---
Here is the latest data on “the business of ed-tech” for August 2017:
The amount of money invested so far this year remains higher than at the same time in 2016 and 2015. (Indeed, the amount invested so far this year has now surpassed the total raised in 2016.) But the number of investment deals has fallen. That is to say, the funding total for the year is being driven by a small number of very large investments – there have been nine of $100 million or more.
Acquisitions are also down from previous years – only 56 so far this year compared to 77 this time last year and 71 the year before.
The types of companies that seem popular with investors include:
The companies that have raised the most money so far this year:
I have created separate GitHub repositories for all areas of funding that I monitor:
These sites include human- and machine-readable versions of this funding data. For more ed-tech data sets, visit Hack Education Data on GitHub.
If you see an error or omission, please file a GitHub issue. You’re welcome to fork or download the repositories too, of course.


{% extends 'main_app/common.html' %} {% load static %} {% block content %}
Are you sure you want to permanently remove {{item}} contact ?


- raiseException(UQI, PSException) - Method in class io.github.privacystreams.core.Function
-
- range(String) - Static method in class io.github.privacystreams.commons.list.ListOperators
-
Calculate the range of the numbers specified by a field.
- range(String) - Static method in class io.github.privacystreams.commons.statistic.StatisticOperators
-
Calculate the range of the number values of a field in the stream.
- range(List<T>) - Static method in class io.github.privacystreams.utils.StatisticUtils
-
Get the range of all numbers in the list.
- recent(String, Long) - Static method in class io.github.privacystreams.commons.time.TimeOperators
-
Check whether the timestamp field value of a field is recent from now (less than a given duration).
- record(long) - Static method in class io.github.privacystreams.audio.Audio
-
Provide an Audio item.
- recordPeriodic(long, long) - Static method in class io.github.privacystreams.audio.Audio
-
Provide a live stream of Audio items.
- Reducers - Class in io.github.privacystreams.core.transformations.reduce
-
A helper class to access reducer functions
- Reducers() - Constructor for class io.github.privacystreams.core.transformations.reduce.Reducers
-
- register(Function<? extends Stream, ?>) - Method in class io.github.privacystreams.core.Stream
-
Register a function to current stream.
- RelativeHumidity - Class in io.github.privacystreams.sensor
-
Ambient relative humidity sensor.
- removeFromWaitingList(UQI, Set<String>) - Static method in class io.github.privacystreams.utils.DropboxUtils
-
- Reorders - Class in io.github.privacystreams.core.transformations.reorder
-
A helper class to access reorder functions.
- Reorders() - Constructor for class io.github.privacystreams.core.transformations.reorder.Reorders
-
- replace(String, String, String) - Static method in class io.github.privacystreams.commons.string.StringOperators
-
Replace a substring to a new string in the string value of a field.
- REQUEST_CODE - Static variable in class io.github.privacystreams.utils.PSPermissionActivity
-
- requestPermissionAndEvaluate(UQI, Function<Void, Void>) - Static method in class io.github.privacystreams.utils.PermissionUtils
-
try request permission and evaluate UQI
- RESEARCH(String) - Static method in class io.github.privacystreams.core.purposes.Purpose
-
Research purpose.
- reuse(int) - Method in class io.github.privacystreams.core.PStream
-
Reuse current stream.
- reuse(int) - Method in class io.github.privacystreams.core.Stream
-
- reverse() - Method in class io.github.privacystreams.core.PStream
-
Reverse the order of items
`reverse()` will reverse the order of the items in the stream.
- reverse() - Static method in class io.github.privacystreams.core.transformations.reorder.Reorders
-
Reverse the order of the items in stream.
- rms(String) - Static method in class io.github.privacystreams.commons.list.ListOperators
-
Calculate the RMS (root mean square) of the numbers specified by a field.
- rms(String) - Static method in class io.github.privacystreams.commons.statistic.StatisticOperators
-
Calculate the RMS (root mean square) of the number values of a field in the stream.
- rms(List<T>) - Static method in class io.github.privacystreams.utils.StatisticUtils
-
Get the RMS (root mean square) of all numbers in the list.
- ROOT_NODE - Static variable in class io.github.privacystreams.accessibility.AccEvent
-
The root view of current event, which is an instance of AccessibilityNodeInfo.
- RotationVector - Class in io.github.privacystreams.sensor
-
Rotation vector sensor.
- roundDown(String, Number) - Static method in class io.github.privacystreams.commons.arithmetic.ArithmeticOperators
-
Round down a number.
- roundUp(String, Number) - Static method in class io.github.privacystreams.commons.arithmetic.ArithmeticOperators
-
Round up a number.
- RSSI - Static variable in class io.github.privacystreams.device.WifiAp
-
The RSSI.


Real Madrid defender Sergio Ramos considering China offers?
Sergio Ramos is allegedly open to leaving Real Madrid for the Chinese Super League in 2020.
by Darren PlantThe 33-year-old has enjoyed a legendary career at the Bernabeu, making 621 appearances since signing for the club in 2005.
However, over the past 12 months, there has been speculation regarding the veteran's future, including the possibility of a lucrative switch to Asia.
According to reports in Spain, Ramos is not ruling out penning a lucrative contract with a team from China's top flight at some point next year.
With Ramos having just over 19 months left on his contract, Real are likely to make an effort to extend the Spaniard's stay.
body check tags ::