All Files
(100.0%
covered at
1.5
hits/line)
16 files in total.
83 relevant lines.
83 lines covered and
0 lines missed
Controllers
(100.0%
covered at
0.0
hits/line)
0 files in total.
0.0 relevant lines.
0.0 lines covered and
0.0 lines missed
| File |
% covered |
Lines |
Relevant Lines |
Lines covered |
Lines missed |
Avg. Hits / Line |
Models
(100.0%
covered at
1.56
hits/line)
6 files in total.
73 relevant lines.
73 lines covered and
0 lines missed
Mailers
(100.0%
covered at
0.0
hits/line)
0 files in total.
0.0 relevant lines.
0.0 lines covered and
0.0 lines missed
| File |
% covered |
Lines |
Relevant Lines |
Lines covered |
Lines missed |
Avg. Hits / Line |
Helpers
(100.0%
covered at
1.0
hits/line)
10 files in total.
10 relevant lines.
10 lines covered and
0 lines missed
Libraries
(100.0%
covered at
0.0
hits/line)
0 files in total.
0.0 relevant lines.
0.0 lines covered and
0.0 lines missed
| File |
% covered |
Lines |
Relevant Lines |
Lines covered |
Lines missed |
Avg. Hits / Line |
-
1
module ApplicationHelper
-
end
-
1
module CompetenciesHelper
-
end
-
1
module CompetencyStepsHelper
-
end
-
1
module IndicatorQuestionsHelper
-
end
-
1
module IndicatorResourcesHelper
-
end
-
1
module IndicatorsHelper
-
end
-
1
module QuestionsHelper
-
end
-
1
module ResourcesHelper
-
end
-
1
module TemplateDownloaderHelper
-
end
-
1
class Competency < ActiveRecord::Base
-
# relationshis
-
1
has_many :indicators
-
1
has_many :indicator_resources, through: :indicators
-
1
accepts_nested_attributes_for :indicators
-
1
accepts_nested_attributes_for :indicator_resources
-
-
# validations
-
1
validates_presence_of :name
-
-
# scopes
-
2
scope :active, -> { where("active = ?", true) }
-
2
scope :inactive, -> { where("active = ?", false) }
-
4
scope :alphabetical, -> { order("name") }
-
-
# Private Methods
-
# ---------------------------
-
-
1
def self.options_for_sort_by_competency
-
4
all.map { |e| [e.name, e.name] }
-
end
-
-
end
-
1
class Indicator < ActiveRecord::Base
-
1
LEVELS_LIST = ["Companion", "Contributor", "Champion"]
-
# Relationships
-
# --------------------------------
-
1
belongs_to :competency
-
1
has_many :indicator_resources
-
1
has_many :resources, through: :indicator_resources
-
1
accepts_nested_attributes_for :indicator_resources
-
-
# Validations
-
# --------------------------------
-
1
validates_presence_of :competency_id, :level, :description
-
1
validates_numericality_of :competency_id, only_integer: true
-
-
-
# Scopes
-
# --------------------------------
-
5
scope :alphabetical, -> { order('description') }
-
2
scope :by_level, -> (level) { where("level LIKE ?", level) }
-
1
scope :by_description, -> (desc) { where("description LIKE ?", desc) }
-
2
scope :by_competency, -> (competency) { joins(:competency).where("name LIKE ?", competency) }
-
2
scope :active, -> { where(active: true) }
-
-
# Private Methods
-
# --------------------------------
-
-
1
def self.options_for_sort_by_level
-
3
group(:level).map { |e| [e.level, e.level] }
-
end
-
-
end
-
1
class IndicatorQuestion < ActiveRecord::Base
-
#relationships
-
1
belongs_to :question
-
1
belongs_to :indicator
-
-
#validations
-
1
validates_presence_of :indicator_id, :question_id
-
end
-
1
class IndicatorResource < ActiveRecord::Base
-
1
attr_accessor :indicator_description
-
1
belongs_to :resource
-
1
belongs_to :indicator
-
1
validates_presence_of :resource_id, :indicator_id
-
-
1
def name
-
1
return resource.name
-
end
-
end
-
1
class Question < ActiveRecord::Base
-
#relationships
-
1
has_many :indicator_questions
-
1
has_many :indicators, through: :indicator_questions
-
-
#validations
-
1
validates_presence_of :question
-
-
#scoeps
-
3
scope :active, -> { where("active = ?", true) }
-
2
scope :inactive, -> { where("active = ?", false) }
-
2
scope :alphabetical, -> { order("question") }
-
end
-
1
class Resource < ActiveRecord::Base
-
# Gem for filtering
-
1
filterrific(
-
default_filter_params: { sorted_by: 'name asc' },
-
available_filters: [
-
:sorted_by,
-
:sort_active,
-
:sort_by_competency,
-
:sort_by_level,
-
:sort_by_category
-
]
-
)
-
-
1
has_many :indicator_resources
-
1
has_many :indicators, through: :indicator_resources
-
-
# Scopes
-
# -----------------------------
-
2
scope :alphabetical, -> { order('name') }
-
7
scope :active, -> { where(active: true) }
-
1
scope :inactive, -> { where(active: false) }
-
3
scope :for_indicator, -> (indicator_id) { joins(:indicator_resources).where('indicator_id = ?', indicator_id) }
-
1
scope :search, ->(term) { where('name LIKE ?', "#{term}%", "#{term}%") }
-
# scopes for filterrific
-
1
scope :sort_active, -> (query) { where('resources.active = ?', query) }
-
1
scope :sort_by_category, -> (query) { where('resources.resource_category = ?', query) }
-
1
scope :sort_by_level, -> (query) { joins(:indicators).where('indicators.level = ?', query) }
-
1
scope :sort_by_competency, -> (query) { joins(:indicators).joins("INNER JOIN competencies ON indicators.competency_id = competencies.id").where('competencies.name = ?', query).group("resources.name") }
-
1
scope :sorted_by, lambda { |sort_option|
-
5
direction = (sort_option =~ /desc$/) ? 'desc' : 'asc'
-
5
case sort_option.to_s
-
when /^name/
-
2
order("LOWER(resources.name) #{ direction }")
-
when /^resource_category/
-
2
order("LOWER(resources.resource_category) #{ direction }")
-
else
-
1
raise(ArgumentError, "Invalid sort option: #{ sort_option.inspect }")
-
end
-
}
-
-
# Validations
-
# -----------------------------
-
1
validates_presence_of :name, :resource_category
-
1
validates_format_of :link, with: /(https?:\/\/(?:www\.|(?!www))[^\s\.]+\.[^\s]{2,}|www\.[^\s]+\.[^\s]{2,})/, message: "is not a valid format", :allow_blank => true
-
-
# Private Functions
-
# -----------------------------
-
-
1
def self.options_for_sorted_by
-
[
-
1
['Name (a-z)', 'name asc'],
-
['Name (z-a)', 'name desc'],
-
['Type (a-z)', 'resource_category_desc'],
-
['Type (z-a)', 'resource_category_asc']
-
]
-
end
-
-
1
def self.options_for_sort_active
-
[
-
1
["True", 't'],
-
["False", 'f']
-
]
-
end
-
-
1
def self.options_for_sort_by_category
-
2
group(:resource_category).map { |e| [e.resource_category, e.resource_category] }
-
end
-
-
1
def self.get_categories
-
1
group(:resource_category)
-
end
-
-
end


APIHost defines the API host URL for v1.
const APIHost = "https://flexpool.io/api/v1"
const WeiRatio = 0.000000001
func MinerGetBalance(address string) (uint, error)
MinerGetBalance takes a mining wallet address and gets the balance in gwei. Returns the balance and nil on success, or 0 and error on failure.
func MinerGetBlockCount(address string) (int, error)
MinerGetBlockCount takes a mining wallet address and gets the number of blocks mined by that address. Returns the number of blocks mined as an int and nil on success, or 0 and error on failure.
func MinerGetEstimatedDailyRevenue(address string) (uint, error)
MinerGetEstimatedDailyRevenue takes a mining address and gets the estimated daily revenue in gwei. Returns the estimated daily revenue as an int and nil on success, or 0 and error on failure.
func MinerGetPaymentCount(address string) (int, error)
MinerGetPaymentCount takes a mining wallet address and gets the number of payments made to that address. Returns the number of payments as an int and nil on success, or 0 and error on failure.
func MinerGetRoundShare(address string) (float64, error)
MinerGetRoundShare takes a mining address and gets the current round share in percentage. Returns the round share as a float64 and nil on success, or 0.0 and error on failure.
func MinerGetTotalDonated(address string) (uint, error)
MinerGetTotalDonated takes a mining address and gets the total amount of gwei donated from that address to the pool. Returns the amount donated as an int and nil on success, or -0 and error on failure.
func MinerGetTotalPaid(address string) (uint, error)
MinerGetTotalPaid takes a mining address and gets the total amount of gwei paid to that address. Returns the amount paid as an int and nil on success, or 0 and error on failure.
func PoolGetAverageBlockReward() (uint, error)
PoolGetAverageBlockReward gets the pool's average block reward in gwei. Returns the average block reward as an int and nil on success, or 0 and error on failure.
func PoolGetCurrentLuck() (float64, error)
PoolGetCurrentLuck gets the pool's current luck as a percent. Returns the current luck as a float64 and nil on success, or 0.0 and error on failure.
func PoolGetMinersOnline() (int, error)
PoolGetMinersOnline gets how many miners are currently active on the pool. Returns the active miner count and nil on success, or 0 and error on failure.
func PoolGetWorkersOnline() (int, error)
PoolGetWorkersOnline gets how many workers are currently active on the pool. Returns the active worker count and nil on success, or 0 and error on failure.
Block contains information relevant to blocks mined - used by multiple endpoints.
type Block struct { Hash string `json:"hash"` Number uint `json:"number"` Type string `json:"type"` Miner string `json:"miner"` Difficulty uint `json:"difficulty"` Timestamp uint `json:"timestamp"` Confirmed bool `json:"confirmed"` RoundTime uint `json:"round_time"` Luck float64 `json:"luck"` ServerName string `json:"server_name"` BlockReward uint `json:"block_reward"` BlockFees uint `json:"block_fees"` UncleInclusionRewards uint `json:"uncle_inclusion_rewards"` TotalRewards uint `json:"total_rewards"` }
Endpoint type alias for the sendAPIRequest function.
type Endpoint int
Endpoint identifiers.
const ( Miner Endpoint = iota Worker Pool )
MinerBlockCount contains block count data from the /miner/{address}/blockCount endpoint.
type MinerBlockCount struct { Confirmed int `json:"confirmed"` Unconfirmed int `json:"unconfirmed"` }
MinerBlockData contains paged block data from the /miner/{address}/blocks endpoint.
type MinerBlockData struct { Data []Block `json:"data"` ItemsPerPage int `json:"items_per_page"` TotalItems int `json:"total_items"` TotalPages int `json:"total_pages"` }
func MinerGetBlocks(address string, page int) (MinerBlockData, error)
MinerGetBlocks takes an address and page number, and gets a list of blocks mined from that address. Returns a MinerBlockData instance and nil on success, an empty MinerBlockData and error on failure.
MinerChartData contains chart data entries from the /miner/{address}/chart endpoint.
type MinerChartData struct { Timestamp int `json:"timestamp"` EffectiveHashrate uint `json:"effective_hashrate"` AverageEffectiveHashrate float64 `json:"average_effective_hashrate"` ReportedHashrate uint `json:"reported_hashrate"` ValidShares int `json:"valid_shares"` StaleShares int `json:"stale_shares"` InvalidShares int `json:"invalid_shares"` }
func MinerGetChart(address string) ([]MinerChartData, error)
MinerGetChart takes a mining wallet address and gets a list of the chart data for that address. Returns a slice of MinerChartData instances and nil on success, or an empty slice and error on failure.
MinerDailyStats contains miner daily stats data from the /miner/{address}/stats and /miner/{address}/daily endpoint.
type MinerDailyStats struct { EffectiveHashrate float64 `json:"effective_hashrate"` InvalidShares int `json:"invalid_shares"` ReportedHashrate float64 `json:"reported_hashrate"` StaleShares int `json:"stale_shares"` ValidShares int `json:"valid_shares"` }
func MinerGetDaily(address string) (MinerDailyStats, error)
MinerGetDaily takes a mining wallet address and gets the effective and reported hashrate of that address, as well as it's amount of stale and valid shares over the last 24 hours. Returns a MinerDailyStats instance and nil on success, or an empty MinerDailyStats and error on failure.
MinerDetails contains overview data from the /miner/{address}/details endpoint.
type MinerDetails struct { MinPayoutThreshold uint `json:"min_payout_threshold"` PoolDonation float64 `json:"pool_donation"` MaxFeePrice uint `json:"max_fee_price"` CensoredEmail string `json:"censored_email"` CensoredIp string `json:"censored_ip"` FirstJoined uint `json:"first_joined"` }
func MinerGetDetails(address string) (MinerDetails, error)
MinerGetDetails takes a mining wallet address and gets the overall meta details of that wallet. Returns a MinerDetails instance and nil on success, or an empty MinerDetails instance and error on failure.
MinerPayment contains payment entries from the /miner/{address}/payments endpoint.
type MinerPayment struct { Txid string `json:"txid"` Amount uint `json:"amount"` Timestamp uint `json:"timestamp"` Duration uint `json:"duration"` }
MinerPaymentChart contains payment chart data from the /miner/{address}/paymentsChart endpoint.
type MinerPaymentChart struct { Amount uint `json:"amount"` Timestamp uint `json:"timestamp"` }
func MinerGetPaymentChart(address string) ([]MinerPaymentChart, error)
MinerGetPaymentChart takes a mining wallet address and gets a list of payments made to that address. Returns a slice of MinerPaymentChart instances and nil on success, an empty slice and error on failure.
MinerPaymentData contains paged payment data from the /miner/{address}/payments endpoint.
type MinerPaymentData struct { Data []MinerPayment `json:"data"` ItemsPerPage int `json:"items_per_page"` TotalItems int `json:"total_items"` TotalPages int `json:"total_pages"` }
func MinerGetPayments(address string, page int) (MinerPaymentData, error)
MinerGetPayments takes a mining wallet address and a page number, and gets a list of payment data for that address + page. Returns a MinerPaymentData instance and nil on success, or an empty MinerPaymentData instance and error on failure.
MinerDailyStats contains miner stats data from the /miner/{address}/stats endpoint.
type MinerStats struct { Current WorkerCurrentStats `json:"current"` Daily MinerDailyStats `json:"daily"` }
func MinerGetStats(address string) (MinerStats, error)
MinerGetStats takes a mining wallet address and gets the current and daily stats of that address. Returns a MinerStats instance and nil on success, or an empty MinerStats instance and error on failure.
MinerWorker contains worker data entries from the /miner/{address}/workers endpoint.
type MinerWorker struct { Name string `json:"name"` Online bool `json:"online"` DuplicateWorkersMerged int `json:"duplicate_workers_merged"` ReportedHashrate uint `json:"reported_hashrate"` EffectiveHashrate uint `json:"effective_hashrate"` ValidShares int `json:"valid_shares"` StaleShares int `json:"stale_shares"` InvalidShares int `json:"invalid_shares"` LastSeen int `json:"last_seen"` }
func MinerGetWorkers(address string) ([]MinerWorker, error)
MinerGetWorkers takes a mining wallet address and gets a list of the active workers for that address. Returns a slice of MinerWorker instances and nil on success, or an empty slice and error on failure.
MinerWorkerCount contains worker count data from the /miner/{address}/workerCount endpoint.
type MinerWorkerCount struct { Online int `json:"online"` Offline int `json:"offline"` }
func MinerGetWorkerCount(address string) (MinerWorkerCount, error)
MinerGetWorkerCount takes a mining wallet address and gets the offline and online worker counts for that address. Returns a MinerWorkerCount instance and nil on success, or an empty MinerWorkerCount instance and error on failure.
PoolAvgLuckRoundTime contains luck data from the /pool/avgLuckRoundtime endpoint.
type PoolAvgLuckRoundTime struct { Luck float64 `json:"luck"` RoundTime float64 `json:"round_time"` }
func PoolGetAverageLuckRoundTime() (PoolAvgLuckRoundTime, error)
PoolGetAverageLuckRoundTime gets the pool's current average luck as a percent and roundtime in seconds. Returns a PoolAvgLuckRoundTime instance and nil on success, or an empty PoolAvgLuckRoundTime and error on failure.
PoolBlockCount contains pool block data from the /pool/blockCount endpoint.
type PoolBlockCount struct { Confirmed int `json:"confirmed"` Unconfirmed int `json:"unconfirmed"` }
func PoolGetBlockCount() (PoolBlockCount, error)
PoolGetBlockCount gets how many blocks have been mined by the pool. Returns a PoolBlockCount instance and nil on success, or an empty PoolBlockCount and error on failure.
PoolBlockData contains paged block data from the /pool/blocks endpoint.
type PoolBlockData struct { Data []Block `json:"data"` ItemsPerPage int `json:"items_per_page"` TotalItems int `json:"total_items"` TotalPages int `json:"total_pages"` }
func PoolGetBlocks(page int) (PoolBlockData, error)
PoolGetBlocks takes a page number and gets a list of blocks the pool has mined from that page. Returns a PoolBlockData instance and nil on success, or an empty PoolBlockData and error on failure.
PoolDonatorInfo contains donation data for the top donators from the /pool/topDonators endpoint.
type PoolDonatorInfo struct { Address string `json:"address"` PoolDonation float64 `json:"pool_donation"` TotalDonated uint `json:"total_donated"` FirstJoined uint `json:"first_joined"` }
func PoolGetTopDonators() ([]PoolDonatorInfo, error)
PoolGetTopDonators gets a list of the top donators in the pool. Returns a slice of PoolDonatorInfo instances and nil on success, or an empty slice and error on failure.
PoolHashrate contains pool hashrate stats data from the /pool/hashrate endpoint.
type PoolHashrate struct { As uint `json:"as"` Au uint `json:"au"` Eu uint `json:"eu"` Sa uint `json:"sa"` Total uint `json:"total"` Us uint `json:"us"` }
func PoolGetHashrate() (PoolHashrate, error)
PoolGetHashrate gets the hashrate of the pool for each region in hashes per second. Returns a PoolHashrate instance and nil on success, or an empty PoolHashrate and error on failure.
PoolHashrateChartData contains pool data entries from the /pool/hashrateChart endpoint.
type PoolHashrateChartData struct { As uint `json:"as"` Au uint `json:"au"` Eu uint `json:"eu"` Sa uint `json:"sa"` Timestamp uint `json:"timestamp"` Total uint `json:"total"` Us uint `json:"us"` }
func PoolGetHashrateChart() ([]PoolHashrateChartData, error)
PoolGetHashrateChart gets a list of hashrate chart data for the pool. Returns a slice of PoolHashrateChartData instances and nil on success, or an empty slice and error on failure.
PoolMinerInfo contains miner data for the top miners from the /pool/topMiners endpoint.
type PoolMinerInfo struct { Address string `json:"address"` Hashrate uint `json:"hashrate"` TotalWorkers int `json:"total_workers"` Balance uint `json:"balance"` PoolDonation float64 `json:"pool_donation"` FirstJoined uint `json:"first_joined"` }
func PoolGetTopMiners() ([]PoolMinerInfo, error)
PoolGetTopMiners gets a list of the top miners in the pool. Returns a slice of PoolMinerInfo instances and nil on success, or an empty slice and error on failure.
Response is the primary container used for all responses from any API endpoint, containing the result and the error.
type Response struct { Error ResponseError `json:"error"` Result interface{} `json:"result"` }
ResponseError contains the error-related data that could be returned from the API if it's used incorrectly.
type ResponseError struct { Code int `json:"code"` Message string `json:"message"` }
WorkerChartData contains chart data entries from the /worker/{address}/{worker}/chart endpoint.
type WorkerChartData struct { Timestamp uint `json:"timestamp"` EffectiveHashrate uint `json:"effective_hashrate"` AverageEffectiveHashrate float64 `json:"average_effective_hashrate"` ReportedHashrate uint `json:"reported_hashrate"` ValidShares int `json:"valid_shares"` StaleShares int `json:"stale_shares"` InvalidShares int `json:"invalid_shares"` }
func WorkerGetChart(address string, worker string) ([]WorkerChartData, error)
WorkerGetChart takes a mining wallet address and worker name, and gets a list of chart data for that address. Returns a slice of MinerChartData instances and nil on success, or an empty slice and error on failure.
WorkerCurrentStats contains hashrate stats - used by multiple endpoints.
type WorkerCurrentStats struct { EffectiveHashrate uint `json:"effective_hashrate"` ReportedHashrate uint `json:"reported_hashrate"` }
func MinerGetCurrent(address string) (WorkerCurrentStats, error)
MinerGetCurrent takes a mining wallet address and gets the current effective and reported hashrate of that address. Returns a WorkerCurrentStats instance and nil on success, or an empty WorkerCurrentStats and error on failure.
func WorkerGetCurrent(address string, worker string) (WorkerCurrentStats, error)
WorkerGetCurrent takes a mining wallet address and worker name, and gets the current effective and reported hashrate of that address. Returns a WorkerCurrentStats instance and nil on success, or an empty WorkerCurrentStats and error on failure.
WorkerDailyStats contains daily hashrate and share stats from the /worker/{address}/{worker}/daily endpoint.
type WorkerDailyStats struct { EffectiveHashrate uint `json:"effective_hashrate"` InvalidShares int `json:"invalid_shares"` ReportedHashrate uint `json:"reported_hashrate"` StaleShares int `json:"stale_shares"` ValidShares int `json:"valid_shares"` }
func WorkerGetDaily(address string, worker string) (WorkerDailyStats, error)
WorkerGetDaily takes a mining wallet address and worker name, and gets the daily effective and reported hashrate of that address as well as it's amount of stale and valid shares over the last 24 hours. Returns a WorkerDailyStats instance and nil on success, an empty WorkerDailyStats and error on failure.
WorkerStats contains current and daily stats from the /worker/{address}/{worker}/stats endpoint.
type WorkerStats struct { Current WorkerCurrentStats `json:"current"` Daily WorkerDailyStats `json:"daily"` }
func WorkerGetStats(address string, worker string) (WorkerStats, error)
WorkerGetStats takes a mining wallet address and worker name, and gets the current and daily stats of that worker. Returns a WorkerStats instance and nil on success, or an empty WorkerStats instance and error on failure.


Library Modelica.Fluid is a free Modelica package providing components for 1-dimensional thermo-fluid flow in networks of vessels, pipes, fluid machines, valves and fittings. A unique feature is that the component equations and the media models as well as pressure loss and heat transfer correlations are decoupled from each other. All components are implemented such that they can be used for media from the Modelica.Media library. This means especially that an incompressible or compressible medium, a single or a multiple substance medium with one or more phases might be used.
In the next figure, several features of the library are demonstrated with a simple heating system with a closed flow cycle. By just changing one configuration parameter in the system object the equations are changed between steady-state and dynamic simulation with fixed or steady-state initial conditions.
With respect to previous versions, the design of the connectors has been changed in a non-backward compatible way, using the recently developed concept of stream connectors that results in much more reliable simulations (see also Stream-Connectors-Overview-Rationale.pdf). This extension was included in Modelica 3.1.
The following parts are useful, when newly starting with this library:
Copyright © 2002-2019, Modelica Association and contributors
| Name | Description |
|---|---|
| UsersGuide | User's Guide |
| Examples | Demonstration of the usage of the library |
| System | System properties and default values (ambient, flow direction, initialization) |
| Vessels | Devices for storing fluid |
| Pipes | Devices for conveying fluid |
| Machines | Devices for converting between energy held in a fluid and mechanical energy |
| Valves | Components for the regulation and control of fluid flow |
| Fittings | Adaptors for connections of fluid components and the regulation of fluid flow |
| Sources | Define fixed or prescribed boundary conditions |
| Sensors | Ideal sensor components to extract signals from a fluid connector |
| Interfaces | Interfaces for steady state and unsteady, mixed-phase, multi-substance, incompressible and compressible flow |
| Types | Common types for fluid models |
| Dissipation | Functions for convective heat transfer and pressure loss characteristics |
| Utilities | Utility models to construct fluid components (should not be used directly) |
| Icons |


--- title: ***sidis*** : ***si***mple ***d***ata ***i***nterface**s** keywords: fastai sidebar: home_sidebar summary: "is a Python module that aims to reduce common programming tasks to a single line of code, such as typecasting and data conversion, sorting and mapping, accessing and assigning values through loops, *etc*. The name is a tribute to the early American polymath, William James Sidis. Documentation can be found on the respective pages in the docs website at https://noeloikeau.github.io/sidis/. Here we give a brief overview of some of the main utilities." description: "is a Python module that aims to reduce common programming tasks to a single line of code, such as typecasting and data conversion, sorting and mapping, accessing and assigning values through loops, *etc*. The name is a tribute to the early American polymath, William James Sidis. Documentation can be found on the respective pages in the docs website at https://noeloikeau.github.io/sidis/. Here we give a brief overview of some of the main utilities." nb_path: "index.ipynb" ---
pip install sidis
import sidis
from sidis import *
Sidis supports extensible typecasting between iterables and non-iterables, letting you do intuitive conversions such as:
cast(0,list)
cast([0.9,1.1],int)
or define your own rules:
mycast = Caster()
mycast[list][float] = lambda t: sum(t)
mycast([0.9,1.1],float)
Sidis lets you sort python objects by the result of maps over those objects, and provides convenient conversion functions.
from sidis import sort, convert
Convert the elements of a list to binary arrays, and sort by the length of the array:
sort([0,10,3,5],by=convert,key=lambda t:len(t[-1]))
from sidis import pipe #like functools.partial, but also allows for typecasting of input and output data
Now let's convert to hex:
sort([0.9,10.5,3.1,5.5],by=pipe(convert,to=hex,otype=int)) #convert the elements `otype` into integers, then hex
a=[1]
get(a,0) #get 0th level or attribute of a
[give(a,0,a[0]+1) for i in range(10)] #and can assign arbitrary objects without writing entire loops!
a
and can apply this level of control to more complex datastructures:
import networkx as nx
g=nx.DiGraph() #create a ring with a loop, 0->1->2->0->0
g.add_edges_from([(0,1),(1,2),(2,0)])
g.add_edges_from([(0,0)])
g.in_degree()
from sidis import get
get(g,'in_degree',0) #get in-degree of node 0
and use this to sort with more abstract methods:
sort(g.nodes,by=g.in_degree)
sort(g.nodes,by=g.edges,key=lambda t:len(list(t[-1])))
or even give attributes to objects:
from sidis import give
give(g,'nodes',0,newattr='for fun')
g.nodes[0]['newattr']
[give(g,'edges',e,weight=np.random.rand(1)) for e in g.edges]
sort(g.edges,'weight')
sidis also extends mapping using maps
, which lets you pass in an object and a series of functions and evaluate those functions independently or sequentially over the input to the desired depth:
f1=lambda t:t
f2=lambda t:t+1
f3=lambda t:t+2
maps(0,f1,f2,f3) #apply them individually
maps(0,f1,f2,f3,depth=-1) #apply them sequentially
maps([0,1],f1,f2,f3,depth=1) #apply f1 to 0, then return f2(f1(0)) and f2(f1(0)), then repeat for 1
from sidis import depth,flatten,unflatten,fill,Template,RNG
depth([[0]])
depth({'a':0,'b':{'c':1,'d':3}})
flatten({'a':0,'b':{'c':1,'d':3}})
unflatten({'a': 0, 'b,c': 1, 'b,d': 3})
fill([[1],[2,3]],fillwith=1000,mask=False)
Template('''
fill out your _name
and provide {0} ZIP _iter, lambda t: 'embedded iterable functions!'
''',_name='name and information',_iter=range(1))
rng=RNG(0) #globally stable
rng.random(0,1,shape=(2,2))


Fit Elastic Net, Lasso, and Ridge regression and do cross-validation in a fast way. We build the algorithm based on Least Angle Regression by Bradley Efron, Trevor Hastie, Iain Johnstone, etc. (2004)(<doi:10.1214/009053604000000067 >) and some algorithms like Givens rotation and Forward/Back Substitution. In this way, many matrices to be computed are retained as triangular matrices which can eventually speed up the computation. The fitting algorithm for Elastic Net is written in C++ using Armadillo linear algebra library.
| Version: | 1.1.2 |
| Depends: | R (≥ 3.1.0) |
| Imports: | Rcpp (≥ 0.12.16) |
| LinkingTo: | Rcpp, RcppArmadillo |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-08-11 |
| Author: | Jingyi Ma [aut], Qiuhong Lai [ctb], Linyu Zuo [ctb, cre], Yi Yang [ctb], Meng Su [ctb], Zhen Yu [ctb], Gege Gao [ctb], Xiao Liu [ctb], Xueni Ruan [ctb], Xinyuan Yang [ctb], Yu Bai [ctb], Zhijun Liao [ctb] |
| Maintainer: | Linyu Zuo <zuozhe5959 at gmail.com> |
| BugReports: | https://github.com/CUFESAM/Elastic-Net/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://github.com/CUFESAM/Elastic-Net |
| NeedsCompilation: | yes |
| CRAN checks: | fasterElasticNet results |
| Reference manual: | fasterElasticNet.pdf |
| Package source: | fasterElasticNet_1.1.2.tar.gz |
| Windows binaries: | r-devel: fasterElasticNet_1.1.2.zip, r-release: fasterElasticNet_1.1.2.zip, r-oldrel: fasterElasticNet_1.1.2.zip |
| OS X binaries: | r-release: fasterElasticNet_1.1.2.tgz, r-oldrel: fasterElasticNet_1.1.2.tgz |
Please use the canonical form https://CRAN.R-project.org/package=fasterElasticNet to link to this page.


This table shows every instruction available to programs on the computer, as well as a small description of their functionalities. An "x" in third column indicates that the instruction uses an argument.
RAM[x] denotes the value at memory location x. A and B correspond to the values of the A and B registers, and ACC stands for the accumulator register.
| 0 | 0000 0000 | HALT | Stop the program from running. | |
| 0000 0001 | LDA | x | Load RAM[x] into ACC. | |
| 0000 0010 | STA | x | Store ACC in RAM[x]. | |
| 0000 0011 | OUT | Show ACC on the output display. | ||
| 4 | 0000 0100 | NO-OP | Do absolutely nothing. | |
| 0000 0101 | MEMREFLD | x | Load RAM[RAM[x]] into ACC. | |
| 0000 0110 | A->B | Copy the value of A to B. | ||
| 0000 0111 | A->ACC | Copy the value of A to ACC. | ||
| 8 | 0000 1000 | AREFLD | Load RAM[A] into ACC. | |
| 0000 1001 | B->A | Copy the value of B to A. | ||
| 0000 1010 | BREFLD | Load RAM[B] into ACC. | ||
| 0000 1011 | B->ACC | Copy the value of B to ACC. | ||
| 12 | 0000 1100 | MEMREFST | x | Store ACC in RAM[RAM[x]]. |
| 0000 1101 | ACC->A | Copy the value of ACC to A. | ||
| 0000 1110 | ACC->B | Copy the value of ACC to B. | ||
| 0000 1111 | AREFST | Store ACC in RAM[A]. | ||
| 16 | 0001 0000 | ADDR | x | Add RAM[x] to ACC. |
| 0001 0001 | ADDA | Add A to ACC. | ||
| 0001 0010 | ADDB | Add B to ACC. | ||
| 0001 0011 | BREFST | Store ACC in RAM[B]. | ||
| 20 | 0001 0100 | SUBR | x | Subtract RAM[x] from ACC. |
| 0001 0101 | SUBA | Subtract A from ACC. | ||
| 0001 0110 | SUBB | Subtract B from ACC. | ||
| 0001 0111 | PAGE | x | Switch the active page to x. | |
| 24 | 0001 1000 | JMP | x | Jump to address x. |
| 0001 1001 | JZ | x | Jump to address x if ZERO is set. | |
| 0001 1010 | JC | x | Jump to address x if CARRY is set. | |
| 0001 1011 | PUSH | Push ACC to the top of the stack. | ||
| 28 | 0001 1100 | POP | Pop the top of the stack into ACC. | |
| 0001 1101 | CALL x | Call the function at address x. | ||
| 0001 1110 | RETURN | Return from the current function. |
Programs are either written in assembly language or machine code. The machine code, when placed in RAM, begins execution at memory address 0. Then, every instruction takes up two bytes: one for the opcode and one for the argument. If no argument is required for a particular instruction, anything can be used, but 0 is common.
Assembly also uses a very simple format. A typical assembly program might look like this:
LDA 50 Push two numbers, 1 and 2, to the stack.
PUSH
LDA 51
PUSH
LDA 52 Clear the accumulator.
POP 0 Then, pop and output the two numbers.
OUT 0 They should be displayed in reverse order.
POP
OUT
HALT
50 DATA 1
51 DATA 2
52 DATA 0
The first column is the address of the instruction or data. The second column is the mnemonic of the instruction to execute. The third column is the argument to that instruction. And, any text after the third column is considered a comment and ignored. Additionally, the first and third


Traits Are Closer To Abstract Classes
Table of Contents
Beginning
Traits are both similar and different from Interfaces and Abstract Classes. Like Interfaces, traits don't take arguments, but unlike interfaces and like Abstract Classes, traits can implement some methods and leave others abstract. Traits also support multiple inheritance and you can add them to objects that are created from Classes that don't extend them in their definition.
Middle
Abstract and Concrete Methods
Traits
trait Child {
def speak(): Unit = println("Never. I must be seen but not heard.")
def come_to_me(): Unit
}
This trait has a concrete method (speak
) and an abstract method come_to_me
.
Boy
If you don't implement the come_to_me
method then the next definition will be rejected by the compiler.
class Boy(name: String) extends Child {
def come_to_me(): Unit = println(s"I, $name, will be there at once.")
}
val boy = new Boy("Alphonse")
boy.speak()
boy.come_to_me()
Never. I must be seen but not heard. I, Alphonse, will be there at once.
A Girl
You can also implement the speak
method, but since it's concrete you need to override it instead of just implement it.
class Girl extends Child {
override def speak(): Unit = println("Whatever...")
def come_to_me(): Unit = println("As if.")
}
val girl = new Girl
girl.speak
girl.come_to_me
Whatever... As if.
A Werewolf
You can also add a trait to an existing class.
trait Tail {
def wag(): Unit = println("I'm quite happy.")
}
Now we can add it to a Boy object using with
(because it already extends
Child
).
val wolfboy = new Boy("Benji") with Tail
wolfboy.speak
wolfboy.come_to_me
wolfboy.wag
Never. I must be seen but not heard. I, Benji, will be there at once. I'm quite happy.
But There's Also An Abstract Class
Scala also provides an Abstract Class, this is to handle two cases:
- You want to define arguments to the constructor in the base class
- You want to call scala code from Java
One thing to note about traits is that they don't take arguments to the constructor so if you want to define some in the base class you need to use the abstract class
type instead of a trait. The trade-off is that Abstract Classes don't support multiple inheritance the way that traits do (so our wolfboy would need a separate abstract class since it has both Child and Tail traits), so you'll lose something if you choose to use them.
End
Being mostly a python programmer I'm not totally certain what Interfaces are for, but luckily, with traits, we can have the best of both Interfaces and Abstract Classes together.


Class OAuthClient
A client for OAuth.
Inheritance
System.Object
OAuthClient
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: DontPanic.TumblrSharp.OAuth
Assembly: DontPanic.TumblrSharp.dll
Syntax
public class OAuthClient
Remarks
This class can be used to authorize the application to access the user's account. If the user authorizes the app, an access token will be generated that can then be used to make OAuth method calls.
Constructors
| Name | Description |
|---|---|
| OAuthClient(IHmacSha1HashProvider, String, String) | Initializes a new instance of the DontPanic.TumblrSharp.OAuth client class. |
Methods
| Name | Description |
|---|---|
| GetAccessTokenAsync(Token, String) | Gets the authorized access token that can be used to make OAuth calls. |
| GetAuthorizeUrl(Token) | Builds the url that is required to connect to the server, where the server will authenticate the user and ask for authorization. |
| GetRequestTokenAsync(String) | Asynchronously gets a request token. |
| PerformXAuthAsync(String, String) | Asynchronously performs XAuth. |


My journey into tech started with a career in law specializing in intellectual property. As I explored the different facets of copyright, trademark and patents, I realized that my facisnation with technology was deep-rooted. I wanted to learn how to become one of the developers I admired so well. That curiosity then opened a door that could never be shut. When I learned how to build my first website, I realized I found something that gave me the freedom & versatility I was looking for in my work. Now I've made a full switch to front-end development with my company SweetSpot.Tech, where I can use my organization skills and eye for detail to write clean, elegant code.
Get Started!The front-end focus: HTML5, CSS3, JavaScript.
Working to meet your needs as quickly as possible.
We update dependencies to keep things fresh.
You have to make your websites with love these days!
Ready to start your next project with us? That's great! Fill out our form, give us a ring or send us an email and we will get back to you as soon as possible!
(646) 694-8620


Mushrooms & P. harmala (Syrian Rue)
I actually have two separate trip reports for this trip. One is a hand written report, the other is a post I made to the usenet group alt.drugs the next day.
----- The Handwritten Report -----
I chose today for this experiment, mainly for symbolic reasons. Being Easter, the celebration of Jesus' resurrection, it seemed an appropriate day to try a combination that could lead to a personal resurrection experience. I began with a baseline consciousness, not habing smoked pot all day and eating only lightly.
I ground up approximately 2 grams of harmala seeds at midnight (so I guess its the day after Easter, technically). I ate them at 12:20AM, they tasted quite disgusting. At 1AM, I ate about a gram of real strong shrooms.
By 1:30, I'm beginning to feel some mild psychedelic effect. I put on Traffic's 'Mr. Fantasy' album, and the Spanish guitar in 'The Dealer' seemed to take on some ethereal dimension. I feel the trip gradually intensify.
It's basically like a regular psilocybin trip, but there is an added, not quite definable difference, qualitatively and quantitatively. More relaxed, mellow, and earthy feeling. The harmala seems to open a different door in the mind. It's really not describable, even in relation to a regular psilocybin trip. It's just not the same. Even on a physical level, it doesn't feel quite the same. I feel cold despite the fact that its around 70 degrees outside... and I feel somehow taller, like my torso is several inches too long. I like the difference harmala makes. Enough writing.
Follow-Up:
A very unique trip. Much longer and more intense than a gram of shrooms would normally be. Different too - more relaxed and my thoughts were more humanly oriented rather than it being an intense cosmic journey through the inner mind like shrooms or acid usually produce. I liked it...very enlightening.
----- The Internet Post -----
Actually, its funny that I just saw Ted's post....as I was just about to make a post of my own concerning a harmala + psilocybin trip I took last night.
 I waited about 30-45 minutes for them to digest (and to see if i would throw up) before eating my shrooms. I felt a slight queasiness in my stomach, but not desire to yack, so I ate the shrooms (about 30-45 mins after the harmala, like I said).
After eating 1.5g of shrooms (from a previous trip out of the same bag, i knew them to be quite potent shrooms), the trip began about 20 minutes after taking them. It came on more gradually than a pure shroom trip. The trip itself was different than just plain shrooms. Its not really a describably difference...it seems to open a different (but similar) door in the mind. Physically, it felt different to. For example, although it was about 70 degrees outside, it felt to be about 40 degrees.... When I walked, I felt somewhat drunk - I wasn't stumbling, my coordination seemed fine...but there was that same sense of vertigo that you feel when walking around drunk.
Hallucinations were quite different. I remember looking at Venus and not being able to decide if it was a star or a plane, because it kept moving. Inside, colors seemed different, but not in the intense way caused by plain shrooms - they seemed somewhat eartier, and I found myself attracted to browns, greys, black, and dark reds - quite different from the attraction to bright colors caused by pure psilocybin.
As far as MAO inhibition... I was drinking cocacola all night (caffeine) and ate a cheeseburger at mcdonalds (cheese & meat), but felt no side effects...however, I do not recommend eating alot of no-no foods, because although shall quantities can be OK, chowing down on cheeses and alcohol or yeast or meats could cause problems. Keep it simple, if you decide to trip with harmala. (You probably wont feel very hungry anyways).
About halfway through the trip, I ate another gram of harmala, to prolong the trip. It did seem to work...as the trip lasted about 6 hours total (other trips from the same bag of shrooms, but with no harmala, lasted only 3-4 hours). The come-down was very very slow, and the peak was quite long as well.
My thought-patterns were also different than they usually are while on shrooms or LSD. But like I said, the differences are very hard to describe...they are subtle, but they add up to produce a quite distinct trip.
For one, it seemed like a less 'freaky' trip. It was very intense, but there was no sense of panic at all. I would probably feel OK going out to dinner with my parents while being on this combination - the harmala really seemed to add a calming aspect to the trip. It also seemed to be less personal of a trip. Rather than a dive into the subconscious mind (as with LSD/shrooms), it seemed to be a dive into what Jung called the super-conscious Mind - the mind of humanity as a whole. Alot of the things I usually end up thinking of while tripping never crossed my mind...and alot of things I have never thought about while tripping were quite prominent in my mind last night.
Harmala is quite legal, and quite easy to get through various mail-order botanical companies...I highly recommend anyone who uses shrooms or DMT try mixing some harmala with the shrooms/DMT. It's incredible - like tripping for the first time. And I like the doors that it opened in my mind. I feel like this trip did a lot of good for me.
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.


Wikipedia
Wikipedia 2001
Wikipedia in the early 2000s was mostly used for finding definitions. It wasn't always like that. Although, people only visited the sites to find any quick information about something. Similar to the Search Engines, there was not a lot you could search back then.
Wikipedia has always been used. Although, since there are so many website specially
Search Engine website that you can search anything, Wikipedia has lost many visitors. I used
to use it back when I was in high school. Now we can do anything thru Google. Although, Wikipedia
for me is still great for definitions and information about places and people.
Their
website homepage looks similar to any other website back in the 90s or early 2000s. Having a lot
of links centered in the homepage was popular. Although, now it tends to be a bit too much.
Wikipedia 2020
Encyclopedias today are on another level like many other websites and industries. More things start to come to the internet which means more information is gathered and used. We used to go to the libraries to read a book. Now we can go to an online Encyclopedia like Wikipedia to read a short summary of anything and you immediately will know about it without buying and just by simply reading for a couple of minutes.
Their website is better looking. Similar to that of Google. It is simple with a limited amount of links. The only things we do is type anything we want to know about and in a matter of seconds we can read about it without having to rent, buy or read a whole book.


Be creative in naming your tour or activity to make it stand out. Example: A Trek through mountains of shepherds
Name of the tour is required
Enter main location or destination for this tour. If this is multi day tour with various destinations, you can enter main regional destination like a state or even country as main destination.
Destination is required
Describe in few clear sentences what makes this tour unique , what experiences could guest expect and why should it be taken.
Description of the tour is required
You can tag this tour like 'Hiking', 'Cycling' etc. for better understading of what you are offering. You can select from the given option or type any tag and enter.
Start location of this tour
End location of this tour
Grade this tour on level of physical fitness required
to
You can create multiple pricing options if needed. For example you can add multiple prices for different sizes of groups or have just a single price for everyone. You can also create custom pricing labels and prices.
This is used for display purpose. Use the lowest price.
Addon is extra service or item that can be offered to guest for additional price . For example, a private tent on a trekking tour, separate room,or insurance etc.
Name of Addon
Approx value
How to apply this price
Mention cancellation and refund policy that you will apply on this tour. This is shown on tour details page.
Duration of the tour is required
You can make tours available as fixed dated tours with fixed schedule for departure or open dated where guest can chose date of departure while booking. Fixed date tours are often group tours whereas open date tours are used for personalized or private tours.
Fixed Departure
If guest need to select a timeslot during booking.
You can select the months when this tour is not available. Guest can only create bookings in months that are not marked as unavailable
Starts: {{vm.getDepartureDateOfSession(vm.fixedProductScheduleOld[$index].startDate)}} {{vm.fixedProductScheduleOld[$index].startTime}}
Until: {{vm.getDepartureDateOfSession(vm.fixedProductScheduleOld[$index].repeatTillDate)}}
Repeats: {{vm.fixedProductScheduleOld[$index].repeatBehavior}}
Capacity: {{!vm.fixedProductScheduleCapacitiesOld[$index].sessionSeatLimit ? '-' : vm.fixedProductScheduleCapacitiesOld[$index].sessionSeatLimit}}
Edit
Delete
Starts: {{vm.getDepartureDateOfSession(vm.fixedProductSchedule[$index].startDate)}} {{vm.fixedProductSchedule[$index].startTime}}
Until: {{vm.getDepartureDateOfSession(vm.fixedProductSchedule[$index].repeatTillDate)}}
Repeats: {{vm.fixedProductSchedule[$index].repeatBehavior}}
Capacity: {{!vm.fixedProductScheduleCapacities[$index].sessionSeatLimit ? '-' : vm.fixedProductScheduleCapacities[$index].sessionSeatLimit}}
Let Guests know what happens through the tour on each day. Be descriptive so that Guests know what to expect.
Day {{vm.dayCounter}}
Day
Click on Day to edit the Day number
Headline to sum up the day's activities to guest, E,g if this is trekking tour, headline of day can be â€œWalking 10 km from base village to camp 1
Describe in detail what happens through this day
You can describe things to carry, clothes to wear, things to know , rules, Dos and Donâ€™t etc.
Describe what is included in tour and its price. For example meals , accommodations, guide etc.
Describe what is excluded from tour and its price. For example Visa, flights, insurance etc.
Make Tour Listing appealing by adding images. First image is used as cover picture for listing.
Pictures speak thousand words .Guests are incited to travel by images and visuals. Use high definition photos of the destination
Name is used only internally for your reference and is not shown to guests while booking.
You can limit capacity for each batch or run of fixed date tour. Or make it unlimited if there is no capacity limit.
This tour has existing sessions, do you want to apply price changing to these sessions?
You have created new sessions of this tour with modified price specific to some sessions. Do you want to apply these pricing to those new sessions?
If you leave this page, all unsaved changes will be lost. Are you sure you want to leave this page?
This is the repeative session. To get the details of the required date, please go to sessions tab.


Feel free to run the text analyzer
to get your sentiment polarity today!
Where does this come from?
We can currently use two different sentiment analysis
techniques which are based from different styles of corpora and lexical resources.
Pattern Library uses a dictionary-based approach with a few heuristics while
Naive Bayes approach is based on calculating probability trained from real movie ratings.


| 003:091 Khan | : |
Verily, those who disbelieved, and died while they were disbelievers, the (whole) earth full of gold will not be accepted from anyone of them even if they offered it as a ransom. For them is a painful torment and they will have no helpers. |
| 003:091 Maulana | : |
Those who disbelieve and die while they are disbelievers, the earth full of gold will not be accepted from one of them, though he should offer it as ransom. These it is for whom is a painful chastisement, and they shall have no helpers. |
| 003:091 Pickthal | : |
Lo! those who disbelieve, and die in disbelief, the (whole) earth full of gold would not be accepted from such an one if it were offered as a ransom (for his soul).  They have incurred painful retribution; they will have no helpers. |
| 003:091 Sarwar | : |
From those who have rejected the truth and died in disbelief, no ransom will be accepted even though they may pay a whole earth of gold. They will suffer a painful torment and no one will help them. |
| 003:091 Shakir | : |
Surely, those who disbelieve and die while they are unbelievers, the earth full of gold shall not be accepted from one of them, though he should offer to ransom himself with it, these it is who shall have a painful chastisement, and they shall have no helpers. |
| 003:091 Sherali | : |
As for those who have disbelieved, and die while they are disbelievers, there shall not be accepted from anyone of them even the earth-full of gold though he offer it as ransom. It is these for whom shall be a grievous punishment, and they shall have no helpers. |
| 003:091 Yusufali | : |
As to those who reject Faith, and die rejecting,- never would be accepted from any such as much gold as the earth contains, though they should offer it for ransom. For such is (in store) a penalty grievous, and they will find no helpers. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > توحيد الله تعالي > الوعيد Pillars of Islam> Islamic> Oneness of Allah> The Threat أركان الإسلام > التوحيد > الكافرون > صفات الكفار Pillars of Islam> Islamic> The Disbelievers> The Characteristics of the Disbelievers
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


*** This page isn't here right now. ***
What can I say... I'm a student!
This is an additional portion of my website that I'm adding.
Don't judge me on this page alone...
Go
back
to where you came from.


Festivals are not limited to a few fixed days in an year. When work is fun every day is a celebration. We do not provide work life balance. For us work is life. Life is work.
Come! Enjoy!


Stay warm from the cold
by John LawlessIf the cold weather is coating your car with frost that can only come off from scraping, imagine what it does to someone who doesn't have a home. Homeless shelters are usually packed full even during the warmer months, so when winter rolls around, space is very limited and hard to come by.
Turning Points Collaborative Society in Vernon runs three shelters around the city, and they are opening up some extra spots for the winter season.
"We are opening up a 20-bed winter shelter today to provide cover from the cold," says Randene Wejr, the co-executive director of the Society. "We expect the spaces to fill up very quickly."
For the Upper Room Mission, they provide other things for the homeless population.
"During cold snaps like these we offer things like blankets and winter boots, when we have them," says Naomi Rouck, the general manager at the Mission. "The community has really stepped up year after year to donate warm-clothing items for those who don't have the means to get them on their own."
Weather forecasts are showing temperatures steadily dropping below freezing at night starting on Sunday. During the day, temperatures will be at freezing or below for the foreseeable future starting Tuesday.


[gecode-users] Understanding cumulatives constraint
Roberto Pinto
librarama at gmail.com
Tue Jul 4 10:57:17 CEST 2006
On 7/4/06, Mikael Zayenz Lagerkvist <zayenz at gmail.com> wrote:
> On 7/3/06, Roberto Pinto <librarama at gmail.com> wrote:
> > I'm trying to compile a really basic example using the cumulatives
> > constraint, but I'm finding some problems that I hope you could help
> > me to solve.
>
> The problem with your example is very simple to solve, machines are
> indexed starting from 0 and not from 1. I've added some comments on
> some parts of your code below.
> > machine[i] = 1; ///all tasks are worked on machine 1
> should be: machine[i] = 0;
Ok, now it's clear. I didn't get that the indexes of the machines must
be sequential starting from 0. I thought that any kind of univoque id
fits the needs.
> Well, the actual solution one gets is
> 0:4, 4:8, 8:12, 12:16,
> This shows that a task may start and another task may begin at the same time.
We could also interpret this solution as "the first task is finished
at the beginning of the fourth day and the following task should start
immediatly after"
Thank you very much
Libra (Roberto)
> Cheers,
> Mikael
> --
> Mikael Zayenz Lagerkvist, http://www.ict.kth.se/~zayenz/
>
More information about the gecode-users
mailing list


Text area example
Simple text area:
Text area with left icon:
Text area with right icon:
Disabled text area:


Choose your plan to continue
choose plan


{% extends "navbar.html" %} {% block head %}
Welcome to wedge, the Wikipedia game.
Your number of edits (that wedge knows of): {{ len(get_edits(session.uid)) }}
Total number of edits (by wedge users): {{ len(get_edits()) }}
Your total score: {{ round(get_total_score(session.uid), 1) }}
Your average score for a single edit: {{ round(get_avg_score(session.uid), 1) }}
wedge makes Wikipedia editing more fun. It analyzes your edits and rates them by how constructive they are, and awards you points correspondingly. Track your progress by getting instant feedback on your edits, and rack up achievements as your points increase. So join today, and become an active and helpful contributor to Wikipedia while competing with other wedge users to be the most constructive!
| Username | Score |
|---|---|
| {{ i[0] }} | {{ round(i[1], 1) }} |


Raytheon awarded an $84.7M contract modification for Evolved Sea Sparrow
by Christen McCurdyNov. 20 (UPI) -- Raytheon Missile System in Tucson has been awarded an $84 million contract for support on the Evolved Sea Sparrow Missile Block 2's production requirements.
The contract, announced Tuesday by the Department of Defense, will allow Raytheon to procure the remaining materials in support of the ESSM fiscal year 2020 low rate initial production Lot 3 all up rounds and spares.
The Evolved Sea Sparrow Missile can be launched from surface ships to destroy threats that include high speed anti-ship cruise missiles, low velocity air threats, high-diving threats and surface-based targets.
The Navy will obligate the full value of the contract at the time of the award, which will not expire at the end of the current fiscal year.
The bulk of work on this project will be performed in Tucson, with other work executed at sites across North America, Europe and Australia.
This contract modification was not competitively procured, per a U.S. government contracts code clause exempting the government from awarding contracts competitively when the terms of an international agreement between the U.S. and a foreign government requires the use of non-competitive procedures.
(0) Leave a comment
upi.com/6960760
Latest Headlines
Defense News // 7 hours ago
Lincoln Carrier Strike Group finishes scheduled transit into Persian Gulf
Nov. 20 (UPI) -- The USS Lincoln Carrier Strike Group's trip through Strait of Hormuz and into the Persian Gulf Tuesday came amid increasing tensions in the Middle East, but officials say it was uneventful and planned ahead.
Defense News // 20 hours ago
U.S. begins production on combatant ship for Saudi Arabia
Nov. 19 (UPI) -- The ship, to be christened the HMS Saud, began construction last month in Marinette, Wisc., as part of a weapons partnership with the Kingdom of Saudi Arabia.
Defense News // 1 day ago
BAE nabs $104.7M for support on Navy, Coast Guard vessels
Nov. 19 (UPI) -- The Navy's contract with BAE Systems Technical makes funds available as needed to provide technical support for the Navy's DDG 51 guided-missile destroyers and multiple Coast Guard vessels.
Defense News // 1 day ago
Exporter: Russian foreign military sales on pace to hit $13.7B despite U.S. sanctions
Nov. 18 (UPI) -- Despite U.S. sanctions, Russian arms sales are on pace to match 2018's export revenue of about $13.7 billion, the head of Russia's defense export company said.
Defense News // 2 days ago
U.S. Army chooses FLIR's Kobra heavy robot vehicle
Nov. 18 (UPI) -- The U.S. Army announced it has chosen the Kobra robot made by FLIR Systems Inc. for the heavy version of its Common Robotic System.
Defense News // 2 days ago
Israel's Blue Flag exercises, a meeting of F-35 fighter planes, completed
Nov. 18 (UPI) -- Israel's Blue Flag exercises, involving five countries and fifth-generation fighter planes, ended on Monday at the Ovda air base in southern Israel.
Defense News // 2 days ago
HMS Prince of Wales, Britain's newest aircraft carrier, arrives in port after trials
Nov. 18 (UPI) -- The HMS Prince of Wales, Britain's newest aircraft carrier, arrived at its home port of Portsmouth, England, for the first time.
Defense News // 2 days ago
Lockheed Martin gets $3.3B contract for communications satellite work
Nov. 18 (UPI) -- Lockheed Martin Co. was awarded a $3.3 billion contract for orbital operations, logistics and support of three U.S. Air Force satellite systems.
Defense News // 3 days ago
U.S., South Korea postpone joint air exercises for diplomacy
BANKOK, Nov. 17 (UPI) -- South Korea and the United States put off their wintertime combined air exercises to support diplomacy with North Korea with U.S. Defense Secretary Mark Esper urging Pyongyang to reciprocate the goodwill by returning to nuclear talks.
Defense News // 4 days ago
Raytheon nabs $209.6M contract to upgrade parts on Aegis Weapon System
Nov. 15 (UPI) -- Raytheon has received a $209.6 million Navy contract to upgrade or replace national item identification numbers within two major subsystems of the Aegis Weapon System, which uses computers and radar to guide weapons to d


Learning from the field - Intelligence Gathering
|
archive
Enum tools cheat sheet
https://highon.coffee/blog/penetration-testing-tools-cheat-sheet/
RPC
https://www.computerhope.com/unix/urpcinfo.htm


{{ event.org | orgName }} presents {{ event.movie.main.title.international }} by {{ event.movie.main.directors | displayName }} Screening now Play
{{ event.title }} Meeting now Join the meeting Contact {{ event.organizedBy | displayName }} to provide a link for the meeting


--- title: regularSO3Grid sidebar: function_reference_sidebar permalink: regularSO3Grid.html folder: function_reference toc: false ---
regular grid in Euler orientation space
| cs | crystalSymmetry |
| ss | specimenSymmetry |
| SO3G | orientation |
| resolution | Euler angle resolution |
| sections | number of sections |
| phi1 | Phi | phi2 | sections along which variable |


1. I am confident about feeding my child.
2. I can settle my child
3. I am confident about helping my child to establish a good sleep routine
4. I know what to do when my child cries.
5. I understand what my child is trying to tell me.
6. I can soothe/calm my child when he/she is distressed.
7. I am confident about playing with my child
8. If my child is unwell I am confident about handling this
9. I feel sure that me and my partner can support each other when needed
10. I am confident that my child is doing well
11. I can make decisions about the care of my child
12. Being a parent is very stressful for me
13. I feel I am doing a good job as a parent
14. Other people think I am doing a good job as a parent
15. I feel that people will be there for me when I need support


In this Activity, you can :
Read below to learn more.
The advantage of a static inner class (exactly the same as a proper public class in a different file) is that the AsyncTask doesn't hold any invisible reference to the activity. Instead, the AsyncTask will be given an explicit reference to the current Activity. Thus, we have more control over this reference.
In this activity, we used a workaround to tie the Activity life cycle to the same instance of the AsyncTask. If you start an AsyncTask, rotate the device and don't start any new AsyncTask, the Activity will be destroyed and a new instance will be created. As before, the AsyncTask will continue its life until it completes. But we re-link the new instance of the Activity to the AsyncTask.
After a new instance of the Activity is created, its UI will be updated by the formerly created AsyncTask.
The advantage of this technique is that an AsyncTask instance holds a reference to the most recent Activity instance. It doesn't prevent garbage collection of the Activity instances that are not displayed anymore.
The technique proposed here uses the method : getLastCustomNonConfigurationInstance. This method is only available in support classes. In the "normal" Android SDK, you would use the method getLastNonConfigurationInstance but this method is deprecated as it used internally by the Loader Framework of Android and is not available in the support library class FragmentActivity. This method is not a general solution, as it depends on the Activity class you use (with support or not).
As we said, to limit the risk of memory leak, we propose an implementation so that the same AsyncTask instance can hold a reference only to one single instance of the outer Activity. This is better than the basic AsyncTask example.
Nevertheless, this produces a memory leak if you start several AsyncTasks, not as important as the previous demo Activity but still a memory leak.
When AsyncTasks are executed, they are passed to an ExecutorService (that used to be single-threaded prior to DONUT release, multi-threaded between DONUT and HONEYCOMB, and back to single-threaded after HONEYCOMB included). This means that the ExecutorService is holding a reference on all your AsyncTask instances. As in every AsyncTask we hold a reference to an Activity, the Activity can't be garbage collected as long as the AsyncTask is still queued by the ExecutorService. This causes a memory leak.
To simulate the problem, start an AsyncTask, rotate the device, and repeat this process. After 30-40 times, you will get an OutOfMemoryException. It takes more time as some AsyncTask terminate their live and allow garbage collection of some activities, but they can't cope if you start AsyncTasks at a rapid pace.


Thing Happened! Much important!
A thing has happened! In our city, an event happened like no other and people have feelings about it. When asked about the event, Legendary Darth Meow II, age 1 year, said, "Meow. I'm a cat!"
Other people had other feelings. When asked for comment, Mayor McCheese said, "I just can't believe this would happen in our city! Of all places, our city! And this event!"
Our news team will update this story as we learn more.


Designed to function in the depths of the ocean, the diving watch is characterised by its rugged construction, luminous dials and hands, and unidirectional bezel.
This device sits on top of the case, and can be used to tell the wearer how much immersion time he has left. Most diving watches owe their design cues to the 1953 Rolex Submariner, the first watch to work at a depth of 100m.

The most jewellery-like of timepieces, a dress watch tends to be understated – think Roman numerals, simple face and a lack of adornments.
Usually attached to a leather strap, the ideal dress watch is super-thin so it can rest unnoticed under the wearer’s cuff until he needs it.
Also, as dress watches don’t perform any specific function bar telling the time, they’re also the most likely to be made from a precious metal.


Django-ctt is Django app, which help you store hierarchical data in database. This is very simple, friendly and reusable app.
To install django-ctt clone repository:
https://github.com/HiddenData/django-ctt.git
Next run:
python setup.py install
In your models.py file put:
import ctt
from ctt.models import CTTModel
Your model must inherit CTTModel.
You must register your model (models.py):
ctt.register(your_model_name)
Finally run
python manage.py syncdb
to create necessary tables.
Now you have extra methods in your model objects e.g. get_children() and get_ancestors(). Your register model has 2 extra fields: parent and level.
class Node(CTTModel):
name = models.CharField(max_length=255)
node = Node.objects.filter(id=1)
print(node.get_children())


BRIGHTON ROCK (director: John Boulting; screenwriters: from the novel Brighton Rock by Graham Greene/Graham Greene/Terence Rattigan; cinematographer: Harry Waxman; cast: Richard Attenborough (Pinkie Brown), William Hartnell (Dallow), Carol Marsh (Rose Brown), Hermione Baddeley (Ida Arnold), Wylie Watson (Spicer), Harcourt Williams (Prewitt),Virginia Winter (Judy), Frank (Reginald Purdell), Charles Goldner (Colleoni), George Carney (Phil Corkey), Nigel Stock (Cubitt), Alan Wheatley (Kolley Kibber), Harry Ross (Brewer), Victoria Winter (Judy), 1947-GB)
Reviewed by Dennis Schwartz
Possibly the best British noir film ever made, a film adapted from the Graham Greene novel. It is a vicious story of a sadistic teenage baby-faced gangster, Pinkie Brown (Richard Attenborough), who works a protection racket around the racecourses in the seaside resort of Brighton. The tourist bureau was so afraid that this gloomy look at Brighton would scare off tourists, that the film opens with a "crawl" telling what a safe and jolly playground community Brighton now is.
At the lair of the 17-year-old Pinkie's mob, are his older henchmen, who tell him that an unimportant journalist Kolley Kibber 'alias' Fred Hale (Wheatley) is visiting Brighton. He gets his picture in the newspaper and as the newspaper article mentions that his visit has to do with him passing out cards in hidden spots that if found the finder will get paid for it. Kollee inadvertently caused the death of a former Brighton gang leader, Kite - the only person for whom Pinkie has ever felt affection. Pinkie decides to go after him with his mob and meets up with him in one of the bars, where he puts a fright on him.
Kolley is trying to flee back to London after that incident but sees that he is being followed by Pinkie's gang. In the bar, for his protection, he tries to get acquainted with a bosomy, beer-guzzling, loud-laughing singer, Ida Arnold (Hermione Baddeley), who has a short engagement with one of the shows performing on the boardwalk. She sees that Fred is scared out of his wits and that he wants her to not leave his side. When he meets her later on at the boardwalk and pays for some seats to get some sun, he begs her to stay with him, he even gives the woman who is short on cash some money to buy tickets for the train so that they can go home together. When she leaves him for a moment, he sees Pinkie's men coming for him and rushes into "The Ghost Train" ride to elude his pursuers. Inside the tunnel he recognizes that his fellow passenger is Pinkie. His body is washed up on the beach some time later and the police rule the death as a heart attack. But Pinkie is afraid that one of his men, Spicer (Wylie Watson), while trying to help him, took Kibber's cards and placed one of them under a tablecloth in a restaurant, and this might come back to haunt him if the police later on believe they are dealing with a murder and a witness comes forward to recognize who put the card there. The cunning youngster wants absolutely no witnesses to his crime.
Meanwhile Ida is convinced that Fred was killed. She performs some kind of magical ritual which spells out Fred's death as a possible suicide and of Fred calling out for help, with her believing in this superstitious practice over the conventional disciplines of knowledge: religion and science. She goes to the police asking them to investigate this death as a murder case, but they tell her that there is no evidence of that. She tells them, I will go after the killer because "I believe in right and wrong."
Ida becomes an allegorical figure in the film, a do-gooder, who represents the popular mass culture, someone Graham Greene had no love for. In fact, he is more sympathetic to the killer in the film, no matter that he is a certifiable maniac.While Pinkie is a psychopath, who rejects all goodness in people and enjoys inflicting pain on others, being a cross between a bully and a cringing child afraid of the dark, at least he stands for something real- which is, evil. In his twisted way, he is a Catholic, hating atheists, because the church's strict dogmas are more real to him than Ida's banal humanism.
Pinkie returns to the restaurant and strikes up a relationship with the inexperienced 17-year-old waitress, Rose (Marsh), who is taken with the bravado of Pinkie and falls in love with him, not caring how rotten he is, as long as he loves her.
Pinkie is overmatched by the big-time gangster in Brighton, Colleoni (Goldner), who tells him there isn't room for the two of them in Brighton, warning Pinkie to stay away from his clients. Pinkie sees this as an opportunity to knock off Spicer, as he warns the Colleoni gang about Spicer interfering with their operation. At the racetrack, they slice Spicer up, but also get Pinkie slashed in the face. Not realizing that Spicer escaped, he is told by his drunken, washed-up, crooked lawyer for the gang, Prewitt (Harcourt), that Spicer is here to see him. In a rage, Pinkie tosses old man Spicer over the banister to his death, and gets Prewitt to swear that it was an accident.
Pinkie is frightened about being uncovered, even though he can't stand Rose, he decides to have the crooked lawyer fix it so that the underaged couple could be legally married in a civil ceremony, therefore she can no longer be a witness against him. Rose, being a Catholic, wanted a church wedding and is late to the wedding ceremony having gone to church to get sanctified, as if only the church can make her soul clean.
Ida is now convinced that Rose is in danger from Pinkie, and states, "I've got to save her, even if she doesn't want to be saved." The film turns into a suspension between melodrama and farce, as Ida becomes the amateur detective, visiting Prewitt's chaotic office, where from next door there is heard loud music drowning out her conversation with him, as she futilely tries to convince him to turn Pinkie in for the two murders. This very serious part of the film was also extremely comical, as the lawyer whose only humanity he has left is from quoting Shakespeare and the vulgar bar singer, who is trying to save the world from an evil she can't even comprehend as also lying within herself, try to communicate with each other. She is blind to what goes for good taste and is consumed by what is popularly believed and assumed to be right. He is too far gone, to do anything about what is right or wrong in the world.
On the boardwalk together, Rose wants an affirmation from Pinkie that he loves her, and seeing a voice message booth, urges Pinkie to make a recording so that she will always have his voice on record. When he goes into the booth, he shuts her out and starts to record: "What you want me to say is I love you." Instead, he goes into a diatribe telling her how she disgusts him and how much he hates her. She holds onto this as a wedding present, hoping to get a chance to listen to it even though she doesn't have a gramophone.
When Ida tracks down where Rose is honeymooning, she tells the young bride that her husband killed two people. Rose only cares that he loves her, and tells Ida that people change and repent. Ida shoots back that people never change-"I haven't."
The persistent Ida runs into Pinkie's crony Dallow (Hartnell) in the boardwalk bar; he listens to what she says and he helps her only because he warned Pinkie that he wants no harm to come to Rose. When he realizes that Pinkie, in the driving rain, has taken Rose down to the end of the pier and plans to kill her, he has the cops called and gives chase after Pinkie himself. They catch hold of Pinkie just as he has talked Rose into a suicide pact, with her to be taking her life first, even as she believes suicide is a sin, she demonstrates that she is willing to do anything for the one she loves. But when the police show up she throws the gun in the water and Dallow comes after Pinkie, who stumbles to his death by cowardly falling off the pier onto the ocean.
The last scene in the film is one of those memorable ones that just can't be easily forgotten. It has a raw power in it that a noir film commands when the dark side of human nature unfolds so suddenly onscreen, even if the scene was changed from the one in Greene's novel. After Pinkie's demise, the black waters by the pier dissolve and the next shot is in a brightly lit room in a Catholic home for pregnant teens. A nun wearing lipstick is seen comforting the pregnant Rose, who feels she should have died with her husband. She is crying out, "I don't want absolution!" Further saying, "I got his voice-I got proof of his love." The nun, looking at the phonograph by the girl's side, says in a grave voice, "There is always hope, it is in the air we breath. We have to hope and pray. Love can bring about salvation." When Rose puts the record on, we have already heard what Pinkie said and wait to see her reaction, but when she plays the record: "What you want me to say is I love you," the record gets stuck and plays that over and over, until the final shot of the film is of the crucifix on the wall, with Rose, seemingly, elated to have her love reaffirmed by such a positive proof. This cynical ending is perfect. The filmmakers thought it could be construed as possibly a happy ending for the filmgoers who thrive on a happy ending overcoming the general despair of the film. But the film was a failure at the box office.
The only weakness in the film was the awkward pacing of the story and the over inflated role of Hermione Baddeley. It was a brassy portrayal that detracted from the noir mood of the film. Richard Attenborough's manic performace as a psychopathic, androgynous character, who had violent mood swings, was pulsatingly brilliant. His sadomasochistic relationship with the naive Rose, coupled with dark shots of the seamy side of Brighton, plus the expressionistic studio shots, gave the film a raw energy that makes it more powerful than the usual gangster film. If you have any kind of feel for noir films, this one is in the don't miss category.
REVIEWED ON 1/17/2000 GRADE: A-
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


[§231-10.8] Tax clearance fees. The department may charge a fee of $20 for each tax clearance application submitted and $5 for each certified copy of a tax clearance. [L 2012, c 180, §2]


Flaredrop
{{ message }}
{{ name }}
: {{ value }}
XRP address:
XRP secret:
Eth public key (address starting with 0x...):
Message (will be created based on the field above):
Signed TX:


GOOD BURGER A film review by Steve Rhodes Copyright 1997 Steve Rhodes
RATING (0 TO ****): ** 1/2
For those of you who thought GEORGE OF THE JUNGLE was too subtle and who found DUMB & DUMBER too intellectual, don't give up -- Nickelodeon has just the movie for you, GOOD BURGER. With the two stars from Nickelodeon's TV series "All That," the film provokes constant laughter. Although the adults may be somewhat surprised, and perhaps a bit embarrassed, at how hard they laugh at the story's ridiculous humor, the six to eleven year old target audience will have no such reservations.
"Welcome to the Good Burger, home of the Good Burger, can I take your order?" chirps the extremely likable guy with the "I'm Ed" button. Ed, whose IQ might be too low to measure, is played with a sweet charisma by Kel Mitchell. The other half of the "All That" series, Kenan Thompson, plays the somewhat brighter kid named Dexter. Whereas Ed is so dedicated to his fast-food position that he sleeps and even showers in his Good Burger pen stripe uniform and hat, Dexter is just there to make enough money to pay off the damages he caused to the car of his teacher, Mr. Wheat.
Sinbad clearly enjoys playing the minor role of Mr. Wheat.
Ed's stupidity borders on legendary status. ("If you ask me, the guy's a few tacos short of a combination plate," is how one character so aptly puts it.) When a customer complains that the hamburger he ordered "with nothing on it" was just a bun, he yells at Ed, "I'm reporting your name to the manager!" Ed, with his raspy Bill Paxton-style voice, incongruously explains, "The manager already knows my name."
Later in the film when Ed is threatened with, "You better watch your butt!", he spins around trying. "I give up," he finally concludes. "There is no way a guy can watch his own butt."
The heart of the film is the war between Good Burger and the new competition across the street, Mondo Burger.
Steven Jordan's candy-colored design for Mondo Burger is exactly how Disney might redesign a Planet Hollywood to bulk it up and make it more playful. Natasha Landau's costumes include shiny plastic jumpsuits with big zippers for the Mondo Burger staff. The resulting look reminds one of WILLY WONKA AND THE CHOCOLATE FACTORY.
First-time screen writers Kevin Kopelow and Dan Schneider went for a completely outlandish comedy without a hint of social relevance, and they succeeded. People all around us were laughing hard and often, albeit not as much in the second half when the show begins to run out of fresh gags and falls back a few times on that perennial favorite of slapstick, food fights. But even then, director Brian Robbins manages to find new ways to stage them.
This terminally silly film has an undeniable charm. Kel Mitchell as Mop haired Ed is a character I'll not soon forget. Although the show is one I expected to hate, I fell for Ed and his band of idiots.
GOOD BURGER runs a fast 1:34. It is rated PG for a few mild profanities. The show would be fine for all ages. My son Jeffrey, age 8, and his friend Steven, age 9, thought the movie was "really, really funny." Steven's favorite scene was of the exploding burgers, and Jeffrey's was the one where Ed preferred miniature golf over being alone with a sexy woman. I can't believe I'm recommending this film, but I am. There were plenty of laughs, well worth ** 1/2.
**** = A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show. Don't waste your money. 0 = Totally and painfully unbearable picture.
REVIEW WRITTEN ON: July 25, 1997
Opinions expressed are mine and not meant to reflect my employer's.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Toggle navigation
Political Dynamo
Home
Election Info
Political News
Political Compatibility
Legislation & Legislators
Federal Congress
State Congress
Executive Branch
Federal Administration
Governors
Mayors
Contact Us
Logout


Become a BAKING master!
Register Today
You don't have to love cooking to cook, but you have to do more than love baking to bake. You have to bake out of love. One way to speed up the process is to learn from the best. You can do just that by signing up for this free webinar!
We'll never share your information without your permission


Lecture 2 - Data storage & Operations, Image data
When we draw something on a screen, how do we represent that internally, and how is that translated into pixels? How are values transformed from 0's and 1's into values we can manipulate and understand?


Fun Facts About Zion National Park
- Zion National Park was founded November 19, 1919
- The nearest city to Zion National Park is Springdale, Utah.
- Zion National Park is distinguished by steep red cliffs.
Zion has three campgrounds.
- The Lava Point Campground (about an hour drive from Zion canyon)
- South Campground
- Watchman Campground
Recommended hikes:


Intersect
Join
TopN
Predefined
Results
Latency
Count
Total
Query
Select at least one field value for each index.
Results
Latency
Matched Rides
Matched Users
Total Users
Total Rides
Pickup Locations
User Query
Ride Query
TopN query
Results
Query
Latency
Total
Benchmark query #1
Benchmark query #2 (approximate)
Benchmark query #3
Benchmark query #4
Benchmark query #5
Results
Description
Latency
Total


Project name: {{ .Name }}
Treatment groups: {{ .GroupNames }} ({{.NumGroups}} groups)
Enter a sampling rate for each treatment group. For example,
a treatment group with sampling rate 2 will have approximately
twice as many assignments as a treatment group with sampling
rate 1. Each sampling rate should be a positive number. Leave
the sampling rates at their default value of "1" if you want
approximately equal numbers of subjects to be assigned to each
treatment group.
Cancel and return to dashboard


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
BEFORE THE MADURAI BENCH OF MADRAS HIGH COURT DATED: 26/06/2008 CORAM The Honourable Mr.Justice ELIPE DHARMA RAO and The Honourable Mr.Justice M.VENUGOPAL TAKEN UP W.P(MD) No.1197 of 2008 The Registrar (Judicial), Madurai Bench of Madras High Court, Madurai. .. Petitioner Vs 1. The Secretary to Government, Health and Family Welfare Department, Chennai-9. 2. The Secretary, Department of Municipal and Special Panchayat Administration, Government of Tamil Nadu, Fort St. George, Chennai-9. 3. The Commissioner, Corporation of Madurai, Madurai. 4. The Chief Health Officer, Madurai Corporation, Madurai. 5. The Chairman, Tamil Nadu Pollution Control Board, Guindy, Chennai-32. 6. The District Collector, Madurai. ..Respondents . . . Prayer Writ petition has been filed under Article 226 of the Constitution of India to issue a writ of Mandamus directing the respondents herein to take effective and emergent steps to prevent,dumping and burning of waste materials at the Corporation garbage dumping yard at Avaniapuram and also shift the dumping place to any other locality which would not affect the public health and to take appropriate measures to prevent the pollution of the atmosphere therein and further direct the Pollution Control Board to monitor the Madurai Corporation to follow the norms as prescribed under the Pollution Control Act. . . . ! ^For Respondents ... Mr.Pala.Ramasamy (For R1,2 & 6) Spl.Govt.Pleader Mr.M.Suresh Kumar (For R3 &R4) Mr.Ramanlaal (For 5) :ORDER
(Order of the Court was made by ELIPE DHARMA RAO, J) As per the notice issued by this Court on the basis of the news item published in the newspaper, THE HINDU, Madurai edition dated 12.2.2008, the Corporation/third respondent had filed its counter affidavit. The relevant portion in paragraphs 4 and 5 is as follows:- 'Para 4. ...in order to put permanent solution in respect of garbage collection and its maintenance, it floated tender for solid waste Management Project with an estimate of Rs.74.29 crores. The above project includes the following main proposals namely-
i) to rehabilitate and augment the existing system by way of providing additional equipments and machineries.
ii) door to door collection of segregated garbage's by using separate containers.
iii) equipment for source segregation using two bins system.
iv) to impove the transport vehicles.
v) Land fill for accumulated waste and future waste. Further after implementation of the above project, collected garbage's are segregated as bio-degradable and non-biodegradable and the same is treated in proper manner and the garbage's are going to be converted into a good manure also. To implement the project a national level tenders were floated on 12.1.2008. International reputed companies participated in the above tender. The tender evaluation committee for the above Project under the Chairmanship of the Commissioner of Corporation, consisting the following members namely
2. Deputy Commissioner,
3. Superintending Engineer
4. Executive Engineer (N & W)
5. Executive Engineer (S & E)
6. Executive Engineer (JnNURM),
7. Joint General Manager, O/o.CMA
8. Assistant Commissioner (Accounts)I/c
9. Joint Chief Environment Engineer, TNPCB.
10. Lecturer(Civil Department)Thiagaraja College of Engineering,
11. Deputy Director,Agricultural Department,
12. M/s.LT & FS Consultant for Bid Processing Management,
13. M/s.Community Consultancy India Private Ltd.
The expert committee has identified the successful bidder and the council by its resolution No.344 dt 28.3.08 has accepted the proposal of the above said committee. Based on the said resolution letter of intent was also issued to the successful Tenderer on 29.3.2008. The successful tenderer has started the work as per the project at Avaniapuram.
Para 5. ... Every day 60 liters of EM-1 solution is applied on the fresh Garbage's collected at Avaniapuram. Similarly Every Day 150 Liters of EM-1 is solution applied on the old Garbage's at Avaniapuram. Apart from that the Corporation has put up guards to prevent Rag Pickers from entering into Garbage Area. I submit that now the Corporation has purchased 10 additional 'Garbage dumper placer vehicle" in addition to existing 24 vehicles are put on operation from 12.6.2008 onwards. Similarly the Corporation has purchased "Mini Loader Robot" (imported) and compacters (for pressing the Garbages) during May 2008 for effective collection and disposal of Garbages.
2. Under the circumstances, we are satisfied that the Corporation will respect the submissions made in the counter affidavit in the interest of public. Recording the same, the Writ Petition is closed. No order as to costs.
er/asvm To
1. The Secretary to Government, Health and Family Welfare Department, Chennai-9.
2. The Secretary, Department of Municipal and Special Panchayat Administration, Government of Tamil Nadu, Fort St. George, Chennai-9.
3. The Commissioner, Corporation of Madurai, Madurai.
4. The Chief Health Officer, Madurai Corporation, Madurai.
5. The Chairman, Tamil Nadu Pollution Control Board, Guindy, Chennai-32.
6. The District Collector, Madurai.


My name is Chunk and I am a dachshund that loves tacos. I am a year and a half old and discovered my passion for tacos during my time in California. My favorite is a breakfast taco with delicious egg, crispy bacon, gooey cheese, and spicy New Mexico green chilies.
This project is about working with local storage to create a functional database. In addition, we have the challenge of styling and formatting our page. I wanted to include some functionality, so I decided to add some dropdowns connected to the navbar. Pretty cool, right?
Ruff, ruff! Feel free to reach out with any comments or questions about tacos and I'll be happy to respond. My email is<EMAIL_ADDRESS>I will respond as soon as possible.
| Fullname | Favorite Taco |
|---|---|
| test key | test value |


AS/400 Auditing
Sections: Remote [info, user enum, exploit], Local [System security, password policy, audit level, documentation]
- Remote
- Information Gathering
- Nmap using common iSeries (AS/400) services.
- Unsecured services (Port;name;description)
-
- 446;ddm;DDM Server is used to access data via DRDA and for record level access
- 449;As-svrmap; Port Mapper returns the port number for the requested server
- 2001;As-admin-http;HTTP server administration
- 5544;As-mtgctrlj;Management Central Server used to manage multiple AS/400S in a net
- 5555;As-mtgctrl;Management Central Server used to manage multiple AS/400S in a net
- 8470;As-Central;Central Server used when a client Access licence is required for downloading translation tables
- 8471;As-Database;Database server used for accessing the AS/400 database
- 8472;As-dtaq;Data Queue server allows access to the AS/400 data queues used for passing data between applications
- 8473;As-file;File Server is used for accessing any part of the AS/400
- 8474;as-netprt; Printer Server used to access printers known to the AS/400
- 8475;as-rmtcmd;Remote Command Server used to send commands from PC to an AS/400
- 8476;as-signon;Sign-on server is used for every client Access connection to authenticate users and to change passwords
- 8480;as-usf;Ultimedia facilities used for multimedia data
- Secured services (Port;name;description)
-
- 447;ddm-ssl;DDM Server is used to access data via DRDA and for record level access
- 448;ddm;DDM Server is used to access data via DRDA and for record level access
- 992;telnet-ssl;Telnet Server
- 2010;As-admin-https;HTTP server administration
- 5566;As-mtgctrl-ss;Management Central Server used to manage multiple AS/400S in a net
- 5577;As-mtgctrl-cs;Management Central Server used to manage multiple AS/400S in a net
- 9470;as-central-s;Central Server used when a client Access licence is required for downloading translation tables
- 9471;as-database-s;Database Server
- 9472;as-dtaq-s;Data Queue server allows access to the AS/400 data queues used for passing data between applications
- 9473;as-file-s;File Server is used for accessing any part of the AS/400
- 9474;as-netprt-s; Printer Server used to access printers known to the AS/400
- 9475;as-rmtcmd-s;Remote Command Server used to send commands from PC to an AS/400
- 9476;as-signon-s;Sign-on server is used for every client Access connection to authenticate users and to change passwords
- NetCat (old school technique)
- nc -v -z -w target ListOfServices.txt | grep "open"
- Banners Grabbing
- Telnet
- Using TN5250
- Tools
- tn5250.sourceforce.net
- Mochasoft (trial)
- SDI (Trial)
- Debian package
- IBM Client Access iSeries (install for Debian)
- Good How-To (in French).
- Security-Database transcription in english
- Download the Package from location
- Convert RPM to DEB package
- Aptitude install alien
- alien iSeriesAccess-XX.rpm
- Installing Deb Package
- dpkg -i iSeriesAccess-xxx.deb
- Running binary file
- /opt/ibm/iSeriesAccess/bin/ibm5250
- Sometimes this error occurs : error while loading libXm.so.3
- This means OpenMotif is missing
- Add deb http://ftp2.fr.debian.org/ sid main non-free to /etc/apt/sources.list
- aptitude update
- aptitude install libmotif3
- Remove added line from /etc/apt/sources.list and launch aptitute update
- After installing OpenMotif, this error sometimes occurs : error while loading libcwbcore.so
- This means Lib Path to iseriesaccess could not be reached
- You should add iseriesaccess (/opt/ibm/iSeriesAccess/lib) to /etc/ld.so.conf
- run the command : ldconfig
- Old School hack : LD_LIBRARY_PATH=/opt/ibm/iSeriesAccess/lib/:${LD_LIBRARY_PATH} /opt/ibm/iSeriesAccess/bin/ibm5250
- Something else
- Search for binary using dpkg -L iseriesaccess
- FTP
- echo quit | nc -v target 21
- HTTP Banner
- echo GET / | nc -v target 80
- Browser HTTP administrative (if available)
- http://target:2001
- http://target:2010
- POP3
- echo quit | nc target 110
- Basic POP3 retriever
-
- SNMP
-
- SMTP
-
- Users Enumeration
- Default AS/400 users accounts
- Error messages
- Telnet Login errors
- CPF1107: Password not correct for user profile XXXX
- CPF1120: User XXXX does not exist
- CPF1116 : Next not valid sign-on attempt variers off device?
- CPF1392 : Next not valid sign-on attempt disables user profile XXXX
- CPF1394: User profile XXXX cannot sign on?
- CPF1118:No password associated with the user XXXX
- CPF1109: Not authorized to subsystem
- CPF1110: Not authorized to work station?
- POP3 authentication Errors
- CPF2204: User profile XXXX not found
- CPF22E2: Password not correct for User profile XXXX
- CPF22E3: User profile XXXX is disabled
- CPF22E4: Password for User profile XXXX has expired
- CPF22E5: No Password associated with User profile XXXX
- Qsys symbolic link (if ftp is enabled)
- ftp target | quote stat | quote site namefmt 1
- cd /
- quote site listfmt 1
- mkdir temp
- quote rcmd ADDLNK OBJ('/qsys.lib') NEWLNK('/temp/qsys')
- quote rcmd QSH CMD('ln -fs /qsys.lib /temp/qsys')
- dir /temp/qsys/*.usrprf
- Here you should list some profils
- LDAP
- Need os400-sys value from ibm-slapdSuffix
- Think to grab it using FTP from (QIBM/UserData/OS400/DirSrv/
- slapd.conf
-
- dn: cn=System, cn=System Backends, cn=IBM Directory, cn=Schemas, cn=Configuration
- cn: System
- slapdPlugin: database /QSYS.LIB/QGLDPSYS.SRVPGM sysprj_backend_init
- slapdReadOnly: FALSE
- slapdSuffix: os400-sys=HERE IS THE VALUE YOU ARE LOOKING FOR
- objectclass: top
- objectclass: ibm-slapdConfigEntry
- objectclass: ibm-slapdOs400SystemBackend
- ibmslapd.conf
- Resolve IP address.
- Telnet Value screen.
-
- Server : AS400_ANDOLINI
- COMPANY : DONCORLEONE.COM
- Value should be : AS400_ANDOLINI.DONCORLEONE.COM
- Tool to browse LDAP
- LdapBrowser
- LDAP Utility
- Luma Ldap brower and more
- LdapSearch (unix utility)
- Enumeration
-
- ldapsearch -h AS400SERVER \ -b "cn=accounts,os400-sys=AS400-Name" \ -D "os400-profile=$LOGIN$,cn=accounts,os400-sys=AS400-Name" \ -w $PASSWRD -L -s sub "os400-profile=*" > MyUSERS.log
- AS400-Name : is the value you grabbed before
-
- ldapsearch -h target \ -b "cn=accounts,os400-sys=AS400-Name" \ -D "os400-profile=$LOGIN$,cn=accounts,os400-sys=AS400-Name" \ -w $PASSWRD -L -s sub "os400-profile=USER_YOU_WANT" > COMPLETEINFO_ONUSER.log
- Exploitation
- CVE References
-
- Access with Work Station Gateway
-
- Network attacks (next release)
- DB2
- QSHELL
- Hijacking Terminals
- Trojan attacks
- Hacking from AS/400