Image adjustment: transforming image content¶
Color manipulation¶
Most functions for manipulating color channels are found in the submodule
skimage.color
.
Conversion between color models¶
Color images can be represented using different color spaces. One of the most common color spaces is the RGB space, where an image has red, green and blue channels. However, other color models are widely used, such as the HSV color model, where hue, saturation and value are independent channels, or the CMYK model used for printing.
skimage.color
provides utility functions to convert images
to and from different color spaces. Integer-type arrays can be
transformed to floating-point type by the conversion operation:
>>> # bright saturated red
>>> red_pixel_rgb = np.array([[[255, 0, 0]]], dtype=np.uint8)
>>> color.rgb2hsv(red_pixel_rgb)
array([[[ 0., 1., 1.]]])
>>> # darker saturated blue
>>> dark_blue_pixel_rgb = np.array([[[0, 0, 100]]], dtype=np.uint8)
>>> color.rgb2hsv(dark_blue_pixel_rgb)
array([[[ 0.66666667, 1. , 0.39215686]]])
>>> # less saturated pink
>>> pink_pixel_rgb = np.array([[[255, 100, 255]]], dtype=np.uint8)
>>> color.rgb2hsv(pink_pixel_rgb)
array([[[ 0.83333333, 0.60784314, 1. ]]])
Conversion from RGBA to RGB - Removing alpha channel through alpha blending¶
Converting an RGBA image to an RGB image by alpha blending it with a
background is realized with rgba2rgb()
>>> from skimage.color import rgba2rgb
>>> from skimage import data
>>> img_rgba = data.logo()
>>> img_rgb = rgba2rgb(img_rgba)
Conversion between color and gray values¶
Converting an RGB image to a grayscale image is realized with
rgb2gray()
>>> from skimage.color import rgb2gray
>>> from skimage import data
>>> img = data.astronaut()
>>> img_gray = rgb2gray(img)
rgb2gray()
uses a non-uniform weighting of color channels, because of the
different sensitivity of the human eye to different colors. Therefore,
such a weighting ensures luminance preservation
from RGB to grayscale:
>>> red_pixel = np.array([[[255, 0, 0]]], dtype=np.uint8)
>>> color.rgb2gray(red_pixel)
array([[ 0.2125]])
>>> green_pixel = np.array([[[0, 255, 0]]], dtype=np.uint8)
>>> color.rgb2gray(green_pixel)
array([[ 0.7154]])
Converting a grayscale image to RGB with gray2rgb()
simply
duplicates the gray values over the three color channels.
Image inversion¶
An inverted image is also called complementary image. For binary images, True values
become False and conversely. For grayscale images, pixel values are replaced by the
difference of the maximum value of the data type and the actual value. For RGB
images, the same operation is done for each channel. This operation can be achieved
with skimage.util.invert()
:
>>> from skimage import util
>>> img = data.camera()
>>> inverted_img = util.invert(img)
Painting images with labels¶
label2rgb()
can be used to superimpose colors on a grayscale image
using an array of labels to encode the regions to be represented with the
same color.
Contrast and exposure¶
Image pixels can take values determined by the dtype
of the image
(see Image data types and what they mean), such as 0 to 255 for uint8
images or [0,
1]
for floating-point images. However, most images either have a
narrower range of values (because of poor contrast), or have most pixel
values concentrated in a subrange of the accessible values.
skimage.exposure
provides functions that spread the intensity
values over a larger range.
A first class of methods compute a nonlinear function of the intensity,
that is independent of the pixel values of a specific image. Such methods
are often used for correcting a known non-linearity of sensors, or
receptors such as the human eye. A well-known example is Gamma
correction, implemented
in adjust_gamma()
.
Other methods re-distribute pixel values according to the histogram of
the image. The histogram of pixel values is computed with
skimage.exposure.histogram()
:
>>> image = np.array([[1, 3], [1, 1]])
>>> exposure.histogram(image)
(array([3, 0, 1]), array([1, 2, 3]))
histogram()
returns the number of pixels for each value bin, and
the centers of the bins. The behavior of histogram()
is therefore
slightly different from the one of numpy.histogram()
, which returns
the boundaries of the bins.
The simplest contrast enhancement rescale_intensity()
consists in
stretching pixel values to the whole allowed range, using a linear
transformation:
>>> from skimage import exposure
>>> text = data.text()
>>> text.min(), text.max()
(10, 197)
>>> better_contrast = exposure.rescale_intensity(text)
>>> better_contrast.min(), better_contrast.max()
(0, 255)
Even if an image uses the whole value range, sometimes there is very little weight at the ends of the value range. In such a case, clipping pixel values using percentiles of the image improves the contrast (at the expense of some loss of information, because some pixels are saturated by this operation):
>>> moon = data.moon()
>>> v_min, v_max = np.percentile(moon, (0.2, 99.8))
>>> v_min, v_max
(10.0, 186.0)
>>> better_contrast = exposure.rescale_intensity(
... moon, in_range=(v_min, v_max))
The function equalize_hist()
maps the cumulative distribution
function (cdf) of pixel values onto a linear cdf, ensuring that all parts
of the value range are equally represented in the image. As a result,
details are enhanced in large regions with poor contrast. As a further
refinement, histogram equalization can be performed in subregions of the
image with equalize_adapthist()
, in order to correct for exposure
gradients across the image. See the example
Histogram Equalization.
Examples:


Observed (crosses), calculated (full line) and difference (at the bottom) neutron powder diffraction (NPD) profile for Sr 0.9Ba 0.1Co 0.95Ru 0.05O 3−δ phase at 25 °C, refined in the tetragonal P4/mmm space group. The vertical markers correspond to the allowed Bragg reflections.


Bayern after 2 Premier League starlets
by BeSoccerBayern Munich are looking for changes to the team and they seem to have a special interest in the Premier League. According to the 'Daily Mial', the Bavarians are after 2 starlets in the Premier League: goalkeeper Dean Henderson and forward Troy Parrott.
There weren't many incomings at the Allianz Arena in the summer, but Bayern Munich are trying to make a move in the next few months to give a breath of fresh air to their team. In particular, they want youthfulness and are looking for it in English football, where they have got their eye set on 2 Premier League starlets.
According to 'Daily Mail', the Bavarians are after the goalkeeper Dean Henderson, who is on loan at Sheffield United form Manchester United, and the Tottenham striker Troy Parrott.
Henderson is 22 years old and is an England youth international. He is on loan at Sheffield United from the Red Devils, where he is the first choice keeper playing all 12 matches.
Featured links
- BREAKING NEWS: Mourinho replaces Pochettino at Tottenham
- The latest football transfers news and rumours
- Wales, golf, Madrid... in that order
- Luis Enrique returns to Spain national team
Bayern currently have Neuer and Ulreich, but see Henderson as a good option for the future who can give competition to both keepers, who are 33 and 31 respectively.
Troy Parrott is a 17-year-old Irish striker that still hasn't made his Tottenham first-team debut, but has been one of the sensations in UEFA Youth League scoring 5 goals in just 3 matches; 4 of them in the 9-2 rout against Red Star Belgrade.
It is certain that Bayern's interest in Parrott isn't new and Tottenham have been working on a contract extension for some time to avoid one of their big promises moving to the Bundesliga, where Bayern are trying to capture future Premier League talent.


--- layout: default ---
Using wpa_supplicant
as the authetification software of Wi-Fi network,
every time I connect the new network, I have to edit its configuration file
(ex. wpa_supplicant.conf
). Editing it manually is very time-consuming for me,
So I made the shell-script program wifi-entries-setup
to add the new Wi-Fi entry to
the assigned configuration file.
SSID
, [Passphrase]
) are added to the assigned configuration
file (ex. wpa_supplicant.conf
)Usage: wifi-entries-setup [-h]
Get the root privilege and execute wifi-entries-setup
.
Input SSID and Passphrase (optional) interactively following the prompt.
-h
option, the help message is appeared.Example
Add the wireless network whose SSID and passphrase are "foo" and "foobarbaz", respectively.
# wifi-entries-setup Starting to scan WiFi ... 0: foo 1: bar 2: baz Which SSID is registered? (input by No.) > 0 Input passphrase (default NONE) > foobarbaz Protected Wifi network SSID foo was registered and you can connect.
Refer to README.


Exercise greater control over deployments with more information and finer granularity.
Custom media type: ant-man-preview Announced: 2016-04-06
ant-man-preview


|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
| ByteCollection | A collection of byte values. |
| ByteIterator | An iterator over byte values. |
| ByteList | An ordered collection of byte values. |
| ByteListIterator | A bi-directional iterator over byte values. |
| CharCollection | A collection of char values. |
| CharIterator | An iterator over char values. |
| CharList | An ordered collection of char values. |
| CharListIterator | A bi-directional iterator over char values. |
| DoubleCollection | A collection of double values. |
| DoubleIterator | An iterator over double values. |
| DoubleList | An ordered collection of double values. |
| DoubleListIterator | A bi-directional iterator over double values. |
| FloatCollection | A collection of float values. |
| FloatIterator | An iterator over float values. |
| FloatList | An ordered collection of float values. |
| FloatListIterator | A bi-directional iterator over float values. |
| IntCollection | A collection of int values. |
| IntIterator | An iterator over int values. |
| IntList | An ordered collection of int values. |
| IntListIterator | A bi-directional iterator over int values. |
| LongCollection | A collection of long values. |
| LongIterator | An iterator over long values. |
| LongList | An ordered collection of long values. |
| LongListIterator | A bi-directional iterator over long values. |
| ShortCollection | A collection of short values. |
| ShortIterator | An iterator over short values. |
| ShortList | An ordered collection of short values. |
| ShortListIterator | A bi-directional iterator over short values. |
| Class Summary | |
| AbstractByteCollection | Abstract base class for ByteCollection s. |
| AbstractCharCollection | Abstract base class for CharCollection s. |
| AbstractDoubleCollection | Abstract base class for DoubleCollection s. |
| AbstractFloatCollection | Abstract base class for FloatCollection s. |
| AbstractIntCollection | Abstract base class for IntCollection s. |
| AbstractLongCollection | Abstract base class for LongCollection s. |
| AbstractShortCollection | Abstract base class for ShortCollection s. |
| ArrayByteList | An ByteList backed by an array of byte s. |
| ArrayCharList | An CharList backed by an array of char s. |
| ArrayDoubleList | An DoubleList backed by an array of double s. |
| ArrayFloatList | An FloatList backed by an array of float s. |
| ArrayIntList | An IntList backed by an array of int s. |
| ArrayLongList | An LongList backed by an array of long s. |
| ArrayShortList | An ShortList backed by an array of short s. |
| ArrayUnsignedByteList | A ShortList backed by an array of unsigned
byte values. |
| ArrayUnsignedIntList | An IntList backed by an array of unsigned
int values. |
| ArrayUnsignedShortList | An IntList backed by an array of unsigned
short values. |
| ByteCollections | This class consists exclusively of static methods that operate on or return ByteCollections. |
| CharCollections | This class consists exclusively of static methods that operate on or return CharCollections. |
| DoubleCollections | This class consists exclusively of static methods that operate on or return DoubleCollections. |
| FloatCollections | This class consists exclusively of static methods that operate on or return FloatCollections. |
| IntCollections | This class consists exclusively of static methods that operate on or return IntCollections. |
| LongCollections | This class consists exclusively of static methods that operate on or return LongCollections. |
| RandomAccessByteList | Abstract base class for ByteList s backed
by random access structures like arrays. |
| RandomAccessByteList.RandomAccessByteListIterator | |
| RandomAccessByteList.RandomAccessByteSubList | |
| RandomAccessCharList | Abstract base class for CharList s backed
by random access structures like arrays. |
| RandomAccessCharList.RandomAccessCharListIterator | |
| RandomAccessCharList.RandomAccessCharSubList | |
| RandomAccessDoubleList | Abstract base class for DoubleList s backed
by random access structures like arrays. |
| RandomAccessDoubleList.RandomAccessDoubleListIterator | |
| RandomAccessDoubleList.RandomAccessDoubleSubList | |
| RandomAccessFloatList | Abstract base class for FloatList s backed
by random access structures like arrays. |
| RandomAccessFloatList.RandomAccessFloatListIterator | |
| RandomAccessFloatList.RandomAccessFloatSubList | |
| RandomAccessIntList | Abstract base class for IntList s backed
by random access structures like arrays. |
| RandomAccessIntList.RandomAccessIntListIterator | |
| RandomAccessIntList.RandomAccessIntSubList | |
| RandomAccessLongList | Abstract base class for LongList s backed
by random access structures like arrays. |
| RandomAccessLongList.RandomAccessLongListIterator | |
| RandomAccessLongList.RandomAccessLongSubList | |
| RandomAccessShortList | Abstract base class for ShortList s backed
by random access structures like arrays. |
| RandomAccessShortList.RandomAccessShortListIterator | |
| RandomAccessShortList.RandomAccessShortSubList | |
| ShortCollections | This class consists exclusively of static methods that operate on or return ShortCollections. |
Collections of primitive values.
Generally these extensions offer memory
and performance improvements over the
Object
wrapped alternative.
The package provides versions of
the major collections framework interfaces
(Collection
, List
,
Map
, Set
, etc.) and their
helpers (Iterator
, ListIterator
,
etc) for each primitive type, and various concrete
implementations of these.
Also see org.apache.commons.collections.primitives.adapters
.
|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Compilation status goes here.
Add Ggg code here:
Click "Compile", and javacript will emerge here:
If you are not afraid, click
Input your stuff here (it will read q's if empty)
And output goes here:
Compilation status goes here.
Add Ggg code here:
Click "Compile", and javacript will emerge here:
If you are not afraid, click
Input your stuff here (it will read q's if empty)
And output goes here:


Password
Will appear here, long press to select
Add this page to home screen for easy access and offline use.


{% extends "layout.html" %} {% block title %}InstaStyle - Home{% endblock %} {% block content %}
Your image is inspired by art!
Neural style transfer is an optimization technique used to take three images, a content image, a style reference image (such as an artwork by a famous painter), and the input image you want to style — and blend them together such that the input image is transformed to look like the content image, but “painted” in the style of the style image.
InstaStyle allows YOU to stylize your pictures for an amazing result !
{% endblock %}


Albert Camus


{{ partial "head.html" . }}
{{ .Content }} {{ partialCached "footer.html" . }} {{ partialCached "defer.html" . }}


Power 50 2020 - Who will be your nominee?
by TechRadar ProPower 50 2020 - Who will be your nominee?
We’re looking for the best and brightest in the UK mobile industry - who do you feel should be considered to join this year's Power 50?
(Image credit: Future)
The Power 50 is the definitive list of the most influential figures in the UK mobile industry during the past year.
Compiled after in-depth interviews with key senior figures across the industry, our panel of experts look to highlight the great work being done across the UK mobile space, with the final 50 nominees set to be celebrated at the Mobile Industry Awards 2020.
The Power 50 recognises those individuals who imbue their businesses with their values, have influence beyond their existing roles, and who we feel serve as an inspiration to the rest of the trade.
So who will make this year’s list? You can join the debate now on the Power 50 website, where nominations are now open for anyone you feel serves as an inspiration to the rest of the trade.
NOMINATE YOUR POWER 50 2020 CHOICE HERE
To make the Power 50 list, an executive needs to be bold in their leadership and vision, and have exceeded expectations in the different categories we have chosen.
Previous winners of the Power 50 Person Of The Year
- 2019: Marc Allera, CEO of EE and BT Consumer
- 2018: Marc Allera, CEO of EE and BT Consumer
- 2017: David Dyson, CEO, Three UK
- 2016: Sebastian James, Group CEO, Dixons Carphone
- 2015: Sebastian James, Group CEO, Dixons Carphone
- 2014: Andrew Harrison, CEO, Carphone Warehouse
- 2013: Olaf Swantee, CEO, EE
- 2012: Simon Stanford, VP of UK & Ireland telecommunications and networks division, Samsung UK
- 2011: Guy Laurence, CEO, Vodafone UK
- 2010: Tom Alexander, CEO, Everything Everywhere
- 2009: Andrew Harrison, CEO, Carphone Warehouse
- 2008: Kevin Russell, CEO, Three UK
For anymore information on our Power 50 or to get more involved in the Mobile Industry Awards please contact mark.fernor@futurenet.com.


[1]
customer service is easy install guide and 6ft CAT6 cable.
[2]
customer service is easy install guide and 6ft CAT6 cable is working - if like me you can find this at all.


Hello! I am Jenny, the one behind Rough Beak Games, my study background being Computing and Games Development.
There's a few projects on display ready to download and try out. A variety created over the years.
Studying at A2 level going straight into university. Working to try and better the local community as best as possible.
You can follow my progress.
Unity3D game developer student C# language of choice, who has a varying level of skill across many areas, from SQL Databases, Websites and Security to Music, Writing and Digital Art as hobbies.
I have always been in close proxity to the online community, the most notable would be with Nival, developers of Prime World, I helped out as a forum moderator for a little while (Summer 2014).
My preferred games of choice would be either RPGs or MOBAs, favourites being Shin Megami Tensei: Devil Survivor (Atlus) and DOTA 2. Although I really enjoy the Gameboy -> DS side of handheld gaming. I would love to work with Atlus one day!


|
Part A - Sin Sin is an odd function so its imaginary part is nonzero while it's real part is 0 (any values are simply due to imprecision in floating point arithmetic). The magnitude flips signs on the ends due to the squaring of the imaginary number to drag the -1 out from under the square root. Part A - Cosine Cosine is an even function so its imaginary part is 0 and its real part is positive on both ends. The image of the imaginary part shows data, but the scale of it is so close to 0 that the points represent small floating point errors in the data and not real values in the imaginary portion of the signal. Part A - Cosine + Sin The sum is simply the sum of the parts except for the magnitude which is the square root of the sum of the squares of the imaginary and real parts of the signal. This is shown in the fact that the real part of the signal looks like the real part of the cosine because the real part of the sine is 0 and the imaginary is just the opposite, it shows the imaginary part of the sin because the imag. part of a cosine is 0. The phases of the two signals add to simply the phase portion of the signal because of varying signs at different points. Prove Rect mathematically - Part B Prove Gaussian mathmatically - Part C Prove Convolution Theorem - Part D The proof of the Convolution theorem is based on the result of applying the Convolution integral under the Fourier Transform integral. When taking the Fourier Transform of the convolution of two functions we can use the shift theorem to simplify the Fourier integral and as the derivation sequence on page 182 shows the integral simplified and then solved is the multiplication of the FT of one function with the FT of another function. |


--- layout: post title: Net::SFTP 1.1.1 post_id: 66 categories: - announcements date: 2008-02-25 22:35:00.000000000 -07:00 author: Jamis permalink: 2008/2/25/net-sftp-1-1-1.html ---
Net::SFTP is a Ruby library for transferring files using the SFTP (Secure FTP) protocol over SSH. This is a maintenance release consisting of only two changes. First, you no longer need to explicitly call the #connect method. It is called automatically as needed. Second, this release has an explicit (RubyGems) dependency on Net::SSH versions less than 1.99.0. This should pave the way for making smoother the eventual release of Net::SSH v2 (which is not backwards compatible and would otherwise break existing installations of Net::SFTP 1.x).
All users of Net::SFTP are encouraged to upgrade. Using Rubygems, installation is simple:
gem install net-sftp
Alternate source packages (bz2 and zip) may be downloaded from the Net::SSH project page:
http://rubyforge.org/frs/?group_id=274&release_id=19594


|
eDSP
0.0.1
A cross-platform DSP library written in C++.
|
This class implements a ring buffer, also called circular buffer. More...
#include <ring_buffer.hpp>
Public Types | |
| typedef ring_span< T >::value_type | value_type |
| typedef ring_span< T >::pointer | pointer |
| typedef std::add_const_t< pointer > | const_pointer |
| typedef ring_span< value_type >::reference | reference |
| typedef ring_span< value_type >::const_reference | const_reference |
| typedef ring_span< value_type >::iterator | iterator |
| typedef ring_span< value_type >::const_iterator | const_iterator |
| typedef ring_span< value_type >::reverse_iterator | reverse_iterator |
| typedef ring_span< value_type >::const_reverse_iterator | const_reverse_iterator |
| typedef ring_span< value_type >::size_type | size_type |
| typedef std::ptrdiff_t | difference_type |
| typedef std::vector< T, Allocator > | container_type |
Public Member Functions | |
| constexpr | ring_buffer ()=default |
| constexpr | ring_buffer (const ring_buffer &)=default |
| constexpr | ring_buffer (ring_buffer &&) noexcept=default |
| constexpr ring_buffer & | operator= (const ring_buffer &)=default |
| constexpr ring_buffer & | operator= (ring_buffer &&) noexcept=default |
| ring_buffer (size_type N) | |
| Creates a ring_buffer with default constructed elements. More... | |
| ring_buffer (size_type N, const value_type &value) | |
| Creates a ring_buffer with copies of an exemplar element. More... | |
| ~ring_buffer ()=default | |
| Default destructor. The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. More... | |
| void | resize (size_type size) |
| Resizes the ring_buffer to the specified number of elements. More... | |
| void | clear () |
| iterator | begin () noexcept |
| Returns a read/write iterator that points to the first element in the ring_buffer. More... | |
| const_iterator | begin () const noexcept |
| Returns a read-only iterator that points to the first element in the ring_buffer. More... | |
| iterator | end () noexcept |
| Returns a read/write iterator that points to the last element in the ring_buffer. More... | |
| const_iterator | end () const noexcept |
| Returns a read-only iterator that points to the last element in the ring_buffer. More... | |
| reverse_iterator | rbegin () noexcept |
| const_reverse_iterator | rbegin () const noexcept |
| Returns a read-only iterator that points to the first element in the ring_buffer. More... | |
| reverse_iterator | rend () noexcept |
| Returns a read/write iterator that points to the last element in the ring_buffer. More... | |
| const_reverse_iterator | rend () const noexcept |
| const_iterator | cbegin () const noexcept |
| Returns a read-only iterator that points to the first element in the ring_buffer. More... | |
| const_iterator | cend () const noexcept |
| Returns a read-only te iterator that points to the last element in the ring_buffer. More... | |
| const_reverse_iterator | crbegin () const noexcept |
| Returns a read-only iterator that points to the first element in the ring_buffer. More... | |
| const_reverse_iterator | crend () const noexcept |
| Returns a read-only iterator that points to the last element in the ring_buffer. More... | |
| constexpr size_type | size () const |
| Returns the number of elements in the ring_buffer. More... | |
| constexpr size_type | max_size () const |
| constexpr bool | empty () const |
| constexpr bool | full () const |
| constexpr size_type | capacity () const |
| reference | operator[] (std::size_t i) |
| Subscript access to the data contained in the ring_buffer. More... | |
| const_reference | operator[] (std::size_t i) const |
| Subscript access to the data contained in the ring_buffer. More... | |
| reference | at (std::size_t i) |
| Provides access to the data contained in the ring_buffer. More... | |
| const_reference | at (std::size_t i) const |
| Provides access to the data contained in the ring_buffer. More... | |
| reference | front () |
| Returns a read/write reference to the data at the first element of the ring_buffer. More... | |
| const_reference | front () const |
| Returns a read-only reference to the data at the first element of the ring_buffer. More... | |
| reference | back () |
| Returns a read/write reference to the data at the last element of the ring_buffer. More... | |
| const_reference | back () const |
| Returns a read-only reference to the data at the last element of the ring_buffer. More... | |
| template<typename... Args> | |
| void | emplace_front (Args... arg) |
| Inserts an object at the front of the ring_buffer. More... | |
| template<typename... Args> | |
| void | emplace_back (Args... arg) |
| Inserts an object at the end of the ring_buffer. More... | |
| void | push_back (const value_type &item) |
| Add data to the end of the ring_buffer. More... | |
| void | pop_front () |
| Removes the first element of the ring. More... | |
| void | pop_back () |
| Removes the last element of the ring_buffer. More... | |
| const container_type & | buffer () const |
| Returns a const reference to the internal buffer. More... | |
| const_pointer * | data () const |
| Returns a const pointer to the underlying data of the internal buffer. More... | |
This class implements a ring buffer, also called circular buffer.
The term ring buffer refers to an area in memory which is used to store incoming data. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.
The ring_buffer is a STL compliant container. It supports random access iterators, constant time insert and erase operations at the beginning or the end of the buffer and interoperability with std algorithms.
| T | Type of element. |
| Allocator | Allocator type, defaults to std::allocator<T>. |
| typedef ring_span<value_type>::const_iterator edsp::types::ring_buffer< T, Allocator >::const_iterator |
| typedef std::add_const_t<pointer> edsp::types::ring_buffer< T, Allocator >::const_pointer |
| typedef ring_span<value_type>::const_reference edsp::types::ring_buffer< T, Allocator >::const_reference |
| typedef ring_span<value_type>::const_reverse_iterator edsp::types::ring_buffer< T, Allocator >::const_reverse_iterator |
| typedef std::vector<T, Allocator> edsp::types::ring_buffer< T, Allocator >::container_type |
| typedef std::ptrdiff_t edsp::types::ring_buffer< T, Allocator >::difference_type |
| typedef ring_span<value_type>::iterator edsp::types::ring_buffer< T, Allocator >::iterator |
| typedef ring_span<T>::pointer edsp::types::ring_buffer< T, Allocator >::pointer |
| typedef ring_span<value_type>::reference edsp::types::ring_buffer< T, Allocator >::reference |
| typedef ring_span<value_type>::reverse_iterator edsp::types::ring_buffer< T, Allocator >::reverse_iterator |
| typedef ring_span<value_type>::size_type edsp::types::ring_buffer< T, Allocator >::size_type |
| typedef ring_span<T>::value_type edsp::types::ring_buffer< T, Allocator >::value_type |
|
default |
|
default |
|
defaultnoexcept |
|
inlineexplicit |
Creates a ring_buffer with default constructed elements.
| N | The number of elements to initially create. |
This constructor fills the ring_buffer with N default constructed elements.
|
inline |
Creates a ring_buffer with copies of an exemplar element.
| N | The number of elements to initially create. |
| value | An element to copy. This constructor fills the ring_buffer with N copies of value. |
|
default |
Default destructor. The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
|
inline |
Provides access to the data contained in the ring_buffer.
| i | The index of the element for which data should be accessed. |
| std::out_of_range | If __n is an invalid index. |
This function provides for safer data access. The parameter is first checked that it is in the range of the vector. The function throws out_of_range if the check fails.
|
inline |
Provides access to the data contained in the ring_buffer.
| i | The index of the element for which data should be accessed. |
| std::out_of_range | If __n is an invalid index. |
This function provides for safer data access. The parameter is first checked that it is in the range of the vector. The function throws out_of_range if the check fails.
|
inline |
Returns a read/write reference to the data at the last element of the ring_buffer.
|
inline |
Returns a read-only reference to the data at the last element of the ring_buffer.
|
inlinenoexcept |
Returns a read/write iterator that points to the first element in the ring_buffer.
Iteration is done in ordinary element order.
|
inlinenoexcept |
Returns a read-only iterator that points to the first element in the ring_buffer.
Iteration is done in ordinary element order.
|
inline |
Returns a const reference to the internal buffer.
|
inline |
Returns the total number of elements that the ring_buffer can hold.
|
inlinenoexcept |
Returns a read-only iterator that points to the first element in the ring_buffer.
Iteration is done in ordinary element order.
|
inlinenoexcept |
Returns a read-only te iterator that points to the last element in the ring_buffer.
Iteration is done in ordinary element order.
|
inline |
Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
|
inlinenoexcept |
Returns a read-only iterator that points to the first element in the ring_buffer.
Iteration is done in reverse element order.
|
inlinenoexcept |
Returns a read-only iterator that points to the last element in the ring_buffer.
Iteration is done in reverse element order.
|
inline |
Returns a const pointer to the underlying data of the internal buffer.
|
inline |
Inserts an object at the end of the ring_buffer.
| arg | Arguments. |
This function will insert an object of type T constructed with T(std::forward<Args>(args)...) before the specified location.
|
inline |
Inserts an object at the front of the ring_buffer.
| arg | Arguments. |
This function will insert an object of type T constructed with T(std::forward<Args>(args)...) before the specified location.
|
inline |
Returns true if the ring_buffer is empty.
|
inlinenoexcept |
Returns a read/write iterator that points to the last element in the ring_buffer.
Iteration is done in ordinary element order.
|
inlinenoexcept |
Returns a read-only iterator that points to the last element in the ring_buffer.
Iteration is done in ordinary element order.
|
inline |
Returns a read/write reference to the data at the first element of the ring_buffer.
|
inline |
Returns a read-only reference to the data at the first element of the ring_buffer.
|
inline |
Returns true if the ring_buffer is full.
|
inline |
Returns the size() of the largest possible ring_buffer.
|
default |
|
defaultnoexcept |
|
inline |
Subscript access to the data contained in the ring_buffer.
| i | The index of the element for which data should be accessed. |
This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)
|
inline |
Subscript access to the data contained in the ring_buffer.
| i | The index of the element for which data should be accessed. |
This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)
|
inline |
Removes the last element of the ring_buffer.
This is a typical stack operation.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called.
|
inline |
Removes the first element of the ring.
This is a typical stack operation.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called.
|
inline |
Add data to the end of the ring_buffer.
| item | Data to be added. |
This is a typical stack operation. The function creates an element at the end of the ring_buffer and assigns the given data to it.
|
inlinenoexcept |
|
inlinenoexcept |
Returns a read-only iterator that points to the first element in the ring_buffer.
Iteration is done in reverse element order.
|
inlinenoexcept |
Returns a read/write iterator that points to the last element in the ring_buffer.
Iteration is done in reverse element order.
|
inlinenoexcept |
|
inline |
Resizes the ring_buffer to the specified number of elements.
| size | Number of elements the ring_buffer should contain. |
|
inline |
Returns the number of elements in the ring_buffer.


Pairing has always scared me...probably because I paired with people way above my skill level (It never feels good to feel like an idiot). However, pairing with fellow Dev Bootcamp mates is a pleasure. When working with someone at your skill level.
My first pairing building this website.
Working with Mike Steichen was nerve-racking. As my first pair with someone at my level, I wasn't sure if I was supposed to run-my-mouth or remain quiet and inquisitive. Or both. It didn't help that we had a Dev Bootcamp guide evaluating us.
This was a particularly bad week to pair as well -- I had almost but forgotten my html knowledge. We stumbled on questions regarding HTML5 formatting. And, we took an hour to figure out how to add padding and margins.
Luckily, we quickly settled into a workable and fun relationship.
By first taking 5 minutes to explain our philosophies on pairing (driving vs. navigation), we were able to fix all the awkward silences that had troubled my previous pairing sessions. There was no indecision on whether something should be said or not.
The biggest difference: Switching roles
Perhaps, the confidence booster in Dev Bootcamp pairing is that we can switch roles. Mike and I decided from the get-go to switch every 30 minutes -- which surprising turned out to be the right amount of time. According to the Pomodoro technique, you should give yourself about half an hour of complete focus, then a break. Likewise, switching to navigator every 30 minutes helps me take a bigger picture on the problem every now and then.
Interesting thoughts
What's interesting writing this post is that I've come to realize how much programming is a team sport. The two most important things to a productive and successful pairing session (as in, you solve the programming problem efficiently and concisely), is that the pairs communicate. You over communicate. You say when you're getting tired and need to switch. You say your thoughts aloud on what might or might not work. You listen to subtle cues to keep quiet and let your pair figure things out. You communicate on what it means to pair. Just those 5 minutes in the beginning are a huge time saver.


vibe_elastic_logger.logger
Aliases
IndexCreator
string delegate() @safe
An IndexCreator is a delegate that calculates the ElasticSearch index that the logger should log to.
Structs
ElasticInfo
ElasticSearch server connection information.
Classes
ElasticLogger
ElasticSearch logger implementation.


Summary
{{if not .ProjectData.Version}}
There are no builds of this project
{{end}}Hooray! There are no recent test failures.
Sort Groups By:
[[failure.groupingField]]
| [[headerField.name]] | |
|---|---|
| [[getHeaderVal(field, index)]] |
[[buildVariant]]


`Ad hoc' problems are those whose algorithms do not fall into standard categories with well-studied solutions. Each ad hoc problem is different; no specific or general techniques exist to solve them.
Of course, this makes the problems the `fun' ones, since each one presents a new challenge. The solutions might require a novel data structure or an unusual set of loops or conditionals. Sometimes they require special combinations that are rare or at least rarely encountered.
Ad hoc problems usually require careful reading and usually yield to an attack that revolves around carefully sequencing the instructions given in the problem.
Ad hoc problems can still require reasonable optimizations and at least a degree of analysis that enables one to avoid loops nested five deep, for example.
More ad hoc problems appear on this web site than any other kind of problem. Always be ready for an ad hoc problem if you can not classify a problem as one of the other standard types (to be listed later).


In the GraphQL world, a lot of articles complain how to handle stuff like an authentication, or side-effects of operations. Should we put it inside the business logic? Shall we use a higher-order function to enhance queries and mutations as well, for example, with an authorization logic? Or maybe use schema directives. There is no single answer anyway.
Nest ecosystem is trying to help with this issue using existing features like guards and interceptors. The idea behind them is to reduce redundancy and also, supply you with tooling that helps creating well-structured, readable, and consistent applications.
You can use either guards, interceptors, and pipes in the same fashion as in the simple REST application. Additionally, you are able to easily create your own decorators, by leveraging custom decorators feature. They all act equivalently. Let's have a look at the following code:
{{ useGuardsExample }}
As you can see, GraphQL works pretty well with both guards and pipes. Thanks to that you can, for instance, move your authentication logic to the guard, or even reuse the same guard class as in the REST application. The interceptors works in the exact same way:
{{ useInterceptorsExample }}
However, the ExecutionContext
received by both guards and interceptors is somewhat different. GraphQL
resolvers
have a separate set of arguments, respectively, root
, args
, context
, and
info
.
Hence, we need to transform given ExecutionContext
to GqlExecutionContext
, which is
basically
very simple.
{{ gqlExecutionContext }}
GqlExecutionContext
exposes corresponding methods for each argument, like getArgs()
,
getContext()
,
and so on. Now we can effortlessly pick up every argument specific for currently processed request.
As mentioned before, the custom decorators feature works like a charm with
GraphQL
resolvers as well. Though, the factory function takes an array of arguments, instead of a request
object.
{{ customDecorators }}
And then:
{{ customDecoratorsExample }}


2 overrides of PerformAction
Microsoft.PowerShell.Security (2)
security\SignatureCommands.cs (2)
295
protected override Signature
PerformAction
(string sourcePathOrExtension, byte[] content)
579
protected override Signature
PerformAction
(string sourcePathOrExtension, byte[] content)
1 reference to PerformAction
Microsoft.PowerShell.Security (1)
security\SignatureCommands.cs (1)
228
if ((Signature =
PerformAction
(sourcePathOrExtension, Content)) != null)


If the component id is NOT a relative path from the parent document's baseURI, you should listen for the monocle:component:baseuri event and change the value of evt.m.cmptURI.
monocle:component:baseuri
evt.m.cmptURI


Ocala events
-
body moving foward knees lock
Easton Area Restaurant Week begins Sunday | lehighvalleylive.com
Jan 22, 2010 . Easton Area Restaurant Week takes off this weekend, inviting . Mangia Italian Restaurant, 190 S. Greenwood Ave., mangiaofeaston.com .
http://www.lehighvalleylive.com/entertainment-general/index.ssf/2010/01/easton_area_restaurant_week_be.htmlMangia Italian Restaurant - Easton, PA - Italian Restaurant, Caterer ...
Mangia Italian Restaurant, Easton, PA. . Places near Mangia Italian Restaurant . Serving lunch & dinner, our menu features wood-oven pizza, favorites such .
http://www.facebook.com/pages/Mangia-Italian-Restaurant/115363711826817
john h sage investments Upcoming events in Ocala
- Sponsored event
busch gardens and orlando and florida
Apr 6 - Dance It Studio
subdivision map act easements song lyrics billy joel my life
- Sponsored event
c bickham dickson park
Apr 6 - Downtown Disney
web counter free hosting one moore productions voice over talant
dna rune hamingja yngvi frey Hottest Tickets
-
Apr 11make multiple drives look like 1
Amway Center -
Apr 28congress and toxicology and meeting
Amway Center -
Jun 25panasonic 7 portable dvd player
Bob Carr Performing Arts Center -
Mar 30motorcycleing in myrtle beach
Amway Center -
Aug 27nl all star standings
Amway Center -
Jun 21nicola fitzharris newcastle upon tyne
Amway Center -
Sep 13adjusting 2005 dodge caravan headlights
Francis Field -
Mar 17painted house river scene
St Augustine Amphitheatre -
Oct 8a chorus lins song
Amway Center -
May 4petsafe rf 67 dog collar battery
Bob Carr Performing Arts Center
Ocala's best venues
-
Restaurant.com - Dining Tips at Restaurant.com Philly Restaurants
Dec 14, 2011 . 64-66 Center Square, Easton, PA . Cedar Hollow Inn Restaurant & Bar . Mangia!Italian Restaurant. 322 E Wyomissing Ave., Mohnton, PA .
https://foursquare.com/restaurant_com/list/dining-tips-at-restaurantcom-philly-restaurants -
Rosanna's Restaurant in Bethlehem: Get Discounted Gift Certificates ...
Find out more about Rosanna's Restaurant in Bethlehem, PA at Restaurant.com. Purchase discounted gift certificates, view photos, browse menus and save!
http://www.restaurant.com/rosannas-restaurant-bethlehem-italian-pid=43232 -
Milano's Pizza & Family Restaurant Roslyn | Food Delivery | GrubHub
View menus, reviews, and coupons for Milano's Pizza & Family Restaurant in . restaurant menu and coupons . 1335 Easton Rd Roslyn,PA |<PHONE_NUMBER> .
http://www.grubhub.com/philly/milanos-pizza--family-restaurant-1335-easton-rd-roslyn/like all get out
98 people's favorite
-
Kunkletown Restaurants | Restaurants in Kunkletown, PA - YP.com
Results 1 - 30 of 652 . 652 listings of Restaurants in Kunkletown on YP.com. Find reviews, directions & phone numbers for the best restaurants in Kunkletown, PA.
http://www.yellowpages.com/kunkletown-pa/restaurants -
Brodheadsville Restaurants | Restaurants in Brodheadsville, PA ...
Results 1 - 30 of 536 . 536 listings of Restaurants in Brodheadsville on YP.com. Find reviews, directions & phone numbers for the best restaurants in Brodheadsville, PA. . Mangia Baby . Website; » Coupons; » Menu; » More Info; » Add Photos .
http://www.yellowpages.com/brodheadsville-pa/restaurants


The Python affine6p lib is to estimate affine transformation parameters between two sets of 2D points.:
| x' | | a b p | | x |
| y' | = | c d q | | y |
| 1 | | 0 0 1 | | 1 |
When the sets are more than three points, the lib estimate parameters with the least squares method.
In making this lib, I used a lot of ideas in nudged lib. Ref: https://github.com/axelpale/nudged-py
Use pip:
pip install affine6p
You have lists of points for the original and converted of the transformation function to be estimated:
import affine6p
origin = [[0,0], [1,0], [0,1], [1,1]]
convert = [[0,0], [1,0], [0,1], [1,1.1]]
trans = affine6p.estimate(origin, convert)
trans.get_matrix()
# [[1.0, 0.0, 0.0],
# [0.050000000000000044, 1.05, -0.02499999999999991],
# [0, 0, 1]]
affine6p.estimate_error(trans, origin, convert)
# 0.025000000000000022
When the number of origin is 1, assume the following relationship:
a = d = 1 and b = c = 0
When the number of origin is 2, assume the following relationship as described in estimate_helmert.:
a = d and b = -c
You can access Transform class members.:
trans.a() # params[0]
trans.b() # params[1]
trans.c() # params[2]
trans.d() # params[3]
trans.p() # params[4]
trans.q() # params[5]
trans.get_matrix() # [[a, b, p], [c, d, q], [0, 0, 1]]
trans.get_rotation_x() # math.atan2(-b, a)
trans.get_rotation_y() # math.atan2(c, d)
trans.get_scale_x() # sqrt(a*a + b*b)
trans.get_scale_y() # sqrt(c*c + d*d)
trans.get_scale() # sqrt((scale_x*scale_x+scale_y*scale_y)*0.5)
trans.get_translation() # [p, q]
trans.params # [a, b, c, d, p, q]
You can apply transform or rotate to 2D point or points. The rotate means p = q = 0.:
trans.transform([0, 0])
trans.transform([[0, 0], [1, 1]])
point = [0, 0]
trans.transform_inv(point)
trans.rotate(point)
trans.rotate_inv(point)


PAM_ACCESS
Section: Linux-PAM Manual (8)Updated: 06/16/2009
Index Return to Main Contents
pam_access - PAM module for logdaemon style login access control
Synopsis
- pam_access.so [debug] [nodefgroup] [noaudit] [accessfile=file] [fieldsep=sep] [listsep=sep]
DESCRIPTION
By default rules for access management are taken from config file FC/etc/security/access.confF[] if you don't specify another file.
If Linux PAM is compiled with audit support the module will report when it denies access based on origin (host or tty).
OPTIONS
accessfile=/path/to/access.conf
- Indicate an alternative FCaccess.confF[] style configuration file to override the default. This can be useful when different services need different access lists.
debug
- A lot of debug information is printed with syslog(3).
noaudit
- Do not report logins from disallowed hosts and ttys to the audit subsystem.
fieldsep=separators
- This option modifies the field separator character that pam_access will recognize when parsing the access configuration file. For example: fieldsep=| will cause the default `:' character to be treated as part of a field value and `|' becomes the field separator. Doing this may be useful in conjunction with a system that wants to use pam_access with X based applications, since the PAM_TTY item is likely to be of the form "hostname:0" which includes a `:' character in its value. But you should not need this.
listsep=separators
- This option modifies the list separator character that pam_access will recognize when parsing the access configuration file. For example: listsep=, will cause the default ` ' (space) and `\t' (tab) characters to be treated as part of a list element value and `,' becomes the only list element separator. Doing this may be useful on a system with group information obtained from a Windows domain, where the default built-in groups "Domain Users", "Domain Admins" contain a space.
nodefgroup
- User tokens which are not enclosed in parentheses will not be matched against the group database. The backwards compatible default is to try the group database match even for tokens not enclosed in parentheses.
MODULE TYPES PROVIDED
All module types (auth, account, password and session) are provided.
RETURN VALUES
PAM_SUCCESS
- Access was granted.
PAM_PERM_DENIED
- Access was not granted.
PAM_IGNORE
-
pam_setcred was called which does nothing.
PAM_ABORT
- Not all relevant data or options could be gotten.
PAM_USER_UNKNOWN
- The user is not known to the system.
FILES
FC/etc/security/access.confF[]
- Default configuration file
SEE ALSO
access.conf(5), pam.d(5), pam(8).
AUTHORS
The logdaemon style login access control scheme was designed and implemented by Wietse Venema. The pam_access PAM module was developed by Alexei Nogin<EMAIL_ADDRESS>The IPv6 support and the network(address) / netmask feature was developed and provided by Mike Becher<EMAIL_ADDRESS>Index
This document was created by man2html, using the manual pages.
Time: 05:34:28 GMT, December 24, 2015


My resume can also be found as a PDF and on LinkedIn
Education
UC Berkeley (2015 - 2019)- Double major in Computer Science (honors) and Applied Mathematics (honors).
- GPA: 3.99 / 4.00
- Dean's List from Fall 2015 - present
- Relevant Courses: Machine Learning, Convex Optimization, Artificial Intelligence, Theoretical Statistics, Algorithms, Computer Architecture, Randomized Algorithms, Data Structures . Full list here
Publications
- Learning Actionable Representions with Goal-Conditioned Policies
Dibya Ghosh, Abhishek Gupta, Sergey Levine.
ICLR 2019. Arxiv - Variational Inverse Control with Events
Justin Fu, Avi Singh, Dibya Ghosh, Larry Yang, Sergey Levine.
NeurIPS 2018. Arxiv - Divide-and-Conquer Reinforcement Learning
Dibya Ghosh, Avi Singh, Aravind Rajeswaran, Vikash Kumar, Sergey Levine.
ICLR 2018. Arxiv - Theory Meets Data
Ani Adhikari, (editor: Dibya Ghosh), et al.
PDF (Last updated 01/2017) - Development of a Computationally Optimized Model of Cancer-induced Angiogenesis through Specialized Cellular Mechanics
Dibya Ghosh
Intel ISEF 2015. Arxiv
Research
Deep Reinforcement Learning- Working under Sergey Levine in the Berkeley AI Research Lab (BAIR)
- Focused on building flexible and powerful deep reinforcement learning algorithms better suited for solving complex real-world robotic problems
- Working under the supervision of Dr. Benjamin Brown at Lawrence Berkeley National Laboratory (Brown Lab)
- Focused on developing interpretable and explainable machine learning algorithms for analyzing high-dimensional scientific systems, such as genomics and agriculture.
Experience
Head Undergraduate Student Instructor for UC Berkeley Statistics (Jan 2017 - June 2019)- Spring '19: Head uGSI for Statistics 140: Probability for Data Science.
- Fall '18: uGSI for Statistics 140: Probability for Data Science.
- Spring '18: Head uGSI for Statistics 140: Probability for Data Science.
- Fall '17: Head uGSI for Statistics 134: Concepts of Probability.
- Spring '17: uGSI for pilot iteration of Statistics 140: Probability for Data Science.
- Responsibilities as a head GSI include monitoring course infrastructure, managing and mentoring uGSIs, writing course content and quizzes, teaching two discussion sections, and holding weekly office hours.
- Working with < cloaked > in deployment of machine learning toolkits for alternative architectures
- See Randomized Community Segmentation in Graphs in Research above for more details.
- Worked with Ani Adhikari and Jason Zhang to develop and design curriculum for Statistics 140: Probability for Data Science.
- Co-wrote the prob140 library with Jason Zhang, a data science library geared toward probability theory written for Prob140 in Python. The library supports graphical visualization and computational tools for finite, infinite, joint, and continuous probability distributions as well as Markov Chains and other random processes.
- Prototyped and fleshed out labs, projects, and other instructional material
- Designed build system and pipeline for prototyping HW assignments and deployment to students
- Worked closely with Jupyter and Gradescope to optimize student submission of assignments
- Data Science Community Visualization for the Annual Ecosystem Report @ BIDS
- Applying unsupervised learning techniques to find graph clusters and identify communities of and topics in data science research.
- Managed the front-end development with D3.JS and AngularJS
- Responsbile for integration with internal pipeline through Flask, Mongo DB, and MySQL.
- Developing the backend for materials and datasets in use for the pioneering Data Science class (500 students)
- Responsibilities involved exploring appropriate datasets for course materials, running preliminary statistical analyses of datasets, designing examples to include in the textbook, Computational and Inferential Thinking, and developing exercises to include in practice sets or assignments.
Awards and Honors
- CS Major Citation (awarded to the top graduating senior in Computer Science)
- Outstanding Graduate Student Instructor Award (awarded to top 10% of GSIs)
- Finalist for CRA Outstanding Undergraduate Researcher Award (awarded to ~20 students nationally)
- Quantedge Award for Academic Excellence (awarded to ~120 seniors at UC Berkeley)
- 3rd Place worldwide at Intel International Science Fair 2015 in Bioinformatics / Computational Biology
- Dean's Honor List (top 4% at UC Berkeley) for Fall 2015, Spring 2016, Fall 2016, Spring 2017, Fall 2017
- 1st Place in Pacman AI competition for CS 188 in Summer 2016
- Robert J. Kraft Award for Freshmen (awarded to ~ 300 people in the 9000-person freshman class)
- Intel Award for Computer Science (best CS related project at CCCSEF)
- Chevron Award for Innovation (best project at CCCSEF)


app.initialize();
About 2014 Textbook Fair
Region 5 Contacts
Directions to Region 5
4th Floor Map
Local Restraunts
Attractions
Schedule of Events
Presenters
Home
Page
About
2014 Fair
Rest
Rooms
Help
#s


{% extends 'base_email.html' %}
{% block message_title %}{{ message_title }}{% endblock %}
{% block message_body_opening %}
You've successfully unsubscribe from DVO Alerts. We've removed your email address {{ recipient.email }} from our mailing list.
{% endblock %}
{% block message_body_intro %}
From now on, you'll no longer receive any emails from us. Thanks and see you around.
{% endblock %}


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
IN THE HIGH COURT OF KERALA AT ERNAKULAM WA.No. 181 of 2010() 1. STATE OF KERALA,REPRESENTED BY THE ... Petitioner Vs 1. SIMON K.FRANCIS,DIRECTOR,CANUS GRANITES ... Respondent 2. THE MEMBER SECRETARY,THE KERALA STATE 3. THE CHAIRMAN,THE KERALA STATE POLLUTION 4. A.K.SURENDRAN,SENIOR ENVIRONMENTAL For Petitioner :GOVERNMENT PLEADER For Respondent :SRI.M.K.DAMODARAN (SR.) The Hon'ble the Chief Justice MR.J.CHELAMESWAR The Hon'ble MR.
An industry by name Canon Granites Private Limited, Perumpilavu, Thrissur District of which one 'Mr.Simon K.Francis' is a Director, had applied for the consent of the Pollution Control Board (hereinafter referred to as Board)for installation of two additional secondary Crushers. The said application was rejected by the Board. It appears from the records that the said industry proceeded to install the additional crushers, even though the Board declined consent. The Board initiated action against the said industry. The industry approached this Court by way of Writ Petition. The full particulars of the same may not be necessary, except to state that by order dated 08.04.2005, this Court gave certain directions to the Pollution Control Board to examine whether the functioning of the above industry is causing any pollution beyond the limits permissible under the law. It is alleged against one Surendren that he demanded from the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:2:- above mentioned Simon K.Francis an illegal gratification of an amount of `15 lakhs for giving a favourable report. The said Simon K.Francis complained to the vigilance authorities of the State who in turn laid a trap on 23.05.2005 at about 7.00 P.M. and vigilance case No. 07/05 was registered, the investigation of which was eventually entrusted to CBI by virtue of an order of this Court dated 24.02.2006 in W.P. (C)19759 of 2005 filed by Mr.Simon K.Francis. It appears, from the records, that the CBI completed the investigation in the said matter and filed a final report under Section 173 of the Criminal Procedure Code on the file of Special Judge of CBI Court, Ernakulam, opining that the above mentioned Surendran committed offences under Sections 7, 13 (2) r/w 13 (1)(d) of the Prevention of Corruption Act, 1988.
2. Based on another complaint given by one Muraleedharan, the petitioner in W.P(C) 36185 of 2007, another vigilance case No. 21 of 2000 on the file of Vigilance Department Kozhikkode is registered against the above mentioned Surendran and in that case also a trap was laid and final report was filed before the Enquiry Commissioner, Vigilance Department, W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:3:- Kozhikode as case No. 01 of 2008 reporting that Surendran is required to be tried for offences under the Prevention of Corruption Act.
3. A charge memo dated 31.10.2008, came to be issued by the State of Kerala framing certain charges against one Mr.Jeyaprasad, who was working as the Member Secretary of the Kerala State Pollution Control Board in connection with sordid episode mentioned earlier. The substance of the allegation in the charge memo is that Jeyaprasad created some false documents with an intention to protect Surendran, who was working as Environmental Engineer in the Pollution Control Board at Trichur, who was facing criminal cases under the Prevention of Corruption Act mentioned earlier. The relevant portion of the charge memo is as follows:
"Upon coming to know of the said trap, Shri A.K. Surendran and other officials of Kerala State Pollution control Board Trichur, namely Smt. Sindhu Radhakrishna, AEE, Smt. Suseela Nair, AE, Smt. K.S. Vinaya, AE and Smt. Bindu Vinod Junior Scientific Assistant on daily wages, agreed among them solves to create false de fence documents to show as if an adverse report had already been sent against Canon W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:4:- Granites P. Ltd before the passing of the bribe money and thereby that there was a motive for the bribe amount being taken on behalf Shri Surendran and, in pursuance of the said agreement, the said officials namely Smt. Sindhu Radhakrishnan, Smt. Suseela Nair, Smt. K.S. Vinaya and Smt. Bindu Vinod unauthorisedly came to the district Office of Pollution Control Board, Trichur on 29.05.2005 (Sunday) and Smt. Sindhu Radhakrishnan, Smt. Suseela Nair, Smt. K.S. Vinaya, created a letter falsely dated 28.05.2005 addressed to standing counsel of Kerala State Pollution control Board in the Hon'ble High Court of Kerala, Ernakulam, with a copy marked to the Member Secretary, Kerala State Pollution Control Board, Trivandrum conveying that the result of the conduct of the trial run at M/s. Canon Granites was adverse and Smt. Bindu Vinod falsely showed the despatch of the said letter on 28.05.2005 in the Despatch Register.
The investigation of the said case was taken over by the CBI in compliance to the direction issued by the Honourable High Court of Kerala. During the CBI investigation you have produced before the investigating officer, a photocopy of the said letter in which you have falsely and with the intention to support the false claim of Shri Surendran and others that the said letter was dispatched on 28.5.2005 , put your initial and d ate as 28/5 with the intention of showing that the said letter was received by you before the passing of the bribe money and thereby to make it appear that there was no motive for the bribe being received on behalf of Shri Surendran and falsely claimed before the investigating Officer that the sake letter was received by you from Shri W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:5:- A.K.Surendran on 28.5.2005 while passing through Trichur, whereas the said letter was made only on 29.5.2005, despatched thereafter and reached office of the Member Secretary, Kerala State Pollution Control Board only on 3.6.2005.
That you, Shri S.D. Jeyaprasad thereby failed to maintain absolute integrity and violated Rule 3 of Kerala Government Servants Conduct Rules, 1960".
The Government thought it fit not to conduct any detailed enquiry against the above mentioned Jeyaprasad with regard to the allegation contained in the above mentioned charge memo but decided to impose a minor penalty of censure as the same could be imposed without resorting to a regular departmental enquiry but by following a summary procedure contemplated under Rule 16 read with Rule 11 of the Kerala Civil Services (Classification, Control and Appeal) Rules, 1960. In view of the decision of the Government to impose such minor penalty, a further notice dated 14.06.2010 came to be issued to Jeyaprasad calling upon him to explain as to why his appointment as Chairman of the Pollution Control Board should not be terminated. Challenging the order W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:6:- imposing punishment of Censure dated 24.03.2010 and notice dated 14.06.10 Jeyaprasad filed W.P. (C) No.20211 of 2010.
3A. It can be noticed from the above extract that the allegations against Jeyaprasad are very grave in nature whatever be the truth of the allegations. If the said allegations are proved, Jeyaprasad, according to us, would be guilty of various offences under the Indian Penal Code such as offence under Section 192 of fabricating false evidence etc. However, in spite of such grave allegations, the State of Kerala never thought it fit to register any crime against said Jeyaprasad, on the other hand rested content with initiation of a departmental proceeding of disciplinary action, which also was closed by awarding a minor so called punishment of Censure.
4. Mr.S.D.Jeyaprasad was working as Member Secretary of the Kerala State Pollution Control Board, a statutory board constituted under the Prevention of Water Pollution Control Act 1974, w.e.f. 18.04.2005. By a Government Order G.O. (Rt.) No. 71/2009/Envt. dated 31.08.2009, Mr. Jeyaprasad was appointed as the Chairman of the Kerala State Pollution Control W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:7:- Board for a period of one year from the date of his taking over charge. Subsequently, by a letter dated 27.03.2010 of the Secretary to Government, Government of Kerala, Environment (A) Department, the said Jeyaprasad was informed that the Government proposes to make his tenure as the chairman of the Pollution Control Board co-terminus with the date of his retirement from the Board service i.e., 31st March, 2010 and called upon Jeyaprasad to show cause, if any, as to why such a decision should not be taken.
5. Challenging the said communication dated 27.3.2010, Mr.Jeyaprasad filed a Writ Petition No. 11235 of 2010. Along with the said Writ Petition he also sought for an interim order seeking to stay all the operations of the above mentioned proceedings. On 31.3.2010, an interim order as sought for by the petitioner was granted. Subsequently, by filing I.A. 10950 of 2010, the above mentioned Jeyaprasad also sought for a positive direction to continue him in the office of Chairman for a period of 3 years. The said prayer was rejected by this Court by order dated 18.08.2010. Aggrieved by the said order Mr. Jeyaprasad W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:8:- filed W.A. No. 1436 of 2010. By interim order dated 20.10.2010 in the above mentioned appeal, a Division Bench of this Court ordered "stay against termination of the appellant until disposal of the said Writ Appeal".
6. Two Writ Petitions, viz. W.P.(C) Nos. 36185 of 2007 and 36205 of 2007, came to be filed by two persons; (1) Mr.Muraleedharan and (2) Mr.Simon K.Francis respectively. The latter is the defacto complainant in Crime Nos. 21 of 2000 and 05 of 2007 registered against the above mentioned Surendran, Environmental Engineer at Trichur on the file of the CBI.
7. The two writ petitions came to be heard together and allowed by common judgment dated 09th October, 2009 with certain directions as follows :
"In the above circumstances, I direct the first respondent to consider the matter in the right perspective in the light of the findings hereinabove and pass orders regarding: (1) whether it is necessary to keep the 4th respondent under suspension in view of the criminal cases pending against him;(2) whether the promotion given to the 4th respondent contrary to Rules as Senior Environmental Engineer requires to be cancelled and (3) whether it is W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:9:- necessary to initiate disciplinary proceedings in respect of the allegations of corruption against the 4th respondent and issue necessary directions to the Pollution Control Board in that regard, as expeditiously as possible, at any rate, within one month from the date of receipt of a copy of this judgment. In any event, in the meantime, the 4th respondent shall be moved out of Palakkad forthwith and he shall not be posted either at Palakkad or Thrissur where the cause of action for the two criminal cases arose, until and unless he is acquitted in the two criminal cases. Orders passed by the Government as directed above shall be communicated to the petitioners within two weeks from the date of passing the orders.
These Writ Petitions are disposed of as above."
While examining the above mentioned two Writ Petitions, the learned Single Judge, who heard those Writ Petitions made certain remarks against the State of Kerala and aggrieved by the same, State of Kerala filed Writ Appeal Nos. 181 of 2010 and 211 of 2010.
8. In the background of the abovementioned facts, the various submissions made in these batch of matters are required to be examined. We shall now deal with these matters individually.
W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:10:-
9. W.P.(C) No.20211 of 2010 is filed with the prayer as follows:
"i. issue a writ of certiorari or any other appropriate writ, order or direction quashing Exts.P19 and P24 orders;"
Exts.P19 and P24 which are impugned in the said writ petition are proceedings dated 24.03.2010 and 14.06.2010 respectively. Earlier of the two proceedings is a Government Order, GO(Rt) No.22/10/Envt. by which the Government decided to award the punishment of censure to Jayaparasad for the misconduct alleged in the memo of charges dated 31.10.2008 referred to earlier. It is already noticed that such a punishment was awarded following a summary procedure contemplated under Rule 16 of the Kerala Civil Services (Classification, Control and Appeal) Rules, 1960 without a regular departmental enquiry. The second of the abovementioned proceedings is a show cause notice consequent upon the imposition of punishment mentioned earlier. By the said proceedings, the Government called upon Jeyaprasad to show cause as to why he should not be removed from the office W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:11:- of the Chairman of the Kerala State Pollution Control Board.
10. Coming to W.P.(C) No.11235 of 2010, the prayers are as follows:
"i. issue a writ of certiorari or any other appropriate writ, order or direction quashing the operation and all further proceedings in pursuance to Ext.P6;
ii. issue a writ of mandamus or any other appropriate writ, order or direction commanding the respondents to permit the petitioner to continue to hold the office of the Chairman of the Kerala State Pollution Control Board, until his term of office, as contemplated under Section 5(1) of Act 6 of 1974 and Section 7 (1)of Act 14 of 1981 expires and the successor enters in office;"
The impugned proceedings, Ext.P6 dated 27.03.2010, is already extracted earlier in this judgment. The substance of the said proceedings is that it is a notice calling upon Jeyaprasad to explain why his tenure as the Chairman of the Kerala State Pollution Control Board should not be confined to 31st March, 2010.
11. The main submission made in the said writ petition is regarding the competence of the State to reduce the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:12:- tenure of the office as proposed in the show cause notice dated 27.03.2010. The submission is that under Section 7(1) of the Air (Prevention and Control of Pollution) Act, 1981 a member of the Board constituted under the said Act shall hold the office for a term of 3 years from the date on which his nomination is notified in the Official Gazette, therefore the tenure statutorily fixed cannot be curtailed by the Government.
12. Jeyaprasad was appointed as the Chairman of the Kerala State Pollution Control Board in exercise of the powers conferred on the Government of Kerala both under Section 4 (2)
(a) of the Water (Prevention and Control of Pollution) Act, 1974 and Section 5 (2) (a) of the Air (Prevention and Control of Pollution) Act, 1981. Section 8 of the Air (Prevention and Control of Pollution) Act, 1981 and Section 6 of the Water (Prevention and Control of Pollution) Act, 1974 prescribed certain disqualifications. Both the Sections stipulate that no person who suffers any one of the specified disqualifications under either of the abovementioned Sections shall be a member of the State Pollution Control Board. Conviction for an offence which in the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:13:- opinion of the Government involves moral turpitude is one of the disqualifications prescribed under both the enactments.
13. The allegations contained in the charge memo dated 31.10.2008, if proved against Jeyaprasad, would render Jeyaprasad guilty of an offence (fabricating false evidence) under Section 192 of the Indian Penal Code at the least and may also establish the commission of other offences like abetment etc. We make it clear that we are not recording any conclusive finding that Jeyaprasad is guilty of any such offence but only indicate that allegations made against him, if proved, are likely to result in such a consequence. In spite of the gravity of the allegations the State of Kerala never thought it fit to register a crime against Jeyaprasad much less investigate the same.
14. The necessity to maintain the purity of the administration (in our opinion) squarely demands a proper investigation in accordance with law into such allegations and more particularly when the allegations are made by the State itself in a departmental proceedings. The primary responsibility of the State is to maintain law and order and also the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:14:- constitutional obligation to provide a rational and clean governament oblige the State to investigate allegations of commission of crime whenever they come to the notice of the State. The State cannot act arbitrarily by selectively applying the law. That would be negation of the Rule of law. The background in which the allegations of fabrication of false evidence is made against Jeyaprasad is already noticed. The two cases against Surendran under the Prevention of Corruption Act are already being investigated by the Delhi Special Police Establishment [popularly known as Central Bureau of Investigation(CBI)] pursuant to an order of this Court dated 24.02.2006 in W.P.(C) No.19757 of 2005. In the context of the said case, the allegations against Jeyaprasad, in our opinion, may also give rise to a charge of abetment. The State does not come forward with any explanation as to why such allegations are never subjected to any investigation in accordance with law. On the other hand, the State of Kerala which had initiated a departmental proceeding against Jeyaprasad by issuing the charge memo dated 31.10.2008 strangely thought it fit to appoint him to be the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:15:- Chairman of the Pollution Control Board by the order dated 31.08.2009 (some ten months after the initiation of the disciplinary proceedings), without concluding the same. Sections 8 and 6 of the Air and Water Pollution Control Acts positively disqualify persons found guilty of offences involving moral turpitude. The State cannot ignore the existence of such allegations which if proved would result in the conviction of a person for offences involving moral turpitude, while choosing people to hold a responsible public office. We are therefore of the opinion that this is a fit case where the State should be directed to register a criminal case in accordance with law on the basis of the allegations made in the memo of charges dated 31.10.2008 framed against Jeyaprasad. We direct accordingly.
15. It is surprising to notice that while making appointments even to Class IV posts under the State the antecedents of the candidate are invariably verified, but in the instant case the State chose to ignore serious allegations existing on record in deciding the desirability of Jeyaprasad to a statutory high office. The statutory authority conferred on the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:16:- State to appoint members of the Pollution Control Board necessarily implies an obligation on the part of the State to exercise that authority in good faith and the larger public interest. When the law prescribes definite disqualifications which render people suffering from such disqualifications unfit to hold public offices, the State cannot ignore the allegations which indicate the doubtful suitability of the person who is being considered for filling up a public office. Such conduct of the State would not be consistent with its constitutional obligations. It is that failure on the part of the State which gives rise to the present exorbitant claims of Jeyaprasad. Our Constitution designed with the high ideal of protecting the citizens from unfair and arbitrary exercise of State power can also be taken advantage of by citizens of doubtful credentials; when the various organs of the State wittingly or otherwise collaborate.
16. The learned counsel appearing for Jeyaprasad very strenuously argued that though the CBI filed a charge sheet against Surendran, it did not choose to make any indictment against Jeyaprasad and therefore the mere allegation in the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:17:- charge memo may not be used as a factor for declining the exercise of jurisdiction under Article 226 of the Constitution of India.
17. We regret our inability to accept the submission. The fact that the CBI did not choose to make any indictment against Jeyaprasad in the final report is for an obvious reason that the case which was investigated by the CBI was a case of definite allegations of violations of the provisions of Prevention of Corruption Act against Surendran. Such an investigation was taken up by the CBI pursuant to an order of this Court. There was never any occasion or authorization for the CBI to examine the conduct of Jeyaprasad.
18. The order of this Court entrusting investigation of the case by the CBI against Surendran came to be passed in W.P. (C) No.19757 of 2005 and same remained unchallenged by the State. The circumstances under which such an order came to be passed are explained in the common judgment dated 09.10.2009 in W.P.(C) Nos.36185/07 and 36205/07 which are the subject matter of the appeals, viz. WA Nos.211/10 and 181/10 and the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:18:- same read as follows:
"Suspecting foul play by the VACB, the petitioner filed W.P.(C) No.19757/2005, seeking a C.B.I investigation, which was ordered by a Single Judge of this Court by judgment dated 15.7.2005, which was set aside by a Division Bench, on the ground that the 4th respondent was not heard before passing that order, directing the Single Judge to hear the matter afresh. The writ petition again came up before another learned Single Judge, who by judgment dated 24.2.2006, after hearing the 4th respondent also, directed the C.B.I. to take over the investigation, accepting the contention of the petitioner that the investigation by the VACB is not proceeding in the right direction, after referring also to the fate of the earlier case against the 4th respondent at the hands of the VACB. Pursuant to the same, the C.B.I. has charge sheeted the 4th respondent, which case is also pending."
19. The second submission made on behalf of Jeyaprasad that a mere allegation of wrong doing cannot disentitle him to seek the constitutional remedy under Article 226 requires an examination. In the normal circumstances the submission would be unexceptionable. But the consistent reluctance of the State in dealing with Jeyaprasad and Surendran in accordance with law, and in fact that at every stage this Court had to intervene to compel the State to act in accordance with W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:19:- law are factors which distinguish Jeyaprasad for a separate treatment. Apart from that the manner in which Jeyaprasad dealt with Surendran in spite of the serious allegations against him is also a strong factor that should weigh with the Court in deciding whether the discretion should be exercised in his favour. We desist from explaining those factors for the reason that any observation in that regard is likely to have an adverse effect on the investigation of the crime to be registered against Jeyaprasad. Exercising the discretion under Article 226 in a case with such factual background in our view is likely to promote a misconception that the judicial branch of the Constitution is not different from the other branches. No misconception could do more lasting injury to this Court and to the system of law. It is immaterial whether justice is done or not to Jeyaprasad.
20. In the background of the facts narrated above the question arises whether this Court should really exercise the extraordinary jurisdiction vested in it by the Constitution under Article 226 to issue writs or orders in the nature of mandamus or certiorari. It is well settled that both the writs are discretionary W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:20:- in nature but not writs of right. The extraordinary jurisdiction is created for the protection of the fundamental rights of the subjects and to prevent the abuse of the State's power. The jurisdiction is to be exercised either for the enforcement of a legal right of the subject or the enforcement of the legal obligations of the State. Courts have recognised a number of exceptional circumstances which justify the refusal to exercise the jurisdiction even in those cases where there is a clearly established legal right or obligation.
21. We are of the opinion that exercising the jurisdiction under Article 226 in favour of a person whose credentials to hold a public office are highly doubtful and who would be disqualified to hold the public office in question if the allegations made against him are investigated and proved before a competent criminal court, would be not a sound exercise of the discretion vested in this Court under Article 226 of the Constitution of India.
22. For the above mentioned reasons, W.P.(C) No.20211 of 2010 is dismissed. For the same reasons, W.P.(C) W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:21:- No.11235 of 2010 is also dismissed. W.A. No.1436 of 2010 which arises out of an order passed in I.A. No.10950 of 2010 in W.P.(C) No.11235 of 2010 should naturally stand dismissed consequent upon the dismissal of W.P.(C)No.11235 of 2010.
23. We are left with W.A. Nos.211 and 181 of 2010 filed by the State of Kerala, aggrieved by certain observations made in the judgment at paragraphs 5 and 11, which read as follows:
"5. Since, the facts disclosed in these writ petitions point at the appalling attitude of the Government and the Pollution Control Board in the matter of dealing with allegations of corruption against an engineer in the Pollution Control Board Service.
11. The whole history of the case, without doubt, is a standing testimony of the enormous clout the 4th respondent has in the higher echelons of power, regardless of political colour of the Government. The 4th respondent, who eminently deserves suspension for the grave offences he is charged with in two criminal cases, the second one committed after the revocation of the suspension pursuant to the first criminal case, had not only been not suspended, but was rewarded with a promotion, even contravening the Rules applicable. A Government which claims to have declared war against corruption in the services of the State, W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:22:- vehemently defends a person who is accused of corruption, that too, a person who has been allegedly caught red handed accepting bribe and who has, unmindful of the first case pending against him, had got himself involved in another more serious case of corruption. Government's stand in defending him in this case would put doubt into the minds of the public regarding the sincerity of the Government about their professed commitment to fight corruption, which is presently the cancer eating into the body of our democracy. If their professed fight against corruption is not mere lip service to pull the wool over the eyes of the public, the Government would do well to cancel the promotion of the 4th respondent and place him under suspension, like any well-meaning Government, who have their priorities right."
The above extracted observations are observations in the judgment under appeal which is a common judgment disposing of two writ petitions filed by two defacto complainants in the two criminal cases registered under the provisions of Prevention of Corruption Act against Surendran (the details of which are already noticed earlier in this judgment). The grievance of the two writ petitioners is that in spite of the fact that Surendran was being investigated for charges under Prevention of Corruption W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:23:- Act, during the pendency of such investigation though initially Surendran was kept under suspension, the suspension was revoked by the State Pollution Control Board and Surendran was also granted a promotion. The petitioners therefore approached this Court seeking directions to the Pollution Control Board to take appropriate action against Surendran. By the judgment under appeal, in the abovementioned two appeals the writ petitions were disposed of with certain directions. The correctness or otherwise of those directions is not the question before us in these appeals. For the purpose of determining whether the observations which are the subject matter of these appeals are justified or not, we would only state that by the judgment under appeal, the learned Judge after elaborate consideration of the material came to the conclusion that the entire episode requires at least a departmental enquiry against Surendran. It is in that background the observations made by the learned Judge are required to be examined. The facts narrated above, in our opinion, clearly demonstrate a very unsatisfactory state of affairs in the administration. In the W.A. Nos. 181, 211 and 1436 of 2010 and W.P.(C) Nos. 11235 & 20211 of 2010 -:24:- circumstances we do not see any reason to interfere with the observations made in the judgment under appeal, or we find anything unwarranted in the said observations. These two appeals are therefore dismissed.
J.Chelameswar, Chief Justice.
P.R.Ramachandra Menon, Judge.
kmd/ttb/vku


Global Variables
The following global variables are available globally.
-
Undocumented
-
Undocumented
The following global variables are available globally.
Undocumented
Undocumented


View Major GPAs
Enter the name of a major to view its median GPA or select a college to view all of its majors. You can select multiple majors from the suggested list.
Enter the name of a major to view its median GPA or select a college to view all of its majors. You can select multiple majors from the suggested list.


I was born and raised in Albuquerque and currently reside with my wife and our 5 kids. I enjoy cooking in my spare time and would eventually like to open a food truck selling french toast.
I also enjoy creating music. My favorite instrument is the banjo, although I also play the accordion.
Prior to taking this course I was a 911 dispatcher for 6 years with APD. I enjoyed the job but not the stress. I am looking for a new path to a rewarding career.
I was excited to find this Bootcamp since I will get out in time for my side-gig as Santa Clause at the mall. My favorite part is promising the kids that I will bring them everything on their wish lists.


If you are acquainted with printing in other Windows programs printing is fairly simple and straightforward. What you see in the window is almost exactly what is printed. There are optional extras though, such as printing headers and footers, a border around the whole page, etc. To see how it looks and how the file would be spread across pages you can use the Print Preview command. The preview depends on the currently selected printer which you can change with the Page Setup Command as well as options such as landscape or portrait printing etc.
Page Layout
The Printer General Options and the Printing Decorations pages of the Options Dialog allows setting of page margins, line-spacing, header/footer etc. There are also other options such as printing column headers so you can easily work out the exact address of any byte. The header and footer are displayed at the top and bottom of each page can be any text, including special codes for the current date/time, page number, filename, time file was last modified, as well as category, keywords and comments if you have added any using the Summary Page of the Properties dialog.
If you have a wide screen (or use a long line length and the scroll bars) then the printed lines may not fit across the page. In this case a smaller version of the screen font is used.
Partial Printing
It is not unusual to want to print a small part of a binary file. You can do this in HexEdit Pro by printing a range of pages or by printing the selection.
To print a range of pages but you must first use Print Preview to find out the numbers of the pages you want to print. Another problem with printing a range of pages is that the standard Print Dialog in Windows has problems if the total number of pages exceeds 32,767. If you want to print part of a very large file such as a database, this is a problem.
A better way to print part of a file is to select the bytes you want to print and use the “Print Selection” option of the Print Dialog. Also when you print the selection you have the option of not printing duplicate lines (instead the line is printed just once with a count of the number of repeats underneath) -- this can be very useful if the section you want to print contains large areas of bytes all the same such as 00 or FF.
Template Tree View
To print (or print preview) the template tree view simply select an item in the tree view and use the File/Print (or File/Print Preview) command as usual. Note that the tree view is printed exactly as displayed. You may want to expand or contract different branches before printing. Also the text is sized to fit across the page so you may need to resize or hide some columns if the text prints too small.
For further information see:
Print command to print all or part of the file
Print Preview command to preview the printed pages
Printer General Options page and Printing Decorations page to change header/footer, margins etc
File menu for printing commands
Print dialog to see options for printing the file or selection
Print Progress dialog to see progress while printing is in progress
Print Setup Dialog to find out how to select and configure the printer
Window Options Page to change the number of displayed columns etc
File Summary Page to set category, comments etc that can be printed in the page header/footer


Nyzo version 502 (commit on GitHub) implements a new autovote mechanism for admitting new verifiers to the cycle.
This version affects the verifier only. The sentinel does not cast votes for new verifiers.
The security of the Nyzo blockchain relies on the diversity of the verifiers producing it. If any one entity has control of more than half of the private keys in the current cycle, that entity can determine the direction of the blockchain. While blockchain rules dictate the maximum rates at which verifiers can be added and removed, the decision of which verifiers are added to the cycle is determined through a democratic process in which each in-cycle verifier casts a vote for the next verifier to be added to the cycle.
The process for determining which new verifier to admit remains democratic in this version, but the default logic for calculating a verifier's vote has changed. Previously, the default logic attempted to establish a first-in, first-out system, but this was problematic for multiple reasons. Inconsistencies among verifiers’ long-maintained timestamp lists resulted in vote scattering, making it easy for blocs of manual votes to influence the outcome of the voting process. Also, a true first-in, first-out process is vulnerable to a single entity starting many verifiers at once and clogging the queue.
The automatic-voting logic in this version is a lottery based on a recent hash in the blockchain. While it still uses node-join timestamps to protect against the equivalent of buying a lottery ticket after numbers have been drawn, the relatively short timescale involved in the new calculation virtually eliminates vote scattering. Also, as this version ties automatic voting to blockchain data with little room for error, it raises the possibility of defining this vote as the “correct” vote. This could potentially be used in a later version to eliminate manual voting and punish in-cycle verifiers that consistently vote for the “wrong” new verifier.
This logic also has the advantage of eliminating the possibility of a single entity starting a large number of verifiers to clog the queue. With a first-in, first-out process, a few thousand verifiers could block the queue for multiple years with the current cycle size. With the new lottery process, a few thousand verifiers waiting would significantly increase a single entity’s chances of joining the cycle, but it would not exclude other verifiers entirely. In a mined blockchain, a miner who controls 51% of mining capacity at any moment can control the direction of the blockchain. In Nyzo, a 51% control of the waiting-verifier pool would only result in a roughly 51% admission rate to the cycle, and this would need to be maintained long enough to overpower the existing cycle. As of this release, the cycle size is almost 770, and the admission rate is approximately 8 verifiers per day. Also, the admission rate decreases with increasing cycle length, so takeover efforts only become more difficult over time.
In the current autovote system, those verifiers with the earliest timestamps have a higher probability of joining the cycle. In the new autovote system, all verifiers that have been waiting more than 10 minutes will have the same probability of joining the cycle. The new system is fairer and will result in a more diverse, more trustworthy system, but we do appreciate the perception that this change may be unfair to verifiers who anticipate joining the cycle soon. In the coming weeks, we will be distributing ∩250,000 to the verifiers waiting in line at the time this version was released. The amounts given to each verifier will be proportional to our calculated change in probability of the verifier joining based on the old and new autovote calculations.
The first code change in this version is a widening of the visibility of the singleSHA256()method of the HashUtil. This method is used by the lottery scoring method to ensure all verifiers have a fair chance of winning the lottery calculation.
In the NewVerifierQueueManager class, constants have been added for managing which autovote method is used. For now, verifiers are free to choose which method to use, though the new lottery method is the default. If the lottery method becomes mandatory in a later release, these constants will be removed.
New-verifier votes were previously only sent to in-cycle verifiers, as out-of-cycle verifiers do not have voting power and generally do not need to be kept apprised of the new-verifier votes. However, the verifiers that are affected by those votes should know about them, as the local vote tally on a verifier affects its decision of whether of transmit a block to try to join the cycle. So, votes are now also sent to both the current and previous subject of the vote.
The calculateVote() method still allows use of the first-in, first-out method through a preference specification, and it still allows manual overrides. However, the new lottery method is the default calculation.
The lottery calculation rounds the current frozen edge height down to the nearest multiple of 50, and the hash of the block at that height is used as a reference for scoring each verifier. The timestamp threshold prevents a manipulation in which an entity could have a large number of verifier identifiers ready, calculate all the verifiers’ scores quickly as a block is produced, and then start a verifier with the winning identifier. However, this threshold is so short that any timestamp tracking issues on a particular verifier will only affect that verifier’s vote for a very short time, instead of resulting in a permanent “demotion” of the subject verifier as would happen in the first-in, first-out process.
The heart of the lottery process is the score() method. A simple distance is calculated between the hash of the reference block and a hash of the bytewise sum of the reference-block hash and the verifier identifier. This calculation is deterministic, fair, based on blockchain data, and computationally cheap.
As a small added bonus for this version, the size at which out-of-cycle nicknames are excluded from the NicknameManager map is now configurable via the preferences file. The default threshold is still 2000.
To specify a different threshold, create a text file at /var/lib/nyzo/production/preferences and add a line to it similar to the following (this would specify a threshold of 5000):
nicknameMapThreshold=5000
The PreferencesUtil class manages operator-specified options. The file, as noted above, is located at /var/lib/nyzo/production/preferences. All keys and values are converted to lower case, and a convenience method is provided for fetching int values with a default fallback.


Home
Home
My Package
Promo
Feedback
LogOut
Home
My Package
Promo
Feedback
LogOut
Welcome Back,
Feisal Simanjuntak Simalakama!!!


care respiratory studies masks face SARS risk protection Confirmed Health evidence infection use syndrome effect transmission COVID- acute did health-care Infect eye systematic MERS physical review data mask coronavirus findings large respirators Â·, similar {border-style Dis East adjusted associated association distance severe China contact estimates inform px;} randomised virus #ffffff;} (eg, non-health-care COVID-, included GRADE Yes healthcare study used using workers available distancing factors infected surgical unadjusted SARS, certainty interventions meta-analysis online rate studies, trials SARS-CoV- health medical settings Â·% Middle contextual distances effects low protective viral ****** Med appendix bias figure hospital provide risk. syndrome. Â·; ******** April Non-health SARS-CoV-, best comparative compared different including masks, people prevent reduction versus â€"). ***** Bayesian Epidemiol However, SARS-CoV, University analysis cotton direct exposed general information observational optimum pandemic patients px; quantitative relative setting settings. stronger subgroup {font-family â€"-layer (appendix (Â· ../...(preprint). Clin Eye Saudi aOR analyses cases close confirmed current effective estimate font-size group increasing larger meta-analyses moderate odds personal pinteraction=Â·; protection, reduce relevant search seen support Â·) (aOR Canada Cochrane Figure MERS-CoV South Vietnam associations community credibility data, distance, distancing, double; estimates. intervention potential probable public reported respirator seasonal sensitivity settings, showing table âˆ’Â· âˆ’Â·%, âˆ’Â·; â€ˆ Forest Korea MERS=Middle March Newcastle-Ottawa RR=relative Research SARS=severe Xue aOR=adjusted assessed assessment based border-color border-width case contacts) currently effect-modification effectiveness exposure final findings. guidance high identified important individual infection, infection. interventions, limited masks. measures nosocomial person-to-person plot policy posterior preventing probably provided quality ratio. related resource results reusable reviews searched solid; spread statistical suggest therefore, workers: {font-style {font-weight (SARS-CoV-) (ie, **** ******* Arabia CI) COVID-. Chinese Hong Liu MERS-CoV. MERS. Medical Physical RNA Risk USA access additional air approach. assess assessing betacoronaviruses bold caused clinical common considering contacts coronavirus. countries courier; definition design disposable em; extracted focused guidelines, highly illness implications individuals interaction lower mask, mean n=, needed outbreak patient present prevention priors probability procedures protection. pt;} random-effects randomized reporting studies,, summary true viruses workers, Â·â€"Â·)