from contextlib import contextmanager
from typing import Iterable
from pepper.framework.infra.di_container import DIContainer
[docs]class LockTimeoutError(Exception):
"""
Raised if an operation runs into a timeout constraint.
"""
pass
[docs]class ResourceContainer(DIContainer):
"""
:class:`~pepper.framework.infra.di_container.DIContainer` providing a :class:`.ResourceManager` instance.
"""
@property
def resource_manager(self):
# type: () -> ResourceManager
raise NotImplementedError()
[docs]class ResourceManager(object):
"""
ResourceManager manages resources available in the system.
Resources can be registered by name and different Locks can be obtained
to synchronize access to the registered resources.
"""
[docs] def get_lock(self, name, blocking=True, timeout=-1):
# type: (str, bool, float) -> Lock
"""
Obtain a :class:`Lock` for the given resource.
Parameters
----------
blocking : bool
Block until the resource is available or return immediately
timeout : float or None
Wait at most the specified `timeout` in seconds until the resource
is available if the specified timeout is positive, otherwise wait
indefinitely.
Returns
-------
:class:`Lock`
The lock.
"""
raise NotImplementedError()
[docs] def get_read_lock(self, name, blocking=True, timeout=-1):
# type: (str, bool, float) -> ReadLock
"""
Obtain a :class:`ReadLock` for the given resource.
Parameters
----------
blocking : bool
Block until the resource is available or return immediately
timeout : float or None
Wait at most the specified `timeout` in seconds until the resource
is available if the specified timeout is positive, otherwise wait
indefinitely.
Returns
-------
:class:`Lock`
The lock.
"""
raise NotImplementedError()
[docs] def get_write_lock(self, name, blocking=True, timeout=-1):
# type: (str, bool, float) -> WriteLock
"""
Obtain a :class:`WriteLock` for the given resource.
Parameters
----------
blocking : bool
Block until the resource is available or return immediately
timeout : float or None
Wait at most the specified `timeout` in seconds until the resource
is available if the specified timeout is positive, otherwise wait
indefinitely.
Returns
-------
:class:`Lock`
The lock.
"""
raise NotImplementedError()
[docs] def provide_resource(self, name):
# type: (str) -> None
"""
Register the resource with the given `name`.
Parameters
----------
name : str
The name of the resource.
Raises
------
:class:`ValueError`
if there is already a resource registered with the given name.
"""
raise NotImplementedError()
[docs] def retract_resource(self, name, force=False, timeout=-1):
# type: (str, bool, float) -> None
"""
Unregister the resource with the given `name`.
Parameters
----------
name : str
The name of the resource.
force : bool
Immediately retract the resource or block until all users released
the released the resource.
timeout : float or None
Wait at most the specified `timeout` in seconds until the resource
is released if the specified timeout is positive, otherwise wait
indefinitely.
"""
raise NotImplementedError()
@property
def resources(self):
# type: () -> Iterable[(str)]
"""
Retrieve all currently registered resource names.
Returns
-------
Iterable[(str)]
A collection of the registered resource names.
"""
raise NotImplementedError()
[docs] def has_resource(self, name):
# type: (str) -> bool
"""
Check if a resource with the given `name` is registered in the
ResourceManager.
Parameters
----------
name : str
The name of the resource.
Returns
-------
bool
Whether a resource with the given `name` is registered or not.
"""
return name in self.resources
[docs]class Lock(object):
"""Lock
Example usage:
.. code-block:: python
lock = resource_manager.get_lock("resource-identifier")
with lock: # blocks waiting for lock acquisition
# do something with the lock
Note: This lock is not *re-entrant*. Repeated calls after already
acquired will block.
This is an exclusive lock. For a read/write lock, see :class:`WriteLock`
and :class:`ReadLock`.
"""
[docs] def acquire(self, blocking=True, timeout=None):
# type: (bool, float) -> bool
"""
Acquire the lock. By defaults blocks and waits forever.
Parameters
----------
blocking : bool
Block until lock is obtained or return immediately
timeout : float or None
Wait at most the specified `timeout` in seconds to acquire the lock
if the specified timeout is positive, otherwise wait indefinitely.
Returns
-------
bool
Signal if the lock was acquired
Raises
------
:class:`LockTimeoutError`
if the lock wasn't acquired within `timeout` seconds.
"""
raise NotImplementedError()
@property
def locked(self):
# type: () -> bool
"""
Check if the lock is held by someone.
Returns
-------
bool
Signal if the lock is held by someone.
"""
raise NotImplementedError()
[docs] def release(self):
# type: () -> None
"""
Release the lock.
"""
raise NotImplementedError()
@property
def interrupted(self):
# type: () -> bool
"""
Signals that the lock should be released by the current owner.
Returns
-------
bool
Whether the lock should be released by the current owner.
"""
raise NotImplementedError()
def __enter__(self):
return self.acquire()
def __exit__(self, exc_type, exc_val, exc_tb):
self.release()
[docs]class WriteLock(Lock):
"""Write Lock
Example usage:
.. code-block:: python
lock = resource_manager.get_write_lock("resource-identifier")
with lock: # blocks waiting for lock acquisition
# do something with the lock
The write lock can not be acquired if the resource is held by any readers
or writers.
Note: This lock is not *re-entrant*. Repeated calls after already
acquired will block.
This is the write-side of a shared lock. See :class:`Lock` for a
standard exclusive lock and :class:`ReadLock` for the read-side of a
shared lock.
"""
[docs] def interrupt_readers(self, interrupt=True):
# type: () -> None
"""
Set the interrupted flag on the lock to signal the current owner that
the lock should be released.
"""
raise NotImplementedError()
[docs]class ReadLock(Lock):
"""Read Lock
Example usage:
.. code-block:: python
lock = resource_manager.get_read_lock("resource-identifier")
with lock: # blocks waiting for outstanding writers
# do something with the lock
The read lock blocks if the resource is held by any writers, but multiple
readers may hold the lock.
Note: This lock is not *re-entrant*. Repeated calls after already
acquired will block.
This is the read-side of a shared lock. See :class:`Lock` for a
standard exclusive lock and :class:`WriteLock` for the write-side of a
shared lock.
"""
[docs] def interrupt_writers(self, interrupt=True):
# type: () -> None
"""
Set the interrupted flag on the lock to signal the current owner that
the lock should be released.
"""
raise NotImplementedError()
[docs]@contextmanager
def acquire(lock, blocking=True, timeout=-1):
"""A context manager to enable usage of `timeout` and `blocking` arguments
in `with` blocks.
Example usage:
.. code-block:: python
lock = resource_manager.get_write_lock("resource-identifier")
with acquire(lock, blocking=True, timeout=10): # blocks waiting for lock acquisition with timeout
# do something with the lock
"""
result = None
try:
result = lock.acquire(blocking)
# result = lock.acquire(blocking=blocking, timeout=timeout)
yield result
finally:
if result:
lock.release()


Prez JavaScript
Home
Ajax
WebSockets
WebWorkers
Geolocalization
File Api
Promise
Slides
Documentation
Home
This page contains all the examples for the presentation.


The is example shows a toolbar menu configured via client code. Tap the button and a menu will be displayed. The menu does nothing other than maintain its own state.


|
Honghao Wei
|
|
Assistant Professor
School of Electrical Engineering and Computer Science
Washington State University, Pullman
EME 406
Email: honghao.wei [@] wsu [DOT] edu
Google Scholar
/ GitHub
|
About me
I am a tenure-track assistant professor in the School of Electrical Engineering and Computer Science at Washington State University (WSU). I received my Ph.D. degree from the Department of Electrical Engineering and Computer Science at the University of Michigan, Ann Arbor, 2023, advised by Prof. Lei Ying. My research interests lie in designing scalable, efficient, and practical machine learning algorithms with strong theoretical guarantees.
To Prospective Students
I have multiple fully-funded Ph.D. openings in my group at WSU.
I am looking for highly motivated students with strong backgrounds in mathematics, reinforcement learning, machine learning, and optimization to work with me.
Moreover, interns and visiting students are highly welcome!
Please shoot me an email if you are interested in working with me. Please include your resume, and undergraduate / graduate transcripts.
Research
My research interests include
Online Learning and Decision-making
Reinforcement Learning and Constrained Reinforcement Learning
Stochastic Modeling, Analysis and Optimization
Reinforcement Learning with Applications in Communication, Ride-hailing Networks, and Social Networks
News!
Preprints
Scalable and Sample Efficient Distributed Policy Gradient Algorithms in Multi-Agent Networked Systems [arxiv]
Xin Liu, Honghao Wei, and Lei Ying.
Sample Efficient Reinforcement Learning in Mixed Systems through Augmented Samples and Its Applications to Queueing Networks [arxiv]
Honghao Wei, Xin Liu, Weina Wang, Lei Ying.
Selected Publications
Provably Efficient Model-Free Algorithms for Non-stationary CMDPs [PDF]
(AISTATS-23) Honghao Wei, Arnob Ghosh, Xingyu Zhou, Lei Ying, and Ness Shroff.
Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond [PDF]
(NeurIPS-22) Hengquan Guo, Xin Liu, Honghao Wei, and Lei Ying.
Triple-Q: A Model-Free Algorithm for Constrained Reinforcement Learning with Sublinear Regret and Zero Constraint Violation [PDF]
(AISTATS-22) Honghao Wei, Xin Liu, and Lei Ying.
A Provably-Efficient Model-Free Algorithm for Infinite-Horizon Average-Reward Constrained Markov Decision Processes [PDF]
(AAAI-22) Honghao Wei, Xin Liu, and Lei Ying.
On Low-Complexity Quickest Intervention of Mutated Diffusion Processes Through Local Approximation [PDF]
(MobiHoc-22) Qining Zhang, Honghao Wei, Weina Wang, and Lei Ying.
Fork: A forward-looking actor for model-free reinforcement learning [PDF]
(CDC-21) Honghao Wei, and Lei Ying.
QuickStop: A Markov Optimal Stopping Approach for Quickest Misinformation Detection [PDF]
(Sigmetrics-19) Honghao Wei, Xiaohan Kang, Weina Wang, and Lei Ying.
Teaching Experience
Graduate Student Instructor, EECS 598 Reinforcement Learning, Winter 2022.
Graduate Student Instructor, EECS 501 Probability and Random Processes, Fall 2021.
Graduate Student Instructor, EECS 598 Reinforcement Learning, Winter 2020.
Graduate Student Instructor, EECS 598 Reinforcement Learning, Fall 2020.
Lab Teaching Assistant, EEE 334 Circuits II, Spring 2018.
Lab Teaching Assistant, EEE 455 Communication Systems, Fall 2017.
Professional Service
Conference Reviewer: ICLR 24 / NeurIPS 22, 23 / ICML 22, 23 / AAAI 22, 23, 24 / AISTATS 22, 23, 24 / INFOCOM 24 / OnlineMarketplaces 2022 / ISIT 21 / CDC 21 / RL4ITS 21 /
Journal Reviewer: IEEE Trans. Inf. Theory / Netw / Control. Netw. Syst.
|


As part of GSoC’16 I’m working on Porting Comment Alter module to Drupal 8 under the mentorship of boobaa and czigor. This blog is an excerpt of the work which I did in the twelfth week of the coding period of GSoC’16. The blogpost for the work done in the eleventh week can be found here.
The GSoC coding period ends this week and I’m glad that I was able to complete the project as per my proposal. All these three months have been very productive for me during which I learned a ton of things not just related to Drupal but also things like writing blogs, managing the project, etc.
During the coding period being stuck on a problem for 3-4 days and after countless hours of debugging finding the solution to be a one-liner or getting good reviews from mentors were some of the most intriguing and satisfying moments for me. I would like to thank both of my mentors boobaa and czigor for always helping me with coding, blogs and project management. It would have never been possible without them. I would also like to thank the whole Drupal community and Google Summer of Code for providing this opportunity to me.
Now talking about the work which I did this week, since most of the coding part was completed last week this week I focused on adding documentation for the module, doing cleaning and proof reading of the whole repo. I’ve created a short demo video: Comment Alter module for Drupal 8 demonstrating a simple use case and working of the module.
This week I also fixed some minor issues like changing the #parent
property for the comment form for all the fields to avoid any clashes. In order to allow same name fields on both comment as well as parent entity the #parent
property was used in the comment_alter_form_comment_form_alter()
function. Due to this the submitted field values appeared at a different location preventing instances of multiple field value in the same #parent
space or $form
element (see commit).
In the upcoming week I would first move the module to drupal.org and will update the description about the module on the project page. I planned to move the module to drupal.org last week only but because of some complications, my mentors were unable to do the final review of the module. My mentors will do with the review before this Friday so I’ll move the module to drupal.org by then.
By the end of the week I’ve created a demo video for the module and fixed some issues. My mentors have already reviewed the code for the work which I did during this week. If anyone is interested, my progress can be followed on my GitHub repo.


Menu
This is a local reconstruction of LPI’s LPIC-1 content.
Topic 1: The Linux Community and a Career in Open Source
1.1 Linux Evolution and Popular Operating Systems
Description: Knowledge of Linux development and major distributions.
Key Knowledge Areas:
- Distributions
- Embedded Systems
- Linux in the Cloud
The following is a partial list of the used files, terms and utilities:
- Debian, Ubuntu (LTS)
- CentOS, openSUSE, Red Hat, SUSE
- Linux Mint, Scientific Linux
- Raspberry Pi, Raspbian
- Android
1.2 Major Open Source Applications
Description: Awareness of major applications as well as their uses and development.
Key Knowledge Areas:
- Desktop applications
- Server applications
- Development languages
- Package management tools and repositories
The following is a partial list of the used files, terms and utilities:
- OpenOffice.org, LibreOffice, Thunderbird, Firefox, GIMP
- Nextcloud, ownCloud
- Apache HTTPD, NGINX, MariaDB, MySQL, NFS, Samba
- C, Java, JavaScript, Perl, shell, Python, PHP
- dpkg, apt-get, rpm, yum
1.3 Open Source Software and Licensing
Description: Open communities and licensing Open Source Software for business.
Key Knowledge Areas:
- Open source philosophy
- Open source licensing
- Free Software Foundation (FSF), Open Source Initiative (OSI)
The following is a partial list of the used files, terms and utilities:
- Copyleft, Permissive
- GPL, BSD, Creative Commons
- Free Software, Open Source Software, FOSS, FLOSS
- Open source business models
1.4 ICT Skills and Working in Linux
Key Knowledge Areas:
- Desktop skills
- Getting to the command line
- Industry uses of Linux, cloud computing and virtualization
The following is a partial list of the used files, terms and utilities:
- Using a browser, privacy concerns, configuration options, searching the web and saving content
- Terminal and console
- Password issues
- Privacy issues and tools
- Use of common open source applications in presentations and projects
Topic 2: Finding Your Way on a Linux System
2.1 Command Line Basics
Description: Basics of using the Linux command line.
Key Knowledge Areas:
- Basic shell
- Command line syntax
- Variables
- Quoting
The following is a partial list of the used files, terms and utilities:
- Bash
- echo
- history
- PATH environment variable
- export
- type
2.2 Using the Command Line to Get Help
Description: Running help commands and navigation of the various help systems.
Key Knowledge Areas:
- Man pages
- Info pages
The following is a partial list of the used files, terms and utilities:
- man
- info
- /usr/share/doc/
- locate
2.3 Using Directories and Listing Files
Description: Navigation of home and system directories and listing files in various locations.
Key Knowledge Areas:
- Files, directories
- Hidden files and directories
- Home directories
- Absolute and relative paths
The following is a partial list of the used files, terms and utilities:
- Common options for ls
- Recursive listings
- cd
- . and ..
- home and ~
2.4 Creating, Moving and Deleting Files
Description: Create, move and delete files and directories under the home directory.
Key Knowledge Areas:
- Files and directories
- Case sensitivity
- Simple globbing
The following is a partial list of the used files, terms and utilities:
- mv, cp, rm, touch
- mkdir, rmdir
Topic 3: The Power of the Command Line
3.1 Archiving Files on the Command Line
Description: Archiving files in the user home directory.
Key Knowledge Areas:
- Files, directories
- Archives, compression
The following is a partial list of the used files, terms and utilities:
- tar
- Common tar options
- gzip, bzip2, xz
- zip, unzip
3.2 Searching and Extracting Data from Files
Description: Search and extract data from files in the home directory.
Key Knowledge Areas:
- Command line pipes
- I/O redirection
- Basic Regular Expressions using ., [ ], *, and ?
The following is a partial list of the used files, terms and utilities:
- grep
- less
- cat, head, tail
- sort
- cut
- wc
3.3 Turning Commands into a Script
Description: Turning repetitive commands into simple scripts.
Key Knowledge Areas:
- Basic shell scripting
- Awareness of common text editors (vi and nano)
The following is a partial list of the used files, terms and utilities:
- #! (shebang)
- /bin/bash
- Variables
- Arguments
- for loops
- echo
- Exit status
Topic 4: The Linux Operating System
4.1 Choosing an Operating System
Description: Knowledge of major operating systems and Linux distributions.
Key Knowledge Areas:
- Differences between Windows, OS X and Linux
- Distribution life cycle management
The following is a partial list of the used files, terms and utilities:
- GUI versus command line, desktop configuration
- Maintenance cycles, beta and stable
4.2 Understanding Computer Hardware
Description: Familiarity with the components that go into building desktop and server computers.
Key Knowledge Areas:
- Hardware
The following is a partial list of the used files, terms and utilities:
- Motherboards, processors, power supplies, optical drives, peripherals
- Hard drives, solid state disks and partitions, /dev/sd*
- Drivers
4.3 Where Data is Stored
Key Knowledge Areas:
- Programs and configuration
- Processes
- Memory addresses
- System messaging
- Logging
The following is a partial list of the used files, terms and utilities:
- ps, top, free
- syslog, dmesg
- /etc/, /var/log/
- /boot/, /proc/, /dev/, /sys/
4.4 Your Computer on the Network
Description: Querying vital networking configuration and determining the basic requirements for a computer on a Local Area Network (LAN).
Key Knowledge Areas:
- Internet, network, routers
- Querying DNS client configuration
- Querying network configuration
The following is a partial list of the used files, terms and utilities:
- route, ip route show
- ifconfig, ip addr show
- netstat, ss
- /etc/resolv.conf, /etc/hosts
- IPv4, IPv6
- ping
- host
Topic 5: Security and File Permissions
5.1 Basic Security and Identifying User Types
Description: Various types of users on a Linux system.
Key Knowledge Areas:
- Root and standard users
- System users
The following is a partial list of the used files, terms and utilities:
- /etc/passwd, /etc/shadow, /etc/group
- id, last, who, w
- sudo, su
5.2 Creating Users and Groups
Description: Creating users and groups on a Linux system.
Key Knowledge Areas:
- User and group commands
- User IDs
The following is a partial list of the used files, terms and utilities:
- /etc/passwd, /etc/shadow, /etc/group, /etc/skel/
- useradd, groupadd
- passwd
5.3 Managing File Permissions and Ownership
Description: Understanding and manipulating file permissions and ownership settings.
Key Knowledge Areas:
- File and directory permissions and ownership
The following is a partial list of the used files, terms and utilities:
- ls -l, ls -a
- chmod, chown
5.4 Special Directories and Files
Description: Special directories and files on a Linux system including special permissions.
Key Knowledge Areas:
- Using temporary files and directories
- Symbolic links
The following is a partial list of the used files, terms and utilities:
- /tmp/, /var/tmp/ and Sticky Bit
- ls -d
- ln -s
Last Modified: 2021-07-03T20:58:26.422606Z
Back to top


jsqis, at its core, is a quantum computer simulator written in Javascript. It allows initialization of quantum registers and their manipulation by means of quantum gates.
Additionally, when used in the browser, jsqis provides a lucid visual representation of a system of quantum bits (qubits). This representation is mathematically precise, allowing people to reason about quantum computing without having mastered any topics in mathematics.
In the language of mathematics, we do this by enumerating all the computational basis states and, beside each basis state, displaying its amplitude (which is a complex number) using a simple graphical representation.
A single bit can be in either of two classical states, zero or one.
A quantum bit can also be in an equal superposition of those two states.
Not only that, but the states can have a relative phase difference.
And they can of course have different amplitudes as well.
When a quantum bit is measured, it will assume a definite value (either zero or one). The probability that the bit will be measured in a given state is proportional to the area of the corresponding box.
In addition to the arrow representing the relative phase, we color code it as well, choosing a continuous hue based on an amplitude's phase. This is redundant (as the arrow already encodes the full information), but stresses the fact that phase information is incredibly important in quantum mechanics.
Just as in the mathematical representation of quantum mechanics, our states are invariant up to a change in overall magnitude and global phase. In other words, it is the relative difference between the sizes and the directions of the arrows that matter. For instance, the following states are all equivalent.
The various states of a single qubit can be understood in terms of photon polarization. Unfortunately, these animations can take quite a bit of CPU time, so this page only enables them when you hover the mouse over a given element.
We define the states 0 and 1 to be represented by vertically- and horizontally-polarized photons, respectively.
A an equal weighted superposition can then be in many different states. If the phases point in parallel directions, we will get diagonal polarization.
Other possibilities include left and right circular polarization.
Elliptical polarization is also possible.
Any other one-qubit quantum state can be represented this way as well.


| WinAPI Wrapper |
The NonCopyAble class is a helper class. It is used as a base class for other classes to prevent them being copied. You cannot create objects of NonCopyAble class, because it has its constructor and destructor private. You cannot copy objects derived from NonCopyAble class, because it has its copy constructor and copy (assignment) operator= private.
Certain objects cannot be copied, because either the WinAPI makes it impossible to copy them or it would be too complex to copy them. Hence these objects' classes are derived from NonCopyAble.


Bookmarx
Add a new bookmark
Fill out the form with the requested values
Advanced Options
Star it?
ADD
CANCEL


hilary_mason_data hilary_mason_data-2008 hilary_mason_data-2008-21 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: What am I like? How about you? Posted: September 26, 2008 | Author: hilary | Filed under: blog | Tags: me , path101 , personality | Leave a comment » My Path 101 Personality Quiz Traits Highest Scoring Traits Love of Thinking Relativism Compartmentalization Lowest Scoring Traits Concreteness Idealism Emotion Like-minded people work in: Biotechnology and Pharmaceuticals Medical Equipment Manufacturing Computer Hardware and Infrastructure Urban Planning Corporate Law See hmason’s full assessment and get your own . I’ve always been skeptical of and fascinated by personality tests. On the one hand, it’s your personality — who could possibly know more about you than you do? On the other, there’s something alluring about quantifying your characteristics, especially when you can compare them to others. These are my results from the Path101 person
sentIndex sentText sentNum sentScore
1 I’ve always been skeptical of and fascinated by personality tests. [sent-4, score-0.886]
2 On the one hand, it’s your personality — who could possibly know more about you than you do? [sent-5, score-0.926]
3 On the other, there’s something alluring about quantifying your characteristics, especially when you can compare them to others. [sent-6, score-0.376]
4 These are my results from the Path101 personality test . [sent-7, score-0.878]
wordName wordTfidf (topN-words)
[('personality', 0.703), ('traits', 0.422), ('scoring', 0.281), ('compare', 0.24), ('fascinated', 0.12), ('hardware', 0.12), ('characteristics', 0.12), ('hand', 0.12), ('medical', 0.12), ('planning', 0.108), ('test', 0.108), ('possibly', 0.093), ('computer', 0.093), ('infrastructure', 0.093), ('hmason', 0.088), ('especially', 0.079), ('full', 0.079), ('thinking', 0.076), ('see', 0.071), ('could', 0.07), ('results', 0.067), ('september', 0.067), ('always', 0.063), ('go', 0.057), ('something', 0.057), ('leave', 0.054), ('love', 0.054), ('work', 0.037), ('get', 0.037), ('ve', 0.035), ('know', 0.035), ('like', 0.033), ('comment', 0.031), ('one', 0.025), ('people', 0.025), ('blog', 0.008), ('tags', 0.006)]
simIndex simValue blogId blogTitle
same-blog 1 1.0000001 21 hilary mason data-2008-09-26-What am I like? How about you?
Introduction: What am I like? How about you? Posted: September 26, 2008 | Author: hilary | Filed under: blog | Tags: me , path101 , personality | Leave a comment » My Path 101 Personality Quiz Traits Highest Scoring Traits Love of Thinking Relativism Compartmentalization Lowest Scoring Traits Concreteness Idealism Emotion Like-minded people work in: Biotechnology and Pharmaceuticals Medical Equipment Manufacturing Computer Hardware and Infrastructure Urban Planning Corporate Law See hmason’s full assessment and get your own . I’ve always been skeptical of and fascinated by personality tests. On the one hand, it’s your personality — who could possibly know more about you than you do? On the other, there’s something alluring about quantifying your characteristics, especially when you can compare them to others. These are my results from the Path101 person
2 0.046104148 4 hilary mason data-2007-06-11-Teaching Search Techniques with Google Games
Introduction: Teaching Search Techniques with Google Games Posted: June 11, 2007 | Author: hilary | Filed under: blog | Tags: games , search | 4 Comments » Educators routinely discuss how students have trouble evaluating and using the results of their Google searches. There are really two parts to this problem, though, and while it’s true that students may struggle to identify reliable sources, before we can address that, we need to teach them how to write good queries. It’s that old computer science maxim: Garbage In, Garbage Out . I like to teach students how to write interesting queries by playing games. This games force students to think about the queries they are writing, and not the results. I have no scientific proof of the results, but I do know that it keeps them entertained and thinking for a while! My favorite games: Google Whack – The classic! Find a two-word query, with no punctuation, that return one and only one result. The Google Whacks on the
3 0.044080045 99 hilary mason data-2013-04-01-Data Engineering
Introduction: Data Engineering Posted: April 1, 2013 | Author: Hilary Mason | Filed under: blog | Tags: bitly , data , engineering , infrastructure | 5 Comments » Data engineering is when the architecture of your system is dependent on characteristics of the data flowing through that system . It requires a different kind of engineering process than typical systems engineering, because you have to do some work upfront to understand the nature of the data before you can effectively begin to design the infrastructure. Most data engineering systems also transform the data as they process it. Developing these types of systems requires an initial research phase, where you do the necessary work to understand the characteristics of the data, before you design the system (and perhaps even requiring an active experimental process where you try multiple infrastructure options in the wild before making a final decision). I’ve seen numerous people run straight into walls when
4 0.037586927 81 hilary mason data-2013-01-03-Interview Questions for Data Scientists
Introduction: Interview Questions for Data Scientists Posted: January 3, 2013 | Author: Hilary Mason | Filed under: blog | Tags: datascience , hiring , startups | 28 Comments » Great data scientists come from such diverse backgrounds that it can be difficult to get a sense of whether someone is up to the job in just a short interview. In addition to the technical questions, I find it useful to have a few questions that draw out the more creative and less discrete elements of a candidate’s personality. Here are a few of my favorite questions. What was the last thing that you made for fun? This is my favorite question by far — I want to work with the kind of people who don’t turn their brains off when they go home. It’s also a great way to learn what gets people excited. What’s your favorite algorithm? Can you explain it to me? I don’t know any data scientists who haven’t fallen in love with an algorithm, and I want to see both that enthusiasm and that the ca
5 0.035524931 114 hilary mason data-2013-12-18-Using Twitter’s Lead-Gen Card to Recruit Beta Testers
Introduction: Using Twitter’s Lead-Gen Card to Recruit Beta Testers Posted: December 18, 2013 | Author: Hilary Mason | Filed under: blog | Tags: email , hack , twitter | 12 Comments » It turns out that it’s pretty easy to co-opt Twitter’s Lead Generation card for anything where you want to gather a bunch of e-mail addresses from your Twitter community. I was looking for people willing to alpha test a little side project of mine, and it worked great and didn’t cost anything. The tweet itself: Love tech discussion but looking for a better community? Help me beta test a side project! https://t.co/H3DYjbCy19 — Hilary Mason (@hmason) December 12, 2013 I created it pretty easily: First, go to ads.twitter.com , log in, and go to “creatives”, then “cards”. Click “Create Lead Generation Card”. It’s a big blue button. You can include a title and a short description. Curiously, you can also include a 600px by 150px image. This seems like an opportunity to
6 0.034649312 108 hilary mason data-2013-09-26-Learn to Code, Learn to Think
7 0.033838488 82 hilary mason data-2013-01-08-Bitly Social Data APIs
8 0.031747025 42 hilary mason data-2010-04-18-Stop talking, start coding
9 0.030196186 70 hilary mason data-2012-01-12-Going to Strata in Feb?
10 0.029390823 3 hilary mason data-2007-06-08-The Best Time to Search for Academic Jobs
11 0.02751397 54 hilary mason data-2011-03-18-Be Ballsy.
12 0.027217764 43 hilary mason data-2010-05-27-E-mail automation, questions and answers
13 0.026122751 94 hilary mason data-2013-03-08-Speaking: Title Slides + Twitter = You Win
14 0.024699967 32 hilary mason data-2009-08-29-Do you do human subject research?
15 0.023075499 76 hilary mason data-2012-08-28-How do you prioritize research?
16 0.023061972 30 hilary mason data-2009-06-01-My Barcamp Presentation: Have Data?  How about you?
Introduction: What am I like? How about you? Posted: September 26, 2008 | Author: hilary | Filed under: blog | Tags: me , path101 , personality | Leave a comment » My Path 101 Personality Quiz Traits Highest Scoring Traits Love of Thinking Relativism Compartmentalization Lowest Scoring Traits Concreteness Idealism Emotion Like-minded people work in: Biotechnology and Pharmaceuticals Medical Equipment Manufacturing Computer Hardware and Infrastructure Urban Planning Corporate Law See hmason’s full assessment and get your own . I’ve always been skeptical of and fascinated by personality tests. On the one hand, it’s your personality — who could possibly know more about you than you do? On the other, there’s something alluring about quantifying your characteristics, especially when you can compare them to others. These are my results from the Path101 person
2 0.18291049 99 hilary mason data-2013-04-01-Data Engineering
Introduction: Data Engineering Posted: April 1, 2013 | Author: Hilary Mason | Filed under: blog | Tags: bitly , data , engineering , infrastructure | 5 Comments » Data engineering is when the architecture of your system is dependent on characteristics of the data flowing through that system . It requires a different kind of engineering process than typical systems engineering, because you have to do some work upfront to understand the nature of the data before you can effectively begin to design the infrastructure. Most data engineering systems also transform the data as they process it. Developing these types of systems requires an initial research phase, where you do the necessary work to understand the characteristics of the data, before you design the system (and perhaps even requiring an active experimental process where you try multiple infrastructure options in the wild before making a final decision). I’ve seen numerous people run straight into walls when
3 0.15491652 63 hilary mason data-2011-09-26-Hacking the Food System: The Ultimate Chocolate Chip Cookie
Introduction: Hacking the Food System: The Ultimate Chocolate Chip Cookie Posted: September 26, 2011 | Author: Hilary Mason | Filed under: blog , projects | Tags: cookies , food , tech , writing | 1 Comment » Food+Tech Connect is putting together a fun series of essays where technologists and foodies share their opinions on how to hack to the food system. They also had a great party, with liquid nitrogen ice cream and other very cool foods. I’m honored to have been asked to participate, especially since food and tech are two of my favorite things! I decided to write about a hack that I did about three years ago, where I wrote a parser and built a statistical model of chocolate chip cookie recipes that I crawled off of the web.  This isn’t the Neiman Marcus $65,000 cookie recipe. Nor is it the classic Toll House Chocolate Chip Cookie recipe that we all grew up with (and, though th
4 0.15491466 3 hilary mason data-2007-06-08-The Best Time to Search for Academic Jobs
Introduction: The Best Time to Search for Academic Jobs Posted: June 8, 2007 | Author: hilary | Filed under: blog | Tags: search | Leave a comment » It’s common knowledge that academic job announcements are seasonal. In general, hiring committees are formed in the fall; they announce positions, wait a month or two for applications, then spend weeks interviewing candidates before making a decision in March or April for positions that will begin the following September. I found some data to prove it, and to possibly guide those engaged in an academic job search. I was playing with Indeed.com ‘s job trends feature, when I realized that you could search not only for particular skills and specializations, but for job categories. A search for “professor” reveals some nice peaks right around mid-October. While a search for “postdoc” isn’t quite so periodic. I can only guess that this can possibly be attributed to trends in funding for postdoctoral positions. It would
5 0.14623152 19 hilary mason data-2008-03-27-InfoFez: Information-based Navigation in Second Life
Introduction: InfoFez: Information-based Navigation in Second Life Posted: March 27, 2008 | Author: hilary | Filed under: projects | Tags: education , secondlife , webapp | Leave a comment » The new version of the InfoFez launches on April 7th… be there!
6 0.14598595 82 hilary mason data-2013-01-08-Bitly Social Data APIs
7 0.14225173 41 hilary mason data-2010-03-14-Art and Technology: Seven on Seven
8 0.1244329 4 hilary mason data-2007-06-11-Teaching Search Techniques with Google Games
9 0.1234961 77 hilary mason data-2012-09-18-Hey Yahoo, You’re Optimizing the Wrong Thing
10 0.12310661 15 hilary mason data-2008-01-28-How to Control Second Life with a Wii-mote (on a Macbook Pro)
11 0.1219212 111 hilary mason data-2013-10-22-The DataGotham 2013 Videos are up!
12 0.11858398 108 hilary mason data-2013-09-26-Learn to Code, Learn to Think
13 0.11345403 70 hilary mason data-2012-01-12-Going to Strata in Feb?
14 0.11055693 43 hilary mason data-2010-05-27-E-mail automation, questions and answers
15 0.10950687 109 hilary mason data-2013-09-30-Need actual random numbers? Meet the NIST randomness beacon.
16 0.10707451 32 hilary mason data-2009-08-29-Do you do human subject research?
17 0.10501432 42 hilary mason data-2010-04-18-Stop talking, start coding
18 0.10396348 5 hilary mason data-2007-07-17-Where the Sun Rises… in Second Life
19 0.10057895 30 hilary mason data-2009-06-01-My Barcamp Presentation: Have Data?
Introduction: I’m a Dead Celebrity! Posted: January 29, 2013 | Author: Hilary Mason | Filed under: blog | 4 Comments » Hilary Mason, Bing Celebrity I have a Google alert set up for my name, and over the weekend it sent me here . Update: Bing has removed the page and now redirects to a regular search. It’s a page on Bing Celebrities, merging my information with information about Hilary Mason, the (now deceased) British actress . According to this page, I have starred in movies before I was born and made videos after I died. It’s my photo and her filmography. It’s creepy, but it’s also intriguing. How does this happen? The data is credited to AMG and inbaseline , whose domain, though linked directly from Bing, does not resolve. Entity disambiguation is certainly a challenge, but I expect more from Microsoft, with so much data and so many brains. This kind of error makes it extremely clear that identity is not a solved problem . I’ve written a bit about iden
same-blog 2 0.92036486 21 hilary mason data-2008-09-26-What am I like? How about you?
Introduction: What am I like? How about you? Posted: September 26, 2008 | Author: hilary | Filed under: blog | Tags: me , path101 , personality | Leave a comment » My Path 101 Personality Quiz Traits Highest Scoring Traits Love of Thinking Relativism Compartmentalization Lowest Scoring Traits Concreteness Idealism Emotion Like-minded people work in: Biotechnology and Pharmaceuticals Medical Equipment Manufacturing Computer Hardware and Infrastructure Urban Planning Corporate Law See hmason’s full assessment and get your own . I’ve always been skeptical of and fascinated by personality tests. On the one hand, it’s your personality — who could possibly know more about you than you do? On the other, there’s something alluring about quantifying your characteristics, especially when you can compare them to others. These are my results from the Path101 person
3 0.20903185 114 hilary mason data-2013-12-18-Using Twitter’s Lead-Gen Card to Recruit Beta Testers
Introduction: Using Twitter’s Lead-Gen Card to Recruit Beta Testers Posted: December 18, 2013 | Author: Hilary Mason | Filed under: blog | Tags: email , hack , twitter | 12 Comments » It turns out that it’s pretty easy to co-opt Twitter’s Lead Generation card for anything where you want to gather a bunch of e-mail addresses from your Twitter community. I was looking for people willing to alpha test a little side project of mine, and it worked great and didn’t cost anything. The tweet itself: Love tech discussion but looking for a better community? Help me beta test a side project! https://t.co/H3DYjbCy19 — Hilary Mason (@hmason) December 12, 2013 I created it pretty easily: First, go to ads.twitter.com , log in, and go to “creatives”, then “cards”. Click “Create Lead Generation Card”. It’s a big blue button. You can include a title and a short description. Curiously, you can also include a 600px by 150px image. This seems like an opportunity to
4 0.20188093 87 hilary mason data-2013-01-28-Startups: Why to Share Data with Academics
Introduction: Startups: Why to Share Data with Academics Posted: January 28, 2013 | Author: Hilary Mason | Filed under: blog | 5 Comments » Last week I wrote a bit about how to share data with academics . This is the complimentary piece, on why you should invest the time and energy in sharing your data with the academic community. As I was talking to people about this topic it became clear that there are really two different questions people ask. First, why do this at all? And second, what do I tell my boss? Let’s start with the second one. This is what you should tell your boss: Academic research based on our work is a great press opportunity and demonstrates that credible people outside of our company find our work interesting. Having researchers work on our data is an easy way to access highly educated brainpower, for free, that in no way competes with us. Who knows what interesting stuff they’ll come up with? Personal relationships with university faculty ar
5 0.1998339 109 hilary mason data-2013-09-30-Need actual random numbers? Meet the NIST randomness beacon.
Introduction: Need actual random numbers? Meet the NIST randomness beacon. Posted: September 30, 2013 | Author: Hilary Mason | Filed under: projects | Tags: beacon , python , random , randomness , randomnumbers | 5 Comments » I wrote a python module that wraps that NIST Randomness Beacon , making it simple to get truly random numbers in python. It’s easy to use: b = Beacon() print b.last_record() print b.previous_record() #and so on There’s also a handy generator for getting a set of n random numbers. (One of the best gifts I ever got was a copy of 1,000,000 Random Numbers , and I’ve been intrigued ever since.) Please note that this the randomness beacon is not intended to be a source of cryptographic keys — indeed, it’s a public set of numbers, so I wouldn’t recommend doing anything that could be compromised by someone else having the access to the exact same set of numbers . Rather, this is interesting precisely for the scientific opportunities that
6 0.19585896 58 hilary mason data-2011-06-22-My Head is Open Source!
7 0.18843052 7 hilary mason data-2007-07-30-Tip: How to Search Google for Ideas
8 0.17361009 24 hilary mason data-2009-01-31-WordPress tip: Move comments from one post to another post
9 0.16773394 85 hilary mason data-2013-01-19-Startups: How to Share Data with Academics
10 0.16466185 105 hilary mason data-2013-07-05-Speaking: Spend at least 1-3 of the time practicing the talk
11 0.1597998 80 hilary mason data-2012-12-28-Getting Started with Data Science
12 0.15921229 40 hilary mason data-2010-02-16-Conference: Search and Social Media 2010
13 0.15249905 92 hilary mason data-2013-02-25-A (short) List of Data Science Blogs
14 0.15221711 82 hilary mason data-2013-01-08-Bitly Social Data APIs
15 0.15206242 46 hilary mason data-2010-08-15-Should you attend Hadoop World? Yes.
16 0.14965668 81 hilary mason data-2013-01-03-Interview Questions for Data Scientists
17 0.14684531 83 hilary mason data-2013-01-10-Book Book — Goose!
18 0.14006811 3 hilary mason data-2007-06-08-The Best Time to Search for Academic Jobs
19 0.13958836 91 hilary mason data-2013-02-22-Why YOU (an introverted nerd) Should Try Public Speaking
20 0.13838471 42 hilary mason data-2010-04-18-Stop talking, start coding


Dlib is principally a C++ library, however, you can use a number of its tools from python applications. This page documents the python API for working with these dlib tools. If you haven’t done so already, you should probably look at the python example programs first before consulting this reference. These example programs are little mini-tutorials for using dlib from python. They are listed on the left of the main dlib web page.
This object represents a 1D array of floating point numbers. Moreover, it binds directly to the C++ type std::vector<double>.
cost.nr() == cost.nc() (i.e. the input must be a square matrix)
Interprets cost as a cost assignment matrix. That is, cost[i][j] represents the cost of assigning i to j.
Interprets assignment as a particular set of assignments. That is, i is assigned to assignment[i].
returns the cost of the given assignment. That is, returns a number which is:
sum over i: cost[i][assignment[i]]
This function performs a canonical correlation analysis between the vectors in L and R. That is, it finds two transformation matrices, Ltrans and Rtrans, such that row vectors in the transformed matrices L*Ltrans and R*Rtrans are as correlated as possible (note that in this notation we interpret L as a matrix with the input vectors in its rows). Note also that this function tries to find transformations which produce num_correlations dimensional output vectors.
Note that you can easily apply the transformation to a vector using apply_cca_transform(). So for example, like this:
- apply_cca_transform(Ltrans, some_sparse_vector)
returns a structure containing the Ltrans and Rtrans transformation matrices as well as the estimated correlations between elements of the transformed vectors.
This function assumes the data vectors in L and R have already been centered (i.e. we assume the vectors have zero means). However, in many cases it is fine to use uncentered data with cca(). But if it is important for your problem then you should center your data before passing it to cca().
This function works with reduced rank approximations of the L and R matrices. This makes it fast when working with large matrices. In particular, we use the dlib::svd_fast() routine to find reduced rank representations of the input matrices by calling it as follows: svd_fast(L, U,D,V, num_correlations+extra_rank, q) and similarly for R. This means that you can use the extra_rank and q arguments to cca() to influence the accuracy of the reduced rank approximation. However, the default values should work fine for most problems.
The dimensions of the output vectors produced by L*#Ltrans or R*#Rtrans are ordered such that the dimensions with the highest correlations come first. That is, after applying the transforms produced by cca() to a set of vectors you will find that dimension 0 has the highest correlation, then dimension 1 has the next highest, and so on. This also means that the list of estimated correlations returned from cca() will always be listed in decreasing order.
This function performs the ridge regression version of Canonical Correlation Analysis when regularization is set to a value > 0. In particular, larger values indicate the solution should be more heavily regularized. This can be useful when the dimensionality of the data is larger than the number of samples.
A good discussion of CCA can be found in the paper “Canonical Correlation Analysis” by David Weenink. In particular, this function is implemented using equations 29 and 30 from his paper. We also use the idea of doing CCA on a reduced rank approximation of L and R as suggested by Paramveer S. Dhillon in his paper “Two Step CCA: A new spectral method for estimating vector models of words”.
cross_validate_ranking_trainer( (svm_rank_trainer_sparse)trainer, (sparse_ranking_pairs)samples, (int)folds) -> _ranking_test
cross_validate_sequence_segmenter( (sparse_vectorss)samples, (rangess)segments, (int)folds [, (segmenter_params)params=<BIO,highFeats,signed,win=5,threads=4,eps=0.1,cache=40,non-verbose,C=100>]) -> segmenter_test
cross_validate_trainer( (svm_c_trainer_sparse_radial_basis)trainer, (sparse_vectors)x, (array)y, (int)folds) -> _binary_test
cross_validate_trainer( (svm_c_trainer_histogram_intersection)trainer, (vectors)x, (array)y, (int)folds) -> _binary_test
cross_validate_trainer( (svm_c_trainer_sparse_histogram_intersection)trainer, (sparse_vectors)x, (array)y, (int)folds) -> _binary_test
cross_validate_trainer( (svm_c_trainer_linear)trainer, (vectors)x, (array)y, (int)folds) -> _binary_test
cross_validate_trainer( (svm_c_trainer_sparse_linear)trainer, (sparse_vectors)x, (array)y, (int)folds) -> _binary_test
cross_validate_trainer_threaded( (svm_c_trainer_sparse_radial_basis)trainer, (sparse_vectors)x, (array)y, (int)folds, (int)num_threads) -> _binary_test
cross_validate_trainer_threaded( (svm_c_trainer_histogram_intersection)trainer, (vectors)x, (array)y, (int)folds, (int)num_threads) -> _binary_test
cross_validate_trainer_threaded( (svm_c_trainer_sparse_histogram_intersection)trainer, (sparse_vectors)x, (array)y, (int)folds, (int)num_threads) -> _binary_test
cross_validate_trainer_threaded( (svm_c_trainer_linear)trainer, (vectors)x, (array)y, (int)folds, (int)num_threads) -> _binary_test
cross_validate_trainer_threaded( (svm_c_trainer_sparse_linear)trainer, (sparse_vectors)x, (array)y, (int)folds, (int)num_threads) -> _binary_test
Compute the dot product between two dense column vectors.
This object represents a sliding window histogram-of-oriented-gradients based object detector.
Returns the default face detector
This is a GUI window capable of showing images on the screen.
Add a list of rectangles to the image_window. They will be displayed as boxes of the given color.
Remove all overlays from the image_window.
Make the image_window display the given image.
Set the title of the window to the given value.
This function blocks until the window is closed.
This function modifies its argument so that it is a properly sorted sparse vector. This means that the elements of the sparse vector will be ordered so that pairs with smaller indices come first. Additionally, there won’t be any pairs with identical indices. If such pairs were present in the input sparse vector then their values will be added together and only one pair with their index will be present in the output.
This object represents a dense 2D matrix of floating point numbers.Moreover, it binds directly to the C++ type dlib::matrix<double>.
Return the number of columns in the matrix.
Return the number of rows in the matrix.
Set the size of the matrix to the given number of rows and columns.
Finds and returns the solution to the following optimization problem:
Maximize: f(A) == assignment_cost(cost, A) Subject to the following constraints:
- The elements of A are unique. That is, there aren’t any elements of A which are equal.
- len(A) == cost.nr()
Note that this function converts the input cost matrix into a 64bit fixed point representation. Therefore, you should make sure that the values in your cost matrix can be accurately represented by 64bit fixed point values. If this is not the case then the solution my become inaccurate due to rounding error. In general, this function will work properly when the ratio of the largest to the smallest value in cost is no more than about 1e16.
This object is used to represent the elements of a sparse_vector.
This field represents the index/dimension number.
This field contains the value in a vector at dimension specified by the first field.
This object is used to represent a range of elements in an array.
The index of the first element in the range. This is represented using an unsigned integer.
One past the index of the last element in the range. This is represented using an unsigned integer.
This object is an array of range objects.
This object is an array of arrays of range objects.
This object represents a rectangular area of an image.
An array of rectangle objects.
This class is used to define all the optional parameters to the train_sequence_segmenter() and cross_validate_sequence_segmenter() routines.
SVM C parameter
This object is the output of the dlib.test_sequence_segmenter() and dlib.cross_validate_sequence_segmenter() routines.
This object represents a sequence segmenter and is the type of object returned by the dlib.train_sequence_segmenter() routine.
This object represents a sliding window histogram-of-oriented-gradients based object detector.
This object is a container for the options to the train_simple_object_detector() routine.
C is the usual SVM C regularization parameter. So it is passed to structural_object_detection_trainer::set_c(). Larger values of C will encourage the trainer to fit the data better but might lead to overfitting. Therefore, you must determine the proper setting of this parameter experimentally.
if true, train_simple_object_detector() will assume the objects are left/right symmetric and add in left right flips of the training images. This doubles the size of the training dataset.
If true, train_simple_object_detector() will print out a lot of information to the screen while training.
The sliding window used will have about this many pixels inside it.
epsilon is the stopping epsilon. Smaller values make the trainer’s solver more accurate but might take longer to train.
train_simple_object_detector() will use this many threads of execution. Set this to the number of CPU cores on your machine to obtain the fastest training speed.
This function solves a structural SVM problem and returns the weight vector that defines the solution. See the example program python_examples/svm_struct.py for documentation about how to create a proper problem object.
This object represents the mathematical idea of a sparse column vector. It is simply an array of dlib.pair objects, each representing an index/value pair in the vector. Any elements of the vector which are missing are implicitly set to zero.
Unless otherwise noted, any routines taking a sparse_vector assume the sparse vector is sorted and has unique elements. That is, the index values of the pairs in a sparse_vector should be listed in increasing order and there should not be duplicates. However, some functions work with “unsorted” sparse vectors. These are dlib.sparse_vector objects that have either duplicate entries or non-sorted index values. Note further that you can convert an “unsorted” sparse_vector into a properly sorted sparse vector by calling dlib.make_sparse_vector() on it.
This object is an array of sparse_vector objects.
This object is an array of arrays of sparse_vector objects.
train( (svm_rank_trainer)arg1, (ranking_pairs)arg2) -> _decision_function_linear
train( (svm_rank_trainer_sparse)arg1, (sparse_ranking_pairs)arg2) -> _decision_function_sparse_linear
test_binary_decision_function( (_decision_function_sparse_linear)function, (sparse_vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_radial_basis)function, (vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_sparse_radial_basis)function, (sparse_vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_polynomial)function, (vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_sparse_polynomial)function, (sparse_vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_histogram_intersection)function, (vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_sparse_histogram_intersection)function, (sparse_vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_sigmoid)function, (vectors)samples, (array)labels) -> _binary_test
test_binary_decision_function( (_decision_function_sparse_sigmoid)function, (sparse_vectors)samples, (array)labels) -> _binary_test
test_ranking_function( (_decision_function_sparse_linear)function, (sparse_ranking_pairs)samples) -> _ranking_test
test_ranking_function( (_decision_function_linear)function, (ranking_pair)sample) -> _ranking_test
test_ranking_function( (_decision_function_sparse_linear)function, (sparse_ranking_pair)sample) -> _ranking_test
test_regression_function( (_decision_function_sparse_linear)function, (sparse_vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_radial_basis)function, (vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_sparse_radial_basis)function, (sparse_vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_histogram_intersection)function, (vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_sparse_histogram_intersection)function, (sparse_vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_sigmoid)function, (vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_sparse_sigmoid)function, (sparse_vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_polynomial)function, (vectors)samples, (array)targets) -> _regression_test
test_regression_function( (_decision_function_sparse_polynomial)function, (sparse_vectors)samples, (array)targets) -> _regression_test
test_sequence_segmenter( (segmenter_type)arg1, (sparse_vectorss)arg2, (rangess)arg3) -> segmenter_test
train_sequence_segmenter( (sparse_vectorss)samples, (rangess)segments [, (segmenter_params)params=<BIO,highFeats,signed,win=5,threads=4,eps=0.1,cache=40,non-verbose,C=100>]) -> segmenter_type
This object represents the mathematical idea of a column vector.


Here's what Red Dead Redemption 2 looks like on lower than the lowest settings
by Jody MacgregorRed Dead Redemption 2 is a gorgeous moustache and horsenut simulator you may have heard of. It's a real pretty looking game, with some intimidatingly high specs. And that's why the YouTube cowboy who calls himself The LowSpec Gamer has ridden down from the ranges to find ways to get Red Dead 2 running on potato PCs.
As he explains in the video, it'll take modders to really unearth all the possibilities, but until then just messing with the system.xml file in your Red Dead Redemption 2 > Settings folder can result in some pretty drastic changes. Forget about rendering moustaches, these people don't even have faces. They look more like characters from Totally Accurate Battle Simulator than the latest Rockstar budget-blowout extravaganza. At the lower-than-lowest settings horses lose all detail and wagons straight-up vanish.
Check out the video to see how it's done and enjoy Arthur Morgan looking like Edward Carnby from Alone in the Dark.


Flat demolition halted after house develops cracks
Call to station expert at demolition site
by Special CorrespondentFort Kochi Sub Collector Snehil Kumar Singh, who is in charge of overseeing the demolition of Maradu flats, on Friday ordered stoppage of demolition of a swimming pool at Alfa Serene apartments after cracks developed in a nearby house of one Hari Sai.
A two-storey structure near the swimming pool was being demolished when a part of the building caved in with a thud. Mr. Singh visited the site after municipal chairperson T.H. Nadeera along with two councillors and a few people living near the apartments met and apprised him of the situation.
Mr. Singh also asked the municipal engineer to make a video of the present situation at the site. The pillar supporting the stairs in the neighbouring house, which is separated by just a couple of metres from the demolition site, developed cracks.
People in the house also experienced tremors. Similar was the experience of those in two other neighbouring houses, said Ms. Nadeera.
She added Mr. Singh had been requested to station an expert official at the demolition sites.


let π = 3.14159
let 你好 = "你好世界"
let 🐶🐮 = "dogcow"
var friendlyWelcome = "Hello!"
friendlyWelcome = "Bonjour!"
// friendlyWelcome is now "Bonjour!"
let languageName = "Swift"
languageName = "Swift++"
// This is a compile-time error: languageName cannot be changed.


{% extends "base.html" %} {% load i18n %} {% block page_title %}about{% endblock %} {% block content %}
This app gets the number of stars of the repository via GitHub API and displays it in charts.
1) Input repository name into the form on the Top page.
2) Push "Compare" button.
3) Get the number of stars via GitHub API v4 and make charts. You can desplay the number of stars by clicking the chart.
COBOL developer. Currently learning python and Django in order to become Web developer.
Go to twitter


Recover account
Enter your email address and an email with instructions will be sent to you.
Recover Account
Have an account?
Signin


I believe my reason for taking a class in Programming is because i didn't
have the necessary skills to build My Career after finishing my University Education.
It is also clear to me that learning and doing things practical are two diffrent things
since in University they don't really teach the technical part of Programming.
So being able to specialize in Programming will enable me to advance as a Developer an be able to
work on my own as Self-employed and get a better understanding of the Programming world.
Through a list of projects i have created with active links to them below:>
These websites used onlyHTML5 and CSS


\module Algebra.Meta
equation
equation a_1 … a_n proves an equation a_0 = a_{n+1} using a_1, … a_n as intermediate steps. A proof of a_i = a_{i+1} can be specified as implicit arguments between them. using, usingOnly, and hiding with a single argument can be used instead of a proof to control the context. The first implicit argument can be either a universe or a subclass of either Monoid, AddMonoid, or Order.Lattice.Bounded.MeetSemilattice. In the former case, the meta will prove an equality in a type without using any additional structure on it. In the latter case, the meta will prove an equality using only structure available in the specified class.
cong
This meta implements the congruence closure algorithm. For example, given assumptions x = x’ and y = y’, it can prove f x y = f x’ y’.
linarith
This meta solves systems of linear equations in ordered rings using Fourier–Motzkin elimination.


An interface to the United States Postal Service Post Calc and Zone Calc APIs, postal allows users to find the postage price, delivery day, and other information for packages and envelopes, as well as to find the postal zone for an origin and a destination zip code pair.
| Version: | 0.1.0 |
| Depends: | R (≥ 2.10) |
| Imports: | curl, dplyr, glue, janitor, jsonlite, lubridate, magrittr, purrr, readr, stringr, tibble (≥ 1.2), tidyr |
| Suggests: | covr, cowsay, ggplot2, here, knitr, maps, rmarkdown, stats, testthat, zipcode |
| Published: | 2018-07-27 |
| Author: | Amanda Dobbyn |
| Maintainer: | Amanda Dobbyn <amanda.e.dobbyn at gmail.com> |
| BugReports: | https://github.com/aedobbyn/postal/issues/ |
| License: | MIT + file LICENSE |
| URL: | https://github.com/aedobbyn/postal/ |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | postal results |
| Reference manual: | postal.pdf |
| Vignettes: |
getting-zoned |
| Package source: | postal_0.1.0.tar.gz |
| Windows binaries: | r-devel: postal_0.1.0.zip, r-release: postal_0.1.0.zip, r-oldrel: postal_0.1.0.zip |
| OS X binaries: | r-release: postal_0.1.0.tgz, r-oldrel: postal_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=postal to link to this page.


- writeAiger(String, boolean) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given boolean output to the named file.
- writeAiger(String, byte) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given byte output to the named file.
- writeAiger(String, int) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given int output to the named file.
- writeAiger(String, long) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given long output to the named file.
- writeAiger(String, byte[]) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given byte outputs to the named file.
- writeAiger(String, int[]) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given int outputs to the named file.
- writeAiger(String, long[]) - Static method in class com.galois.symbolic.Symbolic
-
Write the AIG with the given long outputs to the named file.
- writeCnf(String, boolean) - Static method in class com.galois.symbolic.Symbolic
-
Write a CNF encoding of the given boolean to the named file
such that an "unsatisfiable" result indicates that the boolean
is always true.


uzhotels is a product rebate platform connecting brands with consumers
in-store and on mobile devices.
It is also a smart loyalty program for small businesses.
By giving small businesses tools to promote products like "the big guys",
uzhotels builds real-time engagement between merchants and customers
when they are in store, and remind them to come back and be rewarded.
uzhotels is based in Boston, MA.


//= template/head.html
Three years ago Coinsbank team was crazy enough to bring the largest global blockchain conference on the seas with the first Blockchain Cruise event. Since then we have achieved 7 unique events from the US, Caribbean to Asia and Europe.
Through years there was built a strong global community. And the CoinsGang Weekend 2020 is the celebration of cooperation, empowering the community.
event attendees from
80+ countries
audience reached during
the event
companies promoted their
companies
biggest fintech & business
media
CoinsGang Weekend brings together the influential, disruptive and innovative technology companies that are redefining financial services across all areas of blockchain technology. We’ll be focused on the following key themes:
We invite you to experience a business event surrounded by legendary hospitality. Lavish accommodations at the Gloria Hotels & Resort in Antalya with exquisite service always at your fingertips. And that’s just the standard fare.
Three hotels in a sprawling oasis. Kick back at the 45-hole golf course, the largest in Turkey. Our VIP guests are invited to wake up facing the links in a luxury villa.


Examples Right click inside the box to trigger the menu
Demo 1
Using data-toggle="context"
to attach a context-menu
Demo 2
This is an area where the context menu is active
However, we wont allow it here. But anywhere else
in this text should be perfectly fine. This one is started
with only javascript
Demo 3
Show the menu name of the item that was selected


Scopas awoke to a dark and murky night almost as if the moon didn’t exist at all. He threw his legs over the side of his straw made bed and stretched his arms as far as humanly possible.Then he heard a loud crunching from his straw roof. Scopas sat on his bed shuddering in fear as the shuffling grew louder and louder, and just as he was about to dash out of his room, Apollo seemed to appear out of thin air. Scopas sat on his bed speechless, and just as he was about to cough up a single word, Apollo spoke, “Come face to face with me at the field at the crack of dawn.” Scopas inquired, “But who will drive the Sun Chariot?” Apollo responded, “My son Phaethon will drive it, but because I do not trust him, I will have to make our battle quick. I must go now.”


The goal of RVerbalExpressions
is to make it easier to construct regular expressions using grammar and functionality inspired by VerbalExpressions. Usage of %>%
is encouraged to build expressions in a chain like fashion.
Install the released version of RVerbalExpressions
from CRAN:
Or install the development version from GitHub with:
This is a basic example which shows you how to build a regular expression:
library(RVerbalExpressions)
# construct an expression
x <- rx_start_of_line() %>%
rx_find('http') %>%
rx_maybe('s') %>%
rx_find('://') %>%
rx_maybe('www.') %>%
rx_anything_but(' ') %>%
rx_end_of_line()
# print the expression
x
#> [1] "^(http)(s)?(\\://)(www\\.)?([^ ]*)$"
# test for a match
grepl(x, "https://www.google.com")
#> [1] TRUE
You can see an up to date list of all ports on VerbalExpressions.github.io.
Additionally, there are two R packages that try to solve the same problem. I encourage you to check these out:


--- title: Resonance Audio Wwise Plugin Reference layout: default exclude_from_menu: true ---
This is the main Resonance Audio class that communicates with the Wwise Unity integration.
Native functions of the system can only be called through this class to preserve the internal system functionality.
Public attributes |
|
|---|---|
maxGainDb = 24.0f
|
const float
Maximum allowed gain value in decibels.
|
maxReflectivity = 2.0f
|
const float
Maximum allowed reflectivity multiplier of a room surface material.
|
maxReverbBrightness = 1.0f
|
const float
Maximum allowed reverb brightness modifier value.
|
maxReverbTime = 3.0f
|
const float
Maximum allowed reverb time modifier value.
|
minGainDb = -24.0f
|
const float
Minimum allowed gain value in decibels.
|
minReverbBrightness = -1.0f
|
const float
Minimum allowed reverb brightness modifier value.
|
Public static attributes |
|
|---|---|
roomEffectsBusName = "Room Effects Bus"
|
string
Name of the Wwise Audio Bus where the Resonance Audio Room Effects plug-in is attached to.
|
Public static functions |
|
|---|---|
IsListenerInsideRoom(WwiseResonanceAudioRoom room)
|
bool
Returns whether the listener is currently inside the given |room| boundaries.
|
UpdateAudioRoom(WwiseResonanceAudioRoom room, bool roomEnabled)
|
void
Updates the room effects of the environment with given |room| properties.
|
const float maxGainDb = 24.0f
Maximum allowed gain value in decibels.
const float maxReflectivity = 2.0f
Maximum allowed reflectivity multiplier of a room surface material.
const float maxReverbBrightness = 1.0f
Maximum allowed reverb brightness modifier value.
const float maxReverbTime = 3.0f
Maximum allowed reverb time modifier value.
const float minGainDb = -24.0f
Minimum allowed gain value in decibels.
const float minReverbBrightness = -1.0f
Minimum allowed reverb brightness modifier value.
string roomEffectsBusName = "Room Effects Bus"
Name of the Wwise Audio Bus where the Resonance Audio Room Effects plug-in is attached to.
bool IsListenerInsideRoom( WwiseResonanceAudioRoom room )
Returns whether the listener is currently inside the given |room| boundaries.
void UpdateAudioRoom( WwiseResonanceAudioRoom room, bool roomEnabled )
Updates the room effects of the environment with given |room| properties.
Note:This should only be called from the main Unity thread.


Choose a different enforcement option
You should only apply for a bailiff to visit the defendant if you think they'll be able to get your money back.
You should choose a different enforcement option. You can ask the court to:
- order the defendant to attend a hearing and find out what they can afford to pay
- take money from the defendant's wages to pay the debt
- freeze money in the defendant's bank, building society or business account
- charge the defendant's land or property
You need to use a paper form to apply for each of these options.
Download a paper form (opens in a new window), complete it and return it to make your application.
Where to send paper forms
County Court Money Claims Centre
PO Box 527
Salford
M5 0BY


Pull requests
Issues
Marketplace
General
Home
Products
Windows
Office 365
Skype
Support
Community
Blog
Github
Forum
Shop
Cart
Explorer
New repository
Import repository
New gist
New organization
New issue
Signed as
olton
Your profile
Your stars
Your gists
Help
Settings
Sign out


$25.00
$30.00
$25.00
$30.00
$25.00
$30.00
$25.00
$30.00
$25.00
$30.00
$25.00
$30.00
$25.00
$30.00
$25.00
$30.00


I'm a life long learner with a passion for puzzles and problem solving. Whether it's teaching the quadratic formula, discovering new spreadsheet formulas, or learning a programming language to increase efficiency, I've always been driven to learn more in order to do better. Currently that drive is focused on acquiring the knowledge and skills necessary to become a full stack web developer.
Feel free to reach out!


--- layout: default title: "Jobs" permalink: /jobs/ ---
In general, international job offers for post-doctoral positions are posted on https://jobregister.aas.org/. Here we list an excerpt of job announcements related to astronomical instrumentation.


--- title: Inconspicuous Flowers date: 2008-05-08 00:00:00 -06:00 categories: - whats-blooming layout: post blog-banner: whats-blooming-now-spring.jpg post-date: May 8, 2008 post-time: 10:20 AM blog-image: wbn-default.jpg ---
They're often easy to overlook and not much attention is given to them by the average garden visitor,so I thought I'd put them in the spotlight today. They are the inconspicuous flowers of Red Butte Garden.
The first two photos are Utah natives.
Curl Leaf Mountain Mahogany Cercocarpus ledifolius
This native shrub is an incredibly importatnt forage plant for Mule Deer and Elk. You can find it in our Children's Garden, Herb Garden, Floral Walk, Medicinal Garden and Natural Area.
Skunkbush Sumac Rhus aromatica var. trilobata
These yellow flowers produce fuzzy fruits that can be made into lemonade. The shrubs are drought tolerant and can take full sun. It can be found along our entrance drive and in the floral walk. There are also low growing cultivars of this shrub growing elsewhere in the garden.
The flowers on Boxwood really blend in with the foliage. You have to look close to see them.
Winter Gem Boxwood Buxus microphylla var. koreana 'Winter Gem'
Georgenberg Geum Geum x heldreichii 'Georgenberg'
Indian Summer Crabapple Malus 'Indian Summer'
Now is the time of year to check out all of the maples in the garden. They begin flowering just as their leaves start to open. They are sometimes same color as their leaves so look close.
YBloodgood Maple Acer palmatum 'Bloodgood'
Korean Maple Acer pseudosieboldianum


本书pdf是文字版 和 彩图版，书签良好。
Matter and Measurement
Atoms and the Periodic Table
Ionic and Covalent Compounds
Energy and Matter
Chemical Reactions
Gases
Solutions
Acids and Bases
Nuclear Chemistry
Introduction to Organic Molecules
Unsaturated Hydrocarbons
Organic Compounds That Contain Oxygen or Sulfur
Carboxylic Acids, Esters, Amines, and Amides
Carbohydrates
Lipids
Amino Acids, Proteins, and Enzymes
Nucleic Acids and Protein Synthesis
Energy and Metabolism


ChargeState
public struct ChargeState
Response object containing information about the charge state of the vehicle
-
Declaration
Swift
public var chargingState: ChargingState = ChargingState.stopped
-
Declaration
Swift
public var chargeToMaxRange: Bool = false
-
Declaration
Swift
public var fastChargerPresent: Bool = false
-
Declaration
Swift
public var batteryRange: Double = 0
-
Declaration
Swift
public var estBatteryRange: Double = 0
-
Declaration
Swift
public var idealBatteryRange: Double = 0
-
Percentage
Declaration
Swift
public var batteryLevel: Double = 0.0
-
Declaration
Swift
public var timeToFullCharge: Double = 0.0
-
Declaration
Swift
public var chargePortDoorOpen: Bool = false
-
Declaration
Swift
public var fastChargerType: String? = nil
-
Declaration
Swift
public var userChargeEnableRequest: Int = 0
-
The amount of kH added
Declaration
Swift
public var chargeEnergyAdded: Double = 0
-
The maximum charge current that can be requested
Declaration
Swift
public var chargeCurrentRequestMax: Int = 0
-
Declaration
Swift
public var chargerPhases: Int = 0
-
Declaration
Swift
public var batteryHeaterOn: Int = 0
-
Declaration
Swift
public var motorizedChargePort: Bool = false
-
Declaration
Swift
public var tripCharging: Bool = false
-
Declaration
Swift
public var chargeEnableRequest: Bool = false
-
Declaration
Swift
public var chargeLimitSocStd: Int = 0
-
The actual current provided by the charger
Declaration
Swift
public var chargerActualCurrent: Int = 0
-
Declaration
Swift
public var chargePortLatch: ChargePortLatchState = ChargePortLatchState.unknown
-
Declaration
Swift
public var chargeCurrentRequest: Int = 0
-
The voltage of the charger
Declaration
Swift
public var chargerVoltage: Int = 0
-
Declaration
Swift
public var managedChargingActive: Bool = false
-
Declaration
Swift
public var chargerPilotCurrent: Int = 0
-
Declaration
Swift
public var chargeRate: Int = 0
-
Declaration
Swift
public var chargeLimitSocMax: Int = 0
-
Declaration
Swift
public var chargeLimitSocMin: Int = 0
-
Declaration
Swift
public var usableBatteryLevel: Int = 0
-
Declaration
Swift
public var maxRangeChargeCounter: Int = 0
-
The start time of the scheduled charging
Declaration
Swift
public var scheduledChargingStartTime: Date? = nil
-
Declaration
Swift
public var chargerPower: Int = 0
-
Declaration
Swift
public var scheduledChargingPending: Bool = false
-
Declaration
Swift
public var notEnoughPowerToHeat: Bool = false
-
Declaration
Swift
public var managedChargingStartTime: TimeInterval? = nil
-
Declaration
Swift
public var chargeMilesAddedRated: Double = 0
-
Declaration
Swift
public var chargeMilesAddedIdeal: Double = 0
-
Declaration
Swift
public var managedChargingUserCanceled: Bool = false
-
Declaration
Swift
public var chargeLimitSoc: Int = 0
-
Declaration
Swift
public var euVehicle: Bool = false
-
Declaration
Swift
public var timeStamp: TimeInterval = 0
-
Declaration
Swift
public var fastChargerBrand: String? = nil
-
Declaration
Swift
public var connChargeCable: String? = nil
-
Returns whether the vehicle is connected to a charger or not
Declaration
Swift
public var isChargerConnected: Bool
-
Returns whether the vehicle is improperly connected to a charger
Declaration
Swift
public var isChargerImproperlyConnected: Bool
-
Returns whether the vehicle is charging or will begin charging
Declaration
Swift
public var isCharging: Bool
-
Declaration
Swift
public init()
-
Undocumented
Declaration
Swift
public mutating func mapping(map: Map)


Distributed Release Audit Tool (DRAT)
SUMMARY
AUDIT
PROJECTS
All MIME Types
Top MIME Types
Count :
License Types
Audit Summary
#
Repository
Name
Description
Audit
Back
Project Name
Project Description
Project Repository
Project Location
Filter by License
See All
Unknown License
0
Standard License
0
Apache License
0
Binaries
0
Generated
0
Notes
0
Archives
0
×
File Header
Some text in the modal.


Reference-style links immediately below first block do not resolve
References are placed immediately below the first paragraph:
30 31 32 33
30: /0
31: /1
32: /2
33: /3
Reference-style links immediately above first block
References are placed immediately above the first paragraph:
20 21 22 23
Reference-style links in a non-markdown post do not resolve
References are placed below the first paragraph, and are separated from the
first paragraph by a single blank line:
[40][] [41][] [42][] [43][]
Reference-style links below first block and separated by blank line resolve
References are placed below the first paragraph, and are separated from the
first paragraph by a single blank line:
10 11 12 13
Reference-style links above first block and separated by blank line resolve
Explicit excerpts work even in liquid
explicit excerpt
Implicit excerpts work only in markdown
Custom excerpt separator
Welcome to the 6th post on cobalt.rs!
Both excerpt and excerpt separator are there
excerpt
wins
Custom excerpt separator
Custom excerpt separator
Welcome to the 4th post on cobalt.rs!
Explicit `excerpt`
Is in markdown
An empty post means an empty excerpt
First block is an excerpt
This is our first Post!


Hello World
this is a text inside a div element
this is paragraph has its own background color
we are still in the div element


Class IPSocket
Inheritance
Inherited Members
Namespace: SIPSorcery.Sys
Assembly: SIPSorcery.dll
Syntax
public class IPSocket
Fields
| Improve this Doc View SourceMaxPort
Specifies the maximum acceptable value for the System.Net.IPEndPoint.Port property.
Declaration
public const int MaxPort = 65535
Field Value
| Type | Description |
|---|---|
| System.Int32 |
MinPort
Specifies the minimum acceptable value for the System.Net.IPEndPoint.Port property.
Declaration
public const int MinPort = 0
Field Value
| Type | Description |
|---|---|
| System.Int32 |
Methods
| Improve this Doc View SourceGetIPEndPoint(String)
Returns an IPv4 end point from a socket address in <IP_ADDRESS>:5060 format.
Declaration
public static IPEndPoint GetIPEndPoint(string IPSocket)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | IPSocket |
Returns
| Type | Description |
|---|---|
| System.Net.IPEndPoint |
GetSocketString(IPEndPoint)
This code is based on the IPEndPoint.ToString method in the dotnet source code at https://github.com/dotnet/corefx/blob/master/src/System.Net.Primitives/src/System/Net/IPEndPoint.cs. If/when that feature makes it into .NET Standard this method can be replaced.
Declaration
public static string GetSocketString(IPEndPoint endPoint)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Net.IPEndPoint | endPoint |
Returns
| Type | Description |
|---|---|
| System.String |
IsIPAddress(String)
(convenience method) check if string can be parsed as IPAddress
Declaration
public static bool IsIPAddress(string socket)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | socket | string to check |
Returns
| Type | Description |
|---|---|
| System.Boolean | true/false |
IsPrivateAddress(String)
Checks the Contact SIP URI host and if it is recognised as a private address it is replaced with the socket the SIP message was received on.
Private address space blocks RFC 1597. <IP_ADDRESS> - <IP_ADDRESS> <IP_ADDRESS> - <IP_ADDRESS> <IP_ADDRESS> - <IP_ADDRESS>
Declaration
public static bool IsPrivateAddress(string host)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | host |
Returns
| Type | Description |
|---|---|
| System.Boolean |
Parse(String, Int32)
Declaration
public static IPEndPoint Parse(string endpointstring, int defaultport = -1)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | endpointstring | |
| System.Int32 | defaultport |
Returns
| Type | Description |
|---|---|
| System.Net.IPEndPoint |
Parse(String, out String, out Int32)
Check if endpointstring
contains a hostname or ip-address and ip-port
accepts IPv4 and IPv6 and IPv6 mapped IPv4 addresses
return detected values in host
and port
adapted from: http://stackoverflow.com/questions/2727609/best-way-to-create-ipendpoint-from-string
Declaration
public static bool Parse(string endpointstring, out string host, out int port)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | endpointstring | string to check |
| System.String | host | host-portion of |
| System.Int32 | port | port-portion of |
Returns
| Type | Description |
|---|---|
| System.Boolean | true if host-portion of endpoint string is valid ip-address |
Remarks
rj2: I had the requirement of parsing an IPEndpoint with IPv6, v4 and hostnames and getting them as string and int
Exceptions
| Type | Condition |
|---|---|
| System.ArgumentException | if |
| System.FormatException | if host looks like ip-address but can't be parsed |
ParseHostFromSocket(String)
Declaration
public static string ParseHostFromSocket(string socket)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | socket |
Returns
| Type | Description |
|---|---|
| System.String |
ParsePortFromSocket(String)
For IPv6 addresses with port the string format is of the form: [2a02:8084:6981:7880:54a9:d238:b2ee:ceb]:6060 Without a port the form is: 2a02:8084:6981:7880:54a9:d238:b2ee:ceb
Declaration
public static int ParsePortFromSocket(string socket)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | socket | The socket string to check |
Returns
| Type | Description |
|---|---|
| System.Int32 | The socket string's explicit port number or 0 if it does not have one. |
ParseSocketString(String)
Declaration
public static IPEndPoint ParseSocketString(string s)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | s |
Returns
| Type | Description |
|---|---|
| System.Net.IPEndPoint |
TryParseIPEndPoint(String, out IPEndPoint)
This code is based on the IPEndPoint.TryParse method in the dotnet source code at https://github.com/dotnet/corefx/blob/master/src/System.Net.Primitives/src/System/Net/IPEndPoint.cs. If/when that feature makes it into .NET Standard this method can be replaced.
Declaration
public static bool TryParseIPEndPoint(string s, out IPEndPoint result)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | s | The end point string to parse. |
| System.Net.IPEndPoint | result | If the parse is successful this output parameter will contain the IPv4 or IPv6 end point. |
Returns
| Type | Description |
|---|---|
| System.Boolean | Returns true if the string could be successfully parsed as an IPv4 or IPv6 end point. False if not. |


{# This template can be used in place of the standard DGPF components/search-facets.html template #} {% for facet in search.facets %}


Which are the type rules for concatenation?
The arrays that is concatenated must have the same number of dimensions.
The concatenation dimension k, that you use, must exist.
Arrays must have identical dimension sizes with the exception of the size of dimension k
Argument arrays must have equivalent maximally expanded element types, where the element type of the result array is the element type of the maximally expanded type of the arguments.
What will be the result of the arrays below?
array1 has the result {{22, 34, 15}, {66, 78, 52}}
array2 has the result {{22, 34, 15}, {66, 78, 52}}
array3 has the result {{11, 12}, {13, 14}}
array4 has the result {{7, 2}, {5, 42}, {24, 74}}
array5 has the result {{7, 2}, {5, 42}, {24, 74}}
array6 has the result {{1, 2}, {11, 12}, {13, 14}, {3, 4}}
array7 has the result {{1, 2, 35, 73}, {72, 51, 12, 23}}
Now it is your turn to concatenate arrays using cat:
Concatenate two 1x2-arrays along the first dimension.
Concatenate the arrays you just concatenated, but along the second dimension.
Concatenate one 2x3-array with a 2x1-array along the second dimension.
Concatenate two 2x2-arrays along the first dimension.
What are the results of the array concatenations?
These are examples of how you could concatenate the arrays in the exercise.
myArray1 has the result {{1, 2}, {11, 12}}
myArray2 has the result {{1, 2, 11, 12}}
myArray3 has the result {{21, 32, 43, 12}, {66, 77, 55, 24}}
myArray4 has the result {{10, 40}, {55, 78}, {20, 50}, {31, 22}}
The last thing you should do now is to concatenate three arrays with higher dimension.
So, the arrays you should concatenate are of size 1x2x1, 1x2x2 and 1x2x3 and they should be concatenated along the first dimension. Do the concatenation in the class MoreConcat below.
What is the result after the concatenations?
This is an example of how you could concatenate the arrays in the exercise.
aReady has the result {{1, 3, 4, 7, 8, 9}, {2, 5, 6, 10, 11, 12}}


Sam's Salmon Cookie Emporium
Corporate phone #206.555.5555
Open M-F 10:00AM-6:00PM
OUR LOCATIONS
1st & Pike<PHONE_NUMBER>
SeaTac Airport<PHONE_NUMBER>
Seattle Center<PHONE_NUMBER>
Capitol Hill<PHONE_NUMBER>
Alki<PHONE_NUMBER>
Please contact your local store for hours and events!


-
Captain America: The Winter Soldier
itunes.apple.com
Watch the trailer and download Captain America: The Winter Soldier 2014 on iTunes.
-
Amazon.com: Heaven is For Real (2 Discs) - Blu-ray/DVD/UltraViolet Combo ...
www.amazon.com
Amazon.com: Heaven is For Real (2 Discs) - Blu-ray/DVD/UltraViolet Combo Pack: Greg Kinnear, Thomas Haden Church, Kelly Reilly: Movies & TV
-
Join Our Beta Testing Community
support.ubersocial.com
If you're looking to join our Google + Community and/or get early access to new versions of the app available for beta testing, you've come...
-
New Matter MOD-t: a 3D printer for everyone
www.indiegogo.com
New Matter makes 3D printing easy at only $249. Wireless connectivity. And an online store full of cool designs that you can buy, customize, print, ...
-
Error Code 226 - This request looks like it might be automated
twittercommunity.com
We've seen several discussions around developers receiving Error Code 226 in response to requests for tweet or direct message creation using the ...
-
Disneynature's Bears - Now Playing in Theaters!
www.youtube.com
Disneynature's Bears is now playing. See Bears opening week to help protect our national parks. http://di.sn/da8 The program See "Bears," Protect Our ...
-
UberSocial Beta Testers - Community - Google+
plus.google.com
Be the first to try out new features and get up-to date information about news around UberSocial for Android.
-
Enter zipcode or sign in
shop.sprint.com
If you're new to Sprint, tell us where you'll use your device the most:
-
Service issue
status.twitter.com
Update [12:12pm PDT]: During a planned deploy in one of our core services, we experienced unexpected complications that made Twitter unavailable for ...
-
Mt. Gox goes offline amid allegations of largest-ever bitcoin heist | The ...
www.pbs.org
The world's largest Bitcoin exchange, Mt. Gox, went offline Monday amid allegations of the largest-ever bitcoin heist.
-
Harold Ramis, Star of 'Ghostbusters,' Director of 'Caddyshack,' Dies at 69
movies.yahoo.com
Harold Ramis, best known for appearing in "Ghostbusters" and directing "Groundhog Day" and "Caddyshack," died at the age of 69 early Monday.
-
Bitcoin’s Value Falls 10% As Faltering Mt.Gox Exchange Continues To ...
techcrunch.com
Mt.Gox promised to get its house in order, and get back to the Bitcoin community and its users today. It did, but didn't open up withdrawals, or set ...
-
Facebook turned down WhatsApp co-founder Brian Acton for job in 2009
www.usatoday.com
Tweets from WhatsApp co-founder Brian Acton in 2009 show that Facebook and Twitter turned him down for jobs.
-
Dumbest Celebrity Tweets
www.chacha.com
These 10 celebs take the cake for stupidity in 140 characters or less.
-
Coursera
www.coursera.org
Take free online classes from 80+ top universities and organizations. Coursera is a social entrepreneurship company partnering with Stanford ...
-
The Boring Designer • Cap Watkins
blog.capwatkins.com
Whenever I’m looking at a product designer’s work, I find myself continuously asking the same question: which solution is the boring one? Maybe it’s ...
-
Droidcon NYC announces keynote speakers - Droidcon NYC 2014
nyc.droidcon.com
Today, Droidcon NYC announced its keynote speakers, Chris Haseman & Kevin Grant of Tumblr. "Chris and Kevin are the perfect headliners,” says Kevin ...
-
The Most Fascinating Profile You'll Ever Read About a Guy and His Boring ...
www.wired.com
Ariel Zambelich/WIRED Stewart is hungry. He’s munching on potatoes smothered in chicken fat drippings, sitting by a long metal table that once served ...
-
Aanbevolen apps - Android-apps op Google Play
play.google.com
Winkel bij Google Play op internet. Doe aankopen en gebruik deze direct op uw Android-telefoon of -tablet zonder te synchroniseren.
-
Android Auto: The right information for the road ahead
www.youtube.com
Android Auto extends the Android platform into the car in a way that's purpose-built for driving. Learn more at: http://www.android.com/auto/
-
Material design
www.youtube.com
Design is the art of considered creation. Our goal is to satisfy the diverse spectrum of human needs. As those needs evolve, so too must our designs, ...
-
Twitter / Recherche - #worldcup
twitter.com
Le meilleur des derniers Tweets à propos de #worldcup. Lisez ce que les gens disent et rejoignez la conversation.
-
Not Your Father's Java: An Opinionated Guide to Modern Java Development, ...
blog.paralleluniverse.co
Despite it assosiation with large, bureacratic, and slow enterprise shops, and big, unwieldy frameworks, recent additions to the Java language, ...
-
Official Google Blog: The latest chapter for the self-driving car: ...
googleblog.blogspot.com
Insights from Googlers into our products, technology, and the Google culture
-
Billion-Dollar Startup Club - WSJ.com
graphics.wsj.com
The Journal and Dow Jones VentureSource are tracking companies that are valued at $1 billion or more by venture-capital firms. Today there are more ...


Pressure:
{{measure.pressure}} Pa
Temperature:
{{measure.temperature}} °C
dateOfMeasure:
{{measure.dateOfMeasure}}
Sensor:
{{measure.sensor.name}}
Tyre:
{{measure.sensor.tyre.serialNumber}}
No Tyre Selected
Vehicle:
{{measure.sensor.tyre.mounting.vehicle.type}}
Vehicle Not Mounted


[§211F-33] Purposes and terms of investments. (a) Investments may be used for any purpose consistent with the purposes and objectives of this chapter.
(b) Investments may be made on such terms and conditions as the corporation shall determine to be reasonable, appropriate, and consistent with the purposes and objectives of this chapter. [L 1990, c 110, pt of §3]


--- layout: page title: About header-img: "img/about-bg.png" ---
Career change from finance to software engineering


libxml_disable_entity_loader
(PHP 5 >= 5.2.11, PHP 7)
libxml_disable_entity_loader — Disable the ability to load external entities
说明
bool libxml_disable_entity_loader ([ bool $disable = true ] )
Disable/enable the ability to load external entities.
参数
disable
Disable (TRUE) or enable (FALSE) libxml extensions (such as DOM, XMLWriter
and XMLReader) to load external entities.
返回值
Returns the previous value.
参见
• libxml_use_internal_errors() - Disable libxml errors and allow user to
fetch error information as needed
• The LIBXML_NONET constant
User Contributed Notes 4 notes
===============================================================================
Using this function you can prevent a vulnerable to Local and Remote File
Inclusion attacks.
You'll see it in an example where I load and validate the following string:
]>
&test;
One way to prevent that the file in given back is to set this value to 0.
Please take a closer look at the release of symfony 2.0.11
===============================================================================
Be mindful that this also disables url loading in simplexml_load_file() and
likely other libxml based functions that deal with URLs
===============================================================================
This also seems to have an impact on statements if this is
applied when loading XSLT for the XSLTProcessor class.
===============================================================================
This function was reported to be not thread safe. So this might affect
php-scripts on the same server.


My name is Lincoln Nguyen where I am currently enrolled at Epicodus for web and mobile development. I am 24 and was born and raised in Washington for 24 years. Before I enrolled at Epicodus, I studied at the University of Washington where I graduated with a bachelors in Microbiology. After college, I studied python, HTML, CSS, and C where I decided to enrolled in a bootcamp that can amplify my skills in web development after spending a couple of months on my own learning languages.
Life before programming was all about healthcare and medical microbiology. My goal was to become a physician assistant (PA) and to continue my education in infectious disease/medical microbiology. Unfortunately, time is not on my side so I decided to try something new. My brother introduced me to the idea of an accelerated bootcamp in web and mobile development. I took interest and spend a couple of months learning a variety of languages, though not an expert, on languages such as python, HTML, CSS, and C. As I continue, I decided to give it a chance as my new career path and choice Epicodus to improve my skills in problem-solving and writing codes.
One of my favorite hobbies is being active in sports such as volleyball, tennis, basketball, and baseball. It does not matter what sport as long as I am active and having fun with my friends. I have an active lifestyle regardless of the weather in Seattle! Teamwork and team-bonding is the fundamental of winning games and the moments that I enjoyed the most. Along with being active, I love to travel and have the dream of traveling around the world with my friends and family.


Honor Play 3 Now Available in Icelandic White - Gizchina.com
by PierreRate this post
The Honor Play 3 launched in September is back in the news as the phone maker just launched a new variant of the device. The Play 3 will indeed be available in the color option Icelandic White; a coloration we’ve already seen in various Honor phones.
The new Icelandic White Honor Play 3 will join the Aurora Blue, Magic Night Black and Red Flames variants at the Double Eleven Chinese festival. The White version will also be priced just like other ones at 999 Yuan; around $142 or 130€.
Honor Play 3 Now Available in Icelandic White
Aside from the light color back cover we do not see any other changes on the hardware side. This means we find a large 6.39-inch display with a punch hole camera design. The display also covers 90% of the front, according to official data and it sports German Rhine eye protection technology; basically it reduces the not too friendly blue light.
Honor’s Play 3 is powered by a Kirin 710F chip, supplemented by up to 6GB of RAM and a maximum of 128GB of storage. Meanwhile in the camera department we find a main 48 rear camera, along with an 8MP super wide angle and a 2MP depth sensor.
The smartphone is then equipped with GPU Turbo 3.0 technology, GameDock game mode, Vulcan mode and other modern features.
As we previously mentioned, the smartphone will have a starting price of 999 Yuan ($142) for the 4GB/64GB memory combo.