The Kamakhya Temple also known as Kamrup-Kamakhya temple,is a Sakta temple dedicated to the mother goddess Kamakhya.It is one of the oldest of the 51 Shakti Pithas.Situated on the Nilachal Hill in western part of Guwahati city in Assam, India, it is the main temple in a complex of individual temples dedicated to the ten Mahavidyas of Saktism : Kali, Tara, Sodashi, Bhuvaneshwari, Bhairavi, Chhinnamasta, Dhumavati, Bagalamukhi, Matangi and Kamalatmika.Among these, Tripurasundari, Matangi and Kamala reside inside the main temple whereas the other seven reside in individual temples.It is an important pilgrimage destination for Hindus and especially for Tantric worshipers.


the and network for are nodes fish The from with links transport live salmon movements al., sites transmission all that which this England size {background potential trout disease Scottish via industry number data infectious movement was margin marine only each farms have layers river {border-style aquaculture between can Fish Wales other px;} #ffffff;} Scotland This were also analysis cross-border node farm large within Fig. LSCC both local network. salmonid species structure these total For Table diseases has link Scotland, not risk site Cefas combined different full grid layer outbreak records than there transports Health These control given nodes. reachable source spread time virus EOR MSS been contact due including most network, our out out-component sea such those two water cells connections considered px; unique {font-family Vet. across consider current destination distance epidemiological font-size links, more over pathogen pathogens shows their therefore they type would Animal Atlantic European Network Our Scotland. according animal component cross double; effective epidemics first group infection into its links. located maximum measures modelling networks notifiable present proportion relatively selected sites, small surveillance three under when where â€‰km (%) (Jonkers Aquatic Dis. Total Wales, alone, associated border border-color border-width colour components connected covering determined epidemic expected farming gives having impact in-component include included increases largest layer. layers, layers. location longest mean model multi-layer node, one period points possible potentially production reach recorded removing required results routes simulation single site. solid; targeted then type, using value vicinity widespread {font-style {font-weight (Anonymous, (Green (i.e. British Cross-border Each Environment GB, GBâ€™s Great LSCC. Links Live Marine Med. Regulations Sci. Supplementary although anaemia anemia aquatic area assess assumed being bold but calculated centrality combinations could courier; defined during em; following here highly hydrodynamic increasing lead majority management may nodes, observations outbreaks particle paths pt;} rather referred representation role same sizes spatial specific take through types understanding used vectors very viral waterborne wild


This is an experimental demo of Angry Bots, a Unity game which has been ported to WebAssembly. Fight robots and explore a 3D space station with realistic environmental effects in this top-down shooter. Movement is controlled by W, A, S, D or the arrow keys and aiming & firing is controlled by the mouse.
| Early multi-browser support | ✓ | Runs in experimental builds of Chromium, Firefox, and Edge. |
|---|---|---|
| Demo execution | ✓ | Full execution semantics implemented. |
| Stable binary format | ✘ | Binary format will be updated to match design iterations, until it is frozen for stable release. |
| Standard textual encoding | ✘ | Textual encoding will be standardized before stable release. |
| Stable tooling | ✘ | A mature toolchain for compiling and debugging WebAssembly will be available before stable release. |
| Stable JS API | ✘ | The Wasm object will be updated to allow additional behavior and introspection before stable release |


Introduction
This is version two of Sinorca, a revision of the original design I submitted to OSWD in January 2003. Following is a summary of the major differences between this version and the original.
Sinorca is based on the website of Acronis, a USA-based computer software company. This template is marked up in XHTML 1.0 Strict and styled with CSS, allowing for greater compatibility and transformability. The design does not use any tables (unlike the design’s inspiration) resulting in greater design flexibility and cleaner code.
I hope you find this revision to your liking. You are free to use this design for any purpose you wish — personal, commercial or otherwise — without any obligation. If you publish a website that’s based on this template, please e-mail me your site’s URI.
^ TOPImproved cross-browser compatibility
I did not test version one of Sinorca in Opera before submitting it to OSWD. As a result, the original does not render properly in that browser. In contrast, this version of Sinorca has been fully tested in Opera (7.01), Gecko (Mozilla 1.3) and Internet Explorer (6.0) for consistent rendering.
This means that people using standards-compliant browsers will see the same format and layout of your page.
^ TOPModified stylesheets
- More comprehensive screen stylesheet
- The improved cross-browser consistency is a result of Sinorca’s more comprehensive screen stylesheet. Major style parameters are explicitly defined in the stylesheet, resulting in less dependence on browser-determined defaults and thus fewer rendering idiosyncrasies.
- Removal of colour scheme stylesheet
- I’ve removed the separate colour scheme stylesheet found in the original version, instead incorporating the colour definitions in the single screen stylesheet.
- Addition of a print media stylesheet
- Sinorca now has a print media stylesheet that styles the page in a format appropriate for black and white printing. To see the effect of this stylesheet, select print preview from the file menu, or direct this page to a printer (NB: print only this frame if you are viewing this template in a multi-frame document).
Improved accessibility
This version of Sinorca has improved accessibility features for people with impaired vision. The template tentatively conforms to the WCAG double A rating and § 508 guidelines for web content accessibility. The relative simplicity of the template’s underlying markup ensures that your page can be easily transformed for rendering in aural, tactile (braille) and other non-visual user agents.
Additionally, the majority of document metrics (widths, lengths and spacings) are font-size relative. This means that a user can increase the default font size of your page (using their browser) without compromising it’s layout.


Scorched World
An exercise in
Three.js
as tribute to
Scorched Earth
Start a new game
How many players?
select
2
3
4
#
Player name
Type
Start game
Game over!
The winner is
!
Play another


Ptolemy II Package Design
Ptolemy II uses the Java package system to group classes.
Packages are (roughly) small enough that the UML static structure diagram for the package fits on one page. Larger packages are possible when there is a compelling reason to keep classes together, or when the classes have such a regular structure that their architecture is easily grasped.
Bidirectional dependencies between packages should be avoided. If two packages are dependent upon each other, it makes it hard to determine which package to compile first. Below are the possibilities
Remove the dependency
Combine the two packages into one package
Move the dependency into a third package, which will probably be a subpackage of one of the packages.
A subpackage is a package that is beneath a parent package in the directory hierarchy. For example
ptolemy.kernel.util
is a subpackage of
ptolemy.kernel
. The makefiles are structured so that we run make in the subdirectories first so in general, it is best if subpackages do not depend on the parent package (the reverse is OK).
The test suite for a package should only use packages that are already depended upon by the package under test. This rule cannot always be followed, but if it is followed, it makes it much easier to reuse a package since the tests will not require extra packages.
compile time dependencies
A class explicitly imports a class from another package
A class explicitly uses a class from another package by using the fully qualified dot separated name
run time dependencies
A class uses reflection at runtime.
ptolemy.data.expr.MatlabUtilities is an example of how we use reflection to use the ptolemy.matlab classes at runtime so that we can compile ptolemy.data.expr and not necessary have ptolemy.matlab present
A class parses MoML at runtime that invokes other classes.
test time dependencies
It is better to write Unit tests before writing System tests.
Unit tests will usually get you better coverage and test the code more thourougly.
System tests are useful, but they are more like browsing the code than actually reading it. For example, think of a System test as something like running through a library, looking at the title of the books and and opening up an occasional book to a random page. Unit tests are more like opening up each book and reading it.
A good unit test will only use other packages compile time dependencies of the package under test.
This is important if someone else wants to use the package and not include all of Ptolemy


{% extends "base.html" %} {% block content_title %}
Thankyou for registering with smrtr. An email with account activation instructions has been sent to your registered address.
Click the link in the email to activate your account and login.
See you soon!
{% endblock %}


Tobacco use is a worldwide problem.
Even with all this information about smoking and health problems people keep smoking. Why is that the case? Is quitting really so difficult for people? Is the habit so strong that people are willing to die for it?
Habits are formed over the years and how longer you do them, how harder it is to quit with them. So this website is designed to give people between the age of 14 and 30 living in The Netherlands an interactive insight in some statistics about smoking.
The visualizations below show a world map, scatter plot and a line chart. In the summary below each visualisation will be described and the interface will be explained. Hoovering over each datapoint/country in each visualisation will provide a tooltip with the right information for each visualisation.
Worldmap: The worldmap shows data about the share of people who smoke everyday from 1990 till 2010. With the slider underneath the map you can choose the year which will be showed in the map by colors. The color gradient is based on the minimum and the maximum of the dataset. The color scale for the values of the colors is displayed next to the map.
The worldmap is also linked to the line graph. The user can click on a country, which data then will be displayed in the linegraph in comparison with The Netherlands.
Scatterplot: The scatterplot will show effects of the number of cigarets consumed per smoker (x axis) on the number of deaths from tobacco smoking or the share of cancer deaths attributed to tobacco in % (y axis). The variable of the number of deaths from tobacco smoking has a logarithmic scale, so the values are going from 10 till 1.400.000 which is displayed by 1e+6 (so 1 * 10^6). The variable of the share of cancer deaths attributed to tobacco has a linear scale. The two variables can be switched by choosing a variable on the Y axis button.
The years of the data can also be adjusted with the Year button. The years between 1990 till 2010 with steps of 5 years can be selected for the scatterplot.
Each datapoint in the scatterplot represents a country which are also shown in de worldmap. The scatterplot is, like the worldmap, linked to the line graph. The user can click on a country. This country will be shown in the linegraph in comparison with The Netherlands.
Lingraph: The linegraph shows the same data as the worldmap, share of people who smoke everyday, but then from 1980 till 2012. In this way there is a global overview of the decrease in the number of smokers per clicked country in comparison with The Netherlands.
Since january 1 2014 the age for buying cigarets went from 16 to 18 years old in The Netherlands.  From tomorrow tobacco manufacturers have to put this kind of frightening images on packets of cigarettes and shag. The packages as we know them now, with only a warning in text, may then no longer be produced. The purpose of the new European rules is to discourage smoking further. It will take some time before the new packages can also be seen in the stores. Retailers and producers have a year to sell their stock of old parcels (Translated from NOS, 2016).
Does these measures to discourage smoking actually help? Judge yourself.
In the bargraph the share of people who smoke in The Netherlands is showed. Hoovering over the bars will provide a tooltip with the data about that certain year.


Examination Management System
Welcome All
Home
(current)
About Us
Conatct us
Here You Will Be Notified About Upcoming exams
Examination
Date
Mode of Examination
MOCK JEE
12th May 2020
online
C++/C#
15th May 2020
online
Pyhton Error Finding
20th May 2020
online
Reasoning
25th May 2020
offline
Competative Coding
1st June 2020
online


David Greymaax
1 Minutes ago
15 Minutes ago
Just a reminder that you have an event today
Update dashboard


The Red Stare is a room-scale VR game about spying on communist spies from your apartment window.
Data:
- Platform
- HTC Vive
- Oculus (3 sensors)
- Genre
- Roomscale VR
- Puzzle
- Time
- Project: September 2016 - July 2017
- Personal: February 2017 - July 2017
- Team
- Play:d
- 18 members during my presence
- Awards and Recognition's
- Steam - Released July 2017
- Dutch Game Awards:
- finalist for: best student art, design, and tech.
- Winner of: Best student art and design.
For the red stare I worked on most of the AI systems, which where divided in 3 systems:
The Humans have a simple rule based behavior tree. Because this made most sense with the initial idea of the game.
This means that each person, has a set of rules, with what they can do when, for example "between 20:00 & 5:00 be at home".
This made it for designers really easy to give the different persons their behavior, and make their puzzles.
The way those rules where put into behavior for the AI is by a behavior tree consisting of 3 main branches.
- A branch deciding on the task to do.
- A branch for doing a action with only 1 pawn
- A branch for doing a action with multiple pawns
deciding on a task is really straight forward:
If i would do the same kind of puzzle AI again, i would use a different kind of approach.
Instead of creating tasks if a pawn needs a new one, I would create a daily task list with what each character will be doing at the start of the day.
Cars use a spline based movement pattern, over the road there are multiple splines laid out for the cars to follow.
When a car is spawned, it will take a random one of these routes, meaning that just like real live, no car will be exactly straight behind the other.
This makes it really optimized, as you can calculate a lot of points over these splines in front, and it still keeps it looking real.
For the Cars i'm really satisfied with it. it works really nice and it is really fast.
The birds are fairly simple, there is a manager in charge of the amount of birds in the level. Every time a bird goes too far away, it get's reset to a pre-defined radius from the player.
The birds are fairly basic, they only move forward and by way of raycasts spread over the ticks, they check if anything is in front, and they need to turn around.
To give the birds some life-like flying patterns, without creating lagg and using much calculations, I put a few invisible blocks in the air, where the birds will fly around, making it very pleasing and lifelike to the player.
If I could have had more time, I would have loved to add some way for the birds to land on top of the roofs or electric poles.
I would probably have done this with a "catch collider" which catches the bird, and motions the bird fluently to a place to land.
unfortunately I did not have time to make this before the release, and the designers/producer thought they were good enough now, and it was better not to risk breaking them after release.


Visualize your Deep Learning Architecture (Beta)
Create maps of your deep learning architectures, to visualize complicated models in an easy way. Paste your keras, tflearn(not supported yet) neural net code and generate a visual model.
 It's easier to understand a deep learning model with a graph.
Project on Github
This project is completely open-source, if you want to contribute or work on the code visit the github page.


The Tower of Babylon
问题描述 :
Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we will tell you the whole story:
The babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
They wanted to construct the tallest tower possible by stacking blocks. The problem was that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block. This meant, for example, that blocks oriented to have equal-sized bases couldn’t be stacked.
The babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
They wanted to construct the tallest tower possible by stacking blocks. The problem was that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block. This meant, for example, that blocks oriented to have equal-sized bases couldn’t be stacked.
Your job is to write a program that determines the height of the tallest tower the babylonians can build with a given set of blocks.
输入:
The input will contain one or more test cases. The first line of each test case contains an integer n,
representing the number of different blocks in the following data set. The maximum value for n is 30.
Each of the next n lines contains three integers representing the values xi, yi and zi.
Input is terminated by a value of zero (0) for n.
representing the number of different blocks in the following data set. The maximum value for n is 30.
Each of the next n lines contains three integers representing the values xi, yi and zi.
Input is terminated by a value of zero (0) for n.
输出:
For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format “Case case: maximum height = height”
样例输入:
1 10 20 30 2 6 8 10 5 5 5 7 1 1 1 2 2 2 3 3 3 4 4 4 5 5 5 6 6 6 7 7 7 5 31 41 59 26 53 58 97 93 23 84 62 64 33 83 27 0
样例输出:
Case 1: maximum height = 40 Case 2: maximum height = 21 Case 3: maximum height = 28 Case 4: maximum height = 342
解题代码:
import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List; import java.util.Scanner; public class Main { /** * @param args */ public static void main(String[] args) { Scanner cin = new Scanner(System.in); int kase = 0; while (true) { int n = cin.nextInt(); if (n == 0) { break; } kase++; Listlist = new ArrayList (); for (int i = 1; i <= n; i++) { int x = cin.nextInt(); int y = cin.nextInt(); int z = cin.nextInt(); list.add(new T(x, y, z)); list.add(new T(y, x, z)); list.add(new T(x, z, y)); list.add(new T(z, x, y)); list.add(new T(y, z, x)); list.add(new T(z, y, x)); } Collections.sort(list, new Comparator() { public int compare(Object arg0, Object arg1) { T t1 = (T) arg0; T t2 = (T) arg1; if (t2.x > t1.x) { return t2.x - t1.x; } else if (t2.x == t1.x && t2.y > t1.y) { return t2.y - t1.y; } else if (t2.x == t1.x && t2.y == t1.y && t2.z > t1.z) { return t2.z - t1.z; } return -1; } }); int[] f = new int[list.size() + 1]; for (int i = 0; i < f.length; i++) { f[i] = 0; } f[0] = list.get(0).z; int max = f[0]; for (int i = 1; i < list.size(); i++) { int m = list.get(i).z; for (int k = 0; k < i; k++) { if (list.get(k).x > list.get(i).x && list.get(k).y > list.get(i).y) { m = Math.max(m, f[k] + list.get(i).z); } } max = Math.max(max, m); f[i] = m; } System.out.println("Case " + kase + ": maximum height = " + max); } } static class T { int x; int y; int z; public T(int x, int y, int z) { this.x = x; this.y = y; this.z = z; } } }
(adsbygoogle = window.adsbygoogle || []).push({});
居然是机试，还和13年重复。题目不难
目测会火
代码不对，仔细对比一下输入输出， 怎么会有‘‘printf("The winning moves are:");’’这种输出呢？
不错，现在就缺少新的资料
还是有些难度的！
其实不需要用LCA，用DFS+vector更简单
第一种方法怎么会是O(log(m+n))呢？没有二分的话直接遍历应该就是O(m+n)吧？
这配图…..
可以用公式。主要为了说明动态规划，如果要打表的话，这种方法也是较简单和高效的
修改一下吧 …
真考人啊
有没有C++语言的代码？
yeah, This is very tricky. If you use Cpp,you need more code
Thanks for taking the time to examine this, I really feel strongly about it and love studying a lot more on this topic. If possible, as you acquire experience


Got another invite to Facebook from a friend, but I just don't have the time/attention to sign up. Wish I did...
3/27/2008, 10:07:09 AM
Favs: 0
Retweets: 0
link--- layout: tweet ---
Got another invite to Facebook from a friend, but I just don't have the time/attention to sign up. Wish I did...
3/27/2008, 10:07:09 AM
Favs: 0
Retweets: 0
link


:: Experimental ::
:: Experimental :: Model fitted by BisectingKMeans.
:: Experimental :: Model fitted by BisectingKMeans.
:: Experimental ::
:: Experimental ::
Distributed model fitted by LDA. This type of model is currently only produced by Expectation-Maximization (EM).
This model stores the inferred topics, the full training dataset, and the topic distribution for each training document.
:: Experimental :: Gaussian Mixture clustering.
:: Experimental :: Gaussian Mixture clustering.
This class performs expectation maximization for multivariate Gaussian Mixture Models (GMMs). A GMM represents a composite distribution of independent Gaussian distributions with associated "mixing" weights specifying each's contribution to the composite.
Given a set of sample points, this class will maximize the log-likelihood for a mixture of k Gaussians, iterating until the log-likelihood changes by less than convergenceTol, or until it has reached the max number of iterations. While this process is generally guaranteed to converge, it is not guaranteed to find a global optimum.
Note: For high-dimensional data (with many features), this algorithm may perform poorly. This is due to high-dimensional data (a) making it difficult to cluster at all (based on statistical/theoretical arguments) and (b) numerical issues with Gaussian distributions.
:: Experimental ::
:: Experimental ::
Multivariate Gaussian Mixture Model (GMM) consisting of k Gaussians, where points are drawn from each Gaussian i with probability weights(i).
:: Experimental :: Summary of GaussianMixture.
:: Experimental :: Summary of GaussianMixture.
:: Experimental :: K-means clustering with support for k-means|| initialization proposed by Bahmani et al.
:: Experimental :: K-means clustering with support for k-means|| initialization proposed by Bahmani et al.
:: Experimental :: Model fitted by KMeans.
:: Experimental :: Model fitted by KMeans.
:: Experimental :: Summary of KMeans.
:: Experimental :: Summary of KMeans.
:: Experimental ::
:: Experimental ::
Latent Dirichlet Allocation (LDA), a topic model designed for text documents.
Terminology:
Original LDA paper (journal version): Blei, Ng, and Jordan. "Latent Dirichlet Allocation." JMLR, 2003.
Input data (featuresCol): LDA is given a collection of documents as input data, via the featuresCol parameter. Each document is specified as a Vector of length vocabSize, where each entry is the count for the corresponding term (word) in the document. Feature transformers such as org.apache.spark.ml.feature.Tokenizer and org.apache.spark.ml.feature.CountVectorizer can be useful for converting text to word count vectors.
:: Experimental :: Model fitted by LDA.
:: Experimental :: Model fitted by LDA.
:: Experimental ::
:: Experimental ::
Local (non-distributed) model fitted by LDA.
This model stores the inferred topics only; it does not store info about the training dataset.
:: Experimental ::
A bisecting k-means algorithm based on the paper "A comparison of document clustering techniques" by Steinbach, Karypis, and Kumar, with modification to fit Spark. The algorithm starts from a single cluster that contains all points. Iteratively it finds divisible clusters on the bottom level and bisects each of them using k-means, until there are
k
leaf clusters in total or no leaf clusters are divisible. The bisecting steps of clusters on the same level are grouped together to increase parallelism. If bisecting all divisible clusters on the bottom level would result more thank
leaf clusters, larger clusters get higher priority.Steinbach, Karypis, and Kumar, A comparison of document clustering techniques, KDD Workshop on Text Mining, 2000.


Settings
The settings define the main configuration for Deploy-Man. They
are stored in a common Java properties file. So each setting is
a simple key-value pair. While you can change the values, you
cannot change the keys since they are required in Deploy-Man.


EBD - Easton Bible DIctionary
Machbanai
MACHBANAI
"MACHBANAI "clad with a mantle, or bond of the Lord, one of the Gadite heroes who joined David in the wilderness (
1 Chronicles 12:13
).
"MACHBANAI "clad with a mantle, or bond of the Lord, one of the Gadite heroes who joined David in the wilderness (1 Chronicles 12:13).


{% extends "base.html" %} {% block css %} {% end %} {% block header %} Tell us about yourself Everyone's experience is unique, tell us about yours. {% end %} {% block content %}


WITNESS LIST Urban Affairs Committee April 11, 2001-1:00P HB 239 For: Tidwell, Sandy (Self) Registering, but not testifying: Against: French, Mike (Texas Manufactured Housing Association) HB 1388 For: Lyons, Steve (City of Houston) Villarreal, Johnny (Houston Fire Fighters, Local 341) Williams, Steve (Houston Professional Fire Fighters, Local 341) Registering, but not testifying: For: Bailey, Ken (Self and Texas State Association of Fire Fighters) HB 1611 Registering, but not testifying: For: Igo, Shanna (Texas Municipal League) HB 2116 For: Ashworth, Nancy (BH Management Services/Apartment Association of Texas) Mintz, David (Texas Apartment Association) Ocanas, Reymundo (Self and Texas Association of Community Development Corporations) Against: Anderson, Frank (Orange City Housing Authority) Braziel, Melvin (San Antonio Housing Authority) Hobbs, Jr., Ulysses (Self) Plummer, Jim (San Antonio Housing Authority) Registering, but not testifying: For: Henneberger, John (Texas Low Income Housing Information Service) HB 2245 For: Bailey, Ken (Self and Texas State Association of Fire Fighters) Calagna, Anthony (Texas Fire Chiefs) Ivie Miller, Lisa (State Firemen's and Fire Marshals' Association of Texas) Registering, but not testifying: For: Turner, Guy (Self and Texas State Association of Fire Fighters) Villarreal, Johnny (Houston Fire Fighters, Local 341) Williams, Steve (Houston Professional Fire Fighters, Local 341) On: Slalder, Kelly (Texas Commission on Fire Protection) Soteriou, Jake (Texas Commission on Fire Protection) Warren, Gary (Texas Commission on Fire Protection) HB 3294 Registering, but not testifying: For: Henneberger, John (Texas Low Income Housing Information Service) HB 3413 Registering, but not testifying: For: Braziel, Melvin (San Antonio Housing Authority) Henneberger, John (Texas Low Income Housing Information Service) Plummer, Jim (San Antonio Housing Authority) HB 3414 Registering, but not testifying: For: Braziel, Melvin (San Antonio Housing Authority) Henneberger, John (Texas Low Income Housing Information Service) Plummer, Jim (San Antonio Housing Authority) HB 3449 For: Flynn, Shari (Lubbock Housing Finance Corporation/Texas Association of Local Housing Finance Agencies) Garvin, John (Texas Affiliation of Affordable Housing Providers) Ocanas, Reymundo (Self and Texas Association of Community Development Corporations) Smith, Terral (El Paso Chamber of Commerce/Hunt Building Corporation) Stewart, Brent (Self and Trammell Crow Residential) Talerico, Jeanne (Texas Association of Local Housing Finance Agencies) On: Dunaway, Jim (Association of Rural Communities in Texas) Hawkins, John (Sunset Advisory Commission) Richardson, Chris (Self) Stiner, Daisy (Texas Department of Housing and Community Affairs) Registering, but not testifying: For: Utter, Tom (City of Corpus Christi/Corpus Christi Housing Finance Corporation) HB 3492 For: del Llano, Ann (ACLU of Texas) Henson, Scott (ACLU) Against: Jones, Chris (Combined Law Enforcement Associations of Texas) Kerr, John (Fort Worth Police Officers' Association) Marticiuc, Hans (Houston Police Officers Union) Sanders, Stephen (Self and Houston Police Patrolmen's Union) Registering, but not testifying: For: Harrell, William (ACLU of Texas/NAACP/LULAC) Against: Lyons, Steve (Houston Police Department) Oakley, Keith (Texas Municipal Police Association) HB 3500 Registering, but not testifying: For: Bailey, Ken (Self and Texas State Association of Fire Fighters) Jones, Chris (Combined Law Enforcement Associations of Texas) Oakley, Keith (Texas Municipal Police Association) Turner, Guy (Self and Texas State Association of Fire Fighters) HB 3603 For: Jones, Chris (Combined Law Enforcement Associations of Texas) Registering, but not testifying: For: Bailey, Ken (Self and Texas State Association of Fire Fighters) Kerr, John (Fort Worth Police Officers' Association) Oakley, Keith (Texas Municipal Police Association) Turner, Guy (Self and Texas State Association of Fire Fighters) SB 782 For: Lopez, Leo (Via Metropolitan Transit) Milam, John (Via Metropolitan Transit) Against: Feinsilber, Bennett (Homeowner and Taxpayer Association of San Antonio) Judson, Jeff (Texas Public Policy Foundation) On: Dawson, Sam (San Antonio Transportation Alliance/Greater Chamber/North Chamber) Mitchell, Seth (Bexar County Commissioners Court) Registering, but not testifying: For: Ingle, Priscilla (Via Metropolitan Transit)


What Office Character Are You?
Fill in our quiz below:
What Type of Paper are You?
Cardstock
Wrapping Paper
Newspaper
Preferred Type of Candy:
M&M
Mike and Ikes
Butterfinger
Pick a Career.
Writer
Graphic Designer
CEO
Preferred Mustard
Grey Poupon
Honey Mustard
Whole Grain
Submit
You are most like


|
Groovy JDK |
| Method Summary | |
|---|---|
void
|
eachByte(Closure closure)
Traverse through each byte of the specified stream. |
void
|
eachByte(int bufferLen, Closure closure)
Traverse through each the specified stream reading bytes into a buffer and calling the 2 parameter closure with this buffer and the number of bytes. |
Object
|
eachLine(String charset, Closure closure)
Iterates through this stream reading with the provided charset, passing each line to the given 1 or 2 arg closure. |
Object
|
eachLine(String charset, int firstLine, Closure closure)
Iterates through this stream reading with the provided charset, passing each line to the given 1 or 2 arg closure. |
Object
|
eachLine(Closure closure)
Iterates through this stream, passing each line to the given 1 or 2 arg closure. |
Object
|
eachLine(int firstLine, Closure closure)
Iterates through this stream, passing each line to the given 1 or 2 arg closure. |
Writable
|
filterLine(Closure predicate)
Filter lines from an input stream using a closure predicate. |
Writable
|
filterLine(String charset, Closure predicate)
Filter lines from an input stream using a closure predicate. |
void
|
filterLine(Writer writer, Closure predicate)
Uses a closure to filter lines from this InputStream and pass them to the given writer. |
void
|
filterLine(Writer writer, String charset, Closure predicate)
Uses a closure to filter lines from this InputStream and pass them to the given writer. |
byte[]
|
getBytes()
Read the content of this InputStream and return it as a byte[]. |
String
|
getText()
Read the content of this InputStream and return it as a String. |
String
|
getText(String charset)
Read the content of this InputStream using specified charset and return it as a String. |
Iterator
|
iterator()
Standard iterator for a input stream which iterates through the stream content in a byte-based fashion. |
ObjectInputStream
|
newObjectInputStream()
Create an object input stream for this input stream. |
ObjectInputStream
|
newObjectInputStream(ClassLoader classLoader)
Create an object input stream for this input stream using the given class loader. |
BufferedReader
|
newReader()
Creates a reader for this input stream. |
BufferedReader
|
newReader(String charset)
Creates a reader for this input stream, using the specified charset as the encoding. |
List
|
readLines()
Reads the stream into a list, with one element for each line. |
List
|
readLines(String charset)
Reads the stream into a list, with one element for each line. |
Object
|
splitEachLine(String regex, String charset, Closure closure)
Iterates through the given InputStream line by line using the specified encoding, splitting each line using the given separator. |
Object
|
splitEachLine(Pattern pattern, String charset, Closure closure)
Iterates through the given InputStream line by line using the specified encoding, splitting each line using the given separator Pattern. |
Object
|
splitEachLine(String regex, Closure closure)
Iterates through the given InputStream line by line, splitting each line using the given separator. |
Object
|
splitEachLine(Pattern pattern, Closure closure)
Iterates through the given InputStream line by line, splitting each line using the given separator Pattern. |
Object
|
withObjectInputStream(Closure closure)
Create a new ObjectInputStream for this file and pass it to the closure. |
Object
|
withObjectInputStream(ClassLoader classLoader, Closure closure)
Create a new ObjectInputStream for this file and pass it to the closure. |
Object
|
withReader(Closure closure)
Helper method to create a new Reader for a stream and then passes it into the closure. |
Object
|
withReader(String charset, Closure closure)
Helper method to create a new Reader for a stream and then passes it into the closure. |
Object
|
withStream(Closure closure)
Allows this input stream to be used within the closure, ensuring that it is flushed and closed before this method returns. |
| Method Detail |
|---|
public void eachByte(Closure closure)
closure
- closure to apply to each byte.public void eachByte(int bufferLen, Closure closure)
bufferLen
- the length of the buffer to use..closure
- a 2 parameter closure which is passed the byte[] and a number of bytes successfully read..public Object eachLine(String charset, Closure closure)
charset
- opens the stream with a specified charset.closure
- a closure (arg 1 is line, optional arg 2 is line number starting at line 1).public Object eachLine(String charset, int firstLine, Closure closure)
charset
- opens the stream with a specified charset.firstLine
- the line number value used for the first line (default is 1, set to 0 to start counting from 0).closure
- a closure (arg 1 is line, optional arg 2 is line number).public Object eachLine(Closure closure)
closure
- a closure (arg 1 is line, optional arg 2 is line number starting at line 1).public Object eachLine(int firstLine, Closure closure)
firstLine
- the line number value used for the first line (default is 1, set to 0 to start counting from 0).closure
- a closure (arg 1 is line, optional arg 2 is line number).public Writable filterLine(Closure predicate)
true
if the line should be passed to the writer.predicate
- a closure which returns boolean and takes a line.public Writable filterLine(String charset, Closure predicate)
true
if the line should be passed to the writer.charset
- opens the stream with a specified charset.predicate
- a closure which returns boolean and takes a line.public void filterLine(Writer writer, Closure predicate)
true
if the line should be passed to the
writer.writer
- a writer to write output to.predicate
- a closure which returns true if a line should be accepted.public void filterLine(Writer writer, String charset, Closure predicate)
true
if the line should be passed to the
writer.writer
- a writer to write output to.charset
- opens the stream with a specified charset.predicate
- a closure which returns true if a line should be accepted.public byte[] getBytes()
public String getText()
public String getText(String charset)
charset
- opens the stream with a specified charset.public Iterator iterator()
public ObjectInputStream newObjectInputStream()
public ObjectInputStream newObjectInputStream(ClassLoader classLoader)
classLoader
- the class loader to use when loading the class.public BufferedReader newReader()
public BufferedReader newReader(String charset)
charset
- the charset for this input stream.public List readLines()
public List readLines(String charset)
charset
- opens the stream with a specified charset.public Object splitEachLine(String regex, String charset, Closure closure)
regex
- the delimiting regular expression.charset
- opens the stream with a specified charset.closure
- a closure.public Object splitEachLine(Pattern pattern, String charset, Closure closure)
pattern
- the regular expression Pattern for the delimiter.charset
- opens the stream with a specified charset.closure
- a closure.public Object splitEachLine(String regex, Closure closure)
regex
- the delimiting regular expression.closure
- a closure.public Object splitEachLine(Pattern pattern, Closure closure)
pattern
- the regular expression Pattern for the delimiter.closure
- a closure.public Object withObjectInputStream(Closure closure)
closure
- a closure.public Object withObjectInputStream(ClassLoader classLoader, Closure closure)
classLoader
- the class loader to use when loading the class.closure
- a closure.public Object withReader(Closure closure)
closure
- the closure to invoke with the InputStream.public Object withReader(String charset, Closure closure)
charset
- the charset used to decode the stream.closure
- the closure to invoke with the reader.public Object withStream(Closure closure)
closure
- the closure that the stream is passed into.
|
Groovy JDK |


My App
Naveed Aheer is a React, React Native and Angular developer having hobby to learn latest technologies. He loves to solve problems with his skills.


{{ question.score }}
vote
{{ question.nbReplies }}
Answer
{{ question.nbViews | nbThousandSuffixes : 2 }}
views
{{ question.title }}
{{ tag.name }}
Answered {{ askedMoment }} by {{ question.author.pseudo }}


KSG ICT Equipment Requisition Portal
9+
New Notifications
View Old Notifications
7
New Messages
Inbox
Settings
Logout
Overview
Create, Read, Update and Delete
Pending Requests
Approved Requests
View Equipment
Available Equipment
Cleared Requests
Dashboard
Create, Read, Update and Delete
Equipment:
*
Select One
Laptop
Laptop Charger
LCD Projector
Printer
Extension Cables
Make
*
Serial Number
*
Asset Tag Number
KSG Campus:
*
Select Campus
KSG Lower Kabete
eLDi
KSG Baringo
KSG Embu
KSG Mombasa
KSG Matuga
Add
Edit
Delete
Ready to Leave?
×
Select "Logout" below if you are ready to end your current session.


Class that represents a rain weather effect.
More...
#include <RainWeather.h>
|
| | RainWeather (QPixmap rainGraphic=QPixmap(":/resources/graphics/effects/rain.png"), int numOfRains=150, int rainFalldownSpeed=1500, int rainMoveAmountPerStep=100, int splashStepFreqMs=150, int numSplashPerStep=7, double rainInitialOpacity=0.08, double rainMaxOpacity=0.5, double rainOpacityStepSize=0.005, int rainInitialToMaxOpacityTimeMS=5000, double splashInitialOpacity=0.08, double splashFinalOpacity=0.5, double splashOpacityStepSize=0.002, int splashInitialToFinalOpacityTimeMS=5000) |
| |
| | ~RainWeather () |
| |
| virtual void | start_ () override |
| |
| virtual void | stop_ () override |
| |
| virtual void | resume_ () override |
| |
| virtual void | pause_ () override |
| |
| | WeatherEffect () |
| |
| virtual void | start () |
| | Starts the WeatherEffect. More...
|
| |
| virtual void | stop () |
| | Stops the WeatherEffect. More...
|
| |
| virtual void | resume () |
| | Resumes the WeatherEffect (i.e. More...
|
| |
| virtual void | pause () |
| | Pauses the WeatherEffect. More...
|
| |
Class that represents a rain weather effect.
- See also
- WeatherEffect
- Author
- Abdullah Aghazadah
- Date
- 6/26/16
◆ RainWeather()
| RainWeather::RainWeather |
( |
QPixmap |
rainGraphic = QPixmap(":/resources/graphics/effects/rain.png") , |
|
|
int |
numOfRains = 150 , |
|
|
int |
rainFalldownSpeed = 1500 , |
|
|
int |
rainMoveAmountPerStep = 100 , |
|
|
int |
splashStepFreqMs = 150 , |
|
|
int |
numSplashPerStep = 7 , |
|
|
double |
rainInitialOpacity = 0.08 , |
|
|
double |
rainMaxOpacity = 0.5 , |
|
|
double |
rainOpacityStepSize = 0.005 , |
|
|
int |
rainInitialToMaxOpacityTimeMS = 5000 , |
|
|
double |
splashInitialOpacity = 0.08 , |
|
|
double |
splashFinalOpacity = 0.5 , |
|
|
double |
splashOpacityStepSize = 0.002 , |
|
|
int |
splashInitialToFinalOpacityTimeMS = 5000 |
|
) |
| |
◆ ~RainWeather()
| RainWeather::~RainWeather |
( |
| ) |
|
◆ createSplashesStep_
| void RainWeather::createSplashesStep_ |
( |
| ) |
|
|
slot |
Executed every so often to generate splashes.
Will randomly generate splash graphics where the cam is currently looking at.
◆ pause_()
| void RainWeather::pause_ |
( |
| ) |
|
|
overridevirtual |
◆ rainMoveStep_
| void RainWeather::rainMoveStep_ |
( |
| ) |
|
|
slot |
Executed periodically to move the rain graphics down.
Will also move them back up (at a random x,y) when far down enough.
◆ rainOpacityStep_
| void RainWeather::rainOpacityStep_ |
( |
| ) |
|
|
slot |
Executed periodically to blend the rain in.
Once rains reach max opacity, this function will disconnect its timer.
◆ resume_()
| void RainWeather::resume_ |
( |
| ) |
|
|
overridevirtual |
◆ splashOpacityStep_
| void RainWeather::splashOpacityStep_ |
( |
| ) |
|
|
slot |
Executed periodically to blend the splashes in.
Once the splashes have been blended in, this function will disconnect its timer.
◆ start_()
| void RainWeather::start_ |
( |
| ) |
|
|
overridevirtual |
◆ stop_()
| void RainWeather::stop_ |
( |
| ) |
|
|
overridevirtual |
The documentation for this class was generated from the following files:


Select Your Apartment Please select one SSK Residency-Singsandra
Flat Number Please select one G-00{{ n }} FF-10{{ n }} SF-20{{ n }} TF-30{{ n }} FF-40{{ n }}
Your Name Max 20 characters.
Mobile Number +91-XXXXXXXXXX
Your Email We'll never share your email with anyone else.
Password Min 8, Max 20 characters required
Register
Already Registered!


New skrf.vi.vna Module¶
As of 2017.02 a new architecture for vna drivers is being implemented.
VNA drivers will now have a common high level functionality across all vendors implemented in an ABCVNA class.
Different vendor drivers will implement their own mid level functionality as needed to implement the ABC class
The low level functions are all implemented as SCPI commands which have a new way of being generated and called
Legacy vna module¶
The old vna.py module containing drivers for PNA, PNA-X, HP8510, etc. will be available as vna_old.py and can be used as follows:
from skrf.vi.vna_old import PNA
SCPI Commands¶
To learn about SCPI, you can read the IVI website, or Wikipedia. For this tutorial you only need to know that SCPI comamnds are provided in a tree structure where similar commands are grouped in branches of the tree. All scpi commands are either ‘set’ commands where the user writes something to instrument or ‘query’ commands where the user is requesting data or information from the instrument and the syntax is like this:
:COMMAND:TREE:BRANCH(?) arg1,arg2
Each branch on the command tree is separated by a colon. Query commands provide a question mark at the end of the command tree and arguments are provided as needed after the command. Here is an example of commands grouped in a branch:
:CALC1:PAR:DEF:EXT 'my_meas','S11' # create a new S11 measurement on channel 1
:CALC2:PAR:CAT? # return a catalog of existing measurements on channel2
:CALC:PAR:SEL 'my_meas' # select 'my_meas' on the default channel (channel1)
With this structure in mind, scikit-rf is adopting a tool where SCPI commands are described in a yaml file, which allows for a very compact and universal way to describe the SCPI command tree. The yaml file is then parsed in order to generate a python script file that accesses the SCPI commands through object methods. See the snippet below from the keysight_pna_scpi.yaml file:
COMMAND_TREE:
CALC<cnum=1>:
DATA:
command: {name: data, set: "<fmt=SDATA>,<data=None>", query_values: <fmt=SDATA>}
branch:
SNP:
PORT: {name: snp_data, query_values: "'<ports=(1, 2)>'"}
PAR:
CAT:
EXT: {name: meas_name_list, query: "", csv: True}
DEF:
EXT: {name: create_meas, set: "'<mname>','<param>'"}
DEL: {name: delete_meas, set: "'<mname>'"}
SEL: {name: selected_meas, set: "'<mname>'", query: ""}
MNUM: {name: selected_meas_by_number, set: <mnum>, query: "", returns: int}
FORM: {name: display_format, set: <fmt=MLOG>, query: ""}
In the command tree, all nodes are either:
A new branch of the command tree
A command
Both a command and a branch, as in :CALC:DATA
In the case that a node is both a branch and a command we need to explicitly mark the mappings of each with ‘branch’ and ‘command’. Otherwise, the presence of a mapping item ‘name’, which is a rational name for the command, indicates that the node is a command. Absent that, the node is assumed to be a branch and is further parsed for more nodes.
yaml Command Syntax¶
For a node that is a command, there are only 2 requirements:
‘name’ must be provided
at least one of ‘set’, ‘query’ or ‘query_values’ must be provided.
Optionally you may also specify the following options in the command for query processing:
‘returns’ : default ‘str’; specify the return type (int, float, str, bool) and the value returned from the functions will be converted into the appropriate python type.
‘csv’ : defalt False; if the return value is a csv list, parse it as such and return a python list where the members are individually converted to the type specified by ‘returns’
‘strip_outer_quotes’ : default True; check if the return value is a string literal encapsulated in quotes and strip these out for proper parsing of the return value.
If a command is read or write only, then you specify only the query or set items. If it is read/write, then you specify both. query_values is just a query command that returns a data set, and will then use the pyvisa query_values convenience function that will automatically parse the returned data and place it in a list or numpy array of floats.
The set/query items are merely the string of arguments that must be provided to the command. For example, the ‘create_meas’ example above looked like this:
:CALC1:PAR:DEF:EXT 'my_meas','S11'
If we placed this command in a python function and called it, it might look something like this:
class SCPI:
def __init__(self, pyvisa_resource):
self.resource = pyvisa_resource
def set_create_meas(self, cnum=1, mname="", param="")
scpi_command = ":CALC{:}:PAR:DEF:EXT '{:}','{:}'".format(cnum, mname, param)
self.resource.write(scpi_command)
vna = SCPI(pyvisa_resource)
vna.set_create_meas(1, "my_meas", "S11")
This illustrates what is going on with the yaml file. If we isolate only the create_meas command in the command tree the yaml mapping looks like this:
CALC<cnum=1>:
PAR:
DEF:
EXT: {name: create_meas, set: "'<mname>','<param>'"}
the python function set_create_meas
is simply the write method of the create_meas SCPI command. The ‘set’ item
in the yaml mapping is the string: "'<mname>','<param>'"
which is the the required arguments for the SCPI command.
The function has three keyword arguments, cnum, mname and param which are enclosed in <> brackets. If an argument
has a default parameter (int, float or string) then it can be specified with an ‘=’ sign.
Using the SCPI functions to write a Driver¶
The parser outputs a python file with a SCPI class. The current model for using this class is to initialize a VNA class, which in turn initialized a pyvisa resource. The VNA object then initializes a SCPI object and assigns it to self.scpi. See the abbreviated code from the keysight_pna.py PNA class __init__ method:
def __init__(self, address=DEFAULT_VISA_ADDRESS, **kwargs):
super(PNA, self).__init__(address, **kwargs)
self.resource.timeout = kwargs.get("timeout", 2000)
self.scpi = keysight_pna_scpi.SCPI(self.resource)
Subsequently, the low-level instrument commands are contained with the .scpi namespace and can be called in the following manner inside vna object methods:
f_start = self.scpi.query_f_start(channel)
self.scpi.set_f_start(channel, f_start)