#include <route.h>
|
|
std::ostream & | operator<< (std::ostream &, Route const &route) |
| |
Route is a class that holds a route.
Definition at line 16 of file route.h.
◆ Route() [1/2]
| Route::Route |
( |
Env * |
env, |
|
|
int |
depotID |
|
) |
| |
Constructor.
- Parameters
-
| [in] | env | Environment pointer |
| [in] | depotID | ID of the depot |
Definition at line 14 of file route1.cpp.
◆ Route() [2/2]
| Route::Route |
( |
Env * |
env, |
|
|
int |
depotID, |
|
|
std::vector< int > |
route, |
|
|
std::vector< int > |
demandRoute |
|
) |
| |
Constructor.
- Parameters
-
| [in] | env | Environment pointer |
| [in] | depotID | ID of the depot |
| [in] | route | Vector of customers IDs to add |
| [in] | demandRoute | Vector of demands of the customers to add |
Definition at line 16 of file route.cpp.
◆ addCustomer()
| void Route::addCustomer |
( |
int |
customerID, |
|
|
int |
load, |
|
|
int |
routePos |
|
) |
| |
Add customer to the route. Update the d_route member and the d_demandRoute member.
- Parameters
-
| [in] | customerID | ID of the customer |
| [in] | load | Total demand of the customer |
| [in] | routePos | The position to insert the customer into. |
Definition at line 15 of file addcustomer.cpp.
◆ findCustomer()
| long Route::findCustomer |
( |
int |
customerID | ) |
const |
Find the customer in the route.
- Parameters
-
| [in] | customerID | The ID of the customer |
Definition at line 13 of file findcustomer.cpp.
◆ getDemandRoute()
| std::vector< int > & Route::getDemandRoute |
( |
| ) |
|
|
inline |
Get the demands of the route.
- Returns
- Vector of ints containing the demands of the customers to traverse
Definition at line 86 of file route.h.
◆ getDistance()
| double const Route::getDistance |
( |
| ) |
const |
|
inline |
Get the total distance travelled by the route.
- Returns
- Total distance of the route
Definition at line 104 of file route.h.
◆ getLoad()
| int const Route::getLoad |
( |
| ) |
const |
|
inline |
Get the total load of the route.
- Returns
- Load of the route
Definition at line 95 of file route.h.
◆ getRoute() [1/2]
| std::vector< int > & Route::getRoute |
( |
| ) |
|
|
inline |
Get the actual route.
- Returns
- Vector of ints containing the IDs of the customers to traverse
Definition at line 59 of file route.h.
◆ getRoute() [2/2]
| std::vector< int > const & Route::getRoute |
( |
| ) |
const |
|
inline |
Get the actual route (consts).
- Returns
- Vector of ints containing the IDs of the customers to traverse (const)
Definition at line 77 of file route.h.
◆ getRouteCopy()
| std::vector< int > Route::getRouteCopy |
( |
| ) |
|
|
inline |
Get the actual route as a copy.
- Returns
- Vector of ints containing the IDs of the customers to traverse
Definition at line 68 of file route.h.
◆ getServiceTime()
| double const Route::getServiceTime |
( |
| ) |
const |
|
inline |
Get the total service time of the route
- Returns
- Total service time of the route
Definition at line 113 of file route.h.
◆ removeCustomer()
| int Route::removeCustomer |
( |
int |
customerID | ) |
|
Removes customer from the route corresponding to the vehicle.
- Parameters
-
| [in] | customerID | ID of the customer |
Definition at line 13 of file removecustomer.cpp.
◆ swap()
| void Route::swap |
( |
int |
aIdx, |
|
|
int |
bIdx |
|
) |
| |
Swap two customers in the route.
- Parameters
-
| [in] | aIdx | Position of the first customer in the route |
| [in] | bIdx | Position of the second customer in the route |
Definition at line 14 of file swap.cpp.
◆ twoOpt()
| void Route::twoOpt |
( |
int |
bIdx, |
|
|
int |
cIdx |
|
) |
| |
Apply two opt operator to the route. Switch to arcs of the route.
- Parameters
-
| [in] | aIdx | Position of the first customer to swap |
| [in] | bIdx | Postion of the second customer to swap |
Definition at line 14 of file twoopt.cpp.
◆ d_demandRoute
| std::vector<int> Route::d_demandRoute |
|
private |
Vector of ints containing the demands corresponds to the route
Definition at line 24 of file route.h.
◆ d_depotID
ID of the depot where the route belongs to
Definition at line 19 of file route.h.
◆ d_env
Environment pointer
Definition at line 18 of file route.h.
◆ d_length
Total length of the route
Definition at line 21 of file route.h.
◆ d_load
Total load of the route
Definition at line 20 of file route.h.
◆ d_route
| std::vector<int> Route::d_route |
|
private |
Vector of ints containing the ID of the customers in the route
Definition at line 23 of file route.h.
◆ d_serviceTime
| double Route::d_serviceTime |
|
private |
Total service time of the route. (Customers + distance)
Definition at line 22 of file route.h.
The documentation for this class was generated from the following files:


@composi/fragment:
Install
If you've created a project using create-composi-app
, you do not have to install @composi/fragment. It
is already installed in the project and ready to import into your code. Read
the documentation for create-composi-app to
learn how to get up and running fast.
To use Fragment, you'll need to import it into your project:
import { Fragment } from '@composi/fragment'
Follow the link to Usage to learn how to use Fragment.


Lawlidays
A simple tool to find out the legal holidays in a U.S. state
Results
Reset
Export To:
Google Calendar
Email
JSON
CSV


{include file="public/head" /}
栏目修改
{include file="public/header" /}
{include file="public/left" /}
栏目修改
栏目名称
栏目关键词
栏目内容
{$cates.desc}
提交
{include file="public/footer" /}


{% extends "review/base.html" %} {% block header %} {% endblock %} {% block content %}
The work you are required to review is shown below. You can start the review, come back later to continue editing and adding feedback. Your work is continually saved as you type and evaluate your peers.
If you do not see any document here then you should please first download it.
{% endif %}


About
Node Web Messenger
A messenger client to communicate with all other instances of the client connected by sockets.
Author
Daniel Gisolfi - All current work - dgisolfi
Prerequisites
All requirements to run an instance of this project
- Node.js
- socket.io
- express
- Heroku or an equivalent service
Deployment
Currently this project is being tested and developed within localhost but eventually, I would like to have this web app exist on Heroku or another equivalent service.
Goals
The following are possible additions and goals I would like to meet with this project
- A better understanding and further experience using node.js
- A basic understanding of creating and implementing a node server
- A basic understanding of sockets and using socket.io to connect instances of an application
- A testing ground for the multiple bots I have created that could benefit from a UI


| Reference | Class List | Member Functions | Typedefs | File List |
| Pool | The pool's core type. |
Definition at line 68 of file size_policies.hpp.
Public Member Functions | |
| bool | resize (size_t const worker_count) |
| static_size (Pool volatile &pool) | |
| void | task_finished () |
| void | task_scheduled () |
| void | worker_died_unexpectedly (size_t const new_worker_count) |
Static Public Member Functions | |
| static void | init (Pool &pool, size_t const worker_count) |
|
|
Definition at line 78 of file size_policies.hpp. |
|
|
Definition at line 73 of file size_policies.hpp. |
|
|
Definition at line 82 of file size_policies.hpp. |
|
|
Definition at line 94 of file size_policies.hpp. |
|
|
Definition at line 93 of file size_policies.hpp. |
|
|
Definition at line 87 of file size_policies.hpp. |


--- short: e-sparqlendpointchunked type: extractor color: red title: SPARQL Endpoint chunked description: Extracts RDF triples from a SPARQL endpoint based on a list of entities to extract. Suitable for bigger data. ---
Extractor, allows the user to extract RDF triples from a SPARQL endpoint using a series of CONSTRUCT queries based on an input list of entity IRIs. It is suitable for bigger data, as it queries the endpoint for descriptions of a limited number of entities at once, creating a separete RDF data chunk from each query.
${VALUES}
placeholder. This is where the VALUES clause listing the current entities to query is inserted.
The {{page.title}} component queries a remote SPARQL endpoint using a SPARQL CONSTRUCT query.
It can be configured at runtime using RDF configuration, which can be generated by another component.
This chunked version of the component is suitable for bigger data, which needs to be queried by parts.
The typical use case is getting descriptions of a larger number of entities of the same type, which would be too big to get in one query.
On the input, the component expects a single CSV file containing one column with a header.
The column header is the name of the variable, which will be used in the SPARQL query as the IRI of the entity, about which the extracted data should be.
The row then contain the list of IRIs of these entities.
The list is split into pieces determined by the Chunk size parameter and each piece is inserted into the query using a VALUES clause in place of the ${VALUES}
placeholder, forming one RDF data chunk on the output.
The input list of entities can be created either manually, or using the SPARQL endpoint select or SPARQL endpoint select scrollable cursor components.
Below you can see sample runtime configuration for the component, which includes specification of default graph IRIs. You can also import a sample pipeline. Note that RDF blank nodes are not allowed in runtime configurations.
{% highlight turtle %} @prefix sp:


Module: Aws::IoTFleetWise::Types
Instance Attribute Summary
-
#actuator ⇒ Types::Actuator
rw
Information about a node specified as an actuator.
-
#attribute ⇒ Types::Attribute
rw
Information about a node specified as an attribute.
-
#branch ⇒ Types::Branch
rw
Information about a node specified as a branch.
-
#can_dbc ⇒ Types::CanDbcDefinition
rw
Information, including CAN DBC files, about the configurations used to create a decoder manifest.
-
#condition_based_collection_scheme ⇒ Types::ConditionBasedCollectionScheme
rw
Information about a collection scheme that uses a simple logical expression to recognize what data to collect.
-
#s3_config ⇒ Types::S3Config
rw
The Amazon
::Aws::S3
bucket where the Amazon Web Services IoT FleetWise campaign sends data. -
#sensor ⇒ Types::Sensor
rw
An input component that reports the environmental condition of a vehicle.
-
#time_based_collection_scheme ⇒ Types::TimeBasedCollectionScheme
rw
Information about a collection scheme that uses a time period to decide how often to collect data.
-
#timestream_config ⇒ Types::TimestreamConfig
rw
The Amazon Timestream table where the campaign sends data.
-
#vss_json ⇒ String
rw
Provides the VSS in JSON format.
Instance Attribute Details
#actuator ⇒ Types::Actuator (rw)
Information about a node specified as an actuator.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 2773
class Node < Struct.new( :branch, :sensor, :actuator, :attribute, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class Branch < Node; end class Sensor < Node; end class Actuator < Node; end class Attribute < Node; end class Unknown < Node; end end
#attribute ⇒ Types::Attribute (rw)
Information about a node specified as an attribute.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 2773
class Node < Struct.new( :branch, :sensor, :actuator, :attribute, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class Branch < Node; end class Sensor < Node; end class Actuator < Node; end class Attribute < Node; end class Unknown < Node; end end
#branch ⇒ Types::Branch (rw)
Information about a node specified as a branch.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 2773
class Node < Struct.new( :branch, :sensor, :actuator, :attribute, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class Branch < Node; end class Sensor < Node; end class Actuator < Node; end class Attribute < Node; end class Unknown < Node; end end
#can_dbc ⇒ Types::CanDbcDefinition (rw)
Information, including CAN DBC files, about the configurations used to create a decoder manifest.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 2684
class NetworkFileDefinition < Struct.new( :can_dbc, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class CanDbc < NetworkFileDefinition; end class Unknown < NetworkFileDefinition; end end
#condition_based_collection_scheme ⇒ Types::ConditionBasedCollectionScheme (rw)
Information about a collection scheme that uses a simple logical expression to recognize what data to collect.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 461
class CollectionScheme < Struct.new( :time_based_collection_scheme, :condition_based_collection_scheme, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class TimeBasedCollectionScheme < CollectionScheme; end class ConditionBasedCollectionScheme < CollectionScheme; end class Unknown < CollectionScheme; end end
#s3_config ⇒ Types::S3Config (rw)
The Amazon ::Aws::S3
bucket where the Amazon Web Services IoT FleetWise
campaign sends data.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 1032
class DataDestinationConfig < Struct.new( :s3_config, :timestream_config, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class S3Config < DataDestinationConfig; end class TimestreamConfig < DataDestinationConfig; end class Unknown < DataDestinationConfig; end end
#sensor ⇒ Types::Sensor (rw)
An input component that reports the environmental condition of a vehicle.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 2773
class Node < Struct.new( :branch, :sensor, :actuator, :attribute, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class Branch < Node; end class Sensor < Node; end class Actuator < Node; end class Attribute < Node; end class Unknown < Node; end end
#time_based_collection_scheme ⇒ Types::TimeBasedCollectionScheme (rw)
Information about a collection scheme that uses a time period to decide how often to collect data.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 461
class CollectionScheme < Struct.new( :time_based_collection_scheme, :condition_based_collection_scheme, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class TimeBasedCollectionScheme < CollectionScheme; end class ConditionBasedCollectionScheme < CollectionScheme; end class Unknown < CollectionScheme; end end
#timestream_config ⇒ Types::TimestreamConfig (rw)
The Amazon Timestream table where the campaign sends data.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 1032
class DataDestinationConfig < Struct.new( :s3_config, :timestream_config, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class S3Config < DataDestinationConfig; end class TimestreamConfig < DataDestinationConfig; end class Unknown < DataDestinationConfig; end end
#vss_json ⇒ String
(rw)
Provides the VSS in JSON format.
# File 'gems/aws-sdk-iotfleetwise/lib/aws-sdk-iotfleetwise/types.rb', line 1345
class FormattedVss < Struct.new( :vss_json, :unknown) SENSITIVE = [] include Aws::Structure include Aws::Structure::Union class VssJson < FormattedVss; end class Unknown < FormattedVss; end end


YMCA University Of Science And Technology (Faridabad)
(A Haryana State Government university)
{Established By Haryana State Legistative Act No. 21of 2008 And RecognizedBy UGC Act 956 u/s 22 To Confer Degrees}
Accredited
"A"
Grade By
NAAC
Home
About Us
Registration
Admisson
Photo Gallery
Hostel
Activity
Contact Us
Photo Gallery
Click on the images below:
×
vinay kumar


Suppose you have a Rails application in /somewhere. Add a virtual host to your Apache configuration file and set its DocumentRoot to /somewhere/public:
<VirtualHost *:80> ServerName www.yourhost.com DocumentRoot /somewhere/public # <-- be sure to point to 'public'! <Directory /somewhere/public> AllowOverride all # <-- relax Apache security settings Options -MultiViews # <-- MultiViews must be turned off </Directory> </VirtualHost>
And that’s it! You may also want to check the Users Guide for security and optimization tips, troubleshooting and other useful information:
<yellow><%= @users_guide %></yellow>
Enjoy Phusion Passenger, a product of Phusion (<%= @phusion_website %>) :-) <%= @passenger_website %>
Phusion Passenger is a trademark of Hongli Lai & Ninh Bui.


Unless otherwise stated, this website and all content within this site are the property of ImageRekt and are protected by copyright and other intellectual property laws.
+
Upload an image give it title and description
Type your username, password and email
Type your username and password
Search images based on their titles or on their tags by adding #
Type your username and email to retrieve your password


Departments
Employees
Edit employee
Please fix errors below:
Department
CEO
Accounting
Java
Testing
People management
Firstname
[errors]
Lastname
[errors]
Email
[errors]
Salary
[errors]
Cancel
Save


{% extends 'base.html' %} {% block section %} Chikitshak Hassle Free Appointments with Trusted Doctors. Near me Select dropdown With options Search Topics: Dengue fever Asthma Infertility Diabetes Dehydration {% endblock %}
Near me Select dropdown With options
Search
Topics: Dengue fever Asthma Infertility Diabetes Dehydration


Kids Videos
Trains
Trains for kids
PJ Mask Toys
Paw Patrol Toys
Dora toys
Thomas Train toys
Ryan's Toy Reviews
Peppa Pig toys


Getting started¶
Thanks for checking out GAINS!
We’ll walk through the simplest usage cases for the engine module.
The engine module¶
GAINS operates using the simplified molecular-input line-entry system (SMILES). We use this to create the molecular structures (Chromosome objects) to be manipulated by the engine.
Let’s explore the simple case of creating butane from propanol:
import gains as genetic
import numpy as np
target = "CCCC" #butane smiles
parent_candidates = np.array(["CCCO"]) #propanol smiles, numpy array
In order to begin manipulating the parent_candidate we have to, at a minimum, define three additional functions to interact with the engine: a fitness function, and two display functions; one for displaying accepted mutations and one for displaying the final result.
The fitness function is the most important user-defined function to interact with the engine, so we’ll start there. It allows us to plug any desired objective into the engine; whether it be a quantitative structure property relationship (QSPR), an acitivity/toxicity score, or, as in this case, a simple similarity mapping between a target and a starting structure:
from rdkit import DataStructs
from rdkit.Chem.Fingerprints import FingerprintMols
from rdkit.Chem import AllChem as Chem
def get_fitness(genes, target):
ms = [Chem.MolFromSmiles(target), Chem.MolFromSmiles(genes)]
fps = [FingerprintMols.FingerprintMol(x) for x in ms]
return DataStructs.FingerprintSimilarity(fps[0], fps[1]), None
You can read more of RDKit’s documentation on molecular fingerprint similarity here. Briefly, the fingerprinting algorithm identifies and hashes topological paths in the molecule before folding them down to a set density of bits. We exploit this in the engine to give us a fitness score for a candidate we are attempting to mutate towards the target structure.
The engine doesn’t need to know anything about the target since the fitness function is defined on the user end. To avoid passing the target to and from the engine (and taking up cpu time) we define a helper function:
def fnGetFitness(genes):
return get_fitness(genes, target)
This brings us to the last two functions we need to define, the display functions. There is a lot of freedom here to choose what we would like to print to the screen. At a minimum, the engine expects to pass the candidate (Chromosome object) and the current mutation to the display function; and the candidate’s genes (SMILES string), target (int, float, or array), count of the mutation attempts (int), and two additional variables we’ll get into later (the similarity score and corresponding molecular relative to the molecular solution) to the result display function.
In the following I’ve chosen to print the mutation performed, the fitness score, and the SMILES of the candidate in the display function and the number of atoms and number of mutations in the result display function:
def display(candidate, mutation):
print("{:>20}{:>15}{:>15}".format(mutation, "{:3.4f}".
format(candidate.Fitness),
candidate.Genes))
def result_display(genes, target, mutation_attempts, sim_score,
molecular_relative):
mol = Chem.MolFromSmiles(genes)
print("{:>20}{:>15}".format("number of atoms:", mol.GetNumAtoms()))
print("{:>20}{:>15}".format("mutation attempts:", mutation_attempts))
We have just two more items to pass to the engine: the geneSet object and the optimal fitness we are searching for.
The geneSet object contains the atoms and fragments the engine is allowed to use in any mutation attempt. For now these are hard coded into the engine and may be viewed here.
The optimal fitness in our case is 1 (perfect mapping between candidate and target). But to be thorough we set this by passing the fitness score between the target and itself:
geneSet = genetic.generate_geneset()
optimalFitness, prediction = get_fitness(target, target)
We’re now ready to put this all together:
best = genetic.get_best(fnGetFitness, optimalFitness, geneSet,
display, result_display, target,
parent_candidates)
starting structure 0.3333 CCCO
add_custom_fragment 0.3529 CCCCCO
remove_atom 0.4615 CCCCO
remove_atom 1.0000 CCCC
number of atoms: 4
mutation attempts: 34
In this simple example it took 34 mutation attempts to get from “CCCO” (propanol) to “CCCC” (butane); only 3 of which were accepted because they resulted in a higher fitness score than the parent.
In the next section we’ll go over the different mutations available to the engine.
The mutate function¶
the GAINS engine can perform the following mutations to a molecular candidate:
- remove_atom
- add_atom
- replace_atom
- add_custom_fragment
- remove_custom_fragment
- add_rdkit_fragment
- remove_rdkit_fragment
To understand these sub functions, it is illustrative to look at the function that generates the geneSet:
atoms = [6, 7, 8, 9, 5, 15, 16, 17]
fName = os.path.join(RDConfig.RDDataDir, 'FunctionalGroups.txt')
rdkitFrags = FragmentCatalog.FragCatParams(1, 5, fName)
customFrags = FragmentCatalog.FragCatalog(rdkitFrags)
fcgen = FragmentCatalog.FragCatGenerator()
m = Chem.MolFromSmiles('CCCC')
fcgen.AddFragsFromMol(m, customFrags)
return GeneSet(atoms, rdkitFrags, customFrags)
atoms
is set according to atomic number: carbon, nitrogen, oxygen, fluorine, boron, phosphorus, sulfur, and chlorine.
rdkitFrags
is best understood by showing the output from rdkit itself:
from rdkit import RDConfig
from rdkit.Chem import FragmentCatalog
import os
fName = os.path.join(RDConfig.RDDataDir, 'FunctionalGroups.txt')
rdkitFrags = FragmentCatalog.FragCatParams(1, 5, fName)
rdkitFrags.GetNumFuncGroups()
39
The engine is utilizing 39 built-in fragments from RDKit. We can view these fragments individually:
from rdkit.Chem import Draw
Draw.MolToMPL(rdkitFrags.GetFuncGroup(38))
and view all of their smiles strings:
from rdkit import Chem
for i in range(0,rdkitFrags.GetNumFuncGroups()):
print(Chem.MolToSmiles(rdkitFrags.GetFuncGroup(i)))
[*]NC(C)=O
[*]C(=O)O
[*]C(=O)OC
[*]C(C)=O
[*]C(N)=O
[*]C(C)=O
[*]N=C=O
[*]N=C=S
[*]N(=O)O
[*]N=O
[*]=NO
[*]=NC
[*]N=C
[*]N=NC
[*]N=N
[*]N#N
[*]C#N
[*]S(N)(=O)=O
[*]NS(C)(=O)=O
[*]S(=O)(=O)O
[*]S(=O)(=O)OC
[*]S(C)(=O)=O
[*]S(=O)(=O)Cl
[*]S(C)=O
[*]SC
[*]S
[*]=S
[*]F
[*]C(C)(C)C
[*]C(F)(F)F
[*]C#C
[*]C1CC1
[*]OCC
[*]OC
[*]O
[*]=O
[*]N
[*]=N
[*]#N
You can learn more about RDKit fragments here. The customFrags will change in future versions of GAINS. For now they are simply substructures of butane:
fName = os.path.join(RDConfig.RDDataDir, 'FunctionalGroups.txt')
rdkitFrags = FragmentCatalog.FragCatParams(1, 5, fName)
customFrags = FragmentCatalog.FragCatalog(rdkitFrags)
fcgen = FragmentCatalog.FragCatGenerator()
m = Chem.MolFromSmiles('CCCC')
fcgen.AddFragsFromMol(m, customFrags)
for i in range(3):
print(customFrags.GetEntryDescription(i))
CC
CCC
CCCC
We’ve covered the important information you need to know to get up and running with GAINS. In the next chapter of the series we’ll go over more complex fitness and display functions to take full advantage of the package. For convenience here is the full code of minimal functions we’ve described for interacting with the engine module:
import gains as genetic
import numpy as np
from rdkit import DataStructs
from rdkit.Chem.Fingerprints import FingerprintMols
from rdkit.Chem import AllChem as Chem
target = "CCCC" #butane smiles
parent_candidates = np.array(["CCCO"]) #propanol smiles, numpy array
def get_fitness(genes, target):
ms = [Chem.MolFromSmiles(target), Chem.MolFromSmiles(genes)]
fps = [FingerprintMols.FingerprintMol(x) for x in ms]
return DataStructs.FingerprintSimilarity(fps[0], fps[1]), None
def fnGetFitness(genes):
return get_fitness(genes, target)
def display(candidate, mutation):
print("{:>20}{:>15}{:>15}".format(mutation, "{:3.4f}".
format(candidate.Fitness),
candidate.Genes))
def result_display(genes, target, mutation_attempts, sim_score,
molecular_relative):
mol = Chem.MolFromSmiles(genes)
print("{:>20}{:>15}".format("number of atoms:", mol.GetNumAtoms()))
print("{:>20}{:>15}".format("mutation attempts:", mutation_attempts))
geneSet = genetic.generate_geneset()
optimalFitness, prediction = get_fitness(target, target)
best = genetic.get_best(fnGetFitness, optimalFitness, geneSet,
display, result_display, target,
parent_candidates)
starting structure 0.3333 CCCO
remove_atom 0.6667 CCC
add_custom_fragment 0.7500 CCCCC
remove_atom 1.0000 CCCC
number of atoms: 4
mutation attempts: 41


Please Correct Errors Below
Edit Recipe Information
Recipe Description:
Categories:
Cat 1
Cat 2
Prep Time:
Cook Time:
Difficulty:
Easy
Easy
Medium
Hard
Servings:
Source:
URL:
Ingredients
Edit
1 Cup of milk
1 Teaspoon of chocolate
1 Teaspoon of Sugar
Directions
Notes
Submit


Profile
Posts
Posts data
S.No.
Date posted
Message
I want to see my posts
enter your Facebook
token
Back


int6kid(1) Qualcomm Atheros Open Powerline Toolkit int6kid(1) NAME int6kid - Echo Device Key SYNOPSIS int6kid [options] [device] [device] [ ... ] DESCRIPTION This program prints a single powerline device key or HFID on stdout. It can be used to dynamically define environment variables or insert command line arguments in scripts at runtime. It is intended to echo a specific key read from a sin‐ gle device but it can be used to echo a specific key type read from several devices by specifying either the Qualcomm Atheros Local Management Address or a broadcast address. This program is, in some sense, the inverse of modpib but it reads the key and HFID directly from the powerline device instead of reading from a PIB file. This program is part of the Qualcomm Atheros Powerline Toolkit. See the plc man page for an overview and installation instructions. OPTIONS -A Prints the Ethernet address (MAC) for each specified device. This option and options -D, -M, -N, -S and -U are mutually exclusive. -D Prints the Device Access Key (DAK) for each specified device. This option and options -A, -M, -N, -S and -U are mutually exclusive. -e Redirects stderr messages to stdout. By convention status and error messages are printed on stderr while primary program output is printed on stdout. This option prints all output on stdout in cases where this is desired. -i interface Select the host Ethernet interface. All requests are sent via this host interface and only reponses received via this host interface are recognized. The default interface is eth1 because most people use eth0 as their principle network connection; however, if environment string "PLC" is defined then it takes precedence over the default interface. This option then takes precedence over either default. -n Append a newline to the end of each key. Newlines are omitted by default so that program output can be used as the raw input to another program. If you want the newline then you must request it with this option. -M Prints the Network Membership Key (NMK) for each specified device. This option and options -A, -D, -N, -S and -U are mutually exclusive. -N Prints the network HFID string for each specified device. This option and options -A, -D, -M, -S and -U are mutu‐ ally exclusive. -q Suppresses status messages on stderr. -S Prints the manufacturer HFID string for each specified device. This option and options -A, -D, -M, -N and -U are mutually exclusive. -v Print additional information on stdout. In particular, this option dumps incoming and outgoing packets which can be saved as text files for reference. -x Cause the program to exit on the first error instead of continuing with remaining iterations, operations or devices. Normally, the program reports errors and moves on to the next operation, iteration or device depending on the command line. -?,--help Print program help summary on stdout. This option takes precedence over other options on the command line. -?,--version Print program version information on stdout. This option takes precedence over other options on the command line. Use this option when sending screen dumps to Atheros Technical Support so that they know exactly which version of the Linux Toolkit you are using. ARGUMENTS device The MAC address of some powerline device. More than one address may be specified. If more than one address is specified then operations are performed on each device in turn. The default address is local. See DEVICES for information about symbolic device addresses. DEVICES Powerline devices use Ethernet Media Access Control (MAC) addresses. A MAC address is a 48-bit value entered as 12 hex‐ adecimal digits in upper, lower or mixed character case. Octets may be separated with colons for clarity. For example, "00b052000001", "00:b0:52:00:00:01" and "00b052:000001" are valid and equivalent. The following MAC addresses are special and may be entered by name instead of number. all Same as "broadcast". broadcast A synonym for the Ethernet broadcast address, FF:FF:FF:FF:FF:FF. All devices, whether local, remote or foreign recognize messages sent to this address. A remote device is any device at the far end of a powerline connection. A foreign device is any device not manufactured by Atheros. local A synonym for the Qualcomm Atheros vendor specific Local Management Address (LMA), 00:B0:52:00:00:01. All local Atheros devices recognize this address but remote and foreign devices do not. A remote device is any device at the far end of a powerline connection. A foreign device is any device not manufactured by Atheros. REFERENCES See the Qualcomm Atheros HomePlug AV Firmware Technical Reference Manual for more information. DISCLAIMER Atheros HomePlug AV Vendor Specific Management Message Entry structure and content is proprietary to Qualcomm Atheros, Ocala FL USA. Consequently, public information may not be available. Qualcomm Atheros reserves the right to modify mes‐ sage structure and content in future firmware releases without any obligation to notify or compensate users of this pro‐ gram. EXAMPLES The following example prints the DAK of the local device on stdout. The local device is interrogated because no MAC address was specified. The default interface, eth1 on Linux and 2 on Windows, is used unless environment variable PLC is defined. The DAK is always printed by default. Depending on your system, you may want to use option -n when using this program interactively. # int6kid 00:11:22:33:44:55:66:77:88:99:AA:DD:CC:DD:EE:FF The following example prints the NMK of device 00:B0:52:DA:DA:57 connected to interface eth2 on a Linux system. Several devices could be specified but that is not a common request. # DAK -Mi eth2 00:B0:52:DA:DA:57 F4:23:71:4A:51:39:C2:2D:E5:EA:87:43:99:A1:37:81 The following example dynamically inserts the DAK and NMK of the previous device on the command line of another program. In this example, we want to insert the DAK and NMK into PIB file abc.pib using program modpib. See the modpib man page for an explanation of command line syntax. See the GNU bash manuals for an explanation of why this works. # modpib abc.pib -D $(int6kid -Di eth2 00:B0:52:DA:DA:57) -N $(int6kid -Mi eth2 00:B0:52:DA:DA:57) The following example is an alternate way of accomplishing the same thing using shell script variables. This method may be easier to read and maintain. Notice that we ’squished’ all the options together for brevity. # PLC=00:B0:52:DA:DA:57 # DAK=$(int6kid -Dieth2 ${PLC}) # NMK=$(int6kid -Mieth2 ${PLC}) # modpib abc.pib -D ${DAK} -N ${NMK} SEE ALSO plc(1), int6k(1), int6kf(1), int6kp(1), modpib(1) CREDITS Charles Maier<EMAIL_ADDRESS>open-plc-utils-0.0.3 November 2013 int6kid(1)


75 Years Ago the USS Grayback Was Lost in the Pacific Ocean: This is the Doomed Submarine’s Epic Story.
by Sebastien RoblinOn February 27, 1944, a Japanese Nakajima B5N torpedo bomber patrolling over the East China Sea near Okinawa spotted the glinting hull of a submarine surfaced above the water.
Earlier that very day, the freighter Celyon Maru had been sunk by two torpedoes.
The three-man bomber swooped down and reported a direct hit with a 500-pound, causing the submarine to “explode and sink immediately.”
To play it safe, Japanese warships closed in on a trail of bubbles left at the scene and laced the ocean with depth charges. As concussive blasts wracked the water, a black oil slick surged to the surface.
Ten days later, on March 7, the submarine USS Grayback failed to return to Pearl Harbor from her tenth war patrol as scheduled. Nor did she reply to a radio inquiry three days later.
After waiting three weeks, the Navy listed Grayback and the eighty sailors aboard her as “missing, presumed lost with all hands.”
After the Japanese surrender, researchers correlated Grayback’s disappearance with Japanese records. They concluded 1,652-ton submarine had been on something of a rampage before meeting her last patrol, possibly sinking as many as four ships totaling 21,000 tons.
Grayback Found at Last
Seventy-five years later, a privately funded expedition set out to find Grayback’s lost wreck. Team leader Tim Taylor and partner Christina Dennison had previously located the wrecks of four other U.S. World War II submarines as part of a project called Lost 52, leveraging new autonomous underwater vehicle technology that could search wide areas without having to be continuously tethered to a boat.
Two years earlier, I chatted with Taylor and Dennison about their first find in 2010: Navy coastal defense submarine R-12, which sank mysteriously off the coast of Florida, taking with her forty-three crew. They expressed their wish to preserve the memory of the heroic submariners who sacrificed their lives in the conflict and give relatives a sense of closure by identifying the sites of their remains.


0. Introduction
This is a Manual Page of RapidCopy(FastCopy for GNU/Linux). Please read carefully the following points.
Based on the great original FastCopy v2.11.
Cheer the great original FastCopy up!
|
1. About
FastCopy is the Fastest Copy/Delete Software on Windows.
RapidCopy is portable version of FastCopy that runs GNU/Linux.
Automatically selects different methods according to whether Source and DestDir are in the same or different HDD.
| Diff HDD | Reading and writing are processed respectively in parallel by separate threads. |
| Same HDD | Reading is processed until the big buffer fills. When the big buffer filled, writing is started and processed in bulk.
|
Because Reading/Writing are processed with no OS cache at all, other applications don't easily become slow.
Include/Exclude Filter (UNIX Wildcard style) supported.
GUI and some function constructed by Qt Framework
For the purpose of performance, Using a POSIX system call to replace the Win32API.
Add a number of features such as xxHash verify and copy result EMail sending.
If you want to know the changes from FastCopy, Please refer to change list from FastCopyV2.11
This program is licensed under BSD License.
2. License
Copyright 2004-2012 SHIROUZU Hiroaki All rights reserved.
Copyright 2014-2016 Kengo Sawatsu All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
 IN NO EVENT SHALL SHIROUZU Hiroaki OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
xxHash Library
Copyright (c) 2012-2014, Yann Collet
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.

Copyright (c) 2013 Raivis Strogonovs
Simple Smtp for Qt5 source repository : https://github.com/xcoder123/SimpleSmtp_SSL_QT5
http://morf.lv
Permission is hereby granted, free of charge,
to any person obtaining a copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense,and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies
or substantial portions of the Software.

IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY,WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
QBlowfish is licensed under the MIT License
Copyright © 2012 Roopesh Chander
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject
to the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
3. Environment
Compiled with CentOS7(x64).
need Library as follows.
Qt 5.4.2 or later
libacl-devel
libbsd-devel
4. Install/Uninstall
I hope that your compile is going well:)
5. Usage
Source / DestDir
Specified Source(s) / DestDir by D&D or FileDialog.
If you want to add files/dirs to the Source field by using drag and drop, simply drop with pushing Ctrl key.
You can also drag & drop to DestDir field.
You can not specify a symbolic link directly to the Source and DestDir.
(Please refer to the handling of symbolic links.)
Regarding different behavior whether the end of DestDir character is '/' or not.
Source is one directory and the end of DestDir character is NOT '/'
Copy source directory's contents to DestDir.
(DestDir/Contents_of_SourceDir)
Other cases
Copy source directory that including it self to DestDir.
(DestDir/SourceDir/Contents_of_SourceDir)
Operation mode
| Mode | Detail |
|---|
| Diff (No Overwrite) |
Copy if the same filename doesn't exist in destination. |
| Diff (Size/date) |
Copy if size or date is different, or if it doesn't exist (default) |
| Diff (Size) |
Copy if source filesize is different.
This mode requires "LTFS" checking. | |
| Diff (Newer) |
Copy if source date is newer or doesn't exist. |
| Copy (Overwrite all) |
Always copy/overwrite all. |
| Sync (Size/date) |
Copy if size or date is different, or doesn't exist.
In addition, delete all destination files/directories that don't exist in source. |
| Verify(Size) |
Don't run Copy. verify only.
In verify mode, this process is following differences as an error.
Different file size
File or folder exists in the Source, but is not present in DestDir
Unauthorized file of verification results
|
| Move (Overwrite all) |
Always copy/overwrite all and delete all copied source files. (It is able to change "Move (Overwrite all)" -> "Move (Size/date)" in settings dialog.) |
| Delete |
Delete all files/dirs by force. |
Buttons & Options
| Execute |
The copy operation is executed. While copy is executing, this button changes "Cancel..." button.
|
| Listing |
The files and directories list that will be copied and deleted are displayed.
output reference is here (Compare file pairs that will be skipped(except skipping by filter), if this button is pushed with pushing Ctrl key(button label "listing" -> "listing+v"(*2))) |
| Buffer size |
Specify the size(MB) of the main buffer for Read/Write oprations. |
| Speed Control |
Specify "Full Speed", "Auto Slow"(*1), "9"~"1", "Suspend".
If you feel it is hogging resources, it is recommended to set to "Auto Slow" (If it detects mouse moving/active window changing (and fastcopy window isn't foreground), it is slowed down).
If "Full Speed" isn't selected, low process priority class is set. (This setting is not saved by job manage) |
| NonStop |
Don't interrupt even if errors occur by Read/Write/Delete, and keep processing as much as possible.
(However, errors are displayed in the main window, and recorded in the error log.) |
| Verify |
Verify written files data.
By default, verify with MD5.
You can choose any of the hash algorithm in Settings->General Settings->I/O configuration.
... Action detail: Read(Src) -> MD5(Src) -> Write(Dst) -> Read(Dst) -> MD5(Dst) -> Compare MD5(Src/Dst)
(Of course, all actions are processed in parallel as much as possible)
|
| Estimate |
Display the estimated complete time. This means will cause RapidCopy to investigates source tree before starting. |
| Top |
RapidCopy window is always top-level. |
| Start at once |
Start at once without waiting for the finish of other RapidCopy instance(s) executing. (This button doesn't show when other RapidCopy isn't copying.) |
| "?" |
Show help |
(*1)It is slowed if RapidCopy window isn't foreground and it is detected mouse moving, by waiting beetween I/O, changing process priority, and changing maximum I/O size.
(*2)"Listing+V" mode is backward compatibility feature of the Windows version users. We recommend the use of the verify mode in RapidCopy.
| ACL |
Copy Access Control List.
|
| EA |
Copy EA(Extended Attribute).
notes:If target file contains ACL, copy ACL.
|
| LTFS |
Copy from/to Linear Tape File System(LTFS)
EA,ACL,Speed Control is disable.
Diff copy that uses the date can not be selected under LTFS.
Replace LTFS Prohibit char to '_'.
Please refer to the BBS for LTFS support information. |
| Wipe & Delete (prevent deleted files reviving) |
Rename filename and Overwrite random data before deleting. EA isn't overwritten. If NSA method is checked in setting dialog, Overwriting Random data process runs two times, and overwriting NULL data process runs once.
|
Symbolic link
| Mode | Actions |
|---|
| Diff/Copy |
By default,copy the symbolic link as link.(*1)
| | Move |
Always move the alias and symbolic link itself. |
| Delete |
Always remove the alias symbolic link itself. |
(*1):Will be the behavior of --recreate options equivalent of below is always active.
Hardlink
HardLink can be reproduced as much as possible, if specify "linkdest=1" in configuration file.
(In running, "TotalFiles:" format changes "number_of_files (number_of_dirs)" to "number_of_files / number_of_created_hardlinks (number_of_dirs)").
Please note that consumes 10MB about memory at the maximum per hard link entity 10000 files. (Path length dependent).
If "linkdest" option is enabled, --recreate is enabled tacitly.
File -> Open New Window
Open In New Window.
If you are running copy.you can't use this function.
File -> Save Bug Report
generate Bug Report Data.
Generate file to "$HOME/Desktop/YYYYMMDD-HHMMSS.zip"
JobMng -> Manage Single Job
Register/Restore parameters in main window as named job.
| Add/Modify |
Add/Modify prameters in main window(Source/DestDir, Operation mode, Buffer size, Nonstop/Verify/Estimate/ACL/AltStream/Wipe&Delete/Filter checkboxes, Filter strings, HDD mode) as named job. |
| Delete |
Delete registered job. |
JobMng -> JobList Mode
Save a set of job as JobList and run JobList as copybatch.
Job order can be changed.
JobList
Load job list, save, and delete.
| Create/Save List |
Create/save the contents of the current job list. |
| Delete list |
Delete current job list.
When deleting the job in the job list is all will be removed.
(If the job of the same name outside the deleted job list exists, it does not delete) |
| Force Launch |
If check off, a fatal error occurs in any of the job(ex:Src/Dst path invalid, memory allocate error), it does not start all subsequent job.
Please check to think well the order dependent.
|
JobList Edit
Adding a job to job list, delete, reorder,running etc..
Support D&D reorder.
| Add Job |
Add the contents of the current main window as a new job in the job list under the name of YYYYMMDD_HHMMSSZZZ. |
| Execute JobList |
Runs current job list. If job list is running,it will cancel button. |
| Cancel JobList |
Cancel current job and cancel all later job.
note:Can't cancel executed job(s). |
| Double click job in joblist |
change the name of the selected job. |
| Up key while holding down the Option(Alt) key |
It will raise the execution order of the job. |
| Down key while holding down the Option(Alt) key |
It will reduce the execution order of the job. |
| Drag and Drop in Job order |
Swap order. |
| Delete Job |
Delete job from the job list. |
| Delete all Job |
Delete all jobs from the job list. |
Notice for Joblist Mode
When the job list mode execution of the behavior of existing functions are changed as follows.
| Start at once |
Force run without waiting for the completion of execution of other RapidCopy.
|
| cancel... |
Cancel current job.(If next job exists,next job will start)
|
| Post-Process |
E-Mail,Execute Command,Play Sound, Runs at job list ends. |
| Log Settings |
Detailed log:Generate YYYYMMDD-HHMMSS-[joblistname].log(csv)file in the job list ends.
If a fatal error, such as at each job src / dst path fraud occurs, the error contents are output to the standard log. |
| CLI |
--auto_close:It does not automatically end if even one in a job in the job list error has occurred.
--force_close:Forcibly quit after the end all of the job. |
| Confirm before execute dialog |
"Confirm before execute" dialog is not displayed regardless of the setting. |
Preferences
General settings. (change Default values, I/O parameters, and Copy Options, etc)
I/O Settings -> I/O Settings
Specifies the Read/Write size when reading and writing data.
| I/O unit (MB) | read/write request unit size for OS.
"I/O unit" * "OverLap I/O Num" is the [Max I/O size] for OS.
If it's too large, I/O errors will occur. Please carefully test and set it.
(Buffer size is required more than twice value of Max I/O Size) |
| OverLap I/O Num |
I/O performance(especially 10G Ether) is improved by LinuxAIO system call.
(If it is specified "1", use legacy read/write systemcall)
Note:Running multiple RapidCopy, It may cause I/O error due to insufficient resources in the kernel.
|
I/O Settings -> Verify mode
Select verify algroithm. Default is MD5
If you want to save CPU resources can be used to lower the CPU utilization by using the xxHash.
| Verify Mode | hash key length |
|---|
| SHA-1 | 160bit |
| MD5 | 128bit |
| xxHash | 64bit |
| SHA-2(256bit) | 256bit |
| SHA-2(512bit) | 512bit |
| SHA-3(256bit) | 256bit |
| SHA-3(512bit) | 512bit |
Log Settings
Default is "Write to Log" enabled.
Log output charset is UTF-8
| Number of history items Src/DestDir | need to restart |
| Write to Log(RapidCopy.log) | Write summary and error only. |
| Write EA(xattr) errors to Log | Write EA errors to Log. |
| Write ACL errors to Log | Write ACL erros to Log. |
| Write to detailed Log | Create the "Log/DATE".log file for each copy. If you check "verify", checksum add. |
| Write to detailed CSV |
Create the "Log/DATE".log file for each copy.
csv output format is no BOM and charset is UTF-8
It can be converted to xls using the data import feature of OpenOffice or LibreOffice
(Can't read the UTF-8 in MS Office) |
listup and detailed log format:
| + | Add file(including overwrite) |
| - | Delete file |
| Ends with "/" | Target is directory |
| Ends with "=>" | Target is HardLink |
| Ends with "->" | Target is Symbolic link |
Option -> Auto/Same/Diff HDD mode
Specify Auto/Same/Diff HDD mode(default: Auto).
Command + K shortcut toggles between disk modes (auto -> same -> diff ->...)
Option -> Swap Source<->DestDir
Swap Source for DestDir (for mutual update or etc).
Source/DestDir will be modified based on different behavior whether the end of DestDir character is '/' or not. (For example, If Source is "/Volumes/TEST/AAA/BBB" and DestDir is "/Volumes/TEST/AAA/BBB", then Source becomes "/Volumes/CCC/BBB" and DestDir becomes "/Volumes/TEST/AAA/")
If Source has two or more files/directories, this menu item is disabled.
Option -> Post-Process
Select Post-Process.
Set the action, such as sound settings and command execution or Email sending.
Also, user can add new Post-Process settings.
Sound play after running command. (reverse execution is the windows version)
Option -> Post-Process -> Execute Command
Execute commands in the background by handing it over to /usr/bin/sh
If you execute multi commands,You can separate by semicolon(";")
Option -> Post-Process -> Play Sound
Play any sound at the end.
Support file format is wav
Option -> Post-Process -> E-Mail
E-mail send a copy result.
Transmission protocol only support SMTPS.
gmail account only confirmed the operation. Configuration examples please refer to the following.
Option -> Show Filter
Specify the enable / disable of various filters.
Note: It is always disabled in move mode.
| Include |
Copy only the files/directories that match up specified strings(UNIX Wildcard style).
If you want to specify two or more strings, please use semicolon as separator.
If you want to specify directories, please add '\' to the end of directory name.
Note:If you specify a folder to Include/exclude filters, only the first matching folder is the copy target. (even if there is more than one match folder you will copy only the first match folder)
(For example: *.txt; My Folder [0-9]\)
|
| Exclude |
Don't copy the files/directories that match up specified strings. |
| FromDate |
Don't copy the files that timestamp are older than specified date(format).
This can be specified by not only absolute format ("20090322") but also by relative format (10days before ... "-10D"). |
| ToDate |
Don't copy files with timestamps newer than this specified date. |
| MinSize |
Don't copy the files with sizes that are smaller than specified size.
High number can be abbreviated using K/M/G/T character (Kilo/Mega/Giga/Tera). |
| MaxSize |
Don't copy the files with sizes bigger than specified size. |
Include/Exclude filter(wildcard) format.
| * | Zero or more arbitrary characters |
| ? | One arbitrary character |
| [abc] | One character in "abc" |
| [^abc] | One character except "abc". |
| [a-z] | One character in "abc...xyz" |
| [0-9] | Any single character up to "0-9" |
| \ | Escape character (However, if '\' is the end of string character, it means a directory) |
（Note:Wild card specification same as QtFramework QRegExp::WildcardUnix)
FromDate/ToDate filter format.
| Absolute | Specify "YYYYMMDD"(year/month/day). ex) "20090101" |
| Relative | Specify "+|- number W|D|h|m|s".
W|D|h|m|s means Weeks/Days/hours/minutes/seconds.
ex) "-12h" (This is case sensitive.) |
6. Command Line
A basic format is as follows.
RapidCopy [--options] [--to DestDir] Source1 Source2 …
1. Delimiter is blank character. Path name that contains a space character, escaped with a '\'
2. If you start from the terminal, the terminal side until the end by default GUI operation will be a wait state.
If you want to include in shell scripts, etc., please use the background execution and --auto_close and --force_close as necessary.
Supported options are as follows.
-h,--help … display help.
--cmd (noe|dif|upd|for|syn|ves|mov|del) …Specify operation mode.
（By default, "dif" is used. If "del" is specified, then "--to" option isn't used.）
| Operation Mode | GUI display |
|---|
| noe | Diff (No Overwrite) |
| dif | Diff (Size/date) |
| siz | Diff (Size) (*1) |
| upd | Diff (update) |
| for | Copy (Overwrite) |
| syn | Sync (Size/date) |
| ves | Verify (Size) |
| mov | Move (Overwrite) |
| del | Delete |
(*1)require "--ltfs true"
--auto_close ... Close automatically after execution is finished with no errors.
--force_close ... Close automatically and forcedly after execution is finished.
--open_window ... Don't stored in the task tray.
--estimate ... Estimate complete time.
--no_exec ... Don't start to execute.
--no_confirm_del ... Don't confirm before deleting.
--no_confirm_stop ... Don't Show error dialog, Even if critical errors occurred.
--error_stop (true|false) ... Show error dialog (and operation is interrupted), if an error occurred.
--bufsize N(MB) ... Specify the size(MB) of the main buffer for Read/Write opration.
--log (true|false) … Write the operation/errors information to the standard logfile(RapidCopy.log).
--logfile standardlogfilename ... Specify the filename of standard logfile.
--filelog (true|false|filename) ... Write to the detail filelog(detail of copy/delete files). It is stored YYYYMMDD-hhmmss-N.log in RapidCopy/Log directory. If using verify mode, write digest data as additional data. (To specify filelogname, --filelog filename).
--filecsv (true|false) ... Write to the detail filelog with csv format.Save destination and file name, please follow the instructions of --filelog.
If you specify a --filecsv you need to enable --filelog.
--skip_empty_dir (true|false) ... Skip to create empty directories when /include or /exclude option is used.
--job job_name ... Specify the job that is already registered.
--joblist joblist_name ... Specify the joblist that is already registered.
--force_start (true|false) ... Start at once without waiting for the finish of other RapidCopy executing.
--disk_mode (auto|same|diff) ... Specify Auto/Same/Diff HDD mode. (default:Auto)
--speed (full|autoslow|9-1|suspend) ... Specify speed control level.
--srcfile srcfiles.txt ... Specify source files by textfile. User is able to describe 1 filename per line. ( Attention: If a lot of files are specified, it will take many times to display/refresh Source display area.)
--include "..." ... Specify include filter.( details)
--exclude "..." ... Specify exclude filter.( details)
--from_date "..." ... Specify oldest timestamp filter. ( details)
--to_date "..." ... Specify newest timestamp filter. ( details)
--min_size "..." ... Specify minimum size filter. ( details)
--max_size "..." ... Specify maximum size filter. ( details)
--wipe_del (true|false) ... Rename filename and wipe(overwrite Random data) before deleting.
--acl (true|false) ... Copy ACL.
--ea (true|false) ... Copy EA(Extended Attribute).
--reparse (true|false) ... Copy Symlink as link. details）
--verify (md5|sh1|xxh|s22|s25|s32|s35|fal) ... Verify written files data
| Verify Mode | GUI display |
|---|
| md5 | MD5 |
| sh1 | SHA-1 |
| xxh | xxHash |
| s22 | SHA-2(256bit) |
| s25 | SHA-2(512bit) |
| s32 | SHA-3(256bit) |
| s35 | SHA-3(512bit) |
| fal | no Verify |
--linkdest (true|false) ...Reproduce hardlink as much as possible. details
--recreate (true|false) ... Change updating behavior "overwrite the target" to "delete and recreate the target". (If --linkdest option is enabled, this option is enabled by default.) If you want always to enable, write [main] recreate=1 in RapidCopy.ini.
--postproc (action_name|false) ... Specify post-process action name
--ltfs (true|false) ... Enable LTFS.
--nodot (true|false) ... Skip "." start files or folders.
--xpos (xpos) ... Specifies window Xpos. Need to specify with --ypos.
--ypos (ypos) ... Specifies window Ypos. Need to specify with --xpos
Ex) Copy "/Volumes/srchdd" to "/Volumes/dsthdd" by "diff(Size/Date)" mode.
RapidCopyPro --cmd dif --to /Volumes/dsthdd/ /Volumes/srchdd
RETURN VALUES
When --auto_close or --force_close or command argument error, return value to parent process.
Meaning of the return code is as follows.
| return value | Explanation |
|---|
| 0(EX_OK) | no error(error files and error dirs are 0) |
| 64(EX_USAGE) | arguments error. |
| 79 | error(One or more errors has occurred) |
7. Change list from fastcopy v2.11
Change from the Windows version v2.11, adding, main specification list of deleted is as follows.
Add
Improved operability of GUI such as ProgressBar.
Write completion time in detail file Log (verify valid at the time of verification completion time).
Add new verify algorithm
Add new operation mode.
Add new Post-Process function E-mail sending.
Support Linear Tape File System(LTFS) mode.
Add Job List Mode.
Change
Assuming the evidence use of file corruption detection, changed the specification to record the details file Log in "list+v"
Delete or unsupported
Finder Extenstion is unsupport. (such as right-click menu)
Remove the ability to use the os cache.
Post-Process -> shutdown/standby is unsupport.
Copy behavior is different from the original.
8. Notes
In some modes, destination files that exist with the same filename in source directories, are overwritten forcedly without confirming.
In sync mode, destination files that don't exist with the same filename in source directories, are deleted forcedly without confirming.
In delete mode, target files and directories are deleted forcedly without confirming.
When an error interruption or cancellation during the execution of the copy that enable verification,
RapidCopy will skip the verification of the copied file.
In this case, it does not guarantee already integrity of the file.
If you want to guarantee the verification of the copied file, You should run RapidCopy at Verify mode.
Please use at your own risk. (See 2. License)
9. Misc
Configuration file( RapidCopy.ini)and the destination of the various log files is as follows.
| RapidCopy |
| Setting | $HOME/Documents/RapidCopy.ini |
| standard log | $HOME/Documents/RapidCopy.Log |
| detail file log and csv | $HOME/Documents/Log/YYYYMMMM-hhmmss-N.log |
RapidCopy output the file unconditionally regardless of the disk remaining capacity. Please note the remaining disk space.
Configuration file does not have compatibility in FastCopy.
10. Known bugs
11. ToDo
Refactoring Source.
Enhance perfomance at Verify mode.
Improved specification at the time of copy interrupt.
Relative Path Filter support(compatible with FastCopy v3.00)
GNOME,KDE desktop install support.
12. History
| Version | Summary |
| 1.3.0 | (2018/06/27)
Support Linux AIO
Support O_DIRECT flag for read/write(default:enable) thx Mr Shirouzu.
Optimize read/write performance(O_NOATIME,posix_fadvise...) etc..
Automatically scroll to the end of the input src/dst path
Bug fix.
silent crash at copy beggining,copy end(probably..)
"I/O unit" is always ignore and force set to "1".
When dst error caused. Copy operation stopped.
|
| 1.2.7 | (2018/03/07)
Fix force verify one by one.
Porting from RapidCopy for mac v1.2.6
Change Transinfo MB -> GiB
In the LTFS mode and convert prohibit char. one of the files before substitution is not saved.
When LTFS prohibit char convert detected contradiction,stop forced.
In the LTFS mode and convert prohibit char. Diff(No Overwrite,Size/date) Verify(Size) can't working
|
| 1.1.0 | FirstRelease(2016/3/2) |
|
|


---
layout: post
title: Creating a Mountain Lion development environment
date: '2013-09-16T11:40:00.000-07:00'
author: Mark Evans
tags:
- Apache
- postgres
- Mountain Lion
- python
- mod_wsgi
- RPy2
- Virtualenv
- Homebrew
- R
- Django
- MacOS
modified_time: '2013-09-16T11:40:44.035-07:00'
blogger_id: tag:blogger.com,1999:blog-8042776731714569314.post-1770331158845440331
blogger_orig_url: http://codexpython.blogspot.com/2013/09/creating-mountain-lion-development.html
---
So I had to set up a new dev environment at work on Mountain Lion. It uses the following components


Multi-stage cluster surveys of households are commonly performed by governments and programmes to monitor population-level demographic, social, economic, and health outcomes. Generally, communities are sampled from subpopulations (strata) in a first stage, and then households are listed and sampled in a second stage. In this typical two-stage design, sampled communities are the Primary Sampling Units (PSUs) and households are the Secondary Sampling Units (SSUs). Census data typically serve as the sample frame from which PSUs are selected. However, if census data are outdated inaccurate, or too geographically course, gridded population data (such as <http://www.worldpop.org.uk>) can be used as a sample frame instead. GridSample (<doi:10.1186/s12942-017-0098-4>) generates PSUs from gridded population data according to user-specified complex survey design characteristics and household sample size. In gridded population sampling, like census sampling, PSUs are selected within each stratum using a serpentine sampling method, and can be oversampled in urban or rural areas to ensure a minimum sample size in each of these important sub-domains. Furthermore, because grid cells are uniform in size and shape, gridded population sampling allows for samples to be representative of both the population and of space, which is not possible with a census sample frame.
| Version: | 0.2.1 |
| Depends: | R (≥ 3.2.3) |
| Imports: | rgdal (≥ 1.2-4), raster (≥ 2.5-8), data.table (≥ 1.10.4), rgeos (≥ 0.3-21), geosphere (≥ 1.5-5), sp (≥ 1.2-4), spatstat (≥ 1.49-0), methods, maptools (≥ 0.8-41), spatstat.utils |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-08-07 |
| Author: | Dana R. Thomson [aut] (University of Southampton), Nick Ruktanonchai [cre] (University of Southampton), Forrest R. Stevens [aut] (University of Louisville), Marcia Castro [aut] (Harvard University), Andrew J. Tatem [aut] (University of Southampton), Guilherme A. Zagatti [ctb] (Flowminder) |
| Maintainer: | Nick Ruktanonchai <nrukt00 at gmail.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| In views: | OfficialStatistics |
| CRAN checks: | gridsample results |
| Reference manual: | gridsample.pdf |
| Vignettes: |
Rwanda 2010 DHS |
| Package source: | gridsample_0.2.1.tar.gz |
| Windows binaries: | r-devel: gridsample_0.2.1.zip, r-release: gridsample_0.2.1.zip, r-oldrel: gridsample_0.2.1.zip |
| OS X binaries: | r-release: gridsample_0.2.1.tgz, r-oldrel: gridsample_0.2.1.tgz |
| Old sources: | gridsample archive |
Please use the canonical form https://CRAN.R-project.org/package=gridsample to link to this page.


| Home | Trees | Indices | Help |
|
|---|
|
|
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from |
|
|||
_parser = argparse.ArgumentParser()
|
|
|||
|
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
|
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Fri Sep 11 13:06:33 2015 | http://epydoc.sourceforge.net |


$1,200
Bake this show-stopping chocolate cake topped with decadent salted caramel and cookies. Perfect for celebrating a special occasion
Qty:
Add to Cart


Password Change Failed
There was a problem while changing your password. Please try to reset your password again.


==
We are programmers, IT specialists, and marketing and business gurus who go to work every day with only one goal in mind – business profitability. Our innovative business model allows us to give you the personal service and responsiveness of a small boutique firm and the speed, flexibility, and pricing of large overseas vendors. Here’s what sets us ahead of the pack:We’re attuned to the unique technology challenges faced by businesses today. We offer customized software development and support services tailored to your needs.
Our in-house speciality is to transform your ideas and concepts into lucrative products. From inception to production.
Creative, Artistic and Innovative. Our web design team is always ready to target any size project.
Initiate interaction with new prospects and convert them to paying customer. From Facebook to Yelp reviews, we can help you.
Whether we're buying your ideal domain or selling your premium domains for the best prices, we are here to assist you in the process.
With today’s technology your project can be the opportunity you need for business process improvement at any level. From better marketing communications and increased sales leads, to streamlined and automated fulfillment processes and data management – today’s web technology systems mean that the days of “online business cards” are over.
At Essential Customer Outreach we understand that your web development project plays a key role in the success of your business.


We are importers and Manufacturer Representation of General goods.
Opening hours
8am - 5pm(Weekdays)
8am - 3pm(Saturday)
Phone
08027214631
08038360494
<EMAIL_ADDRESS><EMAIL_ADDRESS>Location
A12a, Aspamda, Tradefair, Lagos State, Nigeria


Tottenham Hotspur to move for Marouane Fellaini?
Former Manchester United midfielder Marouane Fellaini has allegedly emerged as a transfer target for Tottenham Hotspur.
by Darren PlantSince arriving at the North London outfit in November, Jose Mourinho has insisted that he will not look to make major changes during the January window.
However, according to Dhnet, the Portuguese is interested in securing a reunion with a player who he worked with during his time at Old Trafford.
The report claims that contact was recently made with the Belgium international, who now plays for Shandong Luneng Taishan in the Chinese Super League.
While it is suggested that the 32-year-old remains happy with Taishan, Mourinho is said to be prioritising a player of Fellaini's style and stature.
With two years still remaining on his contract, Taishan remain in a strong position to keep hold of one of their star men.
body check tags ::


{% extends "layout.html" %} {% block page_title %} GOV.UK prototype kit {% endblock %} {% block content %} Dashboard Shift Log People Landing Tasks Meetings Logged in as: Martha Green, Offender Manager AB12345 Log out Book a meeting Who with? Ian Rider Dom Wilkins Vincent Carter Jason Richardson Michael Johnson Nathan Robinson Date of meeting Today Tomorrow Wednesday, 23/03/2017 Thursday, 24/03/2017 Friday, 25/03/2017 Time of meeting 9:00 9:30 10:00am 10:30am 11:00 11:30 Meeting place Library Wing B office Education Centre Meeting room 1 Meeting room 2 Meeting room 3 Any other details? Save and continue {% endblock %}


We can simulate from a branching process to form a data set of transmission trees or clusters (if we remove infector information from the transmission trees). We simulate \(K\) branching processes where the primary infector in each tree is the root of each transmission tree and the probability of infection of another individual is where \(\bf{X}\) is a covariate matrix and \(\beta\) is a vector of coefficients, \[ p_i = logit^{-1} (\bf{X}_i\bf{\beta}). \] Then the number of new infectious individuals infected by individual \(i\) is \[ N_i \sim Geometric(p_i). \]
To form a branching process, we begin with an initial infector who is the root node who we index as (1,1). We then draw \(N_{(1,1)} \sim Geometric(p_{(1,1)})\), the number of infections produced by individual (1,1). These infections are part of generation 2 and so will be given indices \((2, 1), \dots, (2, N_{1,1})\).
The infection proceeds by marching down the generations. We first draw \(N_{(2,1)}\) (if individual (2,1) exists) and give these new infections indices \((3, 1), \dots, (3, N_{(2,1)})\). We then draw \(N_{(2,2)}\) and assign them indices \((3, N_{(2,1)} + 1), \dots, (3, \sum_{i=1}^{2}N_{2,i})\). We repeat this process until all infections in generation 3 are achieved. We then repeat the process beginning in generation 4. This infection process is repeated until it naturally terminates (or too a maximum number of infections are drawn). This process is illustrated in the below figure.
Then the data for a single transmission tree is a matrix of size \(n\) where each row is the form \((label, g, i, \inf g, \inf i)\), where label denotes the individual and refers to her covariates, \((g,i)\) is the indexing of individual \(A\) and \((\inf g, \inf i)\) is the infector ID or is denoted by \(\emptyset\) to show that the infection originated from outside the cluster. For example, the above transmission tree \(T\) becomes \[ T = \left ( \begin{array}{ccccc} A& 1& 1& \emptyset& \emptyset&\\ B& 2& 1& 1& 1\\ C& 2& 2& 1& 1\\ D& 3& 1& 2& 2\\ E& 3& 2& 2& 2\\ F& 3& 3& 2& 2\\ G& 3& 4& 3& 1 \end{array}\right ), \] where \(\emptyset\) means we assume the infection originates from the outside.
Because we know the transmission tree, we know \(N_{g,i}\), the number of infections transmitted by indivdual \((g,i)\). In terms of our above matrix \(T\), this is found by counting the number of infector generation, index pairs that equals the individual’s own generation, index pair. For example, in the above, \(N_{(1,1)} = 2, N_{(2,1)} = 0, N_{(2,2)} = 3, N_{(3,1)} = 1, N_{(3,2)} = 0, N_{(3,3)} = 0, N_{(4,1)} = 0\). The likelihood is then the product of independent geometric random variables with different probabilities of success \(p_i\), \[ L(T) = \prod_{j=1}^n (1-p_j)p_j^{N_j}, \] where we use \(j\) as the label of the individual.
In practice, we do not see the transmission tree \(T\) but are instead working with a missing data problem. We observe a cluster \(C\) of individuals, which is a collection of individuals along with their covariates. With respect to the above example matrix of \(T\), we would say \(C\) is a subset of \(T\), specifically \(C = (A, B, C, D, E, F, G)^T\). We say that the size of \(C\) is the number of individuals, \(|C| = n\) or 7 in the above example. We neither know the generation-index pairs nor the infector IDs of the individuals.
We thus compute the total likelihood \(\mathcal{L}(C)\) of a cluster, which is equal to the sum of the likelihood across the set of all permissible transmission trees, \(\mathcal{T}_C\), \[ \mathcal{L}(C) = \sum_{T \in \mathcal{T}_C} L(T). \]
We say a transmission tree \(T \in \mathcal{T}_C\) is permissible if it is a possible outcome of our data generation process. More specifcially, a transmission tree \(T\) is permissible if it satifies the following criteria,
Ex. \(C = (A,B,C)\) where individual \(A\) has \(X_A = 1\) and individuals \(B\) and \(C\) have \(X_B = X_C = 0\)
The below figures shows the different trees in \(\mathcal{T}_C\) where \(|C| = 3\). The size of \(\mathcal{T}_C\) is \(|\mathcal{T}_C| = 12\) if we consider individuals \(A\), \(B\), and \(C\) to be distinguishable from one another. If we say individuals \(B\) and \(C\) are indistinguishable from one another because they have the same value of \(X_i=0\), then there are only 6 unique transmission trees.For observed independent clusters \(C_1, \dots, C_M\), we would like to find the maximum likelihood estimate (MLE) of \(\beta\) \[ \hat{\beta}^{(MLE)} = \arg \max_\beta \prod_{m=1}^M\mathcal{L}(C_m). \]
However, if \(|C_m| > 15\), this is infeasible because the space of \(| \mathcal{T}_C|\) is too large. We can instead sample permissible transmission trees to solve an equivalent problem, maximizing the average likelihood.
Let the average likelihood of a single cluster \(C\) be given by \[ \bar{\mathcal{L}}(C) = \frac{\mathcal{L}(C)}{|\mathcal{T}_C|} \] and note that since \(|\mathcal{T}_C|\) is not dependent on \(\beta\) then the MLE is the same for both \(\mathcal{L}(C)\) and \(\bar{\mathcal{L}}(C)\), \[ \hat{\beta}^{(MLE)} = \arg \max_\beta \prod_{m=1}^M\mathcal{L}(C_m)\\ = \arg \max_\beta \prod_{m=1}^M\frac{1}{|\mathcal{T}_m|}\mathcal{L}(C_m)\\ = \arg \max_\beta \prod_{m=1}^M\bar{\mathcal{L}}(C_m). \]
We approximate average likelihood for each cluster through Monte Carlo (MC) sampling. For a given cluster \(C\), we sample \(K\) MC trees \(T_1, \dots, T_K \in \mathcal{T}_C\)and form estimates \[ \hat{\mathcal{L}}_K(C): = \frac{1}{K} \sum_{i=1}^KL(T_i) \overset{a.s.}{\to} \bar{\mathcal{L}}(C). \]
We then form our estimate \(\hat{\beta}^{(MC)}\) from Monte Carlo (MC) samples from \(\mathcal{T}_C\), \[ \hat{\beta}^{(MC)} = \arg \max_\beta \prod_{m=1}^M\hat{\mathcal{L}}_K(Cm). \]
The result is that (hopefully) \(\hat{\beta}^{(MC)} \approx \hat{\beta}^{(MLE)}\) if \(K\) is large. However, the limits of branching processes are sometimes found to be ‘non-standard’, meaning non-normal. As such, we demonstrate the usefulness of our methods through simulations.


Deser contains lot of mud but camels go very nicely int he hot sun itss too hot jjdsndcmdjskl jdewodmioejdwe nudnwediowedj.
hello this ths is the best place ever seen in the worlg; i thorollow enfjot yr gernrkefner
hello this ths is the best place ever seen in the worlg; i thorollow enfjot yr gernrkefner
hello this ths is the best place ever seen in the worlg; i thorollow enfjot yr gernrkefner
hello this ths is the best place ever seen in the worlg; i thorollow enfjot yr gernrkefner


The Link Log, which forms part of the Link Control, can be enabled or disabled for each links. Once enabled it records the date and time that the link is clicked, as well as the first and last name of authenticated users. The Link Log is displayed on the Edit Item page of any logged links. Note: The following tutorials assume you are viewing the Link Control, either on a Settings page or whilst adding/editing an item such as a link on a module.
Important. The RadEditor has a different method for adding and managing link tracking.
To Enable the Link Log:
To Disable the Link Log:


More housing is needed in England and we support the Government’s policy that brownfield land should be prioritised for new homes. Our #WasteOfSpace campaign supports the launch of new research into the amount of brownfield land available for future development.
Browse our interactive map, showing areas of local disused land nominated by the public, that could be suitable for housing development.
Tweets by @CPRE


Manage apprenticeships
This guide shows how to make your service look consistent with the rest of GOV.UK.
Layout
Grid unit proportions, gutters and spacing.
Typography
Headings, body text, links, lists, inset text, hidden text.
Colour
Colour contrast, Sass variables, colour palettes.
Icons and images
Icons and image ratios.
Data
Data in a table, numeric tabular data, data visualisation.
Buttons
Button text, button alignment, creating buttons.
Form elements
Form fields, labels, focus states, radio buttons, checkboxes.
Errors and validation
Summary boxes, highlighting errors in forms.
Alpha and beta banners
How to create alpha and beta banners using the front-end toolkit.
Looking for the styles?
The Sass files for all the examples can be found on GitHub.


---
layout: page
title: Tyler Frazier
subtitle: Lecturer of Data Science
William & Mary
---
Welcome! My name is Tyler Frazier, and I am a Lecturer of Data Science at William & Mary, where I have generally practiced research and teaching in the area of population and development data science, since the spring of 2015. My research and teaching focus on the use of data science methods to describe, analyze, model and predict human and community scale, development patterns and processes, primarily using the programming languages python, R and java. While the scope of my research and teaching broadly focuses on population and development data science, my primary research focus is on the human development processes of West Africa with emphasis on the Republic of Ghana. Additionally, I am a member of the American Institute of Certified Planners (AICP).
For more information, please see my curriculum vitae.


| hook_pdfcrop {knitr} | R Documentation |
Hook functions are called when the corresponding chunk options are not
NULL
to do additional jobs beside the R code in chunks. This package
provides a few useful hooks, which can also serve as examples of how to
define chunk hooks in knitr.
hook_pdfcrop(before, options, envir) hook_optipng(before, options, envir) hook_pngquant(before, options, envir) hook_mogrify(before, options, envir) hook_plot_custom(before, options, envir) hook_purl(before, options, envir)
before, options, envir |
See References below. |
The function hook_pdfcrop()
calls plot_crop()
to crop
the white margins of PDF plots.
The function hook_optipng()
calls the program optipng
to
optimize PNG images. Note the chunk option optipng
can be used to
provide additional parameters to the program optipng
, e.g.
optipng = '-o7'
.
The function hook_pngquant()
calls the program pngquant
to
optimize PNG images. Note the chunk option pngquant
can be used to
provide additional parameters to the program pngquant
, e.g.
pngquant = '--speed=1 --quality=0-50'
.
The function hook_mogrify()
calls the program mogrify
. Note
the chunk option mogrify
can be used to provide additional parameters
to the program mogrify
(with default -trim
to trim PNG
files).
When the plots are not recordable via grDevices::recordPlot()
and we save the plots to files manually via other functions (e.g. rgl
plots), we can use the chunk hook hook_plot_custom
to help write code
for graphics output into the output document.
The hook hook_purl()
can be used to write the code chunks to an R
script. It is an alternative approach to purl
, and can be more
reliable when the code chunks depend on the execution of them (e.g.
read_chunk()
, or opts_chunk$set(eval = FALSE)
).
To enable this hook, it is recommended to associate it with the chunk option
purl
, i.e. knit_hooks$set(purl = hook_purl)
. When this hook is
enabled, an R script will be written while the input document is being
knit
. Currently the code chunks that are not R code or have the
chunk option purl=FALSE
are ignored. Please note when the cache is
turned on (the chunk option cache = TRUE
), no chunk hooks will be
executed, hence hook_purl()
will not work, either. To solve this
problem, we need cache = 2
instead of TRUE
(see
https://yihui.org/knitr/demo/cache/ for the meaning of cache =
2
).
The two hook functions hook_rgl()
and hook_webgl()
were
moved from knitr to the rgl package (>= v0.95.1247) after
knitr v1.10.5, and you can library(rgl)
to get them.
https://yihui.org/knitr/hooks/#chunk_hooks
rgl::rgl.snapshot
,
rgl::rgl.postscript
,
rgl::hook_rgl
,
rgl::hook_webgl
if (require("rgl") && exists("hook_rgl")) knit_hooks$set(rgl = hook_rgl) # then in code chunks, use the option rgl=TRUE


Freecell Solver version 3.14.0, shortly followed by Freecell Solver 3.14.1, which fixed a build problem on Microsoft Windows, have been released. Freecell Solver 3.14.1 is available in the form of a source archive, and a Win32 self-installing executable, from the download page. Freecell Solver is an open source framework (library and some command line applications), for automatically solving several variants of card Solitaire / Patience games, including Freecell.
This release features several new features: we added a 6th Best-First-Search weight of the inverse of the number of cards not above parents, which has proven useful. We now also allow test groups inside the --tests-order and --depth-tests-order with the random-dfs scan to be ordered using the function =asw(…) based on those BeFS weights.
As a result, the preset -l amateur-star or -l as for short has been added, that uses that and is our fastest preset yet. Another new preset is -l micro-finance (or -l mf for short), which yields especially short solutions.
There are also some not-as-major features: input boards can now contain a leading colon (":") at the beginning of the line of columns, so they can be copy-and-pasted directly from the output of fc-solve with the -p flag. The dbm_fc_solver and depth_dbm_fc_solver now store the positions more compactly (which aided in researching two-freecell deals), and the core libfreecell-solver code was made more 64-bit enabled and many of the limits were converted to 64-bit friendly ones.
A final note: we have dropped support for building Freecell Solver with Microsoft Visual C++ and other non-GCC compatible compilers, which do not support the newer C standards, and other useful features of GCC. Building Freecell Solver with GCC, clang and other compatible compilers will be continued to be supported on Microsoft Windows as well as on Linux and other UNIX-like systems.
More information about all these can be found in the distributed documents of Freecell Solver.
Enjoy!


This starter project comes with simple tabs-based layout for apps that are going to primarily use a Tabbed UI.
new testing


--- lang: en-us layout: default-en title: 'meem | Customer Voice' description: Talk to our Customer Voice team for all of your complaints. social-audio: social-video: social-media: - tw-summary: 'Learn more about the story of meem, our shareholders, our values and what people say about us.' tw-title: 'meem | About Us' permalink: /en/meem-customer-care-en.html alt_url: /ar/meem-customer-care-ar.html sitemap: exclude: ---
At meem, it's all about you. Therefore, we are here to receive all of your complaints. Once a complaint is logged, it will take us not more than 10 business days to resolve it.
You can reach us through any of the following channels:
• Phone: In KSA: 920026336 or Internationally: +966920026336
• Chat: through meem app or meem web banking.
• Social media: ( Twitter, Facebook, and Instagram): @meem
• Email<EMAIL_ADDRESS>• Or you can send your message by filling the form below:


Log In
Boston Institute for Nonprofit Journalism
Reporting incubator and convener boosting independent media and journalists in Greater Boston
Filter
List
Filter stories by...
Story type
Author
Publication
Active Stories


|
ViennaCL - The Vienna Computing Library
1.5.2
|
Base class for mapping binary leaves (inner product-based, matrix vector product-base, matrix-matrix product based...) More...
#include <mapped_objects.hpp>
Public Member Functions | |
| mapped_binary_leaf (std::string const &scalartype) | |
| mapping_type const & | mapping () const |
| scheduler::statement const & | statement () const |
| scheduler::statement_node const & | root_node () const |
| std::string | generate_default (std::pair< std::string, std::string > const &) const |
Protected Attributes | |
| node_info | info_ |
Base class for mapping binary leaves (inner product-based, matrix vector product-base, matrix-matrix product based...)
| mapped_binary_leaf | ( | std::string const & | scalartype | ) | [inline] |
| std::string generate_default | ( | std::pair< std::string, std::string > const & | index | ) | const [inline, virtual] |
Implements mapped_object.
| mapping_type const& mapping | ( | ) | const [inline] |
| scheduler::statement_node const& root_node | ( | ) | const [inline] |
| scheduler::statement const& statement | ( | ) | const [inline] |
node_info info_ [protected] |


Button Types
The default button does not require modifier. Use buttonType="emphasized",
buttonType="host", buttonType="positive",buttonType="attention", buttonType="transparent" or
buttonType="negative"
to modify the type of the button.
Use label="text"
to give label to the button.
Button Sizes
Button support two sized: compact and cozy. Use contentDensity="compact"
to set the values.Use label="text"
to give label to the button.
Button with Icons
Use
glyph="icon-name"
to add an icon to the button and
use label="text"
to give label to the button.
glyphPosition="before"
before and after are used to
place the icons beside label.
Button State
'disabled' and 'selected' states can be achieved through 'disabled' / 'ariaDisabled' and 'ariaSelected'
attributes.Use label="text"
to give label to the button.
Button with long text truncated
When user specifices width of the button then text will start truncating to accomadate it self in the
specified
width as shown below.
Use label="text"
to give label to the button.


- setBorderThickness(int) - Method in class ovalButton.OvalButton
-
Set the thickness of the border on the button.
- setColorBorderHighlighted(Color) - Method in class ovalButton.OvalButton
-
Set the border color that will show whenever the button is marked as being
highlighted (will remain this color even after the mouse exits).
- setColorBorderNormal(Color) - Method in class ovalButton.OvalButton
-
Set the main border color of the button.
- setColorHighlighted(Color) - Method in class ovalButton.OvalButton
-
Set the color of the button when it is highlighted (hovered over etc.).
- setColorNormal(Color) - Method in class ovalButton.OvalButton
-
Set the main color of the button.
- setHighlightedBorder(boolean) - Method in class ovalButton.OvalButton
-
- setRadius(double) - Method in class ovalButton.OvalButton
-
Set radius of the capsule-shape button.
- shape - Variable in class ovalButton.OvalButton
-
Shape of this button.
- SHAPE_CAPSULE - Static variable in class ovalButton.OvalButton
-
Specify that the button has capsule-like shape.
- SHAPE_OVAL - Static variable in class ovalButton.OvalButton
-
Specify that the button has oval shape (default).


Truncate a string
Truncate a string (first argument) if it is longer than the given maximum string length (second argument).
Return the truncated string with a ... ending.
Note that inserting the three dots to the end will add to the string length.
However, if the given maximum string length num is less than or equal to 3,
then the addition of the three dots does not add to the string length in determining the truncated string.
Remember to use Read-Search-Ask if you get stuck. Write your own code.
Here are some helpful links:
String.prototype.slice()


I have 3 years working in the print industry. One year as full-time Graphic Designer, the other 2 years were as a customer service representative. That means I have practice communicating with clients and understand the complexity of color across media.
One of my favorite things to do is help family or friends with their projects. I’ve been doing freelance since 2015. My work includes branding, announcements, and other materials as needed.
Interaction design is the next thing I hope to explore. I enjoy personal developement. To illustrate that, you may be interested to know that I used this porfolio to learn & practice my basic HTML, CSS, and Javascript skills. It's been a fun challenge.
10 week immersive User Experience Design course. This included 5 projects, during a 9-5 work day 5 days a week.
This is where I got the bulk of my design experience specifically in print. I worked a lot in cross-functional teams, discovered my own design process and honed my abilities in design thinking to solve business and client communication problems. Discovering, understanding, and defining the actual problem is a big aspect in any UX position.
As an intern at Deseret Digital Media I learned what a creative and deadline drivien atmosphere felt like. I was specifically part of Story Lab where we tested new ways to tell stories. I worked on video, flat or vector design for infographics, and social media posts.
This was an internship at a branding studio in Guadalajara Mexico. What an adventure! I Loved learning from an international team, eating Mexican street food, and practicing my Spanish. I continued to develop my love for typography at Cocoa Branding.
UX Designer
Oh, and in my free time... I love the outdoors. Rockclimbing has been a hobby of mine as of late. I’d love to try kite boarding or surfing next!


{% extends 'base.html' %} {% block content %} {{block.super}}
{{business.description}}
{{business.email}}
Posted by: {{business.biz_person}}


Forest of the Lost [aq60], forest, in Imperia, peasants: 144
Last updated Turn #125
Forest of the Lost [aq60], forest, in Imperia, peasants: 144
------------------------------------------------------------------------
26: Stack of nazgul [ik8z], nazgul, number: 5, went north.
30: The population grows by one peasant.
Routes leaving Forest of the Lost:
North, forest, to Forest of the Lost [ap60], 8 days
East, forest, to Forest of the Lost [aq61], 8 days
South, forest, to Forest of the Lost [ar60], 8 days
West, forest, to Forest of the Lost [aq59], 8 days
Inner locations:
Yew grove [ad8x], yew grove, 1 day
An Orc Stronghold [u54], orc-stronghold-in-progress, 100% completed,
owner:
Stack of orcs [jn1m], orcs, number: 188
Seen here:
Stack of nazgul [fs9t], nazgul, number: 3
Stack of nazgul [cr4e], nazgul, number: 3


|
BL3 SDK
0.0.1
Borderlands 3 Class Documentation
|
#include <BL3_OakGame_structs.hpp>
Public Attributes | |
| EFriendEventType | FriendEventType |
| EFriendEventPriority | Priority |
| unsigned char | UnknownData00 [0x2] |
| uint32_t | Ordinal |
| bool | ContainsSpoiler |
| bool | BroadcastToSingleFriend |
| bool | DisplayNotificationOnFriendHUD |
| bool | bAlwaysShowNotification |
| bool | DisplayEventOnTimeline |
| unsigned char | UnknownData01 [0x3] |
| struct FText | EventTitleText |
| struct FText | EventText |
| Public Attributes inherited from FTableRowBase | |
| unsigned char | UnknownData00 [0x8] |
| bool bAlwaysShowNotification |
| bool BroadcastToSingleFriend |
| bool ContainsSpoiler |
| bool DisplayEventOnTimeline |
| bool DisplayNotificationOnFriendHUD |
| struct FText EventText |
| struct FText EventTitleText |
| EFriendEventType FriendEventType |
| uint32_t Ordinal |
| EFriendEventPriority Priority |
| unsigned char UnknownData00[0x2] |
| unsigned char UnknownData01[0x3] |


move-result-object
Purpose
Move the object result of the most recent invoke-kind into the indicated
register. This must be done as the instruction immediately after an invoke-kind
or filled-new-array whose (object) result is not to be ignored; anywhere else
is invalid.
Details
| Op & Format |
Mnemonic / Syntax |
Arguments |
| 0c 11x |
move-result-object vAA |
A: destination register (8 bits) |
Constraints
-
A must be a valid register index in the current stack frame.
-
The instruction must be immediately preceded (in the code array) by an
invoke-kind, filled-new-array, or filled-new-array/range instruction.
-
The instruction must be immediately reached (in the actual control flow)
through returning from this invoke-kind instruction or by passing a
filled-new-array or filled-new-array/range instruction (it must not be
jumped to).
-
The result delivered by the invoke-kind instruction must be a reference
value (which excludes the case of a long and double values).
Behavior
-
The result delivered by the invoke-kind instruction is moved to register
vA, that, is vA' = result.
-
If register v(A-1) is the lower half of a register pair, register v(A-1)'
becomes undefined.
-
If register v(A+1) is the upper half of a register pair, register v(A+1)'
becomes undefined.
Exceptions
None.
Notes
This instruction can also be thought of as reading the contents of a special
"result" register that is made valid and defined by executing a non-void return
instruction or a filled-new-array instruction. The execution of any other
instruction (including this one) renders this special register invalid.


When a piece has gone around the board and reaches the lower part of the hallway of its color, it will begin to ascend through the boxes in it.
To enter the goal box the corresponding player will have to do so by counting the exact number of boxes that correspond to him in his movement, from the one in which he is to the central square of arrival: if the route was shorter than the number indicated by the dice, the movement would not take place.
When a piece reaches the final square of arrival, the player must advance any of his remaining number ten.
Only chips of that color may enter in the arrival hall of one color; therefore, catches are not possible in it. If in a series of successive rolls of 6, with the second movement of 6, a chip ends up in a square of the corridor of arrival of its color, and in the corresponding third roll another 6 comes out, said chip will not make any movement but neither will remain captured, as would happen if these circumstances concurred anywhere else on the board.
The game ends when a player manages to enter each of his chips in his respective final box. At any time you should be able to save the game state to a file and load it to continue a previously started game.