| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.collections4.bag; | |
| 18 | ||
| 19 | import java.util.Set; | |
| 20 | ||
| 21 | import org.apache.commons.collections4.set.TransformedSet; | |
| 22 | import org.apache.commons.collections4.Bag; | |
| 23 | import org.apache.commons.collections4.Transformer; | |
| 24 | import org.apache.commons.collections4.collection.TransformedCollection; | |
| 25 | ||
| 26 | /** | |
| 27 | * Decorates another {@link Bag} to transform objects that are added. | |
| 28 | * <p> | |
| 29 | * The add methods are affected by this class. | |
| 30 | * Thus objects must be removed or searched for using their transformed form. | |
| 31 | * For example, if the transformation converts Strings to Integers, you must | |
| 32 | * use the Integer form to remove objects. | |
| 33 | * <p> | |
| 34 | * This class is Serializable from Commons Collections 3.1. | |
| 35 | * | |
| 36 | * @since 3.0 | |
| 37 | * @version $Id: TransformedBag.java 1494280 2013-06-18 20:07:04Z tn $ | |
| 38 | */ | |
| 39 | public class TransformedBag<E> extends TransformedCollection<E> implements Bag<E> { | |
| 40 | ||
| 41 | /** Serialization version */ | |
| 42 | private static final long serialVersionUID =<PHONE_NUMBER>299074185L; | |
| 43 | ||
| 44 | /** | |
| 45 | * Factory method to create a transforming bag. | |
| 46 | * <p> | |
| 47 | * If there are any elements already in the bag being decorated, they | |
| 48 | * are NOT transformed. Contrast this with {@link #transformedBag(Bag, Transformer)}. | |
| 49 | * | |
| 50 | * @param <E> the type of the elements in the bag | |
| 51 | * @param bag the bag to decorate, must not be null | |
| 52 | * @param transformer the transformer to use for conversion, must not be null | |
| 53 | * @return a new transformed Bag | |
| 54 | * @throws IllegalArgumentException if bag or transformer is null | |
| 55 | * @since 4.0 | |
| 56 | */ | |
| 57 | public static <E> Bag<E> transformingBag(final Bag<E> bag, final Transformer<? super E, ? extends E> transformer) { | |
| 58 |
1
1. transformingBag : mutated return of Object value for org/apache/commons/collections4/bag/TransformedBag::transformingBag to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return new TransformedBag<E>(bag, transformer); |
| 59 | } | |
| 60 | ||
| 61 | /** | |
| 62 | * Factory method to create a transforming bag that will transform | |
| 63 | * existing contents of the specified bag. | |
| 64 | * <p> | |
| 65 | * If there are any elements already in the bag being decorated, they | |
| 66 | * will be transformed by this method. | |
| 67 | * Contrast this with {@link #transformingBag(Bag, Transformer)}. | |
| 68 | * | |
| 69 | * @param <E> the type of the elements in the bag | |
| 70 | * @param bag the bag to decorate, must not be null | |
| 71 | * @param transformer the transformer to use for conversion, must not be null | |
| 72 | * @return a new transformed Bag | |
| 73 | * @throws IllegalArgumentException if bag or transformer is null | |
| 74 | * @since 4.0 | |
| 75 | */ | |
| 76 | public static <E> Bag<E> transformedBag(final Bag<E> bag, final Transformer<? super E, ? extends E> transformer) { | |
| 77 | final TransformedBag<E> decorated = new TransformedBag<E>(bag, transformer); | |
| 78 |
4
1. transformedBag : changed conditional boundary → NO_COVERAGE 2. transformedBag : negated conditional → NO_COVERAGE 3. transformedBag : negated conditional → NO_COVERAGE 4. transformedBag : negated conditional → NO_COVERAGE |
if (transformer != null && bag != null && bag.size() > 0) { |
| 79 | @SuppressWarnings("unchecked") // Bag is of type E | |
| 80 | final E[] values = (E[]) bag.toArray(); // NOPMD - false positive for generics | |
| 81 |
1
1. transformedBag : removed call to org/apache/commons/collections4/Bag::clear → NO_COVERAGE |
bag.clear(); |
| 82 |
3
1. transformedBag : changed conditional boundary → NO_COVERAGE 2. transformedBag : Changed increment from 1 to -1 → NO_COVERAGE 3. transformedBag : negated conditional → NO_COVERAGE |
for (final E value : values) { |
| 83 | decorated.decorated().add(transformer.transform(value)); | |
| 84 | } | |
| 85 | } | |
| 86 |
1
1. transformedBag : mutated return of Object value for org/apache/commons/collections4/bag/TransformedBag::transformedBag to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return decorated; |
| 87 | } | |
| 88 | ||
| 89 | //----------------------------------------------------------------------- | |
| 90 | /** | |
| 91 | * Constructor that wraps (not copies). | |
| 92 | * <p> | |
| 93 | * If there are any elements already in the bag being decorated, they | |
| 94 | * are NOT transformed. | |
| 95 | * | |
| 96 | * @param bag the bag to decorate, must not be null | |
| 97 | * @param transformer the transformer to use for conversion, must not be null | |
| 98 | * @throws IllegalArgumentException if bag or transformer is null | |
| 99 | */ | |
| 100 | protected TransformedBag(final Bag<E> bag, final Transformer<? super E, ? extends E> transformer) { | |
| 101 | super(bag, transformer); | |
| 102 | } | |
| 103 | ||
| 104 | /** | |
| 105 | * Gets the decorated bag. | |
| 106 | * | |
| 107 | * @return the decorated bag | |
| 108 | */ | |
| 109 | protected Bag<E> getBag() { | |
| 110 |
1
1. getBag : mutated return of Object value for org/apache/commons/collections4/bag/TransformedBag::getBag to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return (Bag<E>) decorated(); |
| 111 | } | |
| 112 | ||
| 113 | //----------------------------------------------------------------------- | |
| 114 | ||
| 115 | public int getCount(final Object object) { | |
| 116 |
1
1. getCount : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return getBag().getCount(object); |
| 117 | } | |
| 118 | ||
| 119 | public boolean remove(final Object object, final int nCopies) { | |
| 120 |
1
1. remove : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return getBag().remove(object, nCopies); |
| 121 | } | |
| 122 | ||
| 123 | //----------------------------------------------------------------------- | |
| 124 | ||
| 125 | public boolean add(final E object, final int nCopies) { | |
| 126 |
1
1. add : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return getBag().add(transform(object), nCopies); |
| 127 | } | |
| 128 | ||
| 129 | public Set<E> uniqueSet() { | |
| 130 | final Set<E> set = getBag().uniqueSet(); | |
| 131 |
1
1. uniqueSet : mutated return of Object value for org/apache/commons/collections4/bag/TransformedBag::uniqueSet to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return TransformedSet.<E>transformingSet(set, transformer); |
| 132 | } | |
| 133 | ||
| 134 | } | |
Mutations | ||
| 58 |
1.1 |
|
| 78 |
1.1 2.2 3.3 4.4 |
|
| 81 |
1.1 |
|
| 82 |
1.1 2.2 3.3 |
|
| 86 |
1.1 |
|
| 110 |
1.1 |
|
| 116 |
1.1 |
|
| 120 |
1.1 |
|
| 126 |
1.1 |
|
| 131 |
1.1 |


#include <cp_model_lns.h>
Definition at line 44 of file cp_model_lns.h.
◆ NeighborhoodGeneratorHelper()
| operations_research::sat::NeighborhoodGeneratorHelper::NeighborhoodGeneratorHelper |
( |
CpModelProto const * |
model_proto, |
|
|
bool |
focus_on_decision_variables |
|
) |
| |
◆ UpdateHelperData()
| void operations_research::sat::NeighborhoodGeneratorHelper::UpdateHelperData |
( |
bool |
focus_on_decision_variables | ) |
|
◆ FixGivenVariables()
| Neighborhood operations_research::sat::NeighborhoodGeneratorHelper::FixGivenVariables |
( |
const CpSolverResponse & |
initial_solution, |
|
|
const std::vector< int > & |
variables_to_fix |
|
) |
| const |
◆ RelaxGivenVariables()
| Neighborhood operations_research::sat::NeighborhoodGeneratorHelper::RelaxGivenVariables |
( |
const CpSolverResponse & |
initial_solution, |
|
|
const std::vector< int > & |
relaxed_variables |
|
) |
| const |
◆ FixAllVariables()
◆ IsActive()
| bool operations_research::sat::NeighborhoodGeneratorHelper::IsActive |
( |
int |
var | ) |
const |
◆ ActiveVariables()
| const std::vector<int>& operations_research::sat::NeighborhoodGeneratorHelper::ActiveVariables |
( |
| ) |
const |
|
inline |
◆ ConstraintToVar()
| const std::vector<std::vector<int> >& operations_research::sat::NeighborhoodGeneratorHelper::ConstraintToVar |
( |
| ) |
const |
|
inline |
◆ VarToConstraint()
| const std::vector<std::vector<int> >& operations_research::sat::NeighborhoodGeneratorHelper::VarToConstraint |
( |
| ) |
const |
|
inline |
◆ TypeToConstraints()
◆ ModelProto()
| const CpModelProto& operations_research::sat::NeighborhoodGeneratorHelper::ModelProto |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file:


--- layout: page --- {% include head.html %}
{% include header.html %}Vienna is an RSS/Atom reader for Mac OS X, packed with powerful features that help you make sense of the flood of information that is distributed via these formats today. The Vienna Project is continuously being improved and updated, so keep up to date with current development on the forums.
Vienna is an OS X-native Objective-C/Cocoa Open Source project published under the Apache License, Version 2.0. It was started by Steve Palmer (aka stevewpalmer, stevepa) and is currently in active development by Jeff Johnson (aka johnson1234 and jeff_johnson_dev) and Michael Ströck (aka mstroeck). Many others have contributed immensely to this project, for details please download the application and load its “Acknowledgements”.
Companies which have supported the project include GitHub, SourceForge (who provide all our web-hosting) and Senza Limiti.
The project’s Git repository is hosted by GitHub. The easiest way to contact the developers is via the Vienna forums at Cocoaforge. For more on how to contribute to the project read this: Vienna Development.
Actual users are always hard to track, but to date Vienna has been downloaded over 450.000 times from Sourceforge’s servers alone. If you are responsible for one of those downloads: Thank you!


DEAR FRIEND. This business proposal to you is strictly confidential, with due respect. Sorry at this perceived confusion or stress may have receiving this letter from me, Since we have not known ourselves or met previously. Despite that, I am constrained to write you this letter because of the urgency of it.By way of self introduction, I am Mrs. alice Kobe, the wife of late Brigadier - Gen.Maxwell Kobe former ECOMOG ARMY COMMANDER [West African peacekeeping force in Sierra Leone] who died in the Sierra Leone civil disturbance [War]. My three daughters and I are trapped in obnoxious custom and traditional norms. We have suffered maltreatment and untold hardship in the hands of my late husband's family, simply because I did not bear a male child [heir apparent] for my late husband. By tradition, all that my late husband had, [wealth] belongs to his brothers/family. And myself is to be remarried by his immediate younger brother which I vehemently refused. They have taken all that I suffered with my husband to acquire including treasures, houses and his bank particular seized by them. I wanted to escape to escape to your country with my children on exile, but again they conspired and stole my international passport and other traveling document to further frustrate me. Thank God, two weeks ago, I received Key Text Code from a Security Company in EUROPE, that my late husband deposited U.S $25.5 Million cash with this security company EUROPE . It has therefore, become very necessary and urgent to contact someone, a foreigner like you to help me receive/secure these funds overseas in a reliable bank Account (presumably an empty Bank Account, if available) and to help invest it on our behalf as well, while we find a way of getting out to meet with you in your country. These funds are kept on an "OPEN BENEFICIARY MANDATE" with the Security Company in EUROPE to avoid detection, seizure or diversion. I have had several telephone discussions with the Director of the security company in us,who has express willingness to help me on meeting the company's demands. This is why I have contacted you to help save my children and I, receive these funds on our behalf. But, you would need to give me sufficient assurance that if you help me, you would not divert the funds. My children and I have resolved to give you 30% of the total sum. This is all my children and I have got to live on. Please, I have reposed my confidence in you and hope you will not disappoint me. I look forward to your urgent response, including your phone/ mobile No and also your fax no for easier communication. NB: The secret codes (e.g Pin No., Secret Access Code) for this fund are safely kept with me which I can give you as soon as you express desire to help me. Stay blessed. ALICE KOBE


Pat’s Salmon Cookies
Sales Report
Wellcome
Best Cookies in the World !!
Our Stores
Openning Houres`
Seattle:
6AM-7PM
Tokyo:
6AM-7PM
Dubai:
6AM-7PM
Paris:
6AM-7PM
Lima:
6AM-7PM
Our Cookies


pageable_collection.js |
|
|---|---|
Duckbone.PageableCollectionPageableCollection enhances a Backbone Collection so that it understands its connection to a server-paginated endpoint. It should be used in conjunction with the Rails library found in Duckbone.PageableCollection, and either of the standard will_paginate or kaminari gems. UsageFirst, establish pagination in your controller action. Wrap the JSON response in the PageableCollection presenter. For example:
Then create a pageable collection and use
The JSON response will look something like this:
At that point, you can then use Displaying the total countThe collection maintains its PageableViewTo create a paging UI with traditional page links and next/previous navigation, use this class in concert with a Duckbone.PageableView. |
(function() {
Duckbone.PageableCollection = { |
Mixin |
|
property isPageableCollectionIndicates the presence of this mixin |
isPageableCollection: true, |
Public Methods |
|
function parse
When PageableCollection is used in a Rails controller, it wraps the response in an object that contains the collection’s pagination meta-data. This overridden parse method extracts the meta-data into the object, and passes the records on to the normal behavior. |
parse: function(resp, xhr) {
this.numPages = resp.num_pages;
this.limitValue = resp.limit_value;
this.currentPage = resp.current_page;
this.totalCount = resp.total_count;
return resp.records;
}, |
function fetchDelegate |
fetch: function() {
this.fetchPage(1);
}, |
function fetchPage
|
fetchPage: function(pageNum) {
var params = this.params = this.params || {};
params.page = pageNum || 1;
return Backbone.Collection.prototype.fetch.call(this, {
url: buildUrl(this, params),
success: function(c) {
c.trigger('pageChange', c.currentPage, params);
}
});
}, |
function setParam
Set additional query params on the collection, ie search string. These will be sent to the server on fetch and show up in the url. |
setParam: function(param, val) {
this.params = this.params || {};
if (_.isNull(val) || _.isUndefined(val)) {
delete this.params[param];
} else {
this.params[param] = val;
}
}, |
function setPage
Sets the collection to the given page number, and fetches those models |
setPage: function(p) {
if (p != this.currentPage && p > 0 && p <= this.numPages) return this.fetchPage(p);
}, |
function nextPage
Sets the collection to the next page, and fetches those models |
nextPage: function() {
return this.fetchPage(this.currentPage+1);
}, |
function prevPage
Sets the collection to the previous page, and fetches those models |
prevPage: function() {
return this.fetchPage(this.currentPage-1);
}, |
function updateTotalCountOnCollectionEventsCreate bindings that update the totalCount as models are added and removed from the collection. |
updateTotalCountOnCollectionEvents: function() {
this.bind('add', function() {
if (this.totalCount) this.totalCount += 1;
}, this);
this.bind('remove', function() {
if (this.totalCount) this.totalCount -= 1;
}, this);
}
}; |
Internal Functions |
function buildUrl(context, options) {
options = options || {};
var url = (typeof context.url == 'function') ? context.url() : context.url
if (url.indexOf('?') < 0) url += '?';
for (var o in options) {
url += o+'='+options[o]+'&';
}
return url;
}
}).call(); |


Hapshetsut - foremost of noblewoman
Who was Hapshetsut?
Beginning in 1478 B.C., Queen Hatshepsut reigned over Egypt for more than 20 years. She served as queen alongside her husband, Thutmose II, but after his death, she claimed the role of pharaoh while acting as regent to her step-son, Thutmose III. She reigned peaceably, building temples and monuments, resulting in the flourishing of Egypt. After her death, Thutmose III erased her inscriptions and tried to eradicate her memory.


Census: indoor space usage tracker
Decibel level :
Individuals studying:
+1
People on the floor:
+1
Save


--- layout: default title: "A Handel’s Messiah To Remember" description: 'We would like to invite you to a special streaming event of our previous "Messiah - Part 1" concert!' image: "/images/concerts/2020-fall/a-handels-messiah-to-remember.jpg" redirect_from: - /concerts/2020/virtual-concert ---
Our concert will be broadcast live, right here, on Saturday, December 19th at 7pm.
We would like to invite you to a special streaming event of our previous Messiah Part 1 concert! We love making music together and cannot wait to see you in person again soon.
Follow along with the music here!
Click here to see the program from the original performance in December 2019!


docopt
helps you:
docopt
is based on conventions that have been used for decades in help messages and
man pages for describing a program's interface. An interface description
in docopt
is such a help message, but formalized. Here is an example:
Naval Fate.
Usage:
naval_fate ship new <name>...
naval_fate ship <name> move <x> <y> [--speed=<kn>]
naval_fate ship shoot <x> <y>
naval_fate mine (set|remove) <x> <y> [--moored|--drifting]
naval_fate -h | --help
naval_fate --version
Options:
-h --help Show this screen.
--version Show version.
--speed=<kn> Speed in knots [default: 10].
--moored Moored (anchored) mine.
--drifting Drifting mine.
The example describes the interface of executable naval_fate
, which can be
invoked with different combinations of commands (ship
, new
, move
,
etc.), options (-h
, --help
, --speed=<kn>
, etc.) and positional
arguments (<name>
, <x>
, <y>
).
The example uses brackets "[ ]
", parens "( )
", pipes "|
" and ellipsis
"...
" to
describe optional, required, mutually exclusive, and repeating
elements. Together, these elements form valid usage patterns, each starting
with program's name naval_fate
.
Below the usage patterns, there is a list of options with descriptions.
They describe whether an option has short/long forms (-h
, --help
), whether
an option has an argument (--speed=<kn>
), and whether that argument has a
default value ([default: 10]
).
A docopt
implementation will extract all that information and generate a
command-line arguments parser, with the text of the interface description as the
help message shown when the program is invoked with
the -h
or --help
options.
Text occuring between keyword usage:
(case-insensitive) and a visibly
empty line is interpreted as list of usage patterns. The first word after
usage:
is interpreted as the program's name. Here is a minimal example for
program that takes no command-line arguments:
Usage: my_program
Program can have several patterns listed with various elements used to describe the pattern:
Usage:
my_program command --option <argument>
my_program [<optional-argument>]
my_program --another-option=<with-argument>
my_program (--either-that-option | <or-this-argument>)
my_program <repeating-argument> <repeating-argument>...
Each of the elements and constructs is described below.
We will use the word "word" to describe a sequence of characters delimited
by either whitespace, one of "[]()|
" characters, or "...
".
Words starting with "<
", ending with ">
" and upper-case words are
interpreted as positional arguments.
Usage: my_program <host> <port>
Words starting with one or two dashes (with exception of "-
", "--
"
by themselves) are interpreted as short (one-letter) or long options,
respectively.
-abc
is equivalent to
-a -b -c
.=
" sign:--input=ARG
is equivalent to --input ARG
.-f FILE
is equivalent to -fFILE
.Note, writing --input ARG
(as opposed to --input=ARG
) is ambiguous, meaning
it is not possible to tell whether ARG
is option's argument or a positional
argument. In usage patterns this will be interpreted as an option with argument
only if a description (covered below) for that option is
provided. Otherwise it will be interpreted as an option and separate
positional argument.
There is the same ambiguity with the -f FILE
and -fFILE
notation. In the latter
case it is not possible to tell whether it is a number of stacked short
options, or an option with an argument. These notations will be interpreted as an
option with argument only if a description for the option is provided.
All other words that do not follow the above conventions of --options
or
<arguments>
are interpreted as (sub)commands.
Elements (options, arguments, commands) enclosed with square brackets "[ ]
"
are marked to be optional. It does not matter if elements are enclosed
in the same or different pairs of brackets, for example:
Usage: my_program [command --option <argument>]
is equivalent to:
Usage: my_program [command] [--option] [<argument>]
All elements are required by default, if not included in brackets "[ ]
".
However, sometimes it is necessary to mark elements as required explicitly
with parens "( )
".
For example, when you need to group mutually-exclusive elements (see next
section):
Usage: my_program (--either-this <and-that> | <or-this>)
Another use case is when you need to specify that if one element is present, then another one is required, which you can achieve as:
Usage: my_program [(<one-argument> <another-argument>)]
In this case, a valid program invocation could be with either no arguments, or with 2 arguments.
Mutually-exclusive elements can be separated with a pipe "|
" as follows:
Usage: my_program go (--up | --down | --left | --right)
Use parens "( )
" to group elements when one of the mutually exclusive
cases is required. Use brackets "[ ]
" to group elements when none of the
mutually exclusive cases is required:
Usage: my_program go [--up | --down | --left | --right]
Note, that specifying several patterns works exactly like pipe "|
", that is:
Usage: my_program run [--fast]
my_program jump [--high]
is equivalent to:
Usage: my_program (run [--fast] | jump [--high])
Use ellipsis "...
" to specify that the argument (or group of arguments)
to the left could be repeated one or more times:
Usage: my_program open <file>...
my_program move (<from> <to>)...
You can flexibly specify the number of arguments that are required. Here are 3 (redundant) ways of requiring zero or more arguments:
Usage: my_program [<file>...]
my_program [<file>]...
my_program [<file> [<file> ...]]
One or more arguments:
Usage: my_program <file>...
Two or more arguments (and so on):
Usage: my_program <file> <file>...
"[options]
" is a shortcut that allows to avoid listing all options
(from list of options with descriptions) in a pattern. For example:
Usage: my_program [options] <path>
--all List everything.
--long Long output.
--human-readable Display in human-readable format.
is equivalent to:
Usage: my_program [--all --long --human-readable] <path>
--all List everything.
--long Long output.
--human-readable Display in human-readable format.
This can be useful if you have many options and all of them are applicable to one of patterns. Alternatively, if you have both short and long versions of options (specified in option description part), you can list either of them in a pattern:
Usage: my_program [-alh] <path>
-a, --all List everything.
-l, --long Long output.
-h, --human-readable Display in human-readable format.
More details on how to write options' descriptions will follow below.
A double dash "--
", when not part of an option, is often used as a convention
to separate options and positional arguments, in order to handle cases when,
e.g., file names could be mistaken for options. In order to support this
convention, add "[--]
" into your patterns before positional arguments.
Usage: my_program [options] [--] <file>...
Apart from this special meaning, "--
" is just a normal command, so you can
apply any previously-described operations, for example, make it required
(by dropping brackets "[ ]
")
A single dash "-
", when not part of an option, is often used by convention
to signify that a program should process stdin
, as opposed to a file.
If you want to follow this convention add "[-]
" to your pattern.
"-
" by itself is just a normal command, which you can use with any meaning.
Option descriptions consist of a list of options that you put below your
usage patterns. It is optional to specify them if there is no ambiguity
in usage patterns (described in the --option
section above).
An option's description allows to specify:
The rules are as follows:
Every line that starts with "-
" or "--
" (not counting spaces)
is treated as an option description, e.g.:
Options:
--verbose # GOOD
-o FILE # GOOD
Other: --bad # BAD, line does not start with dash "-"
To specify that an option has an argument, put a word describing that
argument after a space (or equals "=
" sign) as shown below. Follow
either <angular-brackets>
or UPPER-CASE
convention for options' arguments.
You can use a comma if you want to separate options. In the example below, both
lines are valid, however it is recommended to stick to a single style.
-o FILE --output=FILE # without comma, with "=" sign
-i <file>, --input <file> # with comma, without "=" sign
Use two spaces to separate options with their informal description.
--verbose MORE text. # BAD, will be treated as if verbose
# option had an argument MORE, so use
# 2 spaces instead
-q Quit. # GOOD
-o FILE Output file. # GOOD
--stdout Use stdout. # GOOD, 2 spaces
If you want to set a default value for an option with an argument, put it
into the option's description, in the form [default: <the-default-value>]
.
--coefficient=K The K coefficient [default: 2.95]
--output=FILE Output file [default: test.txt]
--directory=DIR Some directory [default: ./]
docopt
in your browserdocopt
is available in numerous programming languages.
Official implementations are listed under the docopt organization on GitHub.


a blocky fractal-like shape generator
BlockFractal generates a fractal-like fully-connected shape on a grid.


Vertex module.
MIT. See LICENSE for full details.
These are common commands that apply to all widgets that have them injected.
Get the join style.
The join style.
Specifies the ways in which joints are to be drawn at the vertices of the line. If this option is not specified then it defaults to round. If the line only contains two points then this option is irrelevant.
| string joinStyle | The join style. |
This item to aid method chaining.
Get the smooth method.
The smooth method.
If the smoothing method is bezier, this indicates that the line should be drawn as a curve, rendered as a set of quadratic splines: one spline is drawn for the first and second line segments, one for the second and third, and so on. Straight-line segments can be generated within a curve by duplicating the end-points of the desired line segment. If the smoothing method is raw, this indicates that the line should also be drawn as a curve but where the list of coordinates is such that the first coordinate pair (and every third coordinate pair thereafter) is a knot point on a cubic bezier curve, and the other coordinates are control points on the cubic bezier curve. Straight line segments can be generated within a curve by making control points equal to their neighbouring knot points. If the last point is a control point and not a knot point, the point is repeated (one or two times) so that it also becomes a knot point.
| string smoothMethod | The smooth method. |
This item to aid method chaining.
Get smooth method spline steps.
The smooth method spline steps.
Specifies the degree of smoothness desired for curves: each spline will be approximated with number line segments.
| int splineSteps | The smooth method spline steps. |
This item to aid method chaining.


Snow falling on Mount Charleston
by Las Vegas Review-JournalSnow fell in the Spring Mountains on Wednesday as a storm brought rain to the Las Vegas Valley and Southern Nevada.
The National Weather Service has issued a winter storm warning for Mount Charleston and the Sheep Range until 4 p.m. Thursday.
The visitor gateway for the Spring Mountains National Recreation Area, at 2525 Kyle Canyon Road, will be closed Wednesday and Thursday because of the storm, according to Clark County officials. It is expected to reopen Friday.
The weather service has said that snow may be heavy at times Wednesday afternoon with an accumulation of 4 to 8 inches. Highs will be 41 to 44 degrees at Mount Charleston.
Rain and snow is likely in the evening, followed by a chance of rain and snow after midnight. Accumulation of 2 to 4 inches is expected overnight.
Still, Wednesday’s storm was not expected to bring enough snow for play areas in the Foxtail and Old Mill picnic areas of Lee Canyon.
Its ski resort will likely open in early December, snow conditions permitting, according to Clark County officials.
Related
2 rescued from wash as rain covers Las Vegas Valley


Welcome to Matrix_h’s documentation!¶
Matrix_h¶
Matrix_h hosts a fast, efficient and easy to use C linear algebra library by the name libmatrix.
Key Features¶
Simple and easy to use
Fast and memory efficient
No explicit pointers
Error detection
Installation¶
Clone the repository into your computer by executing the following command in the terminal.
git clone https://github.com/prithvitewatia/matrix_h
cd in the the repository
cd matrix_h
Run the following command
make libmatrix.a
If everything runs fine you will see files libmatrix.a and matrix.o generated in the directory. If not please make sure that you have gcc and make installed and set on PATH. Links to gcc: gcc make: make
Congrats your library is now generated.
Usage¶
Copy the include folder into your project directory
Create a lib folder and move the libmatrix.a into lib folder
Include the library in your C file by using the include directive
#include<matrix.h>
To build your C file execute the command
gcc yourCfile.c -I ./include -L ./lib -lmatrix -o yourOutputfile
Run your file by
./yourOutputfile
- Functions and Examples
- new_matrix
- array_to_matrix
- show_matrix
- get_value
- set_value
- set_all_value
- delete_matrix
- matrix_rowcount
- matrix_columncount
- copy_matrix
- matrix_dot
- matrix_isequal
- submatrix
- add_matrix
- sum_matrix
- multiply_matrix
- transpose_matrix
- power_matrix
- determinant
- concat_side
- concat_down
- rank
- inverse
- solvematrix
- gauss_siedel
- Caution
- Feedback


--- layout: default title: contacts scripts: - /js/libs/jquery.tmpl.js - /js/libs/knockout-1.2.1.debug.js - /js/libs/knockout.mapping-1.0.debug.js --- Knockout Contacts - created by barkmadley - inspited/designed by maccman


I was born and raised in Poplar Bluff, MO.
Currently, I am an apprentice mold designer and builder at my fathers plastic injection molding
factory. I enjoy my profession very much because it often requires critical thinking and problem
solving skills. A few of the softwares I am familiar with and machines I can run include: Vero
VISI, Solidworks, manual lathe, bridgeport milling machine, Fadal CNC machine, Agie EDM machine,
and surface grinding machine.
In my free time, I enjoy spending time with my wife and family,
hunting, fishing, traveling, spending time outdoors, working on our family farm, riding horses, and
building stuff. My most recent build was a teardrop camper.


Shipping
Our products are shipped with a maximum of one day from the purchase date. The delivery may take at least 5 days depending on your location. If you have any concern, contact us by email.
A special collection with a modern look for spring
C$79,90
add to bag local_mallOur products are shipped with a maximum of one day from the purchase date. The delivery may take at least 5 days depending on your location. If you have any concern, contact us by email.


Welcome to our Akan Name Generator.
Its a simple web program that allows you to input your birthday and based on the input,calculates your input and generates an Akan name for you!
Akan names are names popular in the Ghanaian culture, where the children's first names are based on a day name which corresponds to the day of the week the child was born. The names are also dependant on the child's gender.
To find out what your Akan name is, please fill in the details required below:
PLEASE ENTER VALID DATES


#include <stPlainDiskPageManager.h>
Public Member Functions | |
| stPlainDiskPageManager (const char *fName, stSize pagesize) | |
| stPlainDiskPageManager (const char *fName) | |
| virtual | ~stPlainDiskPageManager () |
| virtual bool | IsEmpty () |
| virtual stPage * | GetHeaderPage () |
| virtual stPage * | GetPage (stPageID pageid) |
| virtual void | ReleasePage (stPage *page) |
| virtual stPage * | GetNewPage () |
| virtual void | WritePage (stPage *page) |
| virtual void | WriteHeaderPage (stPage *headerpage) |
| virtual void | DisposePage (stPage *page) |
| virtual stSize | GetMinimumPageSize () |
| void | SetSystemCache (bool enabled) |
| Public Member Functions inherited from stPageManager | |
| virtual | ~stPageManager () |
| virtual void | ResetStatistics () |
| long int | GetReadCount () |
| long int | GetWriteCount () |
| long int | GetAccessCount () |
Additional Inherited Members | |
| Protected Member Functions inherited from stPageManager | |
| void | UpdateReadCounter (unsigned long count=1) |
| void | UpdateWriteCounter (unsigned long count=1) |
This class implements a page manager capable to read and write disk pages. It was designed to provide a fair base for algorithm comparisons and is not suposed to be used by users which seek for performance.
The implementation is based on the standard I/O system calls. All read/write operations are performed without chaching pages. As an additional feature, it is possible to disable the system I/O cache in some operational systems.
Definition at line 104 of file stPlainDiskPageManager.h.
| stPlainDiskPageManager::stPlainDiskPageManager | ( | const char * | fName, |
| stSize | pagesize | ||
| ) |
Creates a new instance of this class. This constructor will create a new file with the given name.
| fName | The file name. |
| pagesize | Size of each page in file. This value must be larger or equal than 64. |
| io_error | If the file can not be created. |
| stPlainDiskPageManager::stPlainDiskPageManager | ( | const char * | fName | ) |
Creates a new instance of this class. This constructor will open an existing file.
| fName | The file name. |
| io_error | If the file can not be opened or the file is not a valid disk page manager file. |
|
virtual |
Disposes this page and free all allocated resources.
|
virtual |
Disposes the given page. This method will make the page available (not allocated) for the next calls of GetNewPage().
Since this page will not be used anymore, this method will release the lock for this page instance.
| page | The page to be disposed. |
Implements stPageManager.
|
virtual |
Returns the header page. This method will return a special page that will be used by SlimTree to write some information about the tree itself.
Since this page must always exist, this method will always return a valid page for reading/writing. Use WritePage() to write this page.
The returning instance of stPage will be locked to prevent its reuse by this page manager. Use ReleasePage() to unlock this instance.
Implements stPageManager.
|
inlinevirtual |
Returns the minimum size of a page. The size of the header page is always ignored since it may be smaller than others.
Implements stPageManager.
Definition at line 243 of file stPlainDiskPageManager.h.
|
virtual |
Allocates a new page for use. As GetPage() and GetHeaderPage(), the returning instance will be locked to prevent reuse by this page manager.
To dispose this page (make it free), use DisposePage().
Implements stPageManager.
Returns the page with the given page ID. This method will return a valid page for reading/writing. Use WritePage() to write this page.
The returning instance of stPage will be locked to prevent its reuse by this page manager. Use ReleasePage() to unlock this instance.
| pageid | The desired page id. |
Implements stPageManager.
|
virtual |
This method will checks if this page manager is empty. If this method returns true, the stSlimTree will create a new tree otherwise it will continue to use the existing tree.
Implements stPageManager.
|
virtual |
Releases this instace for reuse by this page manager. Since some implementations of page manager will reuse instances of stPage to avoid unnecessary resource reallocations, each page instance must be locked until it becomes unecessary.
The stSlimTree will always call this method when a stPage instance will not be used in a near future.
| page | The locked page. |
Implements stPageManager.
|
inline |
This method allows users to enable/disable system I/O cache in certain OS. If this operation is not supported, this implementation does nothing.
| enabled | State of the system cache. |
Definition at line 253 of file stPlainDiskPageManager.h.
|
virtual |
Writes the header page to the disk.
Reimplemented from stPageManager.
|
virtual |
Writes the given page to the disk. This method will write the page but will not release it. Use ReleasePage() to do it.
| page | The page to be written. |
Implements stPageManager.


object Dice
(source)
Manage random things.
choose |
Choose randomly an item in a list. fun <T> choose(: List<T>): T |
index |
Return a random index in a Collection. fun index(: Collection<*>): Int |
newId |
Return a new random Id. fun newId(): String |
newInt |
Return a random int between 0 and max (excluded). fun newInt(: Int): Int |


Solihull extend unbeaten run to four games with Dover draw
Jamey Osborne scored a superb free-kick.
Solihull held on to third spot in the Vanarama National League after taking a point in a 1-1 draw at Dover.
The Whites took the lead after five minutes when Inih Effiong flicked a free-kick into the far corner.
Moors were level before the break with a stunning free-kick from Jamey Osborne.
Osborne brought a decent save from the keeper after the break but neither side could find a winner, leaving Solihull unbeaten in four games.


Change editor theme : default ambiance monokai neat neo night
Would you like to create a new example ? Head over to the examples repo on GitHub


We make sure all our challenges are adapted to the candidate's level and skills. Junior, Intermediate or Senior, make sure you are testing for the right level. Check a project.
With our full report, you will be able to take conclusions on the developer level and compare with other candidates. Review a sample report.
It's a recruitment process but it doesn't have to be boring. Forget FizzBuzz and Palindrome tests, and challenge your candidate with projects you could be building.
We can test your future developer on Ruby On Rails, Elixir, Phoenix and their most popular librairies. Drop us a line if you are interested in other languages.
All our challenges are pre-tested. We make multiple tests to make sure it's adapted to the level and can be completed in the right amount of time.
Don't lose your time creating and correcting developer tests.
You only pay if a candidate has taken a test. It means you only pay for the report. Our challenges start at 40€/report.
Get a full analysis of your candidate's tests with our complete report.
Choose our challenge or we will design a challenge tailored to your needs – level of the candidate, technologies.
We will provide the code and the instructions to the candidate, and deal with her potential programming questions in the process.
After the candidate has finished the challenge and submitted the code, we will correct it and provide you with a detailes reports and the candidate's code.


Let's start off by defining the two terms, then jump into advantages and disadvantages of each type, and finally end off with our analysis.
When setting a variable in a static typed language, you have to know what type of variable it is when the code runs. This means that when you're for example saying var number = 2, you'll have to do int var number = 2, and explicitly state that the value of that variable is going to be an integer.
Advantages & Drawbacks
The advantage to writing it out explicitly is that Type Errors are caught earlier and more difficult to make.
When setting variables in a dynamic language, you don't have to tell the compiler what type of value to expect, it will just know that 2 is an integer and 'test' is a string.
the advantage here is that it's less verbose and quicker to write with dynamic programming languages. The drawback is that you run the risk of runtime Type Erros
Interviews
Recursion
Test Driven Development
Personal Research
Dynamic vs Static typed languages
Big O complexity and notation
Sorting (merge sort, quick sort, bubble sort)
Functional Programming
Binary - go up instead of down
Note - In the following week(s) I will fill in information about each of these topics doing a series of interviews with engineers and also doing a few hours of research on each topic. More to come very soon.


Random Map Generator
Maps generated using cellular automata
Width:
Height:
Fill Percent:
Smoothing:
Tunnels:
Tunnel Distance:
Min:
Max:
Tunnel Width:
Min:
Max:
Tunnel Map
Generate
Download Image
or right click
"
Save image as...


NEWS LIST
{foreach name="data" item="vo"}
{$vo.create_time}
Fabrication of artificial biomimetic materials has attracted abundant attention. As one of the subcategories of biomimetic materials, artificial cells are highly significant for multiple disciplines and their synthesis has been
intensively pursued. In order to manufacture robust “alive” artificial cells with high throughput, easy operation, and precise control, flexible microfluidic techniques are widely utilized. Herein, recent advances in microfluidic‐based
methods for the synthesis of droplets, vesicles, and artificial cells are summarized. First, the advances of droplet fabrication and manipulation on the T‐junction, flow‐focusing, and coflowing microfluidic devices are discussed.
Then, the formation of unicompartmental and multicompartmental vesicles based on microfluidics are summarized. Furthermore, the engineering of droplet‐based and vesicle‐based artificial cells by microfluidics is also reviewed.
Moreover, the artificial cells applied for imitating cell behavior and acting as bioreactors for synthetic biology are highlighted. Finally, the current challenges and future trends in microfluidic‐based artificial cells are
discussed. This review should be helpful for researchers in the fields of microfluidics, biomaterial fabrication, and synthetic biology.
{/foreach}


This is a (with a change)paragraph, we could say stuff here, like:
This is another paragraph, right here!
You never knew it, but this is your perfect website. Here's why.
This is a followup on how lightweight it is
So quick!
It really does
Everything you need to know is right here
It's great!
"Good design is as little design as possible."
- some guy
This is a link, to this site: chippin.ca. Cool!


MEMORY GAME
Match the pairs to uncover a different picture everytime Click or keyboard press on a letter displayed on the board to play!


Ten is the base of the widely-used decimal counting system.
Any whole number that ends in a zero is divisible by 10.
10 can be written as the sum of two square numbers: 1+9; it is also the fourth triangular number.
ϕ(10) = 4, d(10) = 4, σ(10) = 18.


INTJ
: interjection
Definition
An interjection is a word that is used most often as an exclamation or part of an exclamation. It typically expresses an emotional reaction, is not syntactically related to other accompanying expressions, and may include a combination of sounds not otherwise found in the language. Note that words primarily belonging to another part of speech retain their original category when used in exclamations. For example, odlično “great” is an adverb even in exclamatory uses.
As a special case of interjections, the universal tagging scheme also recognizes feedback particles, such as ja “yes” and ne “no”. Given that most of the feedback signals in Slovenian can also be used as syntactically more or less dependent modal particles (to pa ja veš, ona itak nima pojma, tega ne maram, on je seveda poniknil etc.), they have not been converted to INTJ
and remain annotated as particles in the current version of the Slovenian UD Treebank.
Examples
- ah, oh, ha
- zbogom, živijo, adijo
- jebemti, bravo, ups
Conversion from JOS.
All interjections become INTJ
.
Treebank Statistics (UD_Slovenian)
There are 14 INTJ
lemmas (0%), 14 INTJ
types (0%) and 16 INTJ
tokens (0%).
Out of 16 observed tags, the rank of INTJ
is: 15 in number of lemmas, 16 in number of types and 16 in number of tokens.
The 10 most frequent INTJ
lemmas: ah, oho, ha, haha, hm, hvalabogu, ih, jaggghh, jebemti, jezesna
The 10 most frequent INTJ
types: Ah, Oho, Ha, Hm, Hvalabogu, Ih, Jezesna, Joj, Oh, haha
The 10 most frequent ambiguous lemmas:
The 10 most frequent ambiguous types:
Morphology
The form / lemma ratio of INTJ
is 1.000000 (the average of all parts of speech is 1.870691).
The 1st highest number of forms (1) was observed with the lemma “ah”: Ah.
The 2nd highest number of forms (1) was observed with the lemma “ha”: Ha.
The 3rd highest number of forms (1) was observed with the lemma “haha”: haha.
INTJ
does not occur with any features.
Relations
INTJ
nodes are attached to their parents using 3 different relations: sl-dep/discourse (13; 81% instances), sl-dep/obl (2; 13% instances), sl-dep/root (1; 6% instances)
Parents of INTJ
nodes belong to 4 different parts of speech: VERB (11; 69% instances), ADJ (3; 19% instances), PROPN (1; 6% instances), ROOT (1; 6% instances)
0 (0%) INTJ
nodes are leaves.
10 (63%) INTJ
nodes have one child.
5 (31%) INTJ
nodes have two children.
1 (6%) INTJ
nodes have three or more children.
The highest child degree of a INTJ
node is 3.
Children of INTJ
nodes are attached using 3 different relations: sl-dep/punct (20; 87% instances), sl-dep/case (2; 9% instances), sl-dep/amod (1; 4% instances)
Children of INTJ
nodes belong to 4 different parts of speech: PUNCT (20; 87% instances), ADJ (1; 4% instances), ADP (1; 4% instances), SCONJ (1; 4% instances)
Treebank Statistics (UD_Slovenian-SST)
There are 50 INTJ
lemmas (2%), 50 INTJ
types (1%) and 714 INTJ
tokens (4%).
Out of 16 observed tags, the rank of INTJ
is: 7 in number of lemmas, 10 in number of types and 13 in number of tokens.

The 1st highest number of forms (1) was observed with the lemma “a”: a.
The 2nd highest number of forms (1) was observed with the lemma “aa”: aa.
The 3rd highest number of forms (1) was observed with the lemma “aaa”: aaa.
INTJ
does not occur with any features.
Relations
INTJ
nodes are attached to their parents using 5 different relations: sl-dep/discourse:filler (463; 65% instances), sl-dep/discourse (128; 18% instances), sl-dep/root (118; 17% instances), sl-dep/parataxis (3; 0% instances), sl-dep/goeswith (2; 0% instances)
Parents of INTJ
nodes belong to 15 different parts of speech: VERB (294; 41% instances), NOUN (147; 21% instances), ROOT (118; 17% instances), ADJ (48; 7% instances), ADV (22; 3% instances), DET (15; 2% instances), INTJ (15; 2% instances), PART (14; 2% instances), PROPN (14; 2% instances), PRON (7; 1% instances), CCONJ (6; 1% instances), NUM (6; 1% instances), X (4; 1% instances), ADP (3; 0% instances), SCONJ (1; 0% instances)
680 (95%) INTJ
nodes are leaves.
20 (3%) INTJ
nodes have one child.
7 (1%) INTJ
nodes have two children.
7 (1%) INTJ
nodes have three or more children.
The highest child degree of a INTJ
node is 9.
Children of INTJ
nodes are attached using 8 different relations: sl-dep/punct (29; 46% instances), sl-dep/discourse (26; 41% instances), sl-dep/goeswith (2; 3% instances), sl-dep/vocative (2; 3% instances), sl-dep/amod (1; 2% instances), sl-dep/discourse:filler (1; 2% instances), sl-dep/nummod (1; 2% instances), sl-dep/parataxis (1; 2% instances)
Children of INTJ
nodes belong to 8 different parts of speech: PUNCT (16; 25% instances), INTJ (15; 24% instances), PART (14; 22% instances), X (13; 21% instances), PROPN (2; 3% instances), ADJ (1; 2% instances), NUM (1; 2% instances), VERB (1; 2% instances)
INTJ in other languages: [am] [ar] [bg] [bxr] [ca] [ckb] [cop] [cs] [cu] [da] [de] [el] [en] [es] [et] [eu] [fa] [fi] [fo] [fr] [ga] [gl] [got] [grc] [he] [hi] [hr] [hu] [id] [it] [ja] [kk] [kmr] [ko] [la] [lv] [mr] [nl] [no] [pl] [pt] [ro] [ru] [sa] [sk] [sla] [sl] [so] [sr] [sv] [swl] [ta] [tr] [ug] [uk] [u] [urj] [ur] [vi] [yue] [zh]


Communication Channels
问题描述 :
Information theory is generally considered to have been founded in 1948 by Claude Shan-non in his seminal work, \A Mathemati-cal Theory of Communication." The cen-tral paradigm of classical information theory is the engineering problem of the transmis-sion of information over a noisy channel. http://en.wikipedia.org/wiki/Information theory
In this problem, we will specifically consider one of the simplest possible noisy channels, namely the binary symmetric channel (BSC). A BSC transmits a sequence of bits, but each transmitted bit has a probability p of being fiipped to the wrong bit. This is called the crossover probability, as can be understood from the figure. We assume independent behaviour on difierent bits, so a communication of l bits has probability (1 – p)^l of being transmitted
correctly. Note that one can always assume that p < 1/2, since a channel with p = 1/2 is totally useless, and a channel with p > 1/2 can easily be transformed to a new channel having crossover probability 1 – p by just flipping all bits of the output.
Of course, it is still possible to communicate over a noisy channel. (In fact, you are doing it all the time!) To be able to do this, one has to add extra bits in order for the receiver to detect or even possibly correct errors. Example implementations of such a feature are parity bits, Cyclic Redundancy Checks (CRC) and Golay codes.
These are not relevant to this problem, however, so they will not be discussed here.
In this problem you must investigate the behaviour of a binary symmetric channel.
输入:
Then follow T lines with the input and the output of each transmission as binary strings, separated by a single space.
输出:
Then follow T lines with the input and the output of each transmission as binary strings, separated by a single space.
样例输入:
2 10 10 10 11
样例输出:
OK ERROR
#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <cctype> #include <iostream> #include <algorithm> #include <functional> #include <vector> #include <string> #include <map> #include <set> #include <queue> #include <stack> using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; #define PB push_back #define MP make_pair #define clr(a,b) (memset(a,b,sizeof(a))) #define rep(i,a) for(int i=0; i<(int)a.size(); i++) const int INF = 0x3f3f3f3f; const double eps = 1E-8; char s1[1000],s2[1000]; int T; int main() { scanf("%d",&T); while(T--) { scanf("%s%s",s1,s2); if(strcmp(s1,s2) == 0) puts("OK"); else puts("ERROR"); } return 0; }
破鞋的意思？
破鞋的意思？
破鞋的意思？
破鞋的意思？
破鞋的意思？
破鞋的意思？
破鞋的意思？
welcome!
分析的很专业！
学习了
swap写成内联函数会不会好一些
为什么暴力求解方法循环到sqrt(n) 就可以了呢
请不要灌水，多谢！
这个问题别太纠结了，不同的编译器结果不一
即为打印出的组合的个数C(n,r)，假设print函数复杂度为O(1)
比较基础，找些自信
感谢~速度真快，我很喜欢这个网站，从基础看起。
输入样例作为一个整体输入，带回车
使用ListNodeWrapper很蹩脚的感觉，没有更好的解决办法？
已修改。一些字符在编辑的时候转义了


Electronic versions of printed texts (abbreviated as Etexts) of ancient literary works are important pedagoic and scholarly resources. Stored in easily accessible archives, they permit preservation and wider distribution of ancient literary works around the globe through the means of internet. Etexts of literary works also allow quick search for phrases, words, and combinations of words in any literary work. There are many projects currently active world-wide that attempts to put in electronic form ancient literary works.
Project Madurai is an open and voluntary initiative to collect and publish free electronic editions of ancient tamil literary classics. This means either typing-in or scanning old books and archiving the text in one of the most readily accessible formats ("ETEXTS") for use on all popular computer platforms. All etexts will be distributed in both web/html and PDF formats.- Distributed through the World Wide Web servers , anyone located anywhere may download a copy for personal use or read what we publish on the internet, free of charge.
Since its launch in 1998, Project Madurai etexts are released in Tamil script form as per TSCII (Tamil Script Code for Information Interchange) encoding. Since 2004 we have started releasing etexts in Tamil unicode. Etexts are also made available in epub and kindle formats for use in mobile platforms/portable devices such as e-book readers.
Distribution of the etext collections of Project Madurai by third parties is permitted, provided the header page containing the Project Logo and credit acknowledgements are kept intact. Please contact the Project Coordinators before online distribution.
The project will be coordinated by a handful of volunteers, most of which have Project Madurai s as their hobby, just like you! Anyone who would like to contribute can join this project. Simply send an email note to Project Coordinators.
Dr. K. Kalyanasundaram, Lausanne, Switzerland (Project Leader)
Dr. P. Kumar Mallikarjunan, Blacksburg, Va, USA (Dy. Project Leader)
Dr. Ulrike Niklas, Dept of South Asia Studies, National Univ of Singapore, Singapore
Mr. Periannan Chandrasekaran, Atlanta, GA, USA
Mr. Sascha Ebeling, IITS, Univ of Koeln, Koeln, Germany
Dr. Venkataramanan (Venkat), Tokyo, Japan
Mr. Elango Sampandam, Chicago, USA (author of Suvadi Texteditor)
Dr. Venkataramanan (Venkat), Tokyo, Japan
Mr. Elango Sampandam, Chicago, USA (author of Suvadi Texteditor)
If you are interested to participate in the project, send an email to the Project Leader expressing your plans and/or interests. Be specific in stating in which way you will like to contribute and specify the work(s) if any that you are interested. We can go from there.


Mushrooms - P. cubensis
Prior to this experience, I had only tried mushrooms once and at that time I only ate 1.5 grams, and just felt threshold effects. I enjoyed a couple hours of a stoned feeling and some giggling, but I was kind of disappointed after being ready to finally try a psychedelic. About 2 months after this first trip, a good friend of mine explained that he recently acquired a large batch of incredibly potent homegrown Psilocybe Cubensis, and was selling 4-gram bags for 25 dollars.
I snatched one right away, and feeling like the confident fool I was, I decided on eating them alone this (Saturday) night and having a solo trip as my parents would be away for the night. I was in a very positive mindset that night, and this definitely proved to be helpful, if not necessary later. I weighed 135 pounds at the time, and as I would soon find out, I have a somewhat low tolerance to psychedelics.
The bright red caps and the snow-white stems with very faint blue streaks were much more...'professional' looking than many other mushrooms I've seen in the past. I thought they looked very 'healthy' and I later would find out I was quite right. I used a coffee grinder to grind the mushrooms up. I've used the coffee grinder to make mushroom-chocolates since then which I think are the best way of ingesting the sacred fungus.
Anyway, I mixed this powder with some peanut butter, spread on some toast and all 4 grams went down the hatch. It was about 8:00 PM. I spent several minutes right then in a sort of meditative state to sort of prepare my mind for the journey I knew it was about to make. My mind was completely clear and flowing with 'positive energy'.
T+20:00 -- I smoke a small amount of high quality homegrown cannabis to ease the anxious feeling, but wait to smoke more till I'm tripping harder. I started playing Half-Life, a game I really get into, and I began to feel really energized. Although I had just smoked, I could definitely tell that the mushrooms were just starting to kick in. I was glad I had chopped them up so finely because they were coming on fast and I wasn't left for long in that anxious, coming up state. I began to feel like if I were actually the character running around in the game, I could have run faster and done better than I was currently doing. My mind was racing with all the right thoughts to play the game well (prediction, timing, aim, special strategies), and I was playing much better than I normally do. I was laughing out loud half the time, and things began to seem really funny.
T+50:00 -- The fun-factor has increased 10-fold, but Half-Life has now become a challenge to play well. My normally quick-reacting and strategic mind is being taken over by the 'mushroom mind' and I'm letting myself accept it completely. I find myself chasing people with crowbars now and setting remote mines which sends me into bursts of laughter. I can tell that the visuals are just starting because when I turn sharply in the game, instead of seeing the new scene right away, I see more of a moving blur that quickly turns into the new scene. Almost like tracers in real life, these are really fun to play with. I am also starting to see the other characters in the game as live people with different personalities (most of which are violent as this is a game based on killing :-/ ).
This game is coming to point of 'overload' for the brain, so I decided to quit out of it and do something else. I noticed that I was really starting to trip now. My body had this indescribable feeling similar to a strong weed-high but so much more intense that I would feel like I was 'melting together with something' only 5 or 10 seconds after I had been sitting on it or whatever. Visuals had become increasingly stronger, and I was seeing colorful patterns on the wall, and all shiny surfaces had an amazing sparkle to them. At only about 50 minutes in, I was curious and weary about how far this trip would go.
I hadn't been much into Pink Floyd before this trip, mostly because I just hadnít listened to them much, but I put in Dark Side of the Moon after hearing so many recommend this album to trip to, and settled down on my bed. As soon as I started to hear the heartbeat in the very beginning of the album, the music engulfed me, enveloped me to a degree I never thought possible. Every note played and every noise I heard meant something amazing and significant.
Also, every note had its own 'feeling' and my mind was going so fast, I had time to experience every feeling of every noise I heard. This whole time of listening, I had my eyes closed because these truly were the most impressive visuals with the music. All the colors and shapes that were forming and disintegrating went with the music, and created a show that seemed so perfectly synchronized and beautiful, it was much more spectacular than any pink floyd rock show or laser light show or anything.
T+2:00 -- I didn't realize that the CD just started over. Not only did I not remember turning on repeat, but I didnít notice until 3 or 4 songs into the second time playing it that I realized it was repeating. This is how strong of a 'filter' these mushrooms had over my normal reality. Anyway, this second time hearing the song 'Time' I really began to trip in the intro to it because of the long spaces between noises and the way Pink Floyd really separates these guitar noises and other noises well.
I never knew how strong of a hold mushrooms can have on my sense of time until that night. As the song Time was playing, even after the spatial intro, the music began to sllloooowww down, sort of in waves, and then come back to normal speed again. It was so severe at this point that sometimes when several words of lyrics are spoken, a couple of seconds usually, it seemed to take MINUTES! His voice was really low and drawn out, it didnt even really sound human, and I had to listen for what seemed like a long amount of time just to hear several words.
Then it would pick back up again, and I'd feel like I was hardly tripping. This was true throughout the whole trip, the hardcore trip coming in waves. My short-term memory was on such a sporadic level that I didnít even really remember I had listened to Dark Side of the Moon one time already. The music seemed new and it was just like listening to the album for the first time ever.
T+2:50 -- As the heartbeat started to fade in the last part of the album, I thought I was hearing my own heartbeat, and got very scared when I started to hear it fade. I'd try to feel my pulse, but my nerves were firing off signals like crazy, and it was feeling like my skin was 'slithering' and 'crawling' all over my body. It was really strange, but I got used to it and later somewhat enjoyed it.
However it wasn't good when I thought my pulse was actually fading and couldn't feel anything either. (I'd like to mention that almost all of this trip was enjoyable, but my perception of things that night was on such a different level, that I couldnít really perceive it as enjoyable that night, just really amazingly mind-blowing, and I realized later how good of a trip it was in a lot of ways.) I immediately jumped out of bed for fear of my life and also I really had to pee. I knew there was somewhere I should go to help this need (to pee), but I was confused as to where.
My sense of place and location was extremely strange and foreign. After a little wandering around my basement (where my room is) I found the bathroom and saw the toilet. After taking a piss, which was a most enjoyable experience, I was caught on the way out by myself, looking at MYSELF in this shiny wall!! I stood there amazed for many minutes studying myself in awe. The visuals were so strong, my body seemed to be formed in different ways. Like my fingers no longer had joints, but were only about an inch long, and were really smooth looking.
They even looked like this when I looked up close! My hair no longer seemed to be made out of many strands of hair, but of one piece of very soft and fluffy material. All my skin seemed smooth and the same color, I no longer saw freckles, tan lines, zits, anything.
I then started to look up really close, and realized my pupils were enormous!! I donít mean twice or 3 times normal size, I mean I could just BARELY see a sliver of color around the huge, gaping black hole which were my pupils, that is normally where a lot of interesting color is. It was like I could see into myself, past this physical body, into me, into what I really was, into my spirit and my soul. Staring into my own eyes while this messed up was one of the trippiest and most memorable experiences of my life. I had never seen myself in such a genuine way. This was hard for me to believe because I am very in tune with myself and I usually do see myself in a true and genuine way.
But this was different, it was deep and very spiritual, and I saw myself as I really am, not as I would like to be or anything else. As I was analyzing these traits about me, I realized I didn't know who I was!! I knew that I was kind and caring for people and that I like to help people, but I couldnít remember my name! I knew how I acted and behaved, how I thought, but I didn't know how old I was, or my phone number, house address, anything like that.
I couldn't recall what state I was in, and I couldnít remember any of my friends names. This was the very first time in my life anything like this has happened, and it took me by surprise! I was shocked and scared and really, really trippin. This small set of unusual thoughts got me really scared in the bathroom, and I left back to my room. The carpet was swirling around on the ground and seemed to be moving in waves, much like an ocean. The walls and ceiling were breathing in and out together to a great degree, and everything on my wall was 3-D. People came out of the wall, and a space shuttle was in constant flight, flying past stars and galaxies, in a poster where it is just taking off.
I hardly even looked at these amazing things because I was so caught up with my not knowing of so many things. When I couldnít recall the names of any of my family members or friends, not to mention myself, I truly began to think that I was the only being in existence and that I would spend the rest of my life alone. I wanted to communicate with another entity, but I didnít know how.
T+3:15 -- Things were very confusing to me at this point and I was trying to make sense of what seemed like millions of things going on at once. I came to the thought that cannabis usually calms me down and relaxes me, and I knew that many people smoke during their trips, so I looked around until I found the bubbler and finally got it. I was holding it, but not even really thinking about it because my mind would drift off unwillingly every 2 or 3 seconds to something that stood out in my vision or to ponder some thought that had come to mind. I kept looking at my alien-looking fingers wondering who and what I was.
It took me a while longer yet to find what I was supposed to smoke, and it proved to be very difficult to know what to do with it.  The smoke was thick in the pipe, and yet, I couldnít taste it, and I couldnít tell it was in me. I felt like I could have taken the biggest hit ever and held it in forever.
After 4 or 5 big hits, the visuals became extremely intense and it became too hard to smoke. It would just take me too long every time to figure out how to use the device, so I gave up and put the pipe somewhere safe (apparently in my shoe nearby seemed like the best idea at the time). I tried to stand up to go get some water, but that 'lightheadedness' I sometimes get when I stand up fast, it hit me like a bullet, and I was passed out before I knew what had happened.
It must only have been 10 or 20 seconds later, but I came to, and everything was swirling like crazy. The border lines to any object were wavy and dancing around, making the room and my entire field of vision seem like a pool of water that is constantly being hit with rocks and disrupted. The marijuana made the already hard-trip explode with intensity, and after this point things get very confusing.
T+3:30 -- This is about the peak of the trip, and although I do remember a good portion of this time, it wasn't as if I was actually there experiencing it, because I truly felt so out of reality, and in such a different dimension than everything else, that I wasn't really there at all. It was as if my body was there in reality, but my mind (which I had concluded is really ME) was just watching all this happen from infinite space/time away.
My mind and body had never felt so disconnected in my life, had never actually been 2 completely different things which I could identify and which felt distant from each other. There was some region of my subconscious that was still intact and able to experience all this, and its through this part of my brain that I can now recall what happened, but at the time, all of my normal sensory functions ceased to function in their normal way, and began to function as one.
My sight, hearing, taste, touch, and smell were all one and were coming to me as one. This is a very hard thing to explain.  Yet, all these 5 things were happening as one, and my brain registered them all as one.
T+3:50 -- As I came out of the uni-sense state, my mind was shooting thoughts and ideas at random very quickly at me. These thoughts weren't created or forced, but just came to me, they just sort of appeared in my head. This was very similar to the earlier stages of the trip when thoughts came very fast at me. But it was as if a person inside my head was just telling me these things. All of a sudden it said '11:56' to me, that was it. A low-tone voice, but very certain of itself. I turned over on my bed because I instantly knew what it related to. On the clock, in big red numbers in front of me read '11:56' This was one of the trippiest moments of my entire life.
I know for a fact that I didnít see a clock or watch or any time-telling device after about 9:00 or so, and I was stunned for several minutes. Laying in my bed still, everything still swirling, I drifted off into another state of one-sense perception. Again, I came to and the entity said '12:03' I spun around to stare the clock straight on, as it read '12:03' OH MY GOD! AGAIN? WHAT? Did this ever happen a first time? Am I actually seeing this? I was really tripped out. After several more minutes of lying in bed, I tried to predict the time again. This time I was a minute off.
I spent the next couple hours listening to Bob Marley, Sublime, and other various bands, and smoked copious amounts of ganja. The last part of the trip was more in control for me and I was able to enjoy it immensely. I realized that I hadn't talked at all during the trip, and that I hardly even thought in english during the trip. I more just experienced the emotion and got right to thinking about the issue, not talking to myself in english as I often do, but thinking about the thing itself. I went to sleep at about 2:30 that night, about 6 and half hours after dosing. Even as I went to sleep I was still definitely under the influence of the mushrooms, but I was definitely coming back to normal.
The day after I felt just fine. I woke up feeling refreshed and energized, but my mind! oh my god! My mind had soooooo much information to process. I had experienced so many things that night unlike anything I have ever even thought possible, that it would take a long time for my mind to catch up with it all. I thought I was ready and looking for the full-blown psychedelic experience, but when it came to me, I found myself unprepared the mind-blowing experience that the mushrooms provide. I'm glad that I've spent so much time afterwards trying to reflect on what happened that night because it was such a significant experience in my life. It took everything I thought to be true and real and life, reality and existence and turned it all upside down.
In many ways, this was a better trip than I could have hoped for. Had I had a sitter there with me, or even another person tripping, I think it would have gone a lot smoother. Either way, I have enjoyed the sacred fungus on multiple occasions since then and have had excellent trips, although none of them even come close in intensity as the trip that night. It definitely has made me able to see things is a true and genuine way. Although this wasn't a big theme in the actual trip, it became apparent later that seeing everything like I was, was allowing me to form a personal, true, genuine, and unbiased opinion on everything.
This might not sound that amazing, but I feel that often times things appear not as how they really are, so this was great for me. Everything that happened in that trip would take more than my lifetime to completely process and think about, but I think I've got a good start anyway.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


|
Prof.
Richard Adams
California State University, Sacramento, USA
M.Litt., M.A.,
B.A. (Hon.), Special Diploma in Education Studies (with
distinction), University of Oxford
|
|
Prof. Dr. Joseph Aiyeku
Salem State University, Massachusetts, USA
D.B.A.
(International Business), Nova Eastern University, Florida;
M.B.A. (Marketing), Golden State University, San Francisco;
B.S. (Marketing), Portland State University, Oregon |
|
Prof. Dr. Carlos Alsua
University of Alaska, Anchorage, USA
Ph.D. (Business Administration), M.B.A., Arizona
State University; B.A. Brigham Young University
(English-Spanish Translation, Business Management)
|
|
Prof. Dr. Steven E. Aufrecht
University of Alaska, Anchorage, USA
Ph.D. University
of Southern California (Public Administration); M.P.A.
University of Southern California; University of California
Education Abroad Program, Goettingen, Germany
|
|
Prof. Dr. Renate Buber
Vienna University of Economics and Business Administration,
Austria
Ph.D. University
of Economics and Business Administration of Vienna
(Marketing); M.B.A. University of Economics and Business
Administration Vienna (Business Pedagogic) |
|
Prof. Robert Buckley
California State University, Sacramento, USA
Ph.D. cand. Agricultural Economics (ABD: All But Dissertation), University of California, Davis CA, M.S. Cybernetic Systems, San Jose State University, San Jose CA, M.S. Agricultural Economics, University of California, Davis CA, B.S. Mathematics, College of William and Mary, Williamsburg VA |
|
Prof. Dr. Linda Callis Buckley
San Francisco State University, USA
Ph.D., M.A.
(Anthropology), M.A. (Linguistics), University of California
at Davis; B.A. (English), University of Georgia, Athens, USA |
|
Prof. Dr. John W. Campbell
Eastern New Mexico University, USA
Ph.D., M.A. Ohio
State University; B.A. Beloit College, Beloit, Wisconsin
(Philosophy and Psychology) |
|
Ajarn.Joey Cano,Esq;
Ramkhamhaeng University
Juris Doctor (JD), Cleveland State University, Cleveland, Ohio; Bachelor of Arts (Law), Western Washington University, Bellingham, Washington; Associate of Arts and Science Degree, Columbia Basin College, Pasco, Washington, USA. |
|
Prof.
Dr. Tina Carroll
California Polytechnic
State University, Pomona, USA
Ph.D. (Communication), University of Miami;
M.A. (Public and Corp. Communication), University of
South Alabama, Alabama;
B.A. (Journalism), University of Southern Mississippi,
Hattiesburg |
|
|
Prof. Dr. Gerardo H. Chaljub
Devry University, USA
Ph.D.Business Administration, Barry University, M.B.A. Barry University, B.B.A. Ft. Lauderdale College (Professional Experience: Human Resources and Management Professional and Senior HR Consultant in USA, Europe and Latin America and Teaching for over 25 years)
|
|
Ajarn. Birte Chuychunu
University of Osnabrueck, Germany
Ph.D. cand. (cultural studies), University of Osnabrueck, Germany; M. A. (graduate in English and American Literature, Political Science, Media), City College of New York, USA |
| |
Prof.
Dr. Robert L. Curry
California State University, Sacramento, USA
Ph.D. (Economics)
University of Oregon; M.A. (Economics),
B.A. (Economics)
Sacramento State College, USA
|
|
Prof. Dr. Kevin DeLuca
University of Georgia, Athens, USA
Ph.D. University
of Iowa (Communication); M.A. University of Massachusetts
(Communication); B.A. University of Massachusetts
(Communication) |
|
Prof. Dr. Paul Dion
Susquehanna University, PA, USA
Ph.D. (Marketing), University of Toronto; M.B.A. (Marketing), McMaster University, Hamilton, Ontario; B.A. (Experimental Psychology, Biological and Medical Sciences), Canada |
|
Prof. Dr.Robert Doherty
Liverpool John Moores University, UK
MBA Liverpool Business School; BSc (Hons) (Environment Science) New Castle Upon Tyne University |
|
Ajarn. Gabriele Fassbender-Schroer
Ramkhamhaeng University
M.A. (visual communications), University of Aachen, Germany
|
|
Assoc. Prof. Dr. Guillermo Gibens
South Georgia College
Ph.D.
(Communication Studies), Bowling Green State University,
Ohio; M.A. (Communication Studies), University of Kansas,
Lawrence, USA; B.A. (Social Communication), Catholic University
Andres Bello, Caracas, Venezuela |
|
Dr. Frank J. Gold
Ramkhamhaeng University, Thailand
Ed.D. University
of Nebraska, (Educational Psychology and Management); B.A.
Tarkio (Missouri) College, (Biology and Chemistry) |
|
Prof. Dr. David Hemphill
San Francisco State University, USA
Ed. D. Educational Organization and Leadership, University of San Francisco; M.A. Bilingual Vocational Education, University of San Francisco; Graduate Study in Political Science, University of Michigan; A.B. Political Science, Asian Language, University of California |
|
Prof. Dr. Wilford L. Hjort
Ramkhamhaeng University, Thailand
Ph.D., M.P.H.,
M.D., M.S., B.S. Colorado State University (CSU) and
University of California at Los Angeles (UCLA) |
|
Prof. Dr.Julia Holzl
Post-Doctoral Researcher at European Graduate School, Switzerland
Ph.D. (Media and Communications) European Graduate School, Switzerland; M.A. (Peace Studies) University of Innsbruck, Austria;Magistra phil (Political Science) University of Vienna, Austria |
|
|
Prof. Dr. Dr. Juergen Huber
University of Innsbruck, Innsbruck, Austria
Ph.D. (Doctor of
Political Sciences, Distinction), Ph.D. (Doctor of Economic
Sciences in Finance, Distinction), Magister rer.soc.oec.
(Distinction), (Master of Business and Economics),
University of Innsbruck
|
|
|
Prof. Dr. Daniela Ingruber
UNESCO Chair for Peace Studies, University of Innsbruck, Austria
Ph.D (Political Philosophy) â University of Vienna, Austria;
M.A. (Peace) - Universidad Jaume I, Valencia, Spain;
M.A. (Political Science and Drama) University Vienna, Austria |
|
Prof. Dr. Stella Ireland
Ramkhamhaeng Unversity, Thailand
PhD (Interdisciplinary Studies/Multicultural Theatre), The Union Institute and University, Cincinnati, Ohio;
M.Ed., Lesley University, Cambridge, MA;
B.A., University of Western Ontario, London, Canada |
|
Prof. Dr. Herbert L. Johnson
Nova Southeastern University, Florida, USA
Ph.D. University
of Arkansas (Management); M.B.A. University of Houston
(Economic Development); B.A. University of Houston
(Production Management)
|
|
Prof. Dr. Jong S. Jon
California State University, Hayward, USA
Ph.D. University
of Southern California (Public Administration)
|
|
Prof. Zoe Jowers
Liverpool John Moores University, UK
M.A. (Marketing), Liverpool John Moores University; B.A. (Hons.) Consumer Services Management, Leeds Metropolitan University, UK |
|
Prof. Dr. Hassan Khazem
Nova Southeastern University, Forida, USA
D.B.A. (Finance), Nova Southeastern University, Florida; M.B.A., Embry Riddle Aeronautical University, Daytona Beach, Florida; M.S.E.E., Tuskegee University, Alabama; B.S.E.E., Tuskegee University, Alabama, USA |
|
|
Prof. Dr. Shin Dong Kim
Hallym University, South Korea
Ph.D. (Mass
Communication) Indiana University; M.A. (Mass
Communication), B.A. (Journalism and Broadcasting) Korea
University
|
|
Prof. Wolfgang Lechthaler
University of Innsbruck, Innsbruck, Austria
Master of
Economics, B.A. (Economics) University of Innsbruck
|
|
Prof.
Dr. William Leavings
Ramkhamhaeng University, Thailand
J.D. (US. Legal System), University of Denver
B.A. (Business Administration), University of Minnesota
|
|
Prof. Dr. Consuella Lewis
University of Pittsburgh, Pennsylvania, USA
Ph.D. (Education) Claremont Graduate University; M.Sc. in Education, Counseling and Development, Indiana University, Bloomington; BA. Political Science, Indiana University, Bloomington, USA |
|
|
Prof. Dr. Kenneth Lipner
Florida International University, Miami, Florida
Ph.D. Rutgers University,
M.B.A. University of Memphis,
B.S. Florida State University, USA |
|
Assoc.Prof.Dr.Harold Little
Western Kentucky University.
Ph.D.(Accounting) Southern Illinois University.
M.B.A.(Finance) University 0f Chicago.
B.A.(Accounting) Howard University,Washington.
|
|
Prof.Dr. Silvia Orta
Nova Southeastern University, Forida, USA.
Doctor of Education, Nova Southeastern University,Florida, USA.
Master of International Business Adminisration, Nova
Southeastern University,Florida, USA.
Bachelor of
Economics, University of Havana Evaluated and certified by World Education Services Havana, Cuba. |
| |
|
Prof.Miguel Orta
Nova Southeastern University, Forida, USA.
Master of International Business Adminisration, Nova
Southeastern University,Florida, USA.
J.D.-Juris Doctor,Duke University.
B.A. Mass Communication, and Public Adminisration. Florida State University |
|
Prof.Dr. Jonathan Howard Amsbray Ph.D. (Speed Communication),Indiana University
M.A. (Speed Communication),Indiana University
B.A.(Speed Communication/Psychology), University of New Mexico |
|
Prof.Dr.Pier.Paolo Pasqualoni
Ph.D.(philosophy),University of Innsbruck
Graduate study of philosophy, sociology,theory of education,
psycho-and sociolinguistics,University of Innsbruck
College (Realgymnasium),Brixen/Bressanone |
|
Prof.Jamie H.A. Wallin
Ph.D., University of California,Berkeley,California (U.S.A.) Organizational Sociology and Higher Educationa Administration
B.Ed.,M.Ed. University of Alberta, Edmonton, Alberta (Canada) Sociology and Educationa Administration |
|
Prof.Dr. Mark Hickson
University of Alabama
Ph.D.Speech, Southern Illinois University, Cabondale,IL.
J.D. Birmingham Scholl of Law, Birmingham,AL.
M.A. Speech (Minor: History), Auburn University,Auburn,AL.
M.A. Sociology (Minor:Philosophy), Mississippi State University, Starkville,
MS. Doctoral study, Sociology, Mississippi State University,
B.S. Secondary Education (Social Studies),Auburn University,Auburn,AL. |
|
|
Prof. Dr. Frederick Marshall
California State University, Fullerton, USA
Ph.D.
(Linguistics), University of Pittsburgh;; MA (Linguistics),
University of New York, Buffalo; BA (cum laude) (English
Literature), Wesleyan University, Middletown, CT |
|
Prof. Dr. Merle P. Martin
California State University, Sacramento, USA
Ph.D. (Business: MIS), Texas A&M University; M.S.
(Statistics: Data Processing and Operations Research),
Stanford University; B.S. (Business), University of
California at Berkeley
|
|
Prof. Dr. Warren L. Mason
Miami University, Ohio, USA
Ph.D., M.A., B.A., University of Minnesota, Minneapolis;
London School of Economics and Political Science (London)
Research Scholar
|
|
Ass. Prof. Dr. Joseph E. Massey
California State University, Fullerton, USA
Ph.D. (Communication), M.A. (Communication), University of
Arizona; B.A. (Communication and Philosophy), University of
Oklahoma |
|
Prof. Dr. Margaret Davitt Maughan
State University of New York,
Plattsburgh, New York, USA
Ed.D.
(Leadership) University of San Francisco
M.A.T. History University of Santa Clara
B.A.
History University of Santa Clara
|
|
Prof. Michael C. McAlexander
California State University, Fullerton, USA
M.F.A. University of Southern California, Los Angeles (Film
Production, Screenwriting); B.A. University of California,
Irvine (Drama) |
|
Prof.
Dr. Craig McLanahan
Salem State College,
Massachusetts, USA
Ph.D. (Engineering and Operations Research), University of
Massachusetts, Amherst
M.B.A. (Transportation Operations Management), Harvard
Business School
B.S. (Aeronautical Engineering), Princeton University
|
|
Prof. Dr. Andreas Mild
Vienna University of Economics and Business Administration,
Austria
Ph.D. (Honors), Magister rer.soc.oec. (Honors), Vienna
University of Economics and Business Administration
(Production Management, Computer Science in Economics);
Technical college degree in Mechanics |
|
Prof. Dr. Dirk Morschett
University of Fribourg, Switzerland
PhD (Doktor) in Business Administration, Saarland University; Undergraduate and Graduate Studies of Business Administration, Saarland University, Germany |
|
Assoc. Prof. Dr. Bahaudin Mujtaba
Nova Southeastern University, Florida, USA
Ph.D. (Management), M.B.A. (Management/IS), Nova Southeastern University, USA
|
|
Prof. Patty Nasari
University of Paris (Sorbonne)
MBA (Economics), University of California, Davis (in progress); BSEE, California State University, Fullerton |
|
Assoc. Prof. Dr. Maria L. Nathan
Lynchburg College, Virginia, USA
Ph.D. (Management and Organization), The University of Southern California, Los Angeles; M.A. (Applied Psychology), University of Missouri, St. Louis; M.A. (Developmental Psychology), University of Akron, Ohio; B.A. (General Psychology), University of Akron, Ohio
|
|
Prof. Dr. Sonny Nwankwo
University of East London, Dagenham, UK
Ph.D. (Consumerism & Consumer Protection), City University, London; M.B.A. (Marketing), University of Nigeria; Pg.C.E. (Further & Higher Education), Sheffield Hallam University; B.Sc. (Honors; Management Studies), University of Jos, Nigeria |
|
Prof. Dr. Andreas Oberprantacher
University of Innsbruck, Innsbruck, Austria
Ph.D. University of Innsbruck, Innsbruck, Austria |
|
Prof. Dr. Martin F. Parnell
Liverpool John Moores University, Liverpool, UK
Ph.D. (German Political Economy), M.A. (German Linguistics), B.Ed. (German and Education), U.K.
|
|
Prof. Dr. Pedro F. Pellet
Nova Southeastern University, Florida, USA
Ph.D. (International Affairs Specialities in Economics
Development and Developmental Process) University of Miami ; M.Phil. London School of Economics and
Political Sciences, UK ; M.A. (Economics) University of Puerto Rico; B.A. (Economics and Political Sciences), University of Puerto Rico.; B.Sc. (Biology) University of the Sacred Heart |
|
Assoc. Prof. Dr. Linda M. Perkins
Claremont Graduate University, California, USA
Ph.D. (History and Education), University of Illinois; M.S. (Music Education), University of Illinois; B.S. (Music Education), Kentucky State University
|
|
Prof.
Dr. Mohamed Pirani
Liverpool John Moores University, Liverpool, UK
Ph.D.(Research) Manchester University, UK; M.Ed.(Entrepreneuship Â Education), Manchester University, UK; M.Sc.(Entrepreneuship Education), Bristol
University, UK; B.Sc.(Psychology) (Hon.), Bath
University, UK; Fellow of Operations Research Society, UK;
Fellow of Royal Statistical Society, UK. (Profession/Research Interest: Organizations, Knowledge Management, Culture and Management) |
|
Prof. Dr. Raymond Pomerleau
San Francisco State University, USA
Ph.D., M.A., B.A. University of Oregon (Political Science) |
|
Ajarn. Allison Post
Ramkhamhaeng University, Thailand
M.A. Professional Development, Heritage University; B.A. International Affairs, Eastern Washington University, USA |
|
Prof.
Dr. Peter W. Preston
University of Birmingham, UK
Ph.D. (Development Theory), B.A. (Hons) (Philosophy and
Sociology), University of Leeds, UK |
|
Prof. Dr. Jonathan Price
California State University , Sacramento
PhD. English and American Literature, Stanford University; M.A. English and American Literature, Stanford University; B.A. English, Yale University |
|
Prof. Dr. Helga Puelzl
University of Salzburg, Austria
Ph.D. (Political Science), University of Vienna, Austria; M.A. (Political Science), University of Vienna, Austria, and University of Messina, Italy |
|
Prof. Dr. Xin Ren
California State University, Sacramento, USA
Ph.D. Criminal and Criminal Law, University of Pennsylvania; M.A. Criminology, University of Ottawa, Canada; B.A. Philosophy, Renmin University, China; B.A. Sociology, Nankai University, China |
|
Prof. Edward L. Robinson, Jr.
Claremont Graduate University, USA
Ph.D. cand. (Cultural Studies), Claremont Graduate University, California; M.A. (American Studies), University of Utah, Salt Lake City; B.A. (Double Degree in History and Sociology), Georgia State University, Atlanta
|
|
Prof. Melanie Ruefli
Georgia Perimeter College, Lawrenceville, GA
M.A. (linguistiEcs), B.A. (French), Georgia State University, GA, USA
|
|
Prof. Dr. Bernhart Ruso
Vienna Technical University, Vienna, Austria
Ph.D. (Nature Sciences), Vienna University and Vienna Technical University, Vienna, Austria, Extension Degrees in Earth Sciences and Commodity Sciences (Vienna University), M.A. (Ecology) Vienna University, Austria |
|
Prof. Dr. Eugene Sauls
California State University, Hayward, USA
Ph.D. (Accounting), Michigan State University; M.Sc.
(Accounting), B.Sc. (Accounting), University of South
Carolina, USA |
|
Prof. Nancy Scott
Ramkhamhaeng University
C.P.A.; M.B.A. (Accounting), California State University, Chico, USA; B.B.A. (Accounting), Stephen F. Austin State University, USA |
|
Prof
Dr. Donald Singleton
Salisbury State University, Maryland, USA
PhD
(Mass Communication) University of Oklahoma, Norman; MA
(Television Production), University of California at Los
Angeles; A.B. (Accounting), University of North Carolina |
|
Prof. Dr. Herbert Stocker
University of Innsbruck, Innsbruck, Austria
Ph.D. (Doctor of Economics), Master of Economics, University
of Innsbruck |
|
Prof. Dr. JÃ¼rgen WÃ¶ckl
Vienna University of
Economics and Business Administration, Vienna, Austria
Ph.D. (Applied Mathematics), Vienna University of
Economics and Business Administration
Diplom-Ingenieur (graduate in civil engineering), Vienna
Technical University |
|
Prof. Michaela Zimmermann
Senior Lecturer, German Section, Faculty of Humanities
Ramkhamhaeng University
M.A. (German and English), University of Trier, Germany |
|
Prof.Dr. Kenneth Brinson
North Carolina State University
Ph.D.(Educational Administration) Pennsylvania State University .
ME.d.
(Educational Leadership) University of North Carolina at Greensboro.
BS.(Middle School Education) University
of North Carolina at Greensboro. |
|
Prof.Dilp.Des.Claudia Maria Aymar
RheinMain University
Diploma-DesinerZeq.MSc.for Communication Design,University of Schwabisch Gmund,Germany
:Desing Assistant at the School for Printing in Stutrgart,Germany |
|
Prof.Wolfgang Schiffler
RheinMain University
:MSc.,Telecommunication Technologies at the Technical,
University of Darmstadt,Germany |
|
Prof.Jonathan D Biederer
:MA Organizational Communication, California State University, Sacramento
:BA Communication emphasis in training development, California State University, Scramento |
|
Prof.Dr. Monika Mayrhofer
:PhD (Political Science , University of Vienna
Meg.Phil./Master, Graduation with Excellency |
|
Prof. Dr. Thomas J. Knutson
California State University, Sacramento, USAPh.D. Indiana University (Communication Theory and Educational Psychology)Intercultural Communication and Communication Theory |
|


We extend solutions!
transform enterprise synergies
optimize sticky channels
drive magnetic content
syndicate interactive schemas
engage enterprise portals
strategize vertical relationships
maximize visionary e-commerce
redefine customized users


rendgen.css tests
Errors
There should be no empty elements.
Links should have filled href
attributes.
Images should have (at least empty) alt
atributes.
Valid:
Invalid:
form
should have action
attribute.
label
should have for
attribute.
textarea
should have rows
and cols
attribute.
Warnings
Check elements with style
attribute.
Anchors should have proper href
attributes.
Provide some content for alt
attribute on img
element.
Valid:
Invalid:
Use button
instead input
.
tr
should be children of thead
/tfoot
/tbody
, not table
.
tfoot
needs to come before tbody
.
Include cellpadding
and cellspacing
for backwards compatibility.
Check for scope
attribute on th
elements.


from sklearn.model_selection import StratifiedKFold, KFold
from reval.relative_validation import RelativeValidation
from collections import namedtuple
from scipy import stats
import numpy as np
import math
[docs]class FindBestClustCV(RelativeValidation):
"""Child class of :class:`reval.relative_validation.RelativeValidation`.
It performs cross validation on the training set to
select the best number of clusters, i.e., the number that minimizes the
misclassification error.
:param nfold: number of CV folds
:type nfold: int
:param nclust_range: list with minimum and maximum cluster numbers to look for
:type nclust_range: list ([int, int])
:param s: classification object inherited from :class:`reval.relative_validation.RelativeValidation`
:type s: class
:param s: classification object inherited from :class:`reval.relative_validation.RelativeValidation`
:type c: class
:param nrand: number of iterations for normalized misclassification error, inherited from
:class:`reval.relative_validation.RelativeValidation` class
"""
def __init__(self, nfold, nclust_range, s, c, nrand):
"""Construct method
"""
super().__init__(s, c, nrand)
self.nfold = nfold
self.nclust_range = nclust_range
[docs] def best_nclust(self, data, strat_vect=None):
"""This method takes as input the training dataset and the
stratification vector (if available) and performs a
CV to select the best number of clusters that minimizes
normalized misclassification error.
:param data: training dataset
:type data: ndarray, (n_samples, n_features)
:param strat_vect: vector for stratification, defaults to None
:type strat_vect: ndarray, (n_samples,)
:return: CV metrics for training and validation sets, best number of clusters
:rtype: dictionary, int
"""
data_array = np.array(data)
reval = RelativeValidation(self.class_method, self.clust_method, self.nrand)
metrics = {'train': {}, 'val': {}}
check_dist = {'train': {}, 'val': {}}
for ncl in range(self.nclust_range[0], self.nclust_range[1]):
if strat_vect is not None:
kfold = StratifiedKFold(n_splits=self.nfold)
fold_gen = kfold.split(data_array, strat_vect)
else:
kfold = KFold(n_splits=self.nfold)
fold_gen = kfold.split(data_array)
norm_stab_tr, norm_stab_val = [], []
for tr_idx, val_idx in fold_gen:
tr_set, val_set = data_array[tr_idx], data_array[val_idx]
reval.clust_method.n_clusters = ncl
miscl_tr, modelfit, tr_labels = reval.train(tr_set)
miscl_val, val_labels = reval.test(val_set, modelfit)
rndmisc_mean_val = reval.rndlabels_traineval(tr_set, val_set,
tr_labels,
val_labels)
ms_val = miscl_val / rndmisc_mean_val
norm_stab_tr.append(miscl_tr)
norm_stab_val.append(ms_val)
check_dist['train'].setdefault(ncl, list()).append(miscl_tr)
check_dist['val'].setdefault(ncl, list()).append(ms_val)
metrics['train'][ncl] = (np.mean(norm_stab_tr), _confint(norm_stab_tr))
metrics['val'][ncl] = (np.mean(norm_stab_val), _confint(norm_stab_val))
val_score = np.array([val[0] for val in metrics['val'].values()])
bestscore = min(val_score)
# select the cluster with the minimum misclassification error
# and the maximum number of clusters
bestncl = np.flatnonzero(val_score == bestscore)[-1] + self.nclust_range[0]
return metrics, bestncl, check_dist
[docs] def evaluate(self, data_tr, data_ts, nclust):
"""Method that applies clustering algorithm with the best number of clusters
to the test set. It returns the clustering labels.
:param data_tr: training dataset
:type data_tr: ndarray, (n_samples, n_features)
:param data_ts: test dataset
:type data_ts: ndarray, (n_samples, n_features)
:param nclust: best number of clusters
:type nclust: int
:return: labels and accuracy for both training and test sets
:rtype: namedtuple, (train_cllab, train_acc, test_cllab, test_acc)
"""
self.clust_method.n_clusters = nclust
tr_misc, modelfit, labels_tr = super().train(data_tr)
ts_misc, labels_ts = super().test(data_ts, modelfit)
Eval = namedtuple('Eval',
['train_cllab', 'train_acc', 'test_cllab', 'test_acc'])
out = Eval(labels_tr, 1 - tr_misc, labels_ts, 1 - ts_misc)
return out
[docs]def _confint(vect):
"""
Private function to compute confidence interval.
:param vect: performance scores
:type vect: list
:return: mean and error
:rtype: tuple
"""
error = stats.t.ppf(1 - (0.05 / 2), len(vect) - 1) * (np.std(vect) / math.sqrt(len(vect)))
mean = np.mean(vect)
return mean, error


Created: 2021-02-28 Sun 18:49
God, grant me the serenity to accept the things I cannot change,
The courage to change the things I can,
And the wisdom to know the difference.
Richard Niebuhr: Christian ethicist: Christ and Culture
Vatican II was a watershed for the Catholic church. It was both the culmination of developments of the previous century and it set in motion things that changed the Church
Lonergan: It's all about the method
The joys and the hopes, the griefs and the anxieties of the men of this age, especially those who are poor or in any way afflicted, these are the joys and hopes, the griefs and anxieties of the followers of Christ. Gaudium et Spes 1
Created by Dale Hathaway.


A classic Galleria gallery using Fotki images
This example is a classic gallery that fetches images from a Fotki user stream using the Fotki plugin. We also added external links to navigate, pause, play and enter fullscreen mode.
View source for comments and code.


This is a free interpretation of the chapter art for Marathon Durandal and Marathon Infinity, portrays an officer with a heavier armor and some extra gadgets that we don't see in game.
Attention! 4K textures ahead, proceed with caution.
This model is based on the art from the three games and a recent post in Bungie's twitter, that features the Cyborg, Master Chief and Oni's protagonist in a single drawing.
Attention! 4K textures ahead, proceed with caution.
The Defence Drones were a key element in the defence of the UESC Marathon, their only appearance is on board the ship, as they are never seen again
Attention! 4K textures ahead, proceed with caution.
Vaccumm enabled BOBs were not seen in Marathon Durandal, but they appear in that same time frame in Infinity. Their suits were probably designed by Durandal's S'pht as well as their weapons. All of them are volunteers, given the chance to either become lab rats or kill Pfhor.
Attention! 4K textures ahead, proceed with caution.


Manager Home
Accept/Reject Requests
View All Employees
Log Out
Enter Request ID:
Select Option
Accept
Reject

Enter Emp Id to Filter:

Enter Request Type:
Select Option
Submitted
Approved
Rejected

Reset Table: