001 /* 002 * Licensed to the Apache Software Foundation (ASF) under one or more 003 * contributor license agreements. See the NOTICE file distributed with 004 * this work for additional information regarding copyright ownership. 005 * The ASF licenses this file to You under the Apache License, Version 2.0 006 * (the "License"); you may not use this file except in compliance with 007 * the License. You may obtain a copy of the License at 008 * 009 * http://www.apache.org/licenses/LICENSE-2.0 010 * 011 * Unless required by applicable law or agreed to in writing, software 012 * distributed under the License is distributed on an "AS IS" BASIS, 013 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 014 * See the License for the specific language governing permissions and 015 * limitations under the License. 016 */ 017 package org.apache.commons.configuration.tree; 018 019 import java.util.LinkedList; 020 import java.util.List; 021 022 /** 023 *
 024 * A specialized implementation of the {@code NodeCombiner} interface 025 * that constructs a union from two passed in node hierarchies. 026 *
 027 *
 028 * The given source hierarchies are traversed and their nodes are added to the 029 * resulting structure. Under some circumstances two nodes can be combined 030 * rather than adding both. This is the case if both nodes are single children 031 * (no lists) of their parents and do not have values. The corresponding check 032 * is implemented in the {@code findCombineNode()} method. 033 *
 034 *
 035 * Sometimes it is not possible for this combiner to detect whether two nodes 036 * can be combined or not. Consider the following two node hierarchies: 037 *
 038 *
 039 * 040 *
 041 * Hierarchy 1: 042 * 043 * Database 044 * +--Tables 045 * +--Table 046 * +--name [users] 047 * +--fields 048 * +--field 049 * | +--name [uid] 050 * +--field 051 * | +--name [usrname] 052 * ... 053 *
 054 * 055 *
 056 *
 057 * 058 *
 059 * Hierarchy 2: 060 * 061 * Database 062 * +--Tables 063 * +--Table 064 * +--name [documents] 065 * +--fields 066 * +--field 067 * | +--name [docid] 068 * +--field 069 * | +--name [docname] 070 * ... 071 *
 072 * 073 *
 074 *
 075 * Both hierarchies contain data about database tables. Each describes a single 076 * table. If these hierarchies are to be combined, the result should probably 077 * look like the following: 078 *
 079 * 080 *
 081 * Database 082 * +--Tables 083 * +--Table 084 * | +--name [users] 085 * | +--fields 086 * | +--field 087 * | | +--name [uid] 088 * | ... 089 * +--Table 090 * +--name [documents] 091 * +--fields 092 * +--field 093 * | +--name [docid] 094 * ... 095 *
 096 * 097 *
 098 *
 099 * i.e. the {@code Tables} nodes should be combined, while the 100 * {@code Table} nodes should both be added to the resulting tree. From 101 * the combiner's point of view there is no difference between the 102 * {@code Tables} and the {@code Table} nodes in the source trees, 103 * so the developer has to help out and give a hint that the {@code Table} 104 * nodes belong to a list structure. This can be done using the 105 * {@code addListNode()} method; this method expects the name of a node, 106 * which should be treated as a list node. So if 107 * {@code addListNode("Table");} was called, the combiner knows that it 108 * must not combine the {@code Table} nodes, but add it both to the 109 * resulting tree. 110 *
 111 * 112 * @author Commons 114 * Configuration team 115 * @version $Id: UnionCombiner.java 1206486 2011-11-26 16:41:12Z oheger $ 116 * @since 1.3 117 */ 118 public class UnionCombiner extends NodeCombiner 119 { 120 /** 121 * Combines the given nodes to a new union node. 122 * 123 * @param node1 the first source node 124 * @param node2 the second source node 125 * @return the union node 126 */ 127 @Override 128 public ConfigurationNode combine(ConfigurationNode node1, 129 ConfigurationNode node2) 130 { 131 ViewNode result = createViewNode(); 132 result.setName(node1.getName()); 133 result.appendAttributes(node1); 134 result.appendAttributes(node2); 135 136 // Check if nodes can be combined 137 List<ConfigurationNode> children2 = new LinkedList<ConfigurationNode>(node2.getChildren()); 138 for (ConfigurationNode child1 : node1.getChildren()) 139 { 140 ConfigurationNode child2 = findCombineNode(node1, node2, child1, 141 children2); 142 if (child2 != null) 143 { 144 result.addChild(combine(child1, child2)); 145 children2.remove(child2); 146 } 147 else 148 { 149 result.addChild(child1); 150 } 151 } 152 153 // Add remaining children of node 2 154 for (ConfigurationNode c : children2) 155 { 156 result.addChild(c); 157 } 158 159 return result; 160 } 161 162 /** 163 *
 164 * Tries to find a child node of the second source node, with which a child 165 * of the first source node can be combined. During combining of the source 166 * nodes an iteration over the first source node's children is performed. 167 * For each child node it is checked whether a corresponding child node in 168 * the second source node exists. If this is the case, these corresponding 169 * child nodes are recursively combined and the result is added to the 170 * combined node. This method implements the checks whether such a recursive 171 * combination is possible. The actual implementation tests the following 172 * conditions: 173 *
 174 *
 175 *
 176 *
In both the first and the second source node there is only one child 177 * node with the given name (no list structures).
 178 *
The given name is not in the list of known list nodes, i.e. it was 179 * not passed to the {@code addListNode()} method.
 180 *
None of these matching child nodes has a value.
 181 *
 182 *
 183 *
 184 * If all of these tests are successful, the matching child node of the 185 * second source node is returned. Otherwise the result is null. 186 *
 187 * 188 * @param node1 the first source node 189 * @param node2 the second source node 190 * @param child the child node of the first source node to be checked 191 * @param children a list with all children of the second source node 192 * @return the matching child node of the second source node or null 193 * if there is none 194 */ 195 protected ConfigurationNode findCombineNode(ConfigurationNode node1, 196 ConfigurationNode node2, ConfigurationNode child, List<ConfigurationNode> children) 197 { 198 if (child.getValue() == null && !isListNode(child) 199 && node1.getChildrenCount(child.getName()) == 1 200 && node2.getChildrenCount(child.getName()) == 1) 201 { 202 ConfigurationNode child2 = node2.getChildren( 203 child.getName()).iterator().next(); 204 if (child2.getValue() == null) 205 { 206 return child2; 207 } 208 } 209 return null; 210 } 211 }


Me and my cousin bought a bottle of Yellow Jacket capsules at a local gas station. I had heard these were named after some sort of speedy drug used back in the 70s. Anyway, we split them between the two of us (seven pills each)and we each had one the first night.
It was great. The small size of the capsule does not do any justice to their strength. It felt like a sugar high and a good dose of caffeine all rolled into one. The effects set on about 40 minutes after ingestion. It was a nice speedy feeling. My mind was clear and sharp, and my body had the energy I love to have but rarely do.
The six remaining yellow jackets helped pull me through my senior year in high school.  Then I'd have to go to school in the morning. I would pop a yellow jacket at the beginning of the day, and it would give me the boost I needed to start off, and would seem to last most of the school day. They didn't only provide energy, but it also seemed to act as a mood lifter as well.
One night in particular I remember working on a final project for a class. I popped a yellow jacket and took a bath and read a bit until the effects came in. 45 minutes later (I was keeping track of the time with my stopwatch) the effects came in--I could feel and hear my heartrate increase and I was no longer semi-tired or unmotivated. I went to my computer and turned out a 20-page paper.
For all my love of yellow jackets, I never went over the recommended dose. One capsule was the perfect amount. It provided the exact sort of kick I wanted and expected. Those six pills lasted me three or so months, primarily because I knew I shouldn't depend on them for energy. I'd ration them very carefully and only take one if I really needed it. Needless to say, they weren't a recreational drug, but instead a performance enhancing drug.
The I had few side effects. The main one I noticed was the shakes when I was on an ephedra kick. I expected as much -- I had so much energy it had to go somewhere while I was just sitting around. Also, I wasn't hungry at all while on one, but I made myself drink at least a glass of water to make sure there weren't any nasty consequences. To me, ephedra is in no way a recreational drug. It is extremely effective at boosting energy.
Now if only that gas station still sold them...
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


|
PU2CLR Si4735 Arduino Library 2.1.4
Arduino Library for Si47XX Devices - By Ricardo Lima Caratti
|
This is a library for the SI473X and SI474X, BROADCAST AM/FM/SW RADIO RECEIVER, IC from Silicon Labs for the Arduino development environment. It works with I2C protocol and provides an easy-to-use interface for controlling the SI47XX IC family.
This library was built based on Si47XX PROGRAMMING GUIDE-AN332 (REV 1.0) document from Silicon Labs.
It also can be used on all members of the SI473X and SI474X family, though the features you can use depend on which IC version you have. The functionality of each IC is outlined in the comparison matrix in table 1 (Product Family Function); pages 2 and 3 of the programming guide. If you need to build a prototype based on SI47XX device, see https://pu2clr.github.io/SI4735/
This library has more than 30 examples, and it can be freely distributed using the MIT Free Software model. Copyright (c) 2019 Ricardo Lima Caratti. Contact: pu2cl.nosp@m.r@gm.nosp<EMAIL_ADDRESS>This library uses the I²C communication protocol and implements most of the functions offered by Si47XX (BROADCAST AM / FM / SW / LW RADIO RECEIVER) IC family from Silicon Labs.
The main features of this library are listed below.
Some texts were extracted directly from the Silicon Labs documentation. The name of the Silicon Labs document and pages are described in the source code comments.


{% extends "base.html" %} {% block title %}Methodology{% endblock %} {% block content %}
My name is David Bradford and I am in my third semester of the Government Analytics master's program at Johns Hopkins University. I live in Berkeley, CA. Before starting the program, I worked for two years at a political consulting firm in San Francisco, implementing strategy for candidate and ballot measure campaigns. I am currently a Political Analyst Fellow at Crowdpac, a website that uses data to provide objective information on federal, state, and local candidates, such as where they stand on issues and who has donated to their campaign.
At the conclusion of my master's program, I plan on going into political polling or a more general data science field. I have a working knowledge of R, Stata, and SQL, and hope to become proficient in Python as well.


This stage of the set up allows you to decide how you would like to connect to CIX Forums.
Choose Access CIX Forums via dial up if you'd like to use your modem to connect directly to CIX Forums.
Choose Access CIX Forums via the Internet if you'd like to connect to CIX Forums via your Internet connection.
If you choose to connect using either option then Ameol will initially connect via the Internet. You can change this later if you prefer.
When you have made your choice, click Next to continue.


boooks
Home
Logout
Setting
My Books
All Books
Update profile:
City:
State:
Save changes
Change password:
Current password:
New password:
Save changes


Dashboard
Inventory
Live deliveries
Orders
User Profile
Sign out
Do you want to sign out of this session?


About
List
Add
About
Deep
Add
About
Cellar
Add
About
Last100
Add
About
Lists
Add
About My Beers
beer Web App using the jQuery Mobile JavaScript Library
Color key:
Green
at Home
Blue
at Mall
Yellow
at Suwanee
Purple
at Duluth
Orange
at Bev Super
Red
want it
Bottle
Draft
Can
Cask/Firkin
High Gravity
None or ?


| #93 |
upload 0.2a tarball & point docs to it
|
new
|
mmckerns
|
task
|
blocker
|
pathos-0.2a
|
| #16 |
provide programmatic installation of user-configured services
|
new
|
mmckerns
|
task
|
critical
|
pathos-dev
|
| #18 |
provide a master job registry
|
new
|
mmckerns
|
task
|
critical
|
pathos-dev
|
| #77 |
harden sshTunnel
|
new
|
mmckerns
|
enhancement
|
critical
|
pathos-0.3a
|
| #3 |
dill fails on weakrefs
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.5a
|
| #9 |
provide raw capabilities for filesystem exploration and reporting
|
assigned
|
mmckerns
|
task
|
major
|
pathos-0.4a
|
| #10 |
provide a translation service for environment variable in ssh calls
|
assigned
|
mmckerns
|
task
|
major
|
pathos-0.4a
|
| #14 |
provide mechanism for single point authentication
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #15 |
provide programmatic installation of dependencies to remote user space
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #17 |
provide node-to-node communication with publish/subscribe
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #20 |
provide capabilities for recovery and robustness of services
|
new
|
mmckerns
|
task
|
major
|
pathos-dev
|
| #23 |
grep is brittle in obtaining child-of-child's pid
|
new
|
mmckerns
|
defect
|
major
|
pathos-0.4a
|
| #24 |
abstract the RPC service interface
|
new
|
mmckerns
|
task
|
major
|
pathos-dev
|
| #25 |
provide generic mechanism for replicating 'login' environment
|
new
|
mmckerns
|
task
|
major
|
pathos-0.4a
|
| #28 |
dill fails on frame types
|
new
|
mmckerns
|
defect
|
major
|
pathos-0.5a
|
| #37 |
extend existing mapping strategies to all launchers
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.5a
|
| #38 |
provide monitoring and control of scheduled jobs
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.3a
|
| #39 |
provide raw capabilities for killing and restarting jobs
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #40 |
provide versioning repository interactor
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #41 |
provide egg interactor
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #42 |
provide zip interactor
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #43 |
provide basic capabilities for service factory deployment
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #44 |
provide basic capabilities for service deployment
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #45 |
provide basic capabilities for service management
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #46 |
provide service factories
|
new
|
mmckerns
|
task
|
major
|
pathos-0.4a
|
| #47 |
improvements on making remote connections
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.4a
|
| #50 |
pyina launchers should derive from Launcher.py
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #51 |
add ssh map to accompany the ssh launcher
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #56 |
add pyina support for pypar
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-dev
|
| #79 |
add monitoring by proxy
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #82 |
migrate base monitor from mystic to pathos
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #83 |
add rsync launcher
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #86 |
heterogeneous launch / map
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #88 |
incorporate any new use cases from srrietveld.job
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #89 |
check map strategies for logical bugs
|
assigned
|
mmckerns
|
verification
|
major
|
pathos-0.2a
|
| #94 |
add a real multithreaded launcher
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.5a
|
| #95 |
add tutorial examples for dill
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #96 |
add tutorial examples for pathos
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #97 |
add tutorial examples for pyina
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #98 |
add tutorial examples for pox
|
new
|
mmckerns
|
task
|
major
|
pathos-0.4a
|
| #100 |
provide conditional and probabilistic maps
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #121 |
add imap for MPI
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #122 |
add async map for MPI
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #126 |
add real pipe objects for ssh and ssh tunnel
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #128 |
add MPI pipes
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #130 |
serialize between python versions
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #133 |
decorator to sendmail when scheduled job is complete
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #134 |
ssh and ssh tunneled maps
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #135 |
gpu pipes and maps
|
new
|
mmckerns
|
task
|
major
|
pathos-0.3a
|
| #136 |
numpy vector pipes and maps
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #138 |
serialize with json
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.4a
|
| #140 |
zmq pipes and maps
|
new
|
mmckerns
|
idea
|
major
|
pathos-dev
|
| #143 |
finish and clean up docs in pyina
|
new
|
mmckerns
|
task
|
major
|
pathos-0.2a
|
| #150 |
use 'archive' dict in pyina's maps
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #152 |
move from tempfiles to pipes in pyina's maps
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #153 |
throw PicklingError if dill fails
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #154 |
deal with objects that "fake" a module name
|
new
|
mmckerns
|
defect
|
major
|
pathos-0.3a
|
| #159 |
add caching/archiving with MPI shared memory
|
new
|
mmckerns
|
idea
|
major
|
pathos-0.3a
|
| #160 |
add 'hydra-style' node proxies
|
new
|
mmckerns
|
enhancement
|
major
|
pathos-0.3a
|
| #1 |
add tests for speed
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #4 |
extend dill to more easily handle big arrays
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #19 |
provide network detection and load-balancing
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #30 |
lone pickling of a function declared inside a new-style class fails
|
new
|
mmckerns
|
defect
|
minor
|
pathos-0.5a
|
| #35 |
remove pyre dependency for "Launcher.py"
|
assigned
|
mmckerns
|
enhancement
|
minor
|
pathos-0.3a
|
| #48 |
look into paramiko for ssh bindings
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #52 |
explore more scalable parallel mapping algorithm
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #60 |
extend setup.py to RPyC
|
new
|
mmckerns
|
defect
|
minor
|
pathos-dev
|
| #62 |
add support for pyro
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #63 |
add cloud maps and pipes
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.5a
|
| #69 |
provide access to pp's print_stats()
|
assigned
|
mmckerns
|
idea
|
minor
|
pathos-0.5a
|
| #70 |
provide parallel & distributed logging
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.4a
|
| #73 |
provide script to detect current_dir & path
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #76 |
add map factories
|
assigned
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #78 |
return support for pyre.mpi
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-0.5a
|
| #85 |
allow use of "launcher" config file
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-0.4a
|
| #92 |
use the tools available in config to explore the $ENV
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #106 |
allow access of dill's types in multiprocessing
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-0.3a
|
| #109 |
python 3.x support for pathos
|
new
|
mmckerns
|
task
|
minor
|
pathos-0.5a
|
| #110 |
python 3.x support for pyina
|
new
|
mmckerns
|
task
|
minor
|
pathos-0.5a
|
| #112 |
better support for .job files in pyina
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-0.3a
|
| #120 |
add serial async map
|
new
|
mmckerns
|
task
|
minor
|
pathos-0.3a
|
| #124 |
python bindings for schedulers
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-dev
|
| #137 |
cython pipes and maps
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #139 |
add a timeit tool or decorator
|
new
|
mmckerns
|
idea
|
minor
|
pathos-dev
|
| #141 |
look into async pipe for standard python
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #144 |
make settings for ncpus nodes etc like make more sense
|
new
|
mmckerns
|
defect
|
minor
|
pathos-0.2a
|
| #145 |
make sensible map and pipe one-liners
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #151 |
cleanup (or remove) the use of settings in pyina's maps
|
new
|
mmckerns
|
enhancement
|
minor
|
pathos-0.2a
|
| #156 |
transfer mystic.monitors to pathos
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #158 |
support for pathos on BlueGene
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #161 |
add config file with machine-specific settings
|
new
|
mmckerns
|
idea
|
minor
|
pathos-0.3a
|
| #80 |
provide machine-specific launchers
|
new
|
mmckerns
|
idea
|
trivial
|
pathos-0.3a
|
| #125 |
replace use of `which python`
|
new
|
mmckerns
|
enhancement
|
trivial
|
pathos-0.3a
|


Apple Airmac ネットワーク User Manual Air Mac Networks Early2009 J
Wavelan Mac Os ドライバ解説
Molecules Free Full Text Ionic Liquids As Performance Ingredients In Space Lubricants Html
Kindle For Mac Free Download Review Latest Version
Jcm Free Full Text Preoperative And Postoperative Assessment Of Ultrasonographic Measurement Of Inferior Vena Cava A Prospective Observational Study Html


Good
! It is currently
Top News Story:
Stocks
Search
High
Low
Percent Change
Cryptocurrency
Search
Crypto Name:
This crypto search term is not supported, please choose from this list of options:
Retry Crypto Search
Crypto Currency
Search Term


Eric Boggs
My Status:
Status update:
Status update:
Eric is learning with
Quarantine Code
Status update:
Eric is feeling
good
!
Status update:
Eric is feeling
tired


Anytime is Train Time
Choo Choo. Chee Chee.
Current Train Schedule
Train Name
Destination
Frequency (min)
Next Arrival
Minutes Away
Remove
Add Train
Train Name
Destination
First Train Time (HH:mm - military time)
Frequency (min)
Submit


In this cc, I want to write up a couple problems from Emily Riehl's text Category Theory in Context that I've found particularly interesting over the last week. In some sense they feel "fundamental", and while their conclusions seem to be well-known I have had difficulty finding other proofs of these propositions from online searches.
The first problem is 4.6.iii in the text, which shows that representable functors from categories with all coproducts are described exactly by their left adjoints.
The second problem is 4.5.vii in the text, which has to do with the characterization of reflective subcategories, their adjoints, the notion of an essential image, and what it means to be a localization.
Unfortunately, I will assume some background with category theory in the discussion of these problems. Perhaps in the future I will try to make a digestible introduction to category theory, but at this point I am too naive to attempt anything like that .
(4.6.iii) Representable functors from categories with coproducts are described exactly by a left adjoint
This lemma is exciting and beautiful! In one direction the conclusion is trivial; in the other, some construction is needed. It reminds me heavily of the Yoneda lemma, with mathematical objects sitting at different orders of magnitude ending up encoding the same information.
$\text{Lemma.}$ Suppose $C$ is a locally small category with coproducts. Show that a functor $F\colon C\to\text{Set}$ is representable if and only if it admits a left adjoint.
$\text{Proof.}$ $(\Rightarrow)$ Suppose first that $F$ admits a left adjoint $L$. Then, denoting $\star$ to be the terminal object in $\text{Set}$Equivalently, $\star$ is the singleton set (which itself is defined up to unique isomorphism, of course)., the adjunction $L\vdash F$ yields the natural isomorphism
Where $C(L\star, -), \text{Set}(\star, F-)\colon C\to Set$ are the evident hom-functors. Indeed, the natural isomorphism $C(L\star, -)\cong F$ stipulates that $F$ is represented by $L\star$.
$(\Leftarrow)$ Conversely, suppose that $F$ is represented by an object $c\in C$. Let us define a functor $L\colon \text{Set}\to C$ as follows. Given a set $A$, $LA := \coprod_{a\in A} c$, the colimit of the discrete diagram indexed by $A$ into $C$ at the constant object $c$. Indeed this definition is admissible, for $C$ admits all coproducts.
For a set morphism $f\colon A\to B$, $Lf\colon \coprod_{a\in A}c\to \coprod_{b\in B}c$ is the unique morphism factoring the $A$-indexed cocone $c\Rightarrow \prod_{b\in B} c$ given by $\left\{\iota_{fa}\colon fa\hookrightarrow LB \right\}_{a\in A}$ through $LA$. For a morphism $f: A\to B$ where $A= \left\{a_1,a_2\right\}$, this can be visualized by the diagram
Indeed $L$ preserves identities, for $L 1_A$ uniquely factors the colimit cone under a particular diagram through that diagram's colimit, and hence $L 1_A$ must be the identity morphism on the colimit $FA$. Uniqueness of the universal property of colimits ensures that $Lg\circ Lf = L(g\circ f)$ for appropriate $f\colon A\to B, g\colon B\to D\in \text{Set}$ as well; $Lg\circ Lf$ and $L(g\circ f)$ both factor an $A$-indexed cone given by $\left\{\iota_{gfa}\right\}_{a\in A}$ through $LA$, but this factorization is unique.
Thus, $L$ as defined is functorial. To show $L\dashv F$, we will construct the counit $\epsilon\colon LF\Rightarrow 1_{\text{C}}$ and demonstrate that it observes a certain universal property; namely, that it defines an isomorphism
$\epsilon_d$ is an arrow $LFd\to d$, which is equivalently an arrow $\coprod_{C(c,d)} c\to d$. This description invites a natural construction; we will take $\epsilon_d$ to be the unique arrow factoring the cocone under the diagram $C(c,d)\to c$ with nadir $d$, whose components are given by the associated indexing arrows $c\to d$ of the indexing category, through the coproduct $\coprod_{C(c,d)} c$. The universal property of this factorization yields the formula $\epsilon_d\circ\iota_{f_i\colon c\to d} = f_i$.
Naturality of $\epsilon$ follows from a straightforward diagram chase. Fixing a morphism $g\colon d\to e\in C$ and an inclusion $\iota_{f_i\colon c\to d}\colon c\hookrightarrow \coprod_{C(c,d)} c$, we have that $g\circ \epsilon_d\circ\iota_{f_i} = g\circ f_i$ and also $\epsilon_e \circ LFg\circ\iota_{f_i} = \epsilon_e\circ\iota_{g\circ f_i}=g\circ f_i$.
It remains to show the arrow $({\epsilon_d})_{*}\circ L\colon \text{Set}(A, Fd)\cong C(LA, d)$ is really a bijection. Representability of $F$ and the action of $L$ imply that $({\epsilon_d})_{*}\circ L$ is equivalently the composite
First, let us see injectivity. Taking distinct $f,g\colon A\rightrightarrows C(c,d)$, we have that $Lf$, $Lg$ are the unique factorizations of certain distinct cocones under $A$; by the representability of cocones under $A$ and the Yoneda lemma, $Lf$ and $Lg$ are distinct. In another way, $f, g$ being distinct implies $\exists a\in A$ such that $f(a)\ne g(a)$, and so $Lf\iota_a = \iota_{f(a)\colon c\to d} \ne \iota_{g(a)\colon c\to d} = Lg\iota_a$. But now
To see surjectivity, let us fix $f\colon \coprod_A c\to d$ and lift it along $({\epsilon_d})_{*}\circ L$ to an arrow $A\to C(c,d)$. $\coprod_A c$ is the representing object for $\text{Cone}(A, -)$, so $f$ corresponds to a unique cocone $\mu$ under $A$ with nadir $d$. But each $A$-indexed component of $\mu$ is an arrow $c\to d$, and so we can define a function $\bar{f}\colon A\to C(c,d)$ given by $\bar{f}(a)=\mu_a$. Indeed, $\bar{f}$ lifts along the present injection to be in the preimage of $f$; explicitly, $L\bar{f}$ is the unique factorization of a cone whose components are $\left\{\iota_{\bar{f}(a)} = \iota_{\mu_a}\colon c\to \coprod_{C(c,d)} c\right\}_{a\in A}$, and ${\epsilon_d}\circ L\bar{f}$ hence yields the cone $\left\{\epsilon_d\iota_{\mu_a} = \mu_a\right\}_{a\in A}=\mu$; uniqueness of cocone factorization implies ${\epsilon_d}\circ L\bar{f} = f$. $\square$
(4.5.vii) Characterizations of reflective subcategories
$\text{Premise}.$ Consider a reflective subcategory inclusion $D\hookrightarrow{}C$ with reflector $L\colon C\rightarrow D$.
Recall that a $D$ is a reflective subcategory of $C$ if $D$ is a full subcategory and the inclusion of $D$ admits a left adjoint $L$, which we call a reflector. This is definition 4.5.12 in Riehl.
Let us denote the unit of this adjunction by $\eta\colon 1_{C}\Rightarrow L$ and the counit by $\epsilon\colon L\Rightarrow 1_D$; for now we elide the inclusion functor, for its presence in the domain definitions of the unit and counit acts as the identity.
Note also that because the inclusion $D\hookrightarrow C$ is fully faithful, $\epsilon$ is a natural isomorphism.
Okay, let's get started.
$\text{Part (i).}$ Show that $\eta L = L\eta$, and that these natural transformations are isomorphisms.
$\text{Proof.}$ By the triangle identities, $1_L = \epsilon L \circ L\eta$. Since $1_L$ and $\epsilon L$ are natural isomorphisms, we must have that $L\eta$ is a natural isomorphism.
Now consider the following triple of squares, each of which commutes either by the naturality of the unit or the counit.
Commutativity of the first square, which holds for all objects $c\in C$, tells us that $\epsilon L = L\epsilon$. Commutativity of the second and third squares imply $\epsilon L \circ L\eta = L \epsilon \circ \eta L = \epsilon L \circ \eta L$, and so $L\eta = \eta L$. Furthermore, $\eta L$ is a natural transformation because $L\eta$ is. $\square$
$\text{Part (ii).}$ Show that an object $c\in C$ is in the essential image of the inclusion $D\hookrightarrow C$, meaning that it is isomorphic to an object in the subcategory $D$, if and only if $\eta_c$ is an isomorphism.
$\text{Proof.}$ First, suppose $C\ni c\cong d\in D$, and that this isomorphism is given by $\phi\colon c\to d$. For clarity, we will denote the inclusion functor $\iota\colon D\hookrightarrow C$. By the triangle identities, we have that $1_\iota = \iota\epsilon\circ\eta\iota$; this implies $\eta\iota$ is a natural isomorphism. Now consider the square
which commutes by the naturality of $\eta$. $\eta_{\iota d}$, $\phi$, and $L\phi$ are isomorphisms, so $\eta_c$ is an isomorphism.
Conversely, supposing $\eta_c\colon c\to Lc$ is an isomorphism, $\eta_c$ defines an isomorphism between $c$ and $Lc\in D$. $\square$
$\text{Part (iii).}$ Show that the essential image of $D$ consists of those objects $c$ that are local for the class of morphisms that are inverted by $L$. That is, $c$ is in the essential image if and only if the pre-composition functions
are isomorphisms for all arrows $f\colon a\to b$ in $C$ for which $Lf$ is an isomorphism in $D$.
$\text{Proof.}$ Suppose that the class of pre-composition functions as described above, consisting of those functions whose image under $L$ are isomorphisms, are isomorphisms in $C$. Taking $c\in C$, we have that $L\eta_c$ is an isomorphism by $\text{(i)}$, and hence in particular $C(Lc,c)\xrightarrow{\eta_c}C(c,c)$ yields an isomorphism. This implies $\exists ! f\colon Lc\to c$ such that $f\eta_c = 1_c$. By the naturality of $\eta$, the square
commutes, yielding the equivalence
Hence $\eta_c$ and $f$ are inverse isomorphisms. But $\eta_c$ being an isomorphism implies $c$ is in the essential image of $D$.
Conversely, supposing $c\in C$ is in the essential image of $D$, we have that $\exists d\in D$ with isomorphisms $\phi\colon c\leftrightarrows d\colon \phi^{-1}$. Let $f\colon a\to b\in C$ be such that $Lf$ is an isomorphism. Then by the definition of adjunction, the square
commutes. Since $Lf$ is an isomorphism, $(Lf)^*$ is an isomorphism, and so $f^*$ must be an isomorphism as well. Hence
is an isomorphism of hom-sets, satisfying the proposition hypothesis. $\square$
As Riehl points out, this last construction indeed describes why the reflector $L$ can be described as a localization. Indeed, the left adjoint $L$ determines the essential image of a reflective subcategory via a particular universal property that inverts local morphisms.


Custom parser for GitLab-flavored Markdown
It replaces references in the text with links to the appropriate items in GitLab.
Supported reference formats are:
* @foo for team members * #123 for issues * !123 for merge requests * $123 for snippets * 123456 for commits
It also parses Emoji codes to insert images. See www.emoji-cheat-sheet.com/ for a list of the supported icons.
Examples
>> gfm("Hey @david, can you fix this?") => "Hey @david, can you fix this?" >> gfm("Commit 35d5f7c closes #1234") => "Commit 35d5f7c closes #1234" >> gfm(":trollface:") => "
Methods
- G
Constants
| REFERENCE_PATTERN | = | %r{ (?<prefix>\W)? # Prefix ( # Reference @(?<user>[a-zA-Z][a-zA-Z0-9_\-\.]*) # User name |\#(?<issue>\d+) # Issue ID |!(?<merge_request>\d+) # MR ID |\$(?<snippet>\d+) # Snippet ID |(?<commit>[\h]{6,40}) # Commit ID ) (?<suffix>\W)? # Suffix }x.freeze |
| TYPES | = | [:user, :issue, :merge_request, :snippet, :commit].freeze |
| EMOJI_PATTERN | = | %r{(:(\S+):)}.freeze |
Attributes
| [R] | html_options |
Instance Public methods
gfm(text, html_options = {})
Link
Public: Parse the provided text with GitLab-Flavored Markdown
text - the source text #html_options - extra options for the reference links as given to link_to
Note: reference links will only be generated if @project is set
Source: show
# File lib/gitlab/markdown.rb, line 52 def gfm(text, html_options = {}) return text if text.nil? # Duplicate the string so we don't alter the original, then call to_str # to cast it back to a String instead of a SafeBuffer. This is required # for gsub calls to work as we need them to. text = text.dup.to_str @html_options = html_options # Extract pre blocks so they are not altered # from http://github.github.com/github-flavored-markdown/ extractions = {} text.gsub!(%r{
.*?
|.*?}) do |match| md5 = Digest::MD5.hexdigest(match) extractions[md5] = match "{gfm-extraction-#{md5}}" end # TODO: add popups with additional information text = parse(text) # Insert pre block extractions text.gsub!(%r\{gfm-extraction-(\h{32})\}/) do extractions[$1] end sanitize text.html_safe, attributes: ActionView::Base.sanitized_allowed_attributes + %w(id class) end


Dynamic Navbar is supported only in iOS Theme
One of the iOS awesome features is the dynamic navigation bar (navbar). Navbar's elements will slide and fade during pages transition and swipe back when dynamic navbar is enabled.
It works only with Through-type layout
It should be enabled during View initialization by passing dynamicNavbar: true parameter
Dynamic Navbar layout is the same as for usual Navbar, the only difference is that you can add additional classes to Navbar parts (Left, Center, Right) to tell which type of transition effect you want on this part.
By default (if there is no additional classes) each Navbar part has "Fade" transition effect
If you add "sliding" class to any of Navbar parts then it will have "Sliding" effect
For better look you should to keep identic transition type for the same Navbar parts through different pages

Home Left

Home

Home Right

About Left

About

About Right

Sliding transitions should be used wisely because they should reflect app's navigation chain

Home Left

Home

About

Home

About

If you use default back-links (icon + "Back" word) you can enable additional animation for these links to have more iOS 7 look. To make it work you need to add animateNavBackIcon: true
parameter on App initialization and to have link with "back" class and icon in Left Navbar part. Nothing different in layout, here is example:
Dynamic navbar has the following events:
| Event | Target | Description |
|---|---|---|
| navbarBeforeInit | Navbar Inner element
 | Event will be triggered when Framework7 just inserts new navbar inner to DOM |
| navbarInit | Navbar Inner element
 | Event will be triggered after Framework7 initialize navbar |
| navbarReinit | Navbar Inner element
 | This event will be triggered when cached navbar inner becomes visible. It is only applicaple for Inline Pages (DOM cached pages) |
| navbarBeforeRemove | Navbar Inner element
 | Event will be triggered right before navbar inner will be removed from DOM. This event could be very useful if you need to detach some events / destroy some plugins to free memory |
Each event data containes useful information with navbar
elements and Page Data of related page. For example
$$(document).on('navbarInit', function (e) {
var navbar = e.detail.navbar;
var page = e.detail.page
});
Now, in the example above we have initialized Navbar elements in navbar
variable and related Page Data in page
variable. Lets look on properties of navbar
object:
| Navbar Properties | |
|---|---|
| navbar.navbarContainer | Link to parent Navbar HTMLElement |
| navbar.navbarInnerContainer | Link to target Navbar Inner HTMLElement |


I have decided to document my first real experience with Valium, and will try to update the record every fifteen minutes. I am quite an experienced user of alcohol, cannabis and cocaine, and have also tried mushrooms (psilocybin). I take lots of coffee (about 4 - 5 cups a day. I also usually smoke a pack of cigarettes a day.
Set and setting: it is 2:00pm; I just came into the office, looking at six more hours of work as a telephone clerk in a sportsbook. The job is easy, the environment is relaxed, and my mood during the whole day was quite good. Happy and a bit energetic. No other psychoactive have been taken during the last 15 hours, except 3 cups of coffee early in the morning. The night before I had taken two puffs of a joint.
T: 0:00 - Three pills of 5mg diazepam (generic Valium) ingested thirty minutes after I came into the office. I know there won't be much work to do today, so I can chill for the rest of the trip.
T: 0:15 - Effects start kicking in quite fast. Coordination decreased a bit, mind seems slow and distracted. I feel like everything is happening at normal speed, but I am working in slow motion. Can only focus on one task at a time, yet I can act normal around my colleagues, though I feel a bit drowsy.
T: 0:30 - Effects grow: I feel quite slow and disoriented, yet completely able to make coherent and logical decisions. I can be distracted very easily and lose my train of thought. Time seems to go by much faster than usual, but I can attribute this to the fact that it's taking me quite an effort to be writing this. I have to concentrate and maintain my line of thought in place, which has become increasingly difficult. I will smoke a cigarette now, will be back in 10 min.
T: 0:45 - Effects keep on growing: thought process and physical movement continue to grow slower, memory unaffected, but physical coordination slightly impaired. I am typing much slower now, walking slower, and climbing the stairs to the office was a bit of a hassle, feet tripping on the stairs because I didn't raise them enough. I feel like a low dose of THC or alcohol, but with no feeling of euphoria, or the distractions or segmented thought patterns of marihuana. The cigarette had no perceivable effects.
T: 1:00 - definitely feeling like a small dose of cannabis, with a total clarity of mind, yet reactions to internal and external stimuli comes in much slower, and I don't really feel tired. No intention of going to sleep.
T: 1:15 - I've been thinking: this drug is an anxiolitic (supposed to remove your anxieties) and is accomplishing its mission quite well: there is nothing I wish I would be doing right now, I have no anxieties, and feel quite comfortable with anything I do. The loss of energy, will, and drive is definitely part of it. There is nothing I would specifically want to do right now.
T: 1:30 - sleep has started to show up in my thoughts. I am acting even slower than before. I can type a little better now, yet the trip is heading more towards a cannabis trip than I would have expected. I suppose mixing Valium and THC could become a very deep high.
T: 1:45 - Slow. That's what would define my mood at this time. Absolute slowness of everything, and it's increasing. It takes at least a second to react to stuff one would usually react immediately. Walking is possible, but more of a hassle.
T: 2:00 - I'm generally an active guy, don't enjoy marijuana a lot, and would rather have cocaine and alcohol. Even though Valium is definitely Not my drug of choice, it is a fun experience, for it has eliminated all my cravings and desires for a few hours. I feel comfortable with it, and it has the funny effect of slowing me down.
 I still feel slow and just a little bit tired, but the trip has definitely started to end.
T: 3:00 - The trip is over. Only a mild slowness remains, but I'm pretty much at baseline now.
Conclusion: Valium can be a good substance for me if I'm a bit stressed and need to chill off. My dose of 15mg was just right for that. I've heard it doesn't mix right with other depressants or with alcohol, so beware.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Email address
Password
Age
You heard about us from
Facebook
Twitter
GitLab
Skype
GitHub
Message
I dont't have a message. :(
Upload CV
Job Position
Intern
Q&A


Preparation time
less than 30 mins
Cooking time
over 2 hours
Serves
Serves 6
Nigel Slater's Chinese-style duck with spiced chutney goes down a treat slathered over homemade flatbreads.
Preheat the oven to 200C/180C fan/Gas 6.
For the shredded duck, place the duck in a roasting tin and season generously with salt and freshly ground black pepper. Add the shallots and roast for 30 minutes.
After 30 minutes, add the plums to the roasting tin and stir the shallots in the fat released from the duck. Cook for a further hour, or until the duck is cooked. (The duck is cooked through if the juices run clear when the bird is pierced in the thickest part of the leg.)
Meanwhile, heat the oil in a large frying pan over a medium heat. Add the red onions and fry for 5-6 minutes, or until they begin to caramelise. Sprinkle over the grated ginger.
Add the cloves, star anise, redcurrant jelly and prunes to the onion mixture and continue to cook gently for 10 minutes. Turn the heat off and set the chutney aside; reheat when the duck is cooked.
While the duck is still cooking, make the flatbreads. In a bowl, mix the plain flour, yeast, salt and warm water until the mixture comes together as a soft dough. Turn the dough out onto a lightly floured work surface and knead lightly until smooth. Roll the dough into a ball and place in a clean bowl. Cover with a clean tea towel and set aside to prove for 20 minutes.
Grind the garlic, chillies and salt in a pestle and mortar along with the olive oil. Add the butter and chopped parsley and mix well.
Cut the dough into 6 equal-sized pieces. Roll each piece out onto a lightly floured work surface to a 30cm/12in square. Spread each flatbread with some of the butter mixture.
Fold the flatbread from left to middle then right to the very left so that it ends up one-third of its original width. Then fold each flatbread from bottom to middle and top to very bottom so that it ends up one-third of its original height. Roll each flatbread out to the thickness of a pound coin.
When the duck is cooked, pull the meat from the duck carcass and lightly shred it using tongs and a fork. Stir the shredded duck meat into the chutney. Stir in the roasted shallots. Remove the stones from the softened plums and add the flesh to the chutney.
Dry-fry each flatbread in a frying pan over a high heat for 1-2 minutes on each side, or until light golden-brown on both sides. Serve alongside the warm shredded duck.


Seventeen's Dino to sit out Japanese concert today due to enteritis symptoms
by beansssOn November 7, Seventeen's label Pledis Entertainment took to the group's official fan cafe to notify fans of member Dino's schedule changes.
The label revealed, "Earlier this morning, Dino visited the hospital due to symptoms of enteritis. After receiving a diagnosis, we have come to the decision for him to rest until his conditions improve. As a result, Dino will not be able to participate in Seventeen's world tour 'Ode To You in Japan', taking place this November 7 in Makuhari; we ask for you understanding."
Get well soon, Dino.


The Team
Aaron Rossi
CEO & Co-Founder
>
Marco Gomez
Co-Founder, Creative Director
>
Brad Joe
Office Manager
>
Mitch Petty
Lead Developer
>
Philip Satemburgo
Community Manager


Complaint Description:
Observations:
Complainer name:
Address: Complement:
Province:
City: State: ZIP Code:
Phone number:
E-mail:
Animal Race: Quantidade:
Event Date: / /
Event Address: Complement:
Health-Watcher - 2004


|
Click
|
Superclass for databases mapping names to values. More...
Public Member Functions | |
| NameDB (uint32_t type, const String &context, size_t value_size) | |
| Construct a database. More... | |
| virtual | ~NameDB () |
| Destroy a database. More... | |
| uint32_t | type () const |
| Return the database type. More... | |
| const String & | context () const |
| Return the database's compound element context as a string. More... | |
| NameDB * | context_parent () const |
| Return the contextual parent database, if any. More... | |
| size_t | value_size () const |
| Return the database's value size. More... | |
| virtual bool | query (const String &name, void *value, size_t value_size)=0 |
| Query this database for a given name. More... | |
| virtual String | revquery (const void *value, size_t value_size) |
| Query this database for a given value. More... | |
| virtual bool | define (const String &name, const void *value, size_t value_size) |
| Define a name in this database to a given value. More... | |
| bool | define_int (const String &name, int32_t value) |
| Define a name in this database to a 32-bit integer value. More... | |
Superclass for databases mapping names to values.
NameDB databases are Click's general way to map names to values. Many Click elements need to parse names into values of various types. They use NameDB to do it; NameDB and NameInfo implement generally useful properties like names local to a compound element context, and support space- and time-efficient lookups.
Most users should access NameDB's functionality through NameInfo.
|
inline |
Construct a database.
| type | database type |
| context | database compound element context, as a String |
| value_size | database value size |
value_size must be greater than 0.
|
inlinevirtual |
Destroy a database.
Destroying an installed database automatically uninstalls it. See NameInfo::uninstalldb().
|
inline |
Return the database type.
|
inline |
Return the database's compound element context as a string.
|
inline |
Return the contextual parent database, if any.
The contextual parent database is the unique database, for the same router, with the same type(), whose context() is a prefix of this database's context(), that has the longest context() of any matching database. If there is no such database returns null.
|
inline |
Return the database's value size.
|
pure virtual |
Query this database for a given name.
| name | name to look up |
| value | points to value storage |
| value_size | size of value storage |
The value_size parameter must equal this database's value size.
Implemented in DynamicNameDB, and StaticNameDB.
|
virtual |
Query this database for a given value.
| value | points to value to look up |
| value_size | size of value storage |
The value_size parameter must equal this database's value size. The default implementation always returns the empty string.
Reimplemented in DynamicNameDB, and StaticNameDB.
|
virtual |
Define a name in this database to a given value.
| name | name to define |
| value | points to value to define |
| value_size | size of value storage |
The value_size parameter must equal this database's value size. The default implementation always returns false.
Reimplemented in DynamicNameDB.
|
inline |
Define a name in this database to a 32-bit integer value.
| name | name to define |
| value | value to define |
The database's value size must equal 4. The implementation is the same as define(name, &value, 4)
.


The importance of emotional intelligence has always been clear, but that does not mean I have been a good practitioner of it. I found it particularly enlightening how the co-release of emotion in the body is a lot more vivib than in the mind. If one can learn to understand the feelings in the body then they can understand feelings as they are arising and deal with them before they are too late, for example a flushed face when you are starting to feel angry.
It is also really good to know that emotional skills are trainable and we are not stuck being the way we are now. If we can develop these skills we can better deal with challenges and then develop self confidence. Starting with mindfulness seems like an excellent way to do this. I think patience with others is a real weakness for me so identifying those feelings will be a great help.
When I tried mindfulness I found it was a good way to centre myself and draw my attention back to what I was doing. I have a real habbit of wandering in my mind so I think this will be a valuable technique for me.


SHEN LIU
| Name | : | Shen Liu |
| Age | : | 24 |
| Languages | : | Chinese, English |
| : | +1<PHONE_NUMBER> | |
| : |<EMAIL_ADDRESS>|
Projects
Have accomplished various projects across different areas in full stack, machine learning, robotics, image processing, etc.
Some of the project details are listed here.
Implemented AngularJS for data-binding and backend communication.
Designed responsive front-end page with BootStrap.
Installed Bower to fetch web packages.
Developed REST server with Node.js and Express to serve restaurant and user info.
Applied Json web tokens and Passport node module for user login and authentication.
Created user and restaurant Schema with Mongoose ODM and stored in MongoDB.
Established connection between REST server and MongoDB server.
Created different models in both Artificial Neutral Network(ANN) and Convolutional Neutral Network(CNN) using Tensorflow and Keras.
Trained the NN model over 200000+ handwrtting letters and digits.
Evaluated each model based on 10000+ test set and achieved an accuacy of 98% without overfitting.
Utilized KerasJS to export the model and created a simple web app for DNN demo.
Trained with 190 faces to generated 190 Eigenfaces(Principal Components).
Reconstructed 10 testing faces with Eigenfaces after applying PCA.
Combined Support Vector Machine(SVM) with Eigenfaces to classify neutral expression and smiling expression faces, and achieved an accuracy of 87%.
Remotely controlled by Android device via Bluetooth.
GPS Enabled
Real-time environmental data collection (Temperature, humidity, etc.)
Obstacle Avoidance
Battery life monitoring
Developed Android App to interact with the robot
Collaboratively designed the printed circuit board(PCB)
Collaboratively Integrated electronic modules over communication interfaces in C
Conducted microcontroller, motor driver and circuits test
ConFusion Restaurant Full Stack Development
Client Side
Server Side
Database
Convolutional and Artificial Neutral Network
The NN models are trained from self-generated letters and well-known MNIST database of handwrtting digits
Work
Principle Component Analysis(PCA) with Eigenfaces
The upper ten 10 faces are the original testing faces. The lower ten are the reconstructed faces using trained Eigenfaces by reducing 60% dimensionality.
Work
Click here to watch the full video
Embedded System Robotics Design
An autonomous GPS-enabled searching robot with ability of data collection and obstacle avoidance
Features |
Work |
Education
Earned bachalor degree at Purdue University and master degree at UC San Diego both in EE.
Some related core courses are listed here.
PURDUE UNIVERSITY
2011-2015
BS in Electrical Engineering
Digital System Senior Design, Digital Signal Processing with Applications, Probabilistic Methods, Microprocessor System Design and Interfaceing, Adcanced C Language, Visualization
UC SAN DIEGO
2015-2017
MS in Electrical Engineering
Algorithm Design and Analysis, Recommender System and Web Mining, Database System, Intelligent System, Linear Algebra and Application, Probability and Random Process
Experiences
Worked for KingSound, Shanghai as a web developer for 3 month.
-
Amazon Inc.
2017.8 | Seattle, wa
Software Development Engineer
-
KingSound Inc.
2016.6 - 2016.9 | Shanghai, CN
Web Developer (Intern)
Collaborated with senior developers to developed the website for Kingsound with JQuery and Javascript.
Designed website interface with Photoshop and Fireworks.
Managed and Preprocessed the backend user data.
Skills
Computer Language
Java, JavaScript, Python, Matlab, C, SQL, HTML, CSS, Git.
Development
AngularJs, Node.js, BootStrap, JQuery, MongoDB, Tensorflow, Keras, Bower, Grunt, Photoshop.
Skills
Web Development, Machline Learning, Image Processing.
Contact
Feel free to contact me.
Either leave a message here or send email to liushen92@gmail.com


------ Updated: Peter Jamieson, Nov,Dec, 2008 ------
1. Source Text
2. Declarations
3. Primitive Instances
4. Module Instantiations
5. Behavioral Statements
6. Specify Section
7. Expressions
8. General
Definition of Items in Formal Syntax Specifications:
+-----------------------+------------------------------------------------------------+
| Item | Meaning |
+-----------------------+------------------------------------------------------------+
| White space | may be used to separate lexical tokens |
+-----------------------+------------------------------------------------------------+
| Angle brackets | surround each description item and are not literal sym- |
| | bols. That is, they do not appear in the source descrip- |
| | tion. Any text outside angle brackets is literal. |
+-----------------------+------------------------------------------------------------+
| <name> in lower case | is a syntax construct item |
+-----------------------+------------------------------------------------------------+
| <NAME> in upper case | is a lexical token item. Its definition is a terminal node |
| | in the description hierarchy -- that is, its definition |
| | does not contain any syntax construct items |
+-----------------------+------------------------------------------------------------+
| <name>? | is an optional item |
+-----------------------+------------------------------------------------------------+
| <name>* | is zero, one, or more items |
+-----------------------+------------------------------------------------------------+
| <name>+ | is one or more items |
+-----------------------+------------------------------------------------------------+
| <name><,<name>>* | is a comma-separated list of items with at least one |
| | item in the list |
+-----------------------+------------------------------------------------------------+
| <name>::= | gives a syntax definition to an item |
+-----------------------+------------------------------------------------------------+
| ||= | introduces an alternative syntax definition |
+-----------------------+------------------------------------------------------------+
1. Source Text
<source_text>
::= <description>*
<description>
::= <module>
<module>
::= module <name_of_module> <list_of_ports>? ;
<module_item>*
endmodule
<name_of_module>
::= <IDENTIFIER>
<list_of_ports>
::= ( <port> <,<port>>* )
<port>
::= <port_expression>?
||= . <name_of_port> ( <port_expression>? )
<port_expression>
::= <port_reference>
||= { <port_reference> <,<port_reference>>* }
<port_reference>
::= <name_of_variable>
||= <name_of_variable> [ <constant_expression> ]
||= <name_of_variable> [ <constant_expression> :<constant_expression> ]
<name_of_port>
::= <IDENTIFIER>
<name_of_variable>
::= <IDENTIFIER>
<module_item>
::= <parameter_declaration>
||= <input_declaration>
||= <output_declaration>
||= <inout_declaration>
||= <net_declaration>
||= <reg_declaration>
||= <gate_declaration>
||= <module_instantiation>
||= <continuous_assign>
||= <initial_statement>
||= <always_statement>
2. Declarations
<parameter_declaration>
::= parameter <list_of_param_assignments> ;
<list_of_param_assignments>
::=<param_assignment><,<param_assignment>*
<param_assignment>
::=<identifier> = <constant_expression>
<input_declaration>
::= input <range>? <list_of_variables> ;
<output_declaration>
::= output <range>? <list_of_variables> ;
<inout_declaration>
::= inout <range>? <list_of_variables> ;
<net_declaration>
::= <NETTYPE> <expandrange>? <>? <list_of_variables> ;
<list_of_variables> ;
||= <NETTYPE> < <expandrange>? <<list_of_assignments> ;
<NETTYPE> is one of the following keywords:
wire tri tri1 supply0 wand triand tri0 supply1 wor trior trireg
<expandrange>
::= <range>
||= scalared <range>
||= vectored <range>
<reg_declaration>
::= reg <range>? <list_of_register_variables> ;
<continuous_assign>
::= assign < ;list_of_assignments> ;
||= <NETTYPE> <expandrange>? <list_of_assignments> ;
<list_of_variables>
::= <name_of_variable> <,<name_of_variable>>*
<name_of_variable>
::= <IDENTIFIER>
<list_of_register_variables>
::= <register_variable> <,<register_variable>>*
<register_variable>
::= <name_of_register>
||= <name_of_memory> [ <constant_expression> : <constant_expression> ]
<name_of_register>
::= <IDENTIFIER>
<name_of_memory>
::= <IDENTIFIER>
<range>
::= [ <constant_expression> : <constant_expression> ]
<list_of_assignments>
::= <assignment> <,<assignment>>*
3. Primitive Instances
<gate_declaration>
::= <GATETYPE> <gate_instance> <,<gate_instance>>* ;
<GATETYPE> is one of the following keywords:
and nand or nor xor xnor buf bufif0 bufif1 not notif0 notif1 pulldown pullup
nmos rnmos pmos rpmos cmos rcmos tran rtran tranif0 rtranif0 tranif1 rtranif1
<gate_instance>
::= <name_of_gate_instance>? ( <terminal> <,<terminal>>* )
<name_of_gate_instance>
::= <IDENTIFIER><range>?
<terminal>
::= <expression>
||= <IDENTIFIER>
4. Module Instantiations
<module_instantiation>
::= <name_of_module> <
<module_instance> <,<module_instance>>* ;
<name_of_module>
::= <IDENTIFIER>
<module_instance>
::= <name_of_instance> ( <list_of_module_connections>? )
<name_of_instance>
::= <IDENTIFIER><range>?
<list_of_module_connections>
::= <module_port_connection> <,<module_port_connection>>*
||= <named_port_connection> <,<named_port_connection>>*
<module_port_connection>
::= <expression>
<named_port_connection>
::= .< IDENTIFIER> ( <expression> )
5. Behavioral Statements
<initial_statement>
::= initial <statement>
<always_statement>
::= always <statement>
<statement_or_null>
::= <statement>
||= ;
<statement>
::=<blocking_assignment> ;
||= <non_blocking_assignment> ;
||= if ( <expression> ) <statement_or_null>
||= if ( <expression> ) <statement_or_null> else <statement_or_null>
||= case ( <expression> ) <case_item>+ endcase
||= <seq_block>
||= <delay_or_event_control> <statement_or_null>
<assignment>
::= <lvalue> = <expression>
<blocking_assignment>
::= <lvalue> = <expression>
<non_blocking_assignment>
::= <lvalue> <= <expression>
<delay_or_event_control>
||= <event_control>
<case_item>
::= <expression> <,<expression>>* : <statement_or_null>
||= default : <statement_or_null>
||= default <statement_or_null>
<seq_block>
::= begin <statement>* end
6. Specify Section
7. Expressions
<lvalue>
::= <identifier>
||= <identifier> [ <expression> ]
||= <identifier> [ <constant_expression> : <constant_expression> ]
||= <concatenation>
<constant_expression>
::=<expression>
<expression>
::= <primary>
||= <UNARY_OPERATOR> <primary>
||= <expression> <BINARY_OPERATOR> <expression>
||= <expression> <QUESTION_MARK> <expression> : <expression>
||= <STRING>
<UNARY_OPERATOR> is one of the following tokens:
+ - ! ~ & ~& | ^| ^ ~^
<BINARY_OPERATOR> is one of the following tokens:
+ - * / % == != === !== && || < <= > >= & | ^ ^~ >> <<
<QUESTION_MARK> is ? (a literal question mark).
<STRING> is text enclosed in "" and contained on one line.
<primary>
::= <number>
||= <identifier>
||= <identifier> [ <expression> ]
||= <identifier> [ <constant_expression> : <constant_expression> ]
||= <concatenation>
||= <multiple_concatenation>
||= <function_call>
<number>
::= <DECIMAL_NUMBER>
||= <UNSIGNED_NUMBER>? <BASE> <UNSIGNED_NUMBER>
||= <DECIMAL_NUMBER>.<UNSIGNED_NUMBER>
||= <DECIMAL_NUMBER><.<UNSIGNED_NUMBER>>?
E<DECIMAL_NUMBER>
||= <DECIMAL_NUMBER><.<UNSIGNED_NUMBER>>?
e<DECIMAL_NUMBER>
(Note: embedded spaces are illegal in Verilog numbers, but embedded underscore
characters can be used for spacing in any type of number.)
<DECIMAL_NUMBER>
::= A number containing a set of any of the following characters, optionally preceded by + or -
0123456789_
<UNSIGNED_NUMBER>
::= A number containing a set of any of the following characters:
0123456789_
<NUMBER>
Numbers can be specified in decimal, hexadecimal, octal or binary, and may
optionally start with a + or -. The <BASE> token controls what number digits
are legal. <BASE> must be one of d, h, o, or b, for the bases decimal,
hexadecimal, octal, and binary respectively. A number can contain any set of
the following characters that is consistent with <BASE>:
0123456789abcdefABCDEFxXzZ?
<BASE> is one of the following tokens:
'b 'B 'o 'O 'd 'D 'h 'H
<concatenation>
::= { <expression> <,<expression>>* }
<multiple_concatenation>
::= { <expression> { <expression> <,<expression>>* } }
8. General
<comment>
::= <short_comment>
||= <long_comment>
<short_comment>
::= // <comment_text> <END-OF-LINE>
<long_comment>
::= /* <comment_text> */
<comment_text>
::= The comment text is zero or more ASCII characters
<identifier>
::= <IDENTIFIER><.<IDENTIFIER>>*
(Note: the period may not be preceded or followed by a space.)
<IDENTIFIER>
An identifier is any sequence of letters, digits, dollar signs ($), and
underscore (_) symbol, except that the first must be a letter or the
underscore; the first character may not be a digit or $. Upper and lower case
letters are considered to be different. Identifiers may be up to 1024
characters long. Some Verilog-based tools do not recognize identifier
characters beyond the 1024th as a significant part of the identifier. Escaped
identifiers start with the backslash character (\) and may include any
printable ASCII character. An escaped identifier ends with white space. The
leading backslash character is not considered to be part of the identifier.
<event_control>
::= @ <identifier>
||= @ ( <event_expression> )
<event_expression>
::= <expression>
||= posedge <scalar_event_expression>
||= negedge <scalar_event_expression>
||= <event_expression> or <event_expression>
<scalar_event_expression>
Scalar event expression is an expression that resolves to a one bit value.


3.9. Analyzing Problems (WORK IN PROGRESS)¶
3.9.1. Analyzing Problems¶
You most often use the techniques of “algorithm” analysis to analyze an algorithm, or the instantiation of an algorithm as a program. You can also use these same techniques to analyze the cost of a problem. The key question that we want to ask is: How hard is a problem? Certainly we should expect that in some sense, the problem of sorting a list of records is harder than the problem of searching a list of records for a given key value. Certainly the algorithms that we know for sorting some records seem to be more expensive than the algorithms that we know for searching those same records.
What we need are useful definitions for the upper bound and lower bound of a problem.
One might start by thinking that the upper bound for a problem is how hard any algorithm can be for the problem. But we can make algorithms as bad as we want, so that is not useful. Instead, what is useful is to say that a problem is only as hard as what we CAN do. In other words, we should define the upper bound for a problem to be the best algorithm that we know for the problem. Of course, whenever we talk about bounds, we have to say when they apply. We we really should say something like the best algorithm that we know in the worst case, or the best algorithm that we know in the average case.
But what does it mean to give a lower bound for a problem? Lower bound refers to the minimum that any algorithm MUST cost. For example, when searching an unsorted list, we MUST look at every record. When sorting a list, we MUST look at every record (to even know if it is sorted).
It is much easier to show that an algorithm (or program) is in \(\Omega(f(n))\) than it is to show that a problem is in \(\Omega(f(n))\). For a problem to be in \(\Omega(f(n))\) means that every algorithm that solves the problem is in \(\Omega(f(n))\), even algorithms that we have not thought of! In other words, EVERY algorithm MUST have at least this cost. So, to prove a lower bound, we need an argument that is true, even for algorithms that we don’t know.
So far all of our examples of algorithm analysis give “obvious” results, with big-Oh always matching \(\Omega\). To understand how big-Oh, \(\Omega\), and \(\Theta\) notations are properly used to describe our understanding of a problem or an algorithm, it is best to consider an example where you do not already know a lot about the problem.
Let us look ahead to analyzing the problem of sorting to see how this process works. What is the least possible cost for any sorting algorithm in the worst case? The algorithm must at least look at every element in the input, just to determine that the input is truly sorted. Thus, any sorting algorithm must take at least \(cn\) time. For many problems, this observation that each of the \(n\) inputs must be looked at leads to an easy \(\Omega(n)\) lower bound.
In your previous study of computer science, you have probably seen an example of a sorting algorithm whose running time is in \(O(n^2)\) in the worst case. The simple Bubble Sort and Insertion Sort algorithms typically given as examples in a first year programming course have worst case running times in \(O(n^2)\). Thus, the problem of sorting can be said to have an upper bound in \(O(n^2)\). How do we close the gap between \(\Omega(n)\) and \(O(n^2)\)? Can there be a better sorting algorithm? If you can think of no algorithm whose worst-case growth rate is better than \(O(n^2)\), and if you have discovered no analysis technique to show that the least cost for the problem of sorting in the worst case is greater than \(\Omega(n)\), then you cannot know for sure whether or not there is a better algorithm.
Many good sorting algorithms have running time that is in \(O(n \log n)\) in the worst case. This greatly narrows the gap. With this new knowledge, we now have a lower bound in \(\Omega(n)\) and an upper bound in \(O(n \log n)\). Should we search for a faster algorithm? Many have tried, without success. Fortunately (or perhaps unfortunately?), we can prove that any sorting algorithm must have running time in \(\Omega(n \log n)\) in the worst case. 1 This proof is one of the most important results in the field of algorithm analysis, and it means that no sorting algorithm can possibly run faster than \(c n \log n\) for the worst-case input of size \(n\). Thus, we can conclude that the problem of sorting is \(\Theta(n \log n)\) in the worst case, because the upper and lower bounds have met.
Knowing the lower bound for a problem does not give you a good algorithm. But it does help you to know when to stop looking. If the lower bound for the problem matches the upper bound for the algorithm (within a constant factor), then we know that we can find an algorithm that is better only by a constant factor.
So, to summarize: The upper bound for a problem is the best that you CAN do, while the lower bound for a problem is the least work that you MUST do. If those two are the same, then we say that we really understand our problem.
- 1
While it is fortunate to know the truth, it is unfortunate that sorting is \(\Theta(n \log n)\) rather than \(\Theta(n)\).


QDoubleSpinBox Class Reference
Inherits QAbstractSpinBox.
Constructor
- void QDoubleSpinBox(QWidget parent)
Constructor Properties
- prototype: The QDoubleSpinBox prototype object
Prototype Object Properties
The QDoubleSpinBox prototype object inherits properties from the QAbstractSpinBox prototype object and also has the following properties.
- void setRange(double min, double max)
- String textFromValue(double val)
- double valueFromText(String text)
Instance Properties
QDoubleSpinBox objects inherit properties from the QDoubleSpinBox prototype object and also have the following properties.
- prefix
- suffix
- cleanText
- decimals
- minimum
- maximum
- singleStep
- value


This page contains a list of projects that members of the AIR group would be interested in running either as projects for Research Higher Degree students, or where we are looking for collaborative partners - academic or industry. If you see a project that you would be interested in supporting, please contact us.
The aim of this project is to develop and evaluate new techniques for visualising dynamic data (e.g. stock market). As part of this project a generic 3D visualisation tool will be developed and applied to data from a range of application domains (stock market, sport, neurophysiology, consumer demand, etc).
The aim of this project is to develop a model of conflicting emotion which can be integrated into non-playing computer game characters. It examines current models of emotion using traditional conceptual modeling tools derived from software engineering. The model will be integrated and tested using agent-based simulations.
Metro maps were first introduced on the London Underground and now have become a common place tool for navigating transport routes around the world. The question explored in this project is; can more abstract knowledge be represented in this way? For example, would such a layout help novice users navigate through more abstract content. For example, the content of an instruction manual.
This project looks at a possible future for Australia when many small renewable energy generators are installed on the electricity grid and partake in a self-interested market. In this scenario each generator tries to optimize its cost recovery in the face of real time changes in electricity price and a regulatory environment designed to encourage renewable energy generators to support the grid during times of high demand or faults. The project will draw on multi agent theory, game theory and optimisation techniques.
This project looks at boolean models of gene networks, where each gene is modeled as either being on or off. These models have already provided new insights into the stability of critical functions such as cell division. Once the assumption of synchrony is relaxed the models have the potential to provide more information about stability. This project will build on network theory and make use of multi agents models.
A person's heart rate can be measured using simple and cheap sensors, but this only provides the time between each heart beat, not a full electrocardiograph. However, it is becoming increasing apparent that measures calculated from the heart rate can be very useful for the diagnosis of a number of diseases, so could be used as simple health screening system. This project will investigate new measures derived from heart rate recordings and will use some ideas from artificial intelligence.
In large databases, there may be many fields that could be used in analysis such as cluster and outlier detection and association analysis. Including all the fields assumed to be relevant has been shown to be sub-optimal and can actually result in poor performance. However, it is difficult to know which fields to select. This project uses search and optimisation methods to determine the optimum set for a database, given the query type.
| Next |


APOLLO 13 A film review by Steve Rhodes Copyright 1995 Steve Rhodes
RATING (0 TO ****): ***
According to a recent survey, most Americans old enough to remember have forgotten about the ill-fated Apollo 13 mission to the moon. Let me confess from the beginning that I remembered only vaguely that something happened. Apollo 13 was the mission that hit disaster in space.
APOLLO 13 is director Ron Howard's tale of that jinxed journey. Howard is an extremely talented director who specializes in comedies such as PARENTHOOD and SPLASH and in realistic tales that are told almost in real-time like THE PAPER and BACKDRAFT. In APOLLO 13 he attempts realism approaching documentary style.
The movie is based on the book "Lost Moon" by Jim Lovell who led the Apollo 13 mission. In the movie he is played by the ever popular and brilliant Tom Hanks. The rest of the crew consists of Fred Haise (Bill Paxton) and Jack Swigert (Kevin Bacon). The key member of the backup crew is Ken Mattingly (Gary Sinise). The tale of the wives is a secondary plot and focuses on Marilyn Lovell (Kathleen Quinlan). The crew at the NASA control center is lead by Gene Kranz (Ed Harris), but is filled with a great second, third, and fourth string cast. Every actor was carefully chosen. Nevertheless, the science and engineering of what they did was the real star of the movie in my book.
The story is set in 1970. Apollo 13 was the second time human beings attempted to walk on the moon so, of course, Americans were bored stiff and did not care. In today's vernacular, they had been there and done that. I refuse to relate any more since it is the story itself that makes the movie. The story is incredible.
Other than the story and the perfect casting, the only other part worth mentioning is the period makeup and costumes. For someone who was in grad school at Berkeley at the time, it was great fun seeing again the heavy eye shadow, frosted lips, and strange hair styles on the women and the too tight white shirts with ties, black horned rim glasses, and big sideburns on the men. You also see lots of dirty smoking - think of it as a long antismoking ad given how vile they made smoking look.
Although I thoroughly enjoyed the movie, almost cried a couple of times, and was fascinated by the innovative engineering solutions they came up with, I found much wrong with the picture, and I expected to like it more than I did. First, I had a major problem with Ron Howard's directing. From start to finish the energy level in the picture was way below an acceptable threshold. Every action seemed drawn out and too low key.
The editing by Daniel P. Hanley and Michael J. Hill was another area needing improvement. It was exactly 45 minutes into the show before anything of interest happened. I know because I was watching my watch wondering when the movie was going to get started. Viewing this first part was about as much fun as watching a Cricket match. Nothing happened, and it took forever. The editor could have easily set up the picture with 15 minutes tops. Even after it started clicking, there were many scenes where the astronauts would slowly push button lots of buttons, and we were forced to slowly watch them.
Finally, given the subject matter, one might expect some incredible cinematography. Cinematographer Dean Cundey's images were okay, but nothing special. The music by James Horner was totally forgettable - another opportunity lost.
APOLLO 13 runs 2:11 which is too long given the pacing. It is rated PG for some mild cussing and for frightening situations. I think it would be fine for any kid old enough to understand what is happening which I thinks means 9 or older. I recommend the show for its history, science, and engineering and for the fascinating story, and I award it ***.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEWED WRITTEN ON: July 21, 1995
Opinions expressed are mine and not meant to reflect my employer's.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Fluent 2013
-by Jorden Lowe
The topics that hit home
-
Performance / Google's tools for the web
- CSS and Coding it
- Team Dynamics
- Similarities in .Net
Performance
- Using Google Chrome
- Various tools, almost a VS.net for web
- Mobile
- Some tips
the Tools
- Pagespeed
- Performance Timing API (all browsers)
- Timelines
- Google Analytics
- Sampling Profiles
- Continuous paint mode
Mobile
-
3G
- 4G
- Not like wifi, takes time to fire up communication
Tips
- For Mobile
- Use SPDY, in place of HTTP 1.x
- Lazy Load JavaScript
- Use Median Times vs Average times for requests
- async attribute
- Inline some CSS and Javascript
- Keep between 300~1000 ms
- Render at 60 fps
CSS
- Treat like a programming language
- For those who hate CSS
- Use bootstrap
- Get CSS Frameworks
- CSS lint
- www.dribble.com
- Icon Fonts vs Sprites
- Use Sass or less
- Book suggestion "Lean UX"
- Create Style guide
- Prototype UI design
Team Dynamics
- Communication is important
- Team should know about the project
- Development practies
- Team sinks or swim together
- All parts of team, BA, DB, etc.
Team Dynamics
-
Mentoring
-
Pair programming
-
Code Reviews
-
Measurable Goals(30,60,90)
-
Providing guidence
- Don't create knowledge silos
How can we apply this to .Net?
- Refactoring tools
- Node.js
- Web forms
No matter what tools you use,
most important thing is to create.


I made this website to
expand and showcase
my knowledge of
HTML, CSS
and JavaScript.
I made this website to
expand and showcase
my knowledge of
HTML, CSS
and JavaScript.


[gecode-users] Calling Space::status() within a Brancher::commit() call
Christian Schulte
cschulte at kth.se
Mon Oct 12 15:39:10 CEST 2015
Hi Tommaso,
That is indeed not a very good idea as it basically would disable batch
recomputation in Gecode and hence will slow down the whole propagation
process considerably.
What you might want to do instead is put some state in the brancher that
tells the brancher that it is now generating one assignment out of a set of
assignments. This idea then is compatible with how recomputation is done in
Gecode.
For an example that has a slight similarity with what you describe, consider
the case study in MPG on bin packing: there the brancher also branches on
several values and variables simultaneously.
Hope that helps
Cheers
Christian
--
Christian Schulte, www.gecode.org/~schulte
Professor of Computer Science, KTH, cschulte at kth.se
Expert Researcher, SICS, cschulte at sics.se
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of tommaso.urli
Sent: Friday, October 9, 2015 07:18 AM
To: users at gecode.org
Subject: [gecode-users] Calling Space::status() within a Brancher::commit()
call
Hi all,
I am working on an incomplete (heuristic) brancher for a model. The brancher
focuses on feasibility: the goal is to finding a feasible solution quickly,
regardless of its cost, according to a problem-specific heuristic. In my
brancher I often assign several variables in the same branching step; I do
this because as soon as I consider the semantics of the variables, it makes
sense to group related decisions. However, since these variables can be
interconnected by constraints, I'd need to do a propagation step in order to
ensure that their domains are consistent between the assignments.
I am currently calling home->status() in the brancher's commit() method,
which does what I want, however I am not sure whether this is advisable in
general. I'd like some opinion from Christian or Guido regarding this.
Thanks,
---
Tommaso Urli, Researcher
Optimisation Research Group (ORG)
NICTA Canberra Research Lab (CRL)
7 London Circuit, Canberra ACT 2601
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20151012/edeb57ae/attachment.html>
More information about the users
mailing list


Electric motorcycles ride to rescue in fuel-short Cuba
NOVEMBER 10 — It is rush hour in Havana and the queue at the bus stop is longer than ever.
Then a fleet of electric motorcycles appears, beeping their horns.
Surprised and relieved, passengers jump on the backs of the 50 or so electric mopeds.
It is a new solution for Cubans struggling with fuel shortages driven by US sanctions that have curbed oil imports.
Cuba has long been known for the classic American cars that people here lovingly maintain decades after they stopped being built.
But urban transport on the communist island is evolving.
The bikes’ horns beep and some of the riders play reggaeton music — but, being electric, their motors make hardly any noise.
A Chinese-made electric motorcycle costs between US$1,800 and US$2,300 in Cuba. A basic petrol-powered bike on the island can cost up to six times that.
Volunteer riders
The electric bikes — with a maximum speed of about 50 kilometers (30 miles) per hour — were first licensed for import in 2013.
They have multiplied in the streets since then — and have come into their own with the recent fuel shortages.
“I really like this initiative, it helps a lot with the economy,” says passenger Yanet Figueroa, 42, sitting on the back of one of the bikes.
“It really helps people who have great need of it.”
Cuba plunged into a fuel crisis in September after Washington imposed restrictions on fuel shipments from Cuba’s top ally Venezuela.
Cuba had to make do in September with just 30 per cent of its usual fuel supply and the level has still not recovered — it is forecast to reach no more than 80 per cent this month.
With the public transport network badly hit, President Miguel Diaz-Canel has called on drivers to pick up passengers voluntarily.
The owners of electric bikes known as “motorinas” answered the call.
“We have volunteered to do this as a service to society,” says one of the drivers, Javier Capote, 33.
“It is going very well. We are very happy about it.”
The president himself during a televised address mentioned “those famous... what do you call them, the bikes? The ‘motorinas’, that have come out to help.”
Electric bike era
Cuban authorities estimate there are 210,000 electric motorcycles currently in use on the island.
That figure is expected to rise as the government in late October began to sell them with the price capped at US$1,700.
Those who make a living servicing the bikes are pleased by that move as it will bring down costs.
“It seems like a very good idea to us mechanics,” says one, Enrique Alfonso, 47, in his workshop.
He recalls the economic crisis of the 1990s that followed the end of cheap imports from the Soviet Union.
“That was the era of (affordable) Chinese bicycles. Now we are in the era of electric motorcycles,” he says.
“With everything that is going on the country, they have become obtainable for a lot of people.”
Accidents
The electric bikes had a mixed reception at first. Silent and often inexpertly ridden, they are often involved in accidents in a country that already suffers from thousands of crashes a year.
Officials say that of the 7,000 road accidents recorded so far this year, a third have involved electric motorcycles.
Authorities have responded by insisting riders have a license and register their vehicles.
The flourishing of electric bikes follows several years of gradual opening-up of Cuba’s state-run economy. It has also coincided with a digital mini-revolution.
Thanks to the availability of 3G-standard internet connections since last year, riders can network more easily.
The 3G connections helped spawn the Electric Motorbikes of Cuba online group, a club with more than 80 members.
It started out as a club for enthusiasts seeking to have “healthy fun and share the passion we all have for electric motorcycles and road safety,” says its president Osdany Fleites, a 37-year-old taxi driver.
“The motorcycles do not pollute the environment, they do not make a noise,” he says.
Now the club has evolved to have an environmental and “social purpose.”
Along with another club, Eracing, its members take part in rescuing bus passengers stuck due to the fuel shortages.
They have also taken part in environmental clean-up jobs, helping eradicate an infestation of troublesome giant snails in Havana, donated blood and visited children in a cancer ward. — AFP Relaxnews


3 references to FigureCastConversion
System.Management.Automation (3)
engine\CoreAdapter.cs (1)
853
LanguagePrimitives.
FigureCastConversion
(fromType, parameterType, ref rank);
engine\LanguagePrimitives.cs (1)
5673
converter =
FigureCastConversion
(fromType, toType, ref rank);
engine\runtime\Binding\Binders.cs (1)
3852
LanguagePrimitives.
FigureCastConversion
(fromType, resultType, ref rank);


Ceramic Company
NITCO Visit Now
Orient Bellvisit now
Asian Granito visit now
Naveen visit now
Lavish Visit Now
Simpolo visit now
Somany visit now
Cera visit now


Aquario data Settings
Lights Settings
Co2 Settings
Current time
Current date
Current day
Current tank temperature