module documentation
logger class mainly to be used with CMAEvolutionStrategy
| Class |
|
data logger for class CMAEvolutionStrategy . |
| Class |
|
log an arbitrary number of data (a data row) per "timestep". |
| Class |
|
use to fake a Logger in non-verbose setting |
| Function | disp |
displays selected data from (files written by) the class CMADataLogger . |
| Function | plot |
plot data from files written by a CMADataLogger , the call cma.plot(name, **argsdict) is a shortcut for cma.CMADataLogger(name).plot(**argsdict) |
| Function | smartlogygrid |
turn on grid and also minor grid depending on y-limits |
| Variable | __author__ |
Undocumented |
| Variable | last |
Undocumented |
displays selected data from (files written by) the class
CMADataLogger
.
The call cma.disp(name, idx) is a shortcut for cma.CMADataLogger(name).disp(idx).
Arguments
name
- name of the logger, filename prefix,
None
evaluates to the default 'outcma/cma' idx
- indices corresponding to rows in the data file; by default the first five, then every 100-th, and the last 10 rows. Too large index values are removed.
The best ever observed iteration is also printed by default.
Examples
import cma from numpy import r_ # assume some data are available from previous runs cma.disp(None, r_[0, -1]) # first and last cma.disp(None, r_[0:int(1e9):100, -1]) # every 100-th and last cma.disp(idx=r_[0, -10:0]) # first and ten last cma.disp(idx=r_[0:int(1e9):1000, -10:0])
| See Also | |
CMADataLogger.disp |
def plot(name=None, fig=None, abscissa=1, iteridx=None, plot_mean=False, foffset=1e-19, x_opt=None, fontsize=7, downsample_to=3000.0, xsemilog=None, xnormalize=None, addcols=None, **kwargs):
¶
plot data from files written by a CMADataLogger
,
the call cma.plot(name, **argsdict) is a shortcut for
cma.CMADataLogger(name).plot(**argsdict)
Arguments
name
- name of the logger, filename prefix, None evaluates to the default 'outcma/cma'
fig
- filename or figure number, or both as a tuple (any order)
abscissa
- 0==plot versus iteration count, 1==plot versus function evaluation number
iteridx
- iteration indices to plot
x_opt
- if len(x_opt) == dimension, the difference to
x_opt
is plotted, otherwise the first row of x_opt are the indices of the variables to be plotted and the second row, if present, is used to take the difference. xsemilog
- customized semilog plot for x-values
Return None
Examples
cma.plot() # the optimization might be still # running in a different shell cma.s.figsave('fig325.png') cma.s.figclose() cdl = cma.CMADataLogger().downsampling().plot() # in case the file sizes are large
Details
Data from codes in other languages (C, Java, Matlab, Scilab) have the same format and can be plotted just the same.
| See Also | |
CMADataLogger , CMADataLogger.plot |


Before Change
distributions = self._resolve_distributions_by_platform(reqs, platforms=platforms)
locations = set()
for platform, dists in distributions.items():
for dist in dists:
if dist.location not in locations:
self._log.debug(f" Dumping distribution: .../{os.path.basename(dist.location)}")
self.add_distribution(dist)
locations.add(dist.location)
def _resolve_multi(self, interpreter, requirements, platforms, find_links):
Multi-platform dependency resolution for PEX files.
Returns a list of distributions that must be included in order to satisfy a set of requirements.
After Change
:param platforms: A list of platform strings to resolve requirements for.
Defaults to the platforms specified by PythonSetup.
for resolved_dist in self.resolve_distributions(reqs, platforms=platforms):
requirement = resolved_dist.requirement
self._log.debug(f" Dumping requirement: {requirement}")
self._builder.add_requirement(str(requirement))
distribution = resolved_dist.distribution
self._log.debug(f" Dumping distribution: .../{os.path.basename(distribution.location)}")
self.add_distribution(distribution)
def _resolve_multi(self, requirements, platforms=None, find_links=None):
python_setup = self._python_setup_subsystem
python_repos = self._python_repos_subsystem
platforms = platforms or python_setup.platforms


__all__ = ["OutgoingTransaction", "Transaction", "TransactionReceipt"]
from .account import AccountType
import json
[docs]class TXBase:
"""
Enables accessing the attribute 'from' from outside using 'from_'.
"""
def __getattr__(self, attr):
if attr == "from_":
return self.__dict__.__getitem__("from")
else:
return self.__dict__.__getitem__(attr)
def __setattr__(self, attr, value):
if attr == "from_":
self.__dict__.__setitem__("from", value)
else:
self.__dict__.__setitem__(attr, value)
def __repr__(self):
return json.dumps(self.__dict__)
[docs]def preprocess_args(func):
"""
Decorator to change the parameter 'from' to 'from_' during deserialization.
"""
def inner(*args, **kwargs):
if "from" in kwargs:
kwargs["from_"] = kwargs.pop("from")
func(*args, **kwargs)
return inner
[docs]class OutgoingTransaction(TXBase):
"""
Used to pass the data to send transaccions.
:param from_: The address the transaction is send from.
:type from_: str
:param fromType: The account type at the given address.
:type fromType: AccountType, optional
:param to: The address the transaction is directed to.
:type to: str
:param toType: The account type at the given address.
:type toType: AccountType, optional
:param value: Integer of the value (in smallest unit) sent with this transaction.
:type value: int
:param fee: Integer of the fee (in smallest unit) for this transaction.
:type fee: int
:param data: Hex-encoded contract parameters or a message.
:type data: str, optional
"""
def __init__(
self,
from_,
to,
value,
fee,
fromType=AccountType.BASIC,
toType=AccountType.BASIC,
data=None,
):
self.from_ = from_
self.fromType = fromType
self.to = to
self.toType = toType
self.value = value
self.fee = fee
self.data = data
[docs]class Transaction(TXBase):
"""
Transaction returned by the server.
:param hash: Hex-encoded hash of the transaction.
:type hash: str
:param blockHash: Hex-encoded hash of the block containing the transaction.
:type blockHash: str, optional
:param blockNumber: Height of the block containing the transaction.
:type blockNumber: int, optional
:param timestamp: UNIX timestamp of the block containing the transaction.
:type timestamp: int, optional
:param confirmations: Number of confirmations of the block containing the transaction.
:type confirmations: int, optional
:param transactionIndex: Index of the transaction in the block.
:type transactionIndex: int, optional
:param from_: Hex-encoded address of the sending account.
:type from_: str
:param fromAddress: Nimiq user friendly address (NQ-address) of the sending account.
:type fromAddress: str
:param to: Hex-encoded address of the recipient account.
:type to: str
:param toAddress: Nimiq user friendly address (NQ-address) of the recipient account.
:type toAddress: str
:param value: Integer of the value (in smallest unit) sent with this transaction.
:type value: int
:param fee: Integer of the fee (in smallest unit) for this transaction.
:type fee: int
:param data: Hex-encoded contract parameters or a message.
:type data: str, optional
:param flags: Bit-encoded transaction flags.
:type flags: int
:param valid: Is valid transaction.
:type valid: bool, optional
:param inMempool: Transaction is in mempool.
:type inMempool: bool, optional
"""
@preprocess_args
def __init__(
self,
hash,
from_,
fromAddress,
to,
toAddress,
value,
fee,
flags,
blockHash=None,
blockNumber=None,
timestamp=None,
confirmations=0,
transactionIndex=None,
data=None,
valid=None,
inMempool=None,
):
self.hash = hash
self.blockHash = blockHash
self.blockNumber = blockNumber
self.timestamp = timestamp
self.confirmations = confirmations
self.transactionIndex = transactionIndex
self.from_ = from_
self.fromAddress = fromAddress
self.to = to
self.toAddress = toAddress
self.value = value
self.fee = fee
self.data = data
self.flags = flags
self.valid = valid
self.inMempool = inMempool
[docs]class TransactionReceipt:
"""
Transaction receipt returned by the server.
:param transactionHash: Hex-encoded hash of the transaction.
:type transactionHash: str
:param transactionIndex: Integer of the transactions index position in the block.
:type transactionIndex: int
:param blockHash: Hex-encoded hash of the block where this transaction was in.
:type blockHash: str
:param blockNumber: Block number where this transaction was in.
:type blockNumber: int
:param confirmations: Number of confirmations for this transaction (number of blocks on top of the block where this transaction was in).
:type confirmations: int
:param timestamp: Timestamp of the block where this transaction was in.
:type timestamp: int
"""
def __init__(
self,
transactionHash,
transactionIndex,
blockHash,
blockNumber,
confirmations,
timestamp,
):
self.transactionHash = transactionHash
self.transactionIndex = transactionIndex
self.blockHash = blockHash
self.blockNumber = blockNumber
self.confirmations = confirmations
self.timestamp = timestamp


Aaron Filson
I am a Web Developer studying at Code Fellows in Seattle, looking to work on fantastic projects to advance technology and improve the world. I earned a B.S. in Computer Science from the University of Puget Sound, and a M.S. in Project Management from City University of Seattle. I have also worked in ceramics for ten years, and a portfolio of my work is online at : http://aaronfilsonceramics.com.


LATRIK
Services
Solutions
Pricing
Coverage
Innovation
We Bring Green Energy To Your Doorstep.
Get Started
60,000 MW
54,000 MW
478,600 Users
Be In Touch With Our Rep.
Contact Ethan
Adopt Remote Utilities Management.
Manage Your Utilities Even When You Are Away!
Download App


{% extends "base.html" %} {% block addedcss %} {% endblock %} {% block content %}
${{ musician_amount }} is paid to {{ musician.name }}
${{ transaction_fee }} is paid as a transaction fee


|
Yorick Language ReferenceArithmetic and Comparison OperatorsFrom highest to lowest precedence, ^ raise to power
Any binary operator may be prefixed to = to produce an increment operator; thus x*=5 is equivalent to x=x*5. Also, ++x and --x are equivalent to x+=1 and x-=1, respectively. Finally, x++ and x-- increment or decrement x by 1, but return the value of x before the operation. |


data class LocalVideoConfiguration
Contains configuration for a local video or content share to be sent
<init> |
Contains configuration for a local video or content share to be sent LocalVideoConfiguration(maxBitRateKbps: Int = 0) |
safeMaxBitRateKbps |
val safeMaxBitRateKbps: Int |


Welcome!
For new patients, we offer:
- Initial Consultations
- Appt Type A
- Appt Type B
Returning patients, please access your account below


LINK
Section: Linux Programmer's Manual (2)
Updated: 2014-08-19
Index
Return to Main Contents
NAME
link, linkat - make a new name for a file
SYNOPSIS
#include <unistd.h>
int link(const char *oldpath, const char *newpath);
#include <fcntl.h> /* Definition of AT_* constants */
#include <unistd.h>
int linkat(int olddirfd, const char *oldpath,
int newdirfd, const char *newpath, int flags);
Feature Test Macro Requirements for glibc (see
feature_test_macros(7)):
linkat():
-
- Since glibc 2.10:
-
_XOPEN_SOURCE >= 700 || _POSIX_C_SOURCE >= 200809L
- Before glibc 2.10:
-
_ATFILE_SOURCE
DESCRIPTION
link()
creates a new link (also known as a hard link) to an existing file.
If
newpath
exists, it will
not
be overwritten.
This new name may be used exactly as the old one for any operation;
both names refer to the same file (and so have the same permissions
and ownership) and it is impossible to tell which name was the
"original".
linkat()
The
linkat()
system call operates in exactly the same way as
link(),
except for the differences described here.
If the pathname given in
oldpath
is relative, then it is interpreted relative to the directory
referred to by the file descriptor
olddirfd
(rather than relative to the current working directory of
the calling process, as is done by
link()
for a relative pathname).
If
oldpath
is relative and
olddirfd
is the special value
AT_FDCWD,
then
oldpath
is interpreted relative to the current working
directory of the calling process (like
link()).
If
oldpath
is absolute, then
olddirfd
is ignored.
The interpretation of
newpath
is as for
oldpath,
except that a relative pathname is interpreted relative
to the directory referred to by the file descriptor
newdirfd.
The following values can be bitwise ORed in
flags:
- AT_EMPTY_PATH (since Linux 2.6.39)
-
If
oldpath
is an empty string, create a link to the file referenced by
olddirfd
(which may have been obtained using the
open(2)
O_PATH
flag).
In this case,
olddirfd
can refer to any type of file, not just a directory.
This will generally not work if the file has a link count of zero (files
created with
O_TMPFILE
and without
O_EXCL
are an exception).
The caller must have the
CAP_DAC_READ_SEARCH
capability in order to use this flag.
This flag is Linux-specific; define
_GNU_SOURCE
to obtain its definition.
- AT_SYMLINK_FOLLOW (since Linux 2.6.18)
-
By default,
linkat(),
does not dereference
oldpath
if it is a symbolic link (like
link()).
The flag
AT_SYMLINK_FOLLOW
can be specified in
flags
to cause
oldpath
to be dereferenced if it is a symbolic link.
If procfs is mounted,
this can be used as an alternative to
AT_EMPTY_PATH,
like this:
linkat(AT_FDCWD, "/proc/self/fd/<fd>", newdirfd,
newname, AT_SYMLINK_FOLLOW);
Before kernel 2.6.18, the
flags
argument was unused, and had to be specified as 0.
See
openat(2)
for an explanation of the need for
linkat().
RETURN VALUE
On success, zero is returned.
On error, -1 is returned, and
errno
is set appropriately.
ERRORS
- EACCES
-
Write access to the directory containing
newpath
is denied, or search permission is denied for one of the directories
in the path prefix of
oldpath
or
newpath.
(See also
path_resolution(7).)
- EDQUOT
-
The user's quota of disk blocks on the filesystem has been exhausted.
- EEXIST
-
newpath
already exists.
- EFAULT
-
oldpath or newpath points outside your accessible address space.
- EIO
-
An I/O error occurred.
- ELOOP
-
Too many symbolic links were encountered in resolving
oldpath or newpath.
- EMLINK
-
The file referred to by
oldpath
already has the maximum number of links to it.
- ENAMETOOLONG
-
oldpath or newpath was too long.
- ENOENT
-
A directory component in
oldpath or newpath
does not exist or is a dangling symbolic link.
- ENOMEM
-
Insufficient kernel memory was available.
- ENOSPC
-
The device containing the file has no room for the new directory
entry.
- ENOTDIR
-
A component used as a directory in
oldpath or newpath
is not, in fact, a directory.
- EPERM
-
oldpath
is a directory.
- EPERM
-
The filesystem containing
oldpath and newpath
does not support the creation of hard links.
- EPERM (since Linux 3.6)
-
The caller does not have permission to create a hard link to this file
(see the description of
/proc/sys/fs/protected_hardlinks
in
proc(5)).
- EROFS
-
The file is on a read-only filesystem.
- EXDEV
-
oldpath and newpath
are not on the same mounted filesystem.
(Linux permits a filesystem to be mounted at multiple points, but
link()
does not work across different mount points,
even if the same filesystem is mounted on both.)
The following additional errors can occur for
linkat():
- EBADF
-
olddirfd
or
newdirfd
is not a valid file descriptor.
- EINVAL
-
An invalid flag value was specified in
flags.
- ENOENT
-
AT_EMPTY_PATH
was specified in
flags,
but the caller did not have the
CAP_DAC_READ_SEARCH
capability.
- ENOENT
-
An attempt was made to link to the
/proc/self/fd/NN
file corresponding to a file descriptor created with
open(path, O_TMPFILE | O_EXCL, mode);
See
open(2).
- ENOENT
-
oldpath
is a relative pathname and
olddirfd
refers to a directory that has been deleted,
or
newpath
is a relative pathname and
newdirfd
refers to a directory that has been deleted.
- ENOTDIR
-
oldpath
is relative and
olddirfd
is a file descriptor referring to a file other than a directory;
or similar for
newpath
and
newdirfd
- EPERM
-
AT_EMPTY_PATH
was specified in
flags,
oldpath
is an empty string, and
olddirfd
refers to a directory.
VERSIONS
linkat()
was added to Linux in kernel 2.6.16;
library support was added to glibc in version 2.4.
CONFORMING TO
link():
SVr4, 4.3BSD, POSIX.1-2001 (but see NOTES), POSIX.1-2008.
linkat():
POSIX.1-2008.
NOTES
Hard links, as created by
link(),
cannot span filesystems.
Use
symlink(2)
if this is required.
POSIX.1-2001 says that
link()
should dereference
oldpath
if it is a symbolic link.
However, since kernel 2.0,
Linux does not do so: if
oldpath
is a symbolic link, then
newpath
is created as a (hard) link to the same symbolic link file
(i.e.,
newpath
becomes a symbolic link to the same file that
oldpath
refers to).
Some other implementations behave in the same manner as Linux.
POSIX.1-2008 changes the specification of
link(),
making it implementation-dependent whether or not
oldpath
is dereferenced if it is a symbolic link.
For precise control over the treatment of symbolic links when
creating a link, use
linkat(2).
Glibc notes
On older kernels where
linkat()
is unavailable, the glibc wrapper function falls back to the use of
link(),
unless the
AT_SYMLINK_FOLLOW
is specified.
When
oldpath
and
newpath
are relative pathnames,
glibc constructs pathnames based on the symbolic links in
/proc/self/fd
that correspond to the
olddirfd
and
newdirfd
arguments.
BUGS
On NFS filesystems, the return code may be wrong in case the NFS server
performs the link creation and dies before it can say so.
Use
stat(2)
to find out if the link got created.
SEE ALSO
ln(1),
open(2),
rename(2),
stat(2),
symlink(2),
unlink(2),
path_resolution(7),
symlink(7)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- linkat()
-
- RETURN VALUE
-
- ERRORS
-
- VERSIONS
-
- CONFORMING TO
-
- NOTES
-
- Glibc notes
-
- BUGS
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:54:49 GMT, September 18, 2014


[1] Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. SQuAD: 100, 000+ Questions for Machine Comprehension of Text. In Proceedings of EMNLP 2016
[2] Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William W. Cohen, Ruslan Salakhutdinov, and Christopher D. Manning. 2018. HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering. In Proceedings of EMNLP 2018.
[3] Jason Weston, Antoine Bordes, Sumit Chopra, and Tomas Mikolov. 2016. Towards AI-Complete Question Answering: A Set of Prerequisite Toy Tasks. In Proceedings of ICLR 2016
Contact: Betty van Aken (@betty_v_a) @ DATEXIS


Yes, if you have mild allergies you can donate blood, even when taking antihistamines for treatment. However, there are times when you may not be able to donate.
Eligibility
To ensure the safety of both patients and donors, there are some requirements that donors must meet to be eligible to donate blood
Am I eligible to donate blood ?
Take our two-minute eligibility quiz to find out if you can donate blood. If you are determined to be eligible online, you will be able to book your first appointment. Final eligibility will be determined by our partners.
Eligibility Quiz
Common Reasons People Can't Donate
Even if you were deferred in the past, you may be eligible to donate now.
Low Iron
If you were unable to donate due to low iron, you may still be able to donate in the future. We recommend taking steps to help increase your iron level.
Learn More >>
Information About Medications
Most medications will not disqualify you from being able to donate blood, but may require a waiting period after your final dose.
Learn More >>
Cold, Flu and Other Types of Illness
If you don’t feel well on the day of your donation. You should wait 24 hours after your symptoms pass.
Learn More >>
Weight and Height
You have to be over 50 kg to donate.
Learn More >>
Eligibility Frequently Asked Questions
Donation may be possible if your angina has been treated, you have had no further symptoms for at least 6 months and you meet other criteria.
Maybe. It depends on why you’re taking the antibiotics.
Usually yes, as long as you are well and have no side-effects from the medication.
Maybe. There are many forms of this condition and different treatments.
Yes, you can donate if you currently or have previously worked in an abattoir.

In most cases you can donate again if you remain free of cancer five years after completing treatment.


Unexpected behaviour might occur if you are unsure about editing this field.
To read about the available flags please refer to javascript.info.
Reset extenstion settings.
This extension is open source and available on github.com/ada/edge-regex-search.


{{users.login}}
Following {{users.followers}}
Following {{users.following}}
public repos {{users.public_repos}}


Jesse Pinkman
Cook, Heisenberg Inc
Cook, Heisenberg Inc
Ut sibi fuerat socius sagittis. Ego intervenerit. Vere quia a te nuper iratus occidit illos undecim annorum puer. Deinde, si hoc forte qui fuit imperavit.
You are done. Fired. Do not show your face at the laundry again. Stay away from Pinkman. Do not go near him. Ever.
It's complicated and I don't wish to discuss it. It's none of your concern. You know what, let's just say that I have a hell of a lot more on my mind, right now, than…
2014-09-19T12:07:51.042Z 2014-09-19T14:07:51.042Z
/Users/Heisenberg/Pinkman.zip
Copyright © 2010-2014 AMC Network Entertainment LLC.


 After his capture, the suspect told officers he'd planted a bomb in the house that was ready to explode.
|
|
|
|
|
|
|
Facing a hazard of unknown proportions, police officers called Wilson Fire/Rescue Services, which moved quickly to protect citizens in the surrounding neighborhood. "We pulled up our GIS system on a terminal in one of our trucks.We pinpointed the house on the map, and it gave us an evacuation zone," said Chief Don Oliver, of Wilson Fire/Rescue Services. "We could identify the houses we needed to evacuate by address, so we got everybody out."
|
With citizens out of harm's way, police used a robotic device to remove the bomb from the house and disarm it in the street. "It took us 12 hours to resolve the situation, but there was not a single injury," Oliver said.
The incident offers a dramatic example of how Wilson Fire/Rescue uses mobile GIS technology to safeguard residents of this 50,000-member community in eastern North Carolina. Working closely with HP, the rural fire department has become a model for using geospatial information to improve firefighters' decision-making and effectiveness.
HP teamed with ESRI to provide a sophisticated solution for Wilson's "Fire Department of the Future" GIS initiative. The project relies on HP business-critical servers, high-performance workstations and networking equipment. HP technology provides a powerful, reliable infrastructure for running ESRI's advanced GIS mapping applications.
The fire department tapped into the city's existing GIS system for information on streets, water lines and hydrants, electrical and gas lines, and building and zoning specifications.
A GIS fire analysis application allowed the department to add specialized information such as incident reports and fire inspection records into its system. GIS data generated by the system is loaded into computer terminals that are mounted in Wilson's firefighting vehicles. In addition, HP notebooks and handhelds help deliver GIS maps wherever they are needed. "We run about 4,000 calls a year," Oliver said."What we're doing is taking technology and applying it to decision-making in the emergency-service field."
Launched in 2000, the initiative provides new technology tools to address the firefighting needs of a changing city. Once one of the world's largest tobacco markets, Wilson's economy gradually is shifting from agriculture to manufacturing and pharmaceuticals. "We have three and a half million square feet of warehouse space that is used for storing everything from rubber to pesticides," Oliver said.
Wilson uses GIS technology to give them the answers.
One byproduct of Wilson's changing economic base is a large number of vacant commercial buildings which Oliver cites as the city's largest firefighting hazard. Firefighters attacking a blaze in one of these buildings confront a series of questions: Is the building locked up? Can they be relatively certain that no one is inside? Is the building structurally sound? Could potentially hazardous materials still be stored inside?
The department identified every vacant commercial structure in the city, rated its condition and plotted the data on a GIS map. Buildings were put into one of four color-coded categories based on their potential danger. Categories ranged from green for structurally sound and secure, to red for abandoned and dangerous the latter being judged too hazardous to enter under any circumstances.
GIS maps showing the shape, size, location and condition of vacant buildings were loaded into computer terminals mounted in the department's fire trucks."So now, when the fire captain crawls into his rig, he enters the address and brings up a picture of the building," said Oliver. "That tells him straight up whether he's going to be able to make an offensive or defensive attack on the fire."
Geospatial information helps Wilson Fire/Rescue improve firefighter and citizen safety in other ways, too. Like any fire department,Wilson strives to make the best use of limited personnel and assets. GIS technology gave fire officials bold new insight into how and where to deploy resources.
"You know the old adage, 'A picture is worth a thousand words?' Well, it's true," said Oliver. "If I can show you a problem, rather than tell you about the problem, you'll understand it a lot quicker."
For example, the department moved one of its two light squad companies across town after GIS information showed the squad was stationed in the wrong place. "One of the primary responsibilities for these companies is to respond first to emergency medical calls, saving wear and tear on our larger trucks," Oliver said."We had them in what we thought was the most centrally located stations in the city. But we found out that one of our engine companies was responding to over 600 EMS calls a year, and one squad had only responded to 143."
Since its relocation, the squads cover the majority of EMS calls in the city. "We provide better service now than we ever have," said Oliver."And we didn't make that decision until we put it on a map and looked at the picture."
Expanding scope
Using its fire analysis software,Wilson has begun applying geospatial analysis to data stored in its records management system. That insight helps the department identify patterns and eliminate risks that might otherwise go unnoticed.
For example, analysis of the department's emergency medical calls pinpointed locations where traffic accidents occurred frequently. Armed with that information, the fire department convinced city planners to install new traffic signals and reconfigure intersections.
"Where we're really making a difference is being able to convey information taking data and creating pictures that show how we can mitigate issues before they become major problems," Oliver said.
The chief would like to start applying those capabilities to other areas as well.
"We're looking at getting notebooks that our fire inspectors can carry with them in the field when they perform inspections," he said. "I would also like to see all architectural drawings that are approved by the city become available electronically, so we could have the most current configuration for buildings loaded in our system."
Oliver expects GIS maps to help the department strengthen its fire safety education programs too. Although the city's economy is changing,Wilson still has a large population of migrant agricultural workers, many of whom cannot speak English. GIS maps can help show where these workers tend to live and congregate, allowing the department to focus bilingual fire-safety programs where they will have the most impact.
Spreading the word
Given the program's current accomplishments and its promise for the future,Wilson Fire/Rescue entertains a steady stream of fire officials from other jurisdictions who stop by to observe the progress.
"I can't tell you how many departments have been here Atlanta, Raleigh, Charlotte, Durham.We're sharing the story," said Oliver. He also appears regularly at public-safety association meetings to present information on Wilson's project.
Oliver views his department's use of geospatial information and sophisticated computing equipment as a model for other firefighting agencies to follow. The city has become a proving ground for applying advanced information solutions to the business of firefighting. And working in close partnership with HP,Wilson Fire/Rescue Services clearly is proving that GIS technology helps provide safer communities.
"I've got the best fire department in the world. These folks are committed, they're energetic, and they want to do the best job they can. And we're giving them the tools to do it better every day," Oliver said. "We're covering calls better and more quickly so we're cutting down on the number of large fires we have. We're getting to them at an earlier stage.
"The truth is," he said,"this technology has raised the level of service and safety for Wilson's citizens and our firefighters."


Hinesh's Weather Network
Celsius
Fahrenheit
Enter City:
Search
May require several clicks for optimal update, Thank you.
Current Weather
,
o
Weather:
Wind speed:
m/s
Humidity:
%
Hourly Forcast
Click Here (Update)
Hide
5-Day Forcast
o
Weather:
Wind speed:
m/s
Humidity:
%
o
Weather:
Wind speed:
m/s
Humidity:
%
o
Weather:
Wind speed:
m/s
Humidity:
%
o
Weather:
Wind speed:
m/s
Humidity:
%
o
Weather:
Wind speed:
m/s
Humidity:
%


Lorry Name:
load1
Estate:
Nagaraj
Date:
8 Apr 2008
SNo
Length
Girth
Qnty
ClassA
ClassB
ClassC
ClassD
Total CFT
Rate
Amount
1
10.0
4.6
1
12.66
12.66
Class A
Class B
Class C
Class D
Total CFT
Amount
#Logs
12.66
12.66
1


Enter Your Contact Information Below To Get On Our ‘Early Bird’ List And Hear About It Before Anyone Else!


Disabled Italian freighter on tow in Aegean sea
by STEPAN KOTCHERGAGeneral cargo ship HARTURA suffered engine failure on Nov 21 in Aegean sea, while en route from Ravenna Italy to Gemlik Turkey. Tug APOLLON (IMO 7431806) was contracted for salvage, the ship was taken on tow on Nov 22, port of destination Piraeus, ETA Nov 23.
General cargo ship HARTURA, IMO 9546447, dwt 12223, built 2009, flag Italy, manager MONTEVERDE DI NAVIGAZIONE.


|
<< Click to Display Table of Contents >> Navigation: Knowledgebase and FAQ > DNS Basics |
Domains are managed by using a worldwide system of domain registrars and databases. The Domain Name System (DNS) provides a mapping between human-readable computer hostnames and the IP addresses used by networking equipment. An understanding of DNS and domain registrar basics will help administrators manage domains in Microsoft Office 365.
Also, it’s helpful to have a basic understanding of DNS and the difference between domain registrars and domain hosting services. Understanding these terms can help you understand how to register and manage domains.
•.com is the top-level domain
•contoso is the second-level domain
•mail is the third-level domain
Note: Sometimes third-level domains are used to designate webpages that serve specific functions, such as blog.contoso.com.
Name server record |
Identifies which name servers are the authoritative name servers for a specific domain. DNS information can be cached in several name servers for a period of time, but when the cache expires, non-authoritative name servers contact the authoritative name server for updated information about a domain. |
A record (address record) |
Associates a domain name with an IP address. |
CNAME (Alias or canonical name) record |
Specifies that the domain name is an alias of another canonical domain name. When a name server looks up a domain and finds a CNAME record, it replaces the first domain name with the CNAME and then looks up the new name. |
MX (mail exchanger) record |
Identifies the server to which email is directed. It also contains a priority field so that mail can be directed to multiple servers in a prescribed order. |
SPF (sender policy framework) |
An email validation system designed to help prevent email spoofing and phishing. |
SRV (service record) |
Specifies information about available services. SRV records are used by Microsoft Skype for Business and Exchange Online to coordinate the flow of information between Office 365 services. |
TTL (time-to-live) |
The amount of time that a DNS record is retained or cached by a name server or other servers before the server does another lookup on the authoritative name server. You use this to control the number of queries made to a given name server. |


|
| Value |
Description |
Notes |
|
| 00 |
No record errors |
Entire record parsed and ingested without errors, record may have a Product record in the Acknowledgement which itself may
have a <RecordStatusNote> or <RecordStatusDetail> to convey information, editorial queries or warnings
|
| 01 |
No record errors – errors in collateral |
Entire record parsed and ingested without errors, record MUST have a Product record in the Acknowledgement with a <RecordStatusNote>
or at least one <RecordStatusDetail> to convey errors in associated media files (and possibly supplementary editorial queries)
|
| 02 |
Record with errors |
Record parsed and ingested with errors, record MUST have a Product record in the Acknowledgement with a <RecordStatusNote>
or at least one <RecordStatusDetail> to convey errors (and possibly supplementary information, editorial queries or warnings).
At least SOME of the data in the original Product record has been ingested. There may also be errors in associated media files
|
| 03 |
Record rejected |
Entire record rejected, record MUST have a Product record in the Acknowedgemet, with a <RecordStatusNote> or at least one
<RecordStatusDetail> to convey errors (and possibly supplementary information, editorial queries or warnings). NONE of the
data in the original Product record has been ingested
|
| 09 |
Reported previously |
Record status reported in an earlier Acknowledgement message, based on partial processing of ONIX message. The record MUST
NOT have a Product record in this Acknowledgement. Code not valid in <RecordStatusDetail>
|
|


Genetic Drift: Random Sampling
The Hardy-Weinberg Equilibrium Model describes a hypothetical world where allele frequencies remain constant over time, i.e. one in which evolution does not take place. One of the assumptions of the model is an infinite population size. If this assumption is dropped, evolution becomes possible via the mechanism of genetic drift.
Genetic Drift
Genetic drift is the random sampling of alleles in a population. That is to say, the frequency of a particular allele in relation to its counterpart is not determined by natural selection, but by chance.
In population genetics,
-
evolution is defined as as the change in allele
frequencies in a population over generations. Two evolutionary
mechanisms are:
- natural selection, defined as the change in allele frequencies in a population over generations as a result of their fitness for reproduction.
- genetic drift, defined as the change in allele frequencies in a population over generations due to random sampling, leading to loss of genetic variation.
Genetic drift occurs in all non-infinite populations, but its effects are more clearly apparent in small populations. The 'drift' in genetic drift can be explained most easily with an example:
Given two alleles of a gene coding for fur colour, B and b, either may move (drift) towards:
- Fixation — only B survives (or vice-versa).
- Loss — b becomes extinct (or vice-versa).
To reiterate: whichever allele drifts to fixation or loss is a matter of chance, not of natural selection. The surviving allele could be detrimental or beneficial (or neither) towards the adaptability of the phenotype to its environment.
Causes
As mentioned, genetic drift occurs most markedly in small populations. The events that produce small populations are of two main kinds:
1) The Bottleneck Effect
Some kind of catastrophic event occurs, killing off a large percentage of a population. Subsequent generations will have a much smaller allele pool to draw from, and chance events (e.g. reproductory success) can lead to the disappearance of a particular allele from the population within a few generations.
2) The Founder effect
A small part of a population breaks off from the main body and becomes isolated from it. The frequencies of the alleles in this much reduced allele pool will now be subject to chance and, as in the bottleneck effect, their drift towards fixation or loss in subsequent generations will become more likely.
An Example
Assumption: after each round of reproduction, the previous generation dies out.

- P (B allele frequency) = 0.5
- q (b allele frequency) = 0.5
Generation 2
The population is now made up of:
- 9 individuals with black fur (genotype BB or Bb) and
- 1 individual with brown fur (genotype bb).
- P (B allele frequency) = 0.65
- q (b allele frequency) = 0.35
Generation 3
The population is now made up of:
- 10 individuals with black fur (genotype BB or Bb) and
- 0 individuals with brown fur (genotype bb).
- P (B allele frequency) = 1
- q (b allele frequency) = 0
The fact that five pairs of rabbits reproduced in the first generation and only one pair reproduced in the second was purely a matter of chance.
However, if the first generation population had been much larger, say a thousand rabbits rather than ten, there would have initially been two hundred rabbits with the bb genotype rather than two, and the likelihood that none of these rabbits would have passed on their genes to the third generation would have been much smaller.
The drift towards the fixation or loss of alleles in small populations reflects the law of large numbers.
The law of large numbers
The law of large numbers states that in the long run random events tend to average out at the expected value.
Example: tossing a coin
There are two sides to a coin so the probability of heads landing is 50% and the probability of tails landing is also 50%. The expected value is therefore 0.5.
However, if we tossed the coin only ten times, we wouldn't be surprised if heads landed 70% of the time and tails 30% of the time, or even 100% and 0% of the time.
On the other hand, if we tossed the coin a million times, we would be very surprised if we obtained these ranges of values. It is much more likely that the result would be very close to 50% for either side, i.e. close to the expected value of 0.5. (As up to ten simulations can be run at the same time, drifting to both fixation and loss may be seen as possible outcomes in the same chart.)
Returning to the earlier example, if the rabbit population size had been made up of hundreds of thousands of individuals, instead of only ten, the initial frequencies of 0.5 for the P (B allele) and q (b allele) would have shown little variation over many generations.
Simulating Genetic Drift
The charts simulate the possible frequencies of one allele, B, having an initial frequency of 0.5, over a selected number of generations at different population sizes. Allele B's corresponding allele, b, is not shown but its fate can be inferred from the results:
- If the line goes to the top of the x-axis (1.0) and flattens out, B has drifted to fixation (it is the only surviving allele) and b has drifted to loss (it has gone extinct),
- If the line goes to the bottom of the x-axis (0.0) and flattens out, B has drifted to loss and b has drifted to fixation.
No. simulations: | Population size: | No. generations:
Sample Results
Below are three screenshots of charts showing ten simulations with different population sizes, over fifty generations.


{% extends "base.html" %} {% block content %}
Demonstrates how to get and display all of your organization’s monitoring data.
{% if show_doc %}Documentation about this example.
{% endif %}API method used: DataSet:GetStream.
View source file {{ source_file }} on GitHub.
{% endblock %}


Mappings for the StructureDefinition-encounter-es-1 Profile.
| EncounterEventSummary |
| Encounter | Entity. Role, or Act |
| meta | |
| id | n/a |
| extension | n/a |
| text | Act.text? |
| contained | N/A |
| modifierExtension | N/A |
| identifier | .id |
| status | .statusCode |
| statusHistory | n/a |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| status | n/a |
| period | n/a |
| class | .inboundRelationship[typeCode=SUBJ].source[classCode=LIST].code |
| classHistory | n/a |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| class | n/a |
| period | n/a |
| type | .code |
| priority | .priorityCode |
| subject | .participation[typeCode=SBJ]/role[classCode=PAT] |
| episodeOfCare | n/a |
| incomingReferral | .reason.ClinicalDocument |
| participant | .participation[typeCode=PFM] |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| type | .functionCode |
| period | .time |
| individual | .role |
| appointment | .outboundRelationship[typeCode=FLFS].target[classCode=ENC, moodCode=APT] |
| period | .effectiveTime (low & high) |
| length | .lengthOfStayQuantity |
| reason | .reasonCode |
| diagnosis | .outboundRelationship[typeCode=RSON] |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| condition | .outboundRelationship[typeCode=RSON].target |
| role | n/a |
| rank | .outboundRelationship[typeCode=RSON].priority |
| account | .pertains.A_Account |
| hospitalization | .outboundRelationship[typeCode=COMP].target[classCode=ENC, moodCode=EVN] |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| preAdmissionIdentifier | .id |
| origin | .participation[typeCode=ORG].role |
| admitSource | .admissionReferralSourceCode |
| reAdmission | n/a |
| dietPreference | .outboundRelationship[typeCode=COMP].target[classCode=SBADM, moodCode=EVN, code="diet"] |
| specialCourtesy | .specialCourtesiesCode |
| specialArrangement | .specialArrangementCode |
| destination | .participation[typeCode=DST] |
| dischargeDisposition | .dischargeDispositionCode |
| location | .participation[typeCode=LOC] |
| id | n/a |
| extension | n/a |
| modifierExtension | N/A |
| location | .role |
| status | .role.statusCode |
| period | .time |
| serviceProvider | .particiaption[typeCode=PFM].role |
| partOf | .inboundRelationship[typeCode=COMP].source[classCode=COMP, moodCode=EVN] |
| EncounterEventSummary |
| Encounter | |
| identifier | PV1-19 |
| status | No clear equivalent in HL7 v2; active/finished could be inferred from PV1-44, PV1-45, PV2-24; inactive could be inferred from PV2-16 |
| class | PV1-2 |
| type | PV1-4 / PV1-18 |
| priority | PV2-25 |
| subject | PID-3 |
| episodeOfCare | PV1-54, PV1-53 |
| participant | ROL |
| type | ROL-3 (or maybe PRT-4) |
| period | ROL-5, ROL-6 (or maybe PRT-5) |
| individual | ROL-4 |
| appointment | SCH-1 / SCH-2 |
| period | PV1-44, PV1-45 |
| length | (PV1-45 less PV1-44) iff ( (PV1-44 not empty) and (PV1-45 not empty) ); units in minutes |
| reason | EVN-4 / PV2-3 (note: PV2-3 is nominally constrained to inpatient admissions; HL7 v2 makes no vocabulary suggestions for PV2-3; would not expect PV2 segment or PV2-3 to be in use in all implementations ) |
| diagnosis | |
| condition | Resources that would commonly referenced at Encounter.indication would be Condition and/or Procedure. These most closely align with DG1/PRB and PR1 respectively. |
| hospitalization | |
| preAdmissionIdentifier | PV1-5 |
| admitSource | PV1-14 |
| reAdmission | PV1-13 |
| dietPreference | PV1-38 |
| specialCourtesy | PV1-16 |
| specialArrangement | PV1-15 / OBR-30 / OBR-43 |
| destination | PV1-37 |
| dischargeDisposition | PV1-36 |
| location | |
| location | PV1-3 / PV1-6 / PV1-11 / PV1-42 / PV1-43 |
| serviceProvider | PV1-10 / PL.6 & PL.1 (note: HL7 v2 definition is "the treatment or type of surgery that the patient is scheduled to receive"; seems slightly out of alignment with the concept name 'hospital service'. Would not trust that implementations apply this semantic by default) |


CLICK ME!
You should fill out the form now...
User Information
Please Enter the Following:
But first:
First Name
Last Name
Birthdate
Select Profile Picture
Email:
Email:
Enter a number greater than 1 and less than 10
Password:
Verify Password:
I agree to the terms of service
I agree
I disagree


Automation Demo Application
Add
Execute Snippets
List of Code Snippets
{{ testcode.text }}
List of Clients connected
{{ webClient.clientId }}


Basic ngx-datatable example styled for ngx-ui. Note: This module is not included in ngx-ui by default.


Hello, I am Shekhar Singh.
I am a Software Engineer.
I can help you build your Tech from 0 to 1.
I can help you scale your Tech from 1 to 100.
I can help you build your team.
Let's connect through email or linkedin.
Core areas: Software architecture, Data architecture, Platforms and DevOps.
(for students)


System Components
Management
Score Entry
from other computers
Team Score Display
from other computers
Robot Game Timer
from other computers
Quit
Will stop the engine
Credits
>


MAD CITY (Warner - 1997) Starring John Travolta, Dustin Hoffman, Mia Kirshner, Alan Alda, Robert Prosky, Blythe Danner Screenplay by Tom Matthews Produced by Arnold Kopelson, Anne Kopelson Directed by Costa-Gavras Running time: 114 minutes
**1/2 (out of four stars) Alternate Rating: B-
Note: Some may consider portions of the following text to be spoilers. Be forewarned.
-------------------------------------------------------------
The situation is explosive. A lone former employee has commandeered the Museum of Natural History. Armed with a shotgun and explosives, he's wounded a security guard, and holds a few museum employees and a visiting class of young children hostage. Holed up behind the relative safety of museum's security implementations, his sole liaison to the police and outside world is -- a ruthlessly ambitious, ethically bankrupt TV investigative reporter? Uh-oh.
Such is the scenario for Costa-Gavras' MAD CITY, which, through exposition of the increasingly-compromised ethics and outright dishonesty in modern television reporting, wants to be a searing indictment against the media, but ultimately produces little more than a singe.
Chief in its problems is its lack of originality; this is simply a story which is too familiar to be told in such a straightforward manner. Not only has the theme of media manipulation been addressed in similar fashion in several other films, but it's safe to conclude that by now the increasingly mistrusting and suspicious public is jaded enough to fully realize that the reporting it absorbs through print, radio, and television comes with a spin courtesy of the source which delivers it. Tom Matthews' screenplay for MAD CITY tells us nothing new in this respect; it's preaching to the converted.
Essentially a character study which focuses on the everchanging and curiously symbiotic relationship between gunman Sam Baily (John Travolta), a museum security guard recently laid off due to budgetary constraints who accidentally triggered the hostage siege when returning to attempt to plead his case to museum director Mrs. Banks (Blythe Danner), and reporter Max Brackett (Dustin Hoffman), a former network star desperate to regain his ace status after being demoted to local coverage, MAD CITY is relatively intimate and staid enough that it could function in a glossed-down form as a stage production.
Sam is not a bad man: he's effectively a slow-witted simpleton played by Mr. Travolta as a lost puppy dog who haplessly bumbled his way into the volatile situation presented in MAD CITY. The film takes great pains to assert his relative innocuousness -- his shooting of the other security guard (fine character actor Bill Nunn, curiously billed extremely low considering his substantial role in the film) was accidental -- by presenting him with a childlike mentality: he frolics with and wins over the captive schoolchildren, and perpetually turns to Max for guidance. In this treatment, MAD CITY tries to be a bit too cute for its own good at times, which undermines the tension inherent in the situation.
Of course, Max is happy to pull the strings behind this story and milk it for all it's worth -- this is his ticket back to the big time. While the film is often simply blatantly unsubtle with its theme of media manipulation and sensationalism, as evident by a recurring thread in which Max tutors Sam on how to play up the situation in order to win public support (and of course, in his own self-interest, create high ratings), as well as a scene where Max edits and syncs interview footage until the final product corresponds with what he wants his subjects to say, one can almost relish his forthright, unapologetic lack of scruples. While not disturbing as the film would seem to like, Max's aggressive naked ambition occasionally proves to be quite amusing: a particularly good moment in the film is a flashback sequent which depicts the cause for Max's demotion -- a moment of on-air grandstanding histrionics which humiliated network anchorman Kevin Hollander (Alan Alda). However, in a move which seems arbitrarily artificial, MAD CITY ends up trying to play it both ways by having Max be as slimy and manipulative as the system the film cries out against, and then do a sudden about-face as the plot requires and grow a conscience; it rings patently false.
Yet, although it's anticlimactic and often a little too heavy-handed, MAD CITY is always engaging and maintains interest. Well shot by Patrick Bloosier and paced well, the film unfolds in a logical progression which is predictable but ultimately inevitable.
It's helped by good performances from its cast. MAD CITY is essentially a showcase for Mr. Hoffman and Mr. Travolta, who are solid in their respective roles. I couldn't help but enjoy Mr. Hoffman's depiction of a character who discards objective reporting and puts a spin on his story with nonchalant efficiency, and Mr. Travolta, despite my best efforts to resist, is occasionally endearing through his character's bewilderment at the escalating situation in which he finds himself. He does tend to substitute the use of slang for obliviousness in his character here, much as he did for a remarkably similar character in another performance -- in Desmond Nakano's WHITE MAN'S BURDEN, Mr. Travolta played a lower-class, uneducated working man whom, after being laid off from a menial job, took his employer hostage. On the note of drawing parallels to previous work, the theme of chastising media manipulation isn't new to Mr. Hoffman, as can be witnessed in Stephen Frears' HERO (titled ACCIDENTAL HERO overseas).
Mia Kirshner has a lot of spunk as the protege videographer Laurie who falls under Max's wing and learns the tricks of the trade all-too-well, eventually becoming seduced with the glamour of 'making' the news. Ms. Danner is good in a small role as the museum director and lends dignity to the part, although most of the time she just gets to stand around. Mr. Alda is fine, although it's somewhat dubious to cast him as a network star anchorman -- he just doesn't have the gladhanding aura about him. William Atherton rehashes a variation of his most famous role from as unscrupulous reporter Richard Thornberg in DIE HARD (which, in its own way, was even more effective and less self-righteous in its skewering of the media) -- here, he plays a transparently-vacuous local anchorman.
While MAD CITY thankfully avoided overt parallels to the O.J. Simpson media circus, and was wrapped production before any references to the Princess Diana incident could be made, the handling of the race card in the film struck me as far too heavy-handed, and the montages of T-shirts being sold outside the museum and folk singers strumming odes to Sam pushed the film too far into satire. Granted, as can be seen from coverage outside the L.A. courtroom from 1996, it's not at all unbelievable, but the film would have been more effective and had a stronger impact had the emphasis on the carnival-like atmosphere which prevails along with media events been lessened.
MAD CITY can be neatly encapsulated with one particular sequence, in which Max chastises Laurie for aiding the wounded museum guard -- she can't film him and help him at the same time, and the former clearly takes precedent. It's a heartless sentiment, but the sequence, like the film itself, is neither quite as disturbing or shocking as it's intended to be, because we already know the film's angle. For a potentially potent story, MAD CITY, while eminently watchable, is curiously hollow.
- Alex Fung email<EMAIL_ADDRESS>web : http://www.ncf.carleton.ca/~aw220/
-- Alex Fung<EMAIL_ADDRESS>| http://www.ncf.carleton.ca/~aw220/ "I'll never forget you. You're too weird." - David Krumholtz, ADDAMS FAMILY VALUES
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Code@Night Archive
-
Q/A Session with Princeton Alumni now at Meta (March 23, 2022): Thanks to former tigers Matthew Yeh, Phillip Yoon, and Frank Li for taking some time out of their busy schedules to tell us about their jobs at Meta! Some notes, as well as answers to the questions you asked, can be found here.
-
Interview Prep with Meta Engineer Blake Dixon (March 16, 2022): Thanks to Princeton alum Blake Dixon for going through a couple practice problems and giving us the insider perspective on Big Tech interviews! Unfortunately, we couldn’t record the presentation or share the slides, but we do have some notes that you can find here. (You’ll need to log in with your Princeton email.)
-
Competitive Programming Advising (February 25, 2022): Thanks to Nalin for leading our ICPC practice! Tips and the problems we went over can be found at this link. (You’ll need to sign in with your Princeton credentials.)
-
Workshop on C++ (November 19, 2021): Thanks (again) to Andrew Wonnacott from Old Mission Capital for teaching us a bit about C++ and what it’s like to work for a propietary trading firm! Slides can be found here.
-
Startup Talk with Alinea (November 12, 2021): Thanks to Anam Lakhani and Eve Halimi from Alinea for sharing their story in the fintech startup world, as well as exposing us to some of the technical challenges they have to consider on a day-to-day basis!
-
Workshop on YugabyteDB and the Database Industry (October 29, 2021): Thanks to the Yugabyte Team for hosting an info session on the cool things going on at Yugabyte! Slides can be found here.
-
A Gentle Introduction to Python (September 24, 2021): Thanks to Nalin Ranjan for easing us into Python! For those who want to review the materials, you can find them here (slides), here (Jupyter notebook with exercises), and here (Jupyter notebook with solutions to exercises).
-
Workshop on Design (April 3, 2020): Thanks to Kevin Feng for teaching us the basic principles of product design! Slides can be found here.
-
Workshop on C++ (September 27, 2019): Thanks to Andrew Wonnacott from Old Mission Capital for teaching us a bit about C++! Slides can be found here.


Center of Excellence for Social Technologies (NEES): NEES is a research group from the Computing Institute at the Federal University of Alagoas. It focuses on research and development of IT Solutions, generating scientific knowledge and promoting its transference for the society, companies and scientific community. Its vision is to be an international reference in the generation of knowledge, empowering people with social view and supporting new spin-offs related to social entrepreneurship and IT.
The Semantic Web provides a common framework that allows data to be shared and reused across application, enterprise, and community boundaries.
Computers in Education is a sub-field of informatics with focus on computers applications, systems and networks that support research in and delivery of education.
Social entrepreneurship is the attempt to draw upon business techniques to find solutions to social problems.
Investigation about open data usage on cities through ontologies.
JOINT wants to build a plataform for agile and efficient semantic applications development.


Below we have outlined a few the other products we offer in addition to our cleaning services here at MP Professional Duct Cleaning.
We are sure you’ve probably heard a lot about HEPA filters over the last couple of decades. Even if you are not familiar with their use in HVAC systems, vents, and ducts, you may be familiar with their use in vacuum cleaners and other appliances like that.
They are popular and spoken a lot for some very good reasons, but if you are new to the world of air purification, we realize that you might need more convincing than that to invest in one.
At MP Professional Duct Cleaning we offer HEPA filter installation as part of our extensive list of services.
HEPA stands for High-Efficiency Particulate Air and is used to describe special filters that are designed to catch and contain contaminants the first time around. They are especially important in hospitals and other medical care environments where sanitation is extremely important.
They can be, and in our opinion should be used in the home environment too. As they offer such benefits as:
99.97% air filtration
Fresh air constantly circulated throughout your home
Next to no accumulation or build-up of dust, making blockages more or less a thing of the past
Which in turn means duct cleaning is required less frequently
And it is more energy efficient as airflow is unrestricted
As well as the more general benefits listed above, there are also several health benefits to having HEPA filters installed in your home, including:
Reduction of airborne allergens, ideal for asthmatics and other allergy sufferers
Improved quality of air can help people with other respiratory issues
Improved heart rate and blood pressure
Reduces the harmful effects of pollution
Now you know why you should consider having a HEPA filter installed in your property, why should you choose MP Professional Duct Cleaning to carry out the work for you?
That’s a very sensible and justified question.
We feel strongly that because we are passionate about delivering a service where you, the customer is our main priority, coupled with the fact that we have more than 6 years’ worth of experience in the industry, that we are the best people for the job of installing your HEPA filter.
We won’t just install the HEPA filter for you, though, as we will also help you to make the right choice for your home and budget. We carry many different makes and models. You can be sure, though, that although they may have different pros and cons, we have only selected the makes and models that we think are the best out there.
Although adding moisture to a room would seem to be counterintuitive and something that most people want to avoid, there are certain scenarios, it needs to be balanced. Therefore, rooms should not be completely dry or completely wet, which means if you have rooms in your property where the air and atmosphere are very dry, you could benefit from the installation of a humidifier.
Perhaps you are only familiar with humidifiers by name and not by purpose or function. Let us elaborate on why you should consider the humidifier installation service we offer here at MP Professional Duct Cleaning.
A humidifier is a special invention, normally in the form of an electrical appliance that increases the amount of moisture in either a whole building or specific rooms.
There are some key health benefits you can gain from having a humidifier installed in your home or business premises, including the fact it eases the symptoms of people who:
Have respiratory issues
Regular nose bleeds
Dry cough and/or dry throat
In addition to the health benefits listed above, it’s also worth noting that if there is a lot of paint on the surfaces in your property, a humidifier can help it last longer. Paintwork tends to crack more easily in areas where there is limited or no moisture in the air.
If you are interested in having a humidifier installed in your home or property, then we can sort that for you. As well as offering recommendations to the best make and model for your property size and your budget, we will also carry out the installation to the same impeccably high standards we carry out all the work we do.


In today’s connected world, information of every hue––intellectual property, health records, personal communications, government records, financial information––is accessible over the Internet and other networks. The nearly ubiquitous and on-demand access to a wide variety of information has given rise to an array of services that improve individual and organizational efficiencies, and our overall quality of life. At the same time, such open access poses substantial risk to individuals and organizations, as has been demonstrated by recent high-profile hacking events.
The University of Southern California’s Information Sciences Institute (USC/ISI) is sponsored by IARPA under the CAUSE program to research technologies that will counter cyber threats by anticipating them before they manifest in the form of an actual attack. The EFFECT research team, led by USC/ISI, includes a team of experts from Arizona State University, Raytheon BBN, Hyperion Gray, Lockheed Martin ATL, Ruhr University Bochum. The team is exploring methods to forecast cyberattacks by integrating information from a variety of sensors within a robust machine inference framework.
To find traces of early planning activity by malicious actors, researchers will collect data from unconventional sources, that include dark web and social media sites, forum discussions and others, develop methods to deal with large volumes of heterogeneous information that include unstructured natural language text, structured data, and public network traffic data, and analyze these data streams to generate robust warnings of pending cyberattacks.
The age-old saying to be forewarned is to be forearmed rings particularly true in the case of cyber threats. For society to continue enjoying the benefits of an open, worldwide Internet, it is critical that we tame the rapidly growing cyber threats posed by a variety of state and non-state actors.


{% block content %}
The Doctrine Project is the home to several PHP libraries primarily focused on database storage and object mapping. The core projects are the Object Relational Mapper (ORM) and the Database Abstraction Layer (DBAL) it is built upon.
|
Doctrine has been downloaded a total of {{ totalDownloads|number_format }} times! |
Many other popular PHP projects use libraries from Doctrine. Some use the full ORM and others may only use one small library such as the Inflector. Here are some projects that use Doctrine.
| {{ doctrineUser.name }} | {% else %}{{ doctrineUser|raw }} | {% endif %} {% endfor %}
Tidelift is working with the maintainers of Doctrine ORM and thousands of other open source projects to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use.
The Tidelift Subscription is a managed open source subscription for application dependencies covering millions of open source projects across JavaScript, Python, Java, PHP, Ruby, .NET, and more.
Your subscription includes:


A little demo of drag-and-drop functionality in SVG
Written in Python, hosted as a frontend static web page, powered by Brython.
- Some items are draggable. They will have a visual clue when mouse is hovering on them.
- Coins can be placed fully inside piggy bank.
- All draggable things can be thrown fully or partly into recycle bin.


Shed Sensors
Plots
24 hours
48 hours
1 week
1 month
3 months
1 year
2016
SunCalc
ThingSpeak
View Logs
Errors
Plant States
Settings
Log Files
Settings Files
NETWORK
Router IP Address
HEATER
Enable Heater
ON temperature
°C
Hysterisis ±
°C
Miplug Sensor Id
RAIN GAUGE
Tick Measurement
mm per tick
THINGSPEAK
Host Address
API Key
Channel ID
MAKER CHANNEL
POST Address
Key
EVERNOTE
Gardening Tag
Plant Tag Identifier
Location Tag Identifier
State Tag Identifier
Notebook
WATER LEVEL PREDICTION
Enable Water Level Alarm
Alarm level
mm
Watering Days
days
Irrig Depth Full
mm
Irrig Depth Partial
mm
Soil Type
Sandy
Loamy Sand
Sandy Loam
Loam
Silt Loam
Silt
Silt Clay Loam
Silty Loam
Clay
Coordinates
Crop Factor Kc
Root Depth
metres
Errors
Date
No.
Message
Notified
Count
Plant States
Name
GUID
Color
Symbol


The specified mapping was applied on all entries of the source table. The resulting entities are listed bellow and may be adjusted before confirming the import.


(Deprecated API)
(Deprecated API)
(Deprecated API)
Includes enterprise licensing and support
With the Google Maps API for Flash, it is now very easy to add Google Maps technology to your Microsoft Windows Presentation Foundation (WPF) application using XAML.
The Google Maps API for Flash runs as a Flash application inside the Flash player control. The Flash Player control is embedded in the WPF application and code glue allows your Native .NET C# or VB.NET code to interface for the Google Maps control in Flash.
This sample project demonstrates you how to insert Google Maps in your WPF application, how to access the Google Maps API and interface with the Maps control, and how to receive information back from the control in the WPF application.
The final application looks like this:
The address bar at the top is a WPF TextBox
control.
You can type any address, press Enter (or the Search button) and
the map will display a marker at the requested address.
The values at the bottom of the screen are TextBox
controls that display the longitude and latitude of
the marker oberlay on the map. Clicking on the map will reposition the marker
and send an event from the Google Maps control in Flash to the WPF code.
So how is all this done?
You need to create a SWF File to display the Google map control and interface with it. Detailed information with step by step instructions on how to setup your Flex development environment is available at http://code.google.com/apis/maps/documentation/flash/tutorial-flex.html.
<?xml version="1.0" encoding="utf-8"?> <mx:Application xmlns:mx="http://www.adobe.com/2006/mxml" layout="absolute">
This is the standard MXML header.
<maps:Map xmlns:maps="com.google.maps.*" id="map" mapevent_mapready="onMapReady(event)" width="100%" height="100%"/>
The Google maps control is configured to use 100% of the
Flash player area as the rest of the user interface is provided in WPF.
On receipt of the mapevent_mapready
event, we
call the onMapReady
function.
<mx:Script> <![CDATA[ import com.google.maps.services.ClientGeocoderOptions; import com.google.maps.overlays.Marker; import com.google.maps.controls.MapTypeControl; import com.google.maps.controls.PositionControl; import com.google.maps.controls.ZoomControl; import com.google.maps.InfoWindowOptions; import com.google.maps.MapMouseEvent; import com.google.maps.services.ClientGeocoder; import com.google.maps.services.GeocodingEvent; import com.google.maps.LatLng; import com.google.maps.Map; import com.google.maps.MapEvent; import com.google.maps.MapType; import mx.controls.Alert; private var marker : Marker; private function onMapReady(event:Event):void { ... } private function onMapClick(event:MapMouseEvent):void { ... } private function onSearch(address:String):void { ... } ]]> </mx:Script>
The script for this MXML application is inlined with the MXML code but could be managed in a separate file. In addition to the import definitions required to access the Google Maps API within Flash, there are three private functions defined. These are discussed below.
</mx:Application>
And finally the closing tag for the MXML file.
private function onMapReady(event:Event):void { var centerLL : LatLng = new LatLng(38.900218,-77.036562); map.setCenter( centerLL, 18, MapType.NORMAL_MAP_TYPE); map.addControl(new ZoomControl()); map.addControl(new PositionControl()); map.addControl(new MapTypeControl()); map.addEventListener(MapMouseEvent.CLICK,onMapClick); marker = new Marker( centerLL ); map.addOverlay( marker ); ExternalInterface.addCallback("Search",onSearch); }
This function has five specific tasks:
map.setCenter()
Zoom
, Position
and MapType
controls to the map control using map.addControl()
onMapClick
function to the MapMouseEvent.Click
event to monitor mouse clicks on
the map using map.addEventListener()
map.addOverlay()
onSearch
function to the Search
event on the ExternalInterface
(more on this later).
More information about the API classes is in the http://code.google.com/apis/maps/documentation/flash/reference.html
private function onMapClick(event:MapMouseEvent):void { marker.setLatLng( event.latLng ); ExternalInterface.call( "setPosition", marker.getLatLng().lat(), marker.getLatLng().lng() ); }
When the map is clicked, a MapMouseEvent.CLICK
event is
triggered. From the addEventListener()
call in the
onMapReady()
function, the
onMapClick()
function is called.
The event parameter contains the LatLng
value of the point
where the map was clicked. The function repositions the marker to the new
coordinates using marker.setLatLng()
then makes a call to
the ExternalInterface
"setPosition" to notify the WPF layer of the
change of position of the marker.
(The ExternalInterface
is discussed later in this article).
private function onSearch(address:String):void { // Geocoding example var geocoder:ClientGeocoder = new ClientGeocoder(); geocoder.addEventListener( GeocodingEvent.GEOCODING_SUCCESS, function(event:GeocodingEvent):void { var placemarks:Array = event.response.placemarks; if (placemarks.length > 0) { map.setCenter(placemarks[0].point); marker.setLatLng(placemarks[0].point); ExternalInterface.call("setPosition", marker.getLatLng().lat(), marker.getLatLng().lng() ); } }); geocoder.addEventListener( GeocodingEvent.GEOCODING_FAILURE, function(event:GeocodingEvent):void { Alert.show("Geocoding failed"); }); geocoder.geocode(address); }
When a "Search" call is received from the WPF layer through
the ExternalInterface, the onSearch
function is called
passing a single address
parameter.
To convert an address into a LatLng
value, we need to
create an instance of the ClientGeocoder
,
and make a call to geocode()
. This call is asynchronous and the
ClientGeocoder
can fire two events as a response
to this call, GeocodingEvent.GEOCODING_SUCCESS
and
GeocodingEvent.GEOCODING_FAILURE
.
On success, we center the map to the new address, reposition the marker and notify the WPF layer of the new position of the marker. On failure we simply display an error message.
We use two features of the Flex SDK to communicate
between the Google Maps control in Flex and the WPF layer;
ExternalInterface.call()
and ExternalInterface.addCallback()
.
The ExternalInterface.call()
method allows the AS3 code to send a
request to the host of the Flash control. The request is received by the host
as an XML message. So the call
ExternalInterface.call( "setPosition", marker.getLatLng().lat(), marker.getLatLng().lng() );
is converted to:
<invoke name="setPosition" returntype="xml"> <arguments> <number>40.7077159</number> <number>-74.0116411</number> </arguments> </invoke>
The Flex environment also allows the Flash control to receive requests from the host environment. This functionality is used when an address is entered in WPF. A "Search" request is sent by WPF to Flash as an XML message:
<invoke name="Search" returntype="xml"> <arguments> <string>1 Wall Street, New York</string> </arguments> </invoke>
We monitor request from the Host using
ExternalInterface.addCallback
.
C:\src\flash>h:\flash_api_dev\flex_sdk_3\bin\mxmlc GoogleMaps.mxml -library-path+=h:\flash_api_dev\sdk\lib\map_flex_1_9.swc Loading configuration file H:\flash_api_dev\flex_sdk_3\frameworks\flex-config.xml C:\src\flash\GoogleMaps.swf (242361 bytes)
WPF doesn't have native support for ActiveX controls but ActiveX controls can be hosted in WPF using the WindowsFormsHost control. To use this control, you need to create an Interop wrapper around the Flash control. The source code provided with this project already includes the necessary files, but if you need to recreate the Interop library, you can either:
C:\src\flash>"C:\Program Files\Microsoft SDKs\Windows\v6.0A\bin\aximp.exe" C:\Windows\system32\Macromed\Flash\Flash10a.ocx
The command-line tool is particularly useful if you need to be able to sign your assemblies or if you would like to get the assemblies regenerated in a batch process. See http://msdn.microsoft.com/en-us/library/8ccdh774(VS.80).aspx
or
Microsoft Visual Studio automatically generates an AxHost wrapper class for a Microsoft ActiveX control when the control is added to a design surface. The following procedure creates a managed assembly named AxInterop.ShockwaveFlashObjects.dll.
The Shockwave Flash Player control is added to the Toolbox.
We're now ready to create our demo application.
<Window x:Class="GoogleMapsFlashInWpf.Window1" xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation" xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml" xmlns:wf="clr-namespace:System.Windows.Forms;assembly=System.Windows.Forms" xmlns:ax="clr-namespace:AxShockwaveFlashObjects;assembly=AxInterop.ShockwaveFlashObjects" Title="Hosting Google Maps Flash API in a WPF .NET Application" Loaded="WindowLoaded" MinHeight="400" MinWidth="600"> <Grid> <Grid.RowDefinitions> <RowDefinition Height="Auto" /> <RowDefinition Height="*" /> <RowDefinition Height="Auto" /> </Grid.RowDefinitions> <Grid Margin="5,5,5,5" Grid.Row="0"> <Grid.ColumnDefinitions> <ColumnDefinition Width="Auto"/> <ColumnDefinition Width="*"/> <ColumnDefinition Width="Auto"/> </Grid.ColumnDefinitions> <Label Margin="0,0,5,0" Grid.Column="0">Address:</Label> <TextBox Name="address" Grid.Column="1" KeyDown="TextBox_KeyDown"></TextBox> <Button Margin="5,0,0,0" Padding="10,0,10,0" Grid.Column="2" Click="Search_Click">Search</Button> </Grid> <Border BorderThickness="1" BorderBrush="Blue" Grid.Row="1" Margin="5,5,5,5"> <WindowsFormsHost Name="wfh"> <ax:AxShockwaveFlash x:Name="axFlash"/> </WindowsFormsHost> </Border> <Grid Margin="5,5,5,5" Grid.Row="2"> <Grid.ColumnDefinitions> <ColumnDefinition Width="5*"/> <ColumnDefinition Width="5*"/> </Grid.ColumnDefinitions> <StackPanel Grid.Column="0" Orientation="Horizontal"> <TextBlock Margin="0,0,5,0">Lat:</TextBlock> <TextBlock Name="lat"></TextBlock> </StackPanel> <StackPanel Grid.Row="2" Grid.Column="1" Orientation="Horizontal"> <TextBlock Margin="0,0,5,0">Lng:</TextBlock> <TextBlock Name="lng"></TextBlock> </StackPanel> </Grid> </Grid> </Window>
Note the AxShockwaveFlash control hosted inside the WindowsFormsHost control.
using System; using System.Linq; using System.Xml.Linq; using System.Windows; using System.Windows.Input; namespace GoogleMapsFlashInWpf { /// /// Interaction logic for Window1.xaml /// public partial class Window1 : Window { public Window1() { InitializeComponent(); } private void WindowLoaded(object sender, RoutedEventArgs e) { AxShockwaveFlashObjects.AxShockwaveFlash axFlash = wfh.Child as AxShockwaveFlashObjects.AxShockwaveFlash; axFlash.FlashVars = "key= your_api_key"; axFlash.Movie = System.Windows.Forms.Application.StartupPath + "\\GoogleMaps.swf"; axFlash.FlashCall += new AxShockwaveFlashObjects._IShockwaveFlashEvents_FlashCallEventHandler(axFlash_FlashCall); } void axFlash_FlashCall(object sender, AxShockwaveFlashObjects._IShockwaveFlashEvents_FlashCallEvent e) { XDocument call = XDocument.Parse(e.request); var q = from c in call.Elements("invoke") select new { Name = c.Attribute("name").Value, Arguments = c.Element("arguments").Descendants() }; foreach (var i in q) { if (i.Name == "setPosition") { lat.Text = i.Arguments.ElementAt(0).Value; lng.Text = i.Arguments.ElementAt(1).Value; } } } private void TextBox_KeyDown(object sender, KeyEventArgs e) { if (e.Key == Key.Enter) Search_Click(sender, null); } private void Search_Click(object sender, RoutedEventArgs e) { AxShockwaveFlashObjects.AxShockwaveFlash axFlash = wfh.Child as AxShockwaveFlashObjects.AxShockwaveFlash; XElement call = new XElement("invoke", new XAttribute("name", "Search"), new XAttribute("returntype", "xml"), new XElement("arguments", new XElement("string", address.Text) ) ); axFlash.CallFunction(call.ToString(SaveOptions.DisableFormatting)); } } }
Within this code, there are three elements to notice:
axFlash.FlashVars = "key= your_api_key"; axFlash.Movie = System.Windows.Forms.Application.StartupPath + "\\GoogleMaps.swf";
FlashCall
event of the Flash
object to receive the ExternalInterface.call()
calls from Flash.
axFlash_FlashCall
, we process the XML request received
from Flash, check the Invoke.Name
attribute
(it should be "setPosition") and change the values of lat.Text
and
lng.Text
with the new latitude and longitude
values.
When the Search button is clicked, we prepare an XML element
of type "invoke", set the "name" attribute and the arguments elements and call
the CallFunction
method of the Flash control.
This request will be received inside Flash using
ExternalInterface.addCallback
.
To deploy, you need these files:
Google Maps MXML file
GoogleMaps.mxml
Compiled SWF file
GoogleMaps.swf
Visual Studio 2008 project for the Flash Interop Library (Source)
FlashAxLib_Src.zip.
Flash Interop Library (.NET Assemblies)
FlashAxLib.zip.
Visual Studio 2008 project for the Google Maps Demo (Source)
GoogleMapsFlashInWpf_Src.zip.
Google Maps Demo (.NET Executable)
GoogleMapsFlashInWpf.zip.
Google Maps API for Flash
http://code.google.com/apis/maps/documentation/flash/
Google Maps API for Flash - Flex SDK Tutorial
http://code.google.com/apis/maps/documentation/flash/tutorial-flex.
Windows Forms ActiveX Control Importer (Aximp.exe)
http://msdn.microsoft.com/en-us/library/8ccdh774(VS.80).aspx
Walkthrough: Hosting an ActiveX control in Windows Presentation Foundation by Using XAML
http://msdn.microsoft.com/en-us/library/ms748870.aspx
If you have any problems with or questions about this tutorial, please post in the Maps API forum.


HOME
Registration for KYIT Project
Select Course:(One person will be eligible for one course only)
First Preference*:
Select Course
Name:*
Father Name:*
Mother Name:*
Gender:*
Select Gender
National ID
Date of Birth:*
Religion:*
Select Religion
Ethnic Group:*
Select Religion
Mobile:*
Email:*
Is Employed?
Yes
No
Monthly Income:
Present Address
Address:*
City:*
Post Code:*
Division:*
Select Division
District:*
Select District
Sub-District:*
Select Sub-District
Permanent Address
Address:*
City:*
Post Code:*
Division:*
Select Division
District:*
Select District
Sub-District:*
Select Sub-District
Highest Academic Achievement
Level of Education:
Institute:
Subject:
Year:
Photo
Image size should be 300x300 (Max 100KB) in JPG Format
Security
Name:*


Microverse Survey Page Project
Explannation
Name
Email
Age
Ideas ?
kek
kekw
monka
monkaw
pog
pogU
TFblade
BoxBox
Moe & Alicopter


Irodalomjegyzék
Arun, Rajkumar, Venkatasubramaniyan Suresh, CE Veni Madhavan, and MN Narasimha Murthy. 2010. “On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations.” In Pacific-Asia Conference on Knowledge Discovery and Data Mining, 391–402.
Baccianella, Stefano, Andrea Esuli, and Fabrizio Sebastiani. 2010. “Sentiwordnet 3.0: An Enhanced Lexical Resource for Sentiment Analysis and Opinion Mining.” In Lrec, 2200–2204.
Bar, Daniel, Torsten Zesch, and Iryna Gurevych. 2011. “A Reflective View on Text Similarity.” Proceedings of Recent Advances in Natural Language Processing: 515–20.
Blei, David M, Andrew Y Ng, and Michael I Jordan. 2003. “Latent Dirichlet Allocation.” Journal of machine Learning research 3(Jan): 993–1022.
Brady, Henry E. 2019. “The Challenge of Big Data and Data Science.” Annual Review of Political Science 22(1): 297–323. https://www.annualreviews.org/doi/10.1146/annurev-polisci-090216-023229 (April 15, 2021).
Burtejin, Zorgit. 2016. “Csoportosítás (Klaszterezés).” In Kvantitatív Szövegelemzés és Szövegbányászat a Politikatudományban, ed. Miklós Sebők. Budapest: L’Harmattan, 85–101.
Cao, Juan et al. 2009. “A Density-Based Method for Adaptive LDA Model Selection.” Neurocomputing 72(7-9): 1775–81.
Deveaud, Romain, Eric SanJuan, and Patrice Bellot. 2014. “Accurate and Effective Latent Concept Modeling for Ad Hoc Information Retrieval.” Document numérique 17(1): 61–84.
Griffiths, T. L., and M. Steyvers. 2004. “Finding Scientific Topics.” Proceedings of the National Academy of Sciences 101(Supplement 1): 5228–35. http://www.pnas.org/cgi/doi/10.1073/pnas.0307752101 (February 23, 2021).
Grimmer, Justin, and Brandon M Stewart. 2013. “Text as Data: The Promise and Pitfalls of Automatic Content Analysis Methods for Political Texts.” Political analysis 21(3): 267–97.
Hjorth, Frederik et al. 2015. “Computers, Coders, and Voters: Comparing Automated Methods for Estimating Party Positions.” Research & Politics 2(2):<PHONE_NUMBER>580476.
Jacobi, Carina, Wouter Van Atteveldt, and Kasper Welbers. 2016. “Quantitative Analysis of Large Amounts of Journalistic Texts Using Topic Modelling.” Digital Journalism 4(1): 89–106.
Kusner, Matt J, Yu Sun, Nicholas I Kolkin, and Kilian Q Weinberger. 2015. “From Word Embeddings to Document Distances.” Proceedings of the 32nd International Conference on Machine Learning.
Kwartler, Ted. 2017. Text Mining in Practice with R. John Wiley & Sons.
Ladd, John R. 2020. “Understanding and Using Common Similarity Measures for Text Analysis.” The Programming Historian 9. https://doi.org/10.46430/phen0089.
Laver, Michael, Kenneth Benoit, and John Garry. 2003. “Extracting Policy Positions from Political Texts Using Words as Data.” American political science review: 311–31.
Laver, Michael, and John Garry. 2000. “Estimating Policy Positions from Political Texts.” American Journal of Political Science: 619–34.
Liu, Bing. 2010. “Sentiment Analysis and Subjectivity.” Handbook of natural language processing 2(2010): 627–66.
Loughran, Tim, and Bill McDonald. 2011. “When Is a Liability Not a Liability? Textual Analysis, Dictionaries, and 10-Ks.” The Journal of Finance 66(1): 35–65.
Máté, Ákos, Miklós Sebők, and Tamás Barczikay. 2021. “The Effect of Central Bank Communication on Sovereign Bond Yields: The Case of Hungary” ed. Hiranya K. Nath. PLOS ONE 16(2): e0245515. https://dx.plos.org/10.1371/journal.pone.0245515 (February 15, 2021).
Mikolov, Tomas, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. “Efficient Estimation of Word Representations in Vector Space.” arXiv preprint arXiv:1301.3781.
Mikolov, Tomas et al. 2018. “Advances in Pre-Training Distributed Word Representations.” In Proceedings of the International Conference on Language Resources and Evaluation (LREC 2018),
Niwattanakul, Suphakit, Jatsada Singthongchai, Ekkachai Naenudorn, and Supachanun Wanapu. 2013. “Using of Jaccard Coefficient for Keywords Similarity.” Hong Kong: 5.
Pennington, Jeffrey, Richard Socher, and Christopher D Manning. 2014. “Glove: Global Vectors for Word Representation.” In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), 1532–43.
Phan, Xuan-Hieu, Le-Minh Nguyen, and Susumu Horiguchi. 2008. “Learning to Classify Short and Sparse Text & Web with Hidden Topics from Large-Scale Data Collections.” In, 91–100.
Roberts, Margaret E et al. 2014. “Structural Topic Models for Open-Ended Survey Responses.” American Journal of Political Science 58(4): 1064–82.
Russel, Stuart, and Peter Norvig. 2005. Mesterséges Intelligencia. Panem Kft.
Schütze, Hinrich, Christopher D Manning, and Prabhakar Raghavan. 2008. 39 Introduction to Information Retrieval. Cambridge University Press Cambridge.
Sebők, Miklós. 2016. Kvantitatív Szövegelemzés és Szövegbányászat a Politikatudományban. L’Harmattan Kiadó.
Sebők, Miklós, and Zoltán Kacsuk. 2021. “The Multiclass Classification of Newspaper Articles with Machine Learning: The Hybrid Binary Snowball Approach.” Political Analysis 29(2): 236–49. https://www.cambridge.org/core/product/identifier/S1047198720000273/type/journal_article (April 19, 2021).
Sebők, Miklós et al. 2021. “Viscosity Revisited: The Power of Legislatures in New and Old Democracies - A Comparative Text Reuse Analysis.”
Sieg, Adrien. 2018. “Text Similarities : Estimate the Degree of Similarity Between Two Texts.” Medium. https://medium.com/@adriensieg/text-similarities-da019229c894.
Silge, Julia, and David Robinson. 2017. Text Mining with R: A Tidy Approach. " O’Reilly Media, Inc.".
Slapin, Jonathan B, and Sven‐Oliver Proksch. 2008. “A Scaling Model for Estimating Time‐series Party Positions from Texts.” American Journal of Political Science 52(3): 705–22.
Spirling, Arthur, and Pedro L Rodriguez. 2021. “Word Embeddings.” Journal of Politics. https://polmeth.mit.edu/sites/default/files/documents/Pedro_Rodriguez.pdf.
Straka, Milan, and Jana Straková. 2017. “Tokenizing, Pos Tagging, Lemmatizing and Parsing Ud 2.0 with Udpipe.” In Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies, 88–99.
Szarvas, György, Richárd Farkas, and András Kocsor. 2006. “A Multilingual Named Entity Recognition System Using Boosting and C4. 5 Decision Tree Learning Algorithms.” In International Conference on Discovery Science, Springer, 267–78.
Tan, Pang-Ning, Michael Steinbach, and Vipin Kumar. 2011. Bevezetés Az Adatbányászatba. Panem Kft.
Tikk, Domonkos. 2007. Szövegbányászat. Budapest: Typotext.
Üveges, István. 2019. “Named Entity Recognition in the Miskolc Legal Corpus.”
Vincze, Veronika. 2019. “Beszéd és Nyelvelemző Szoftverek.” In Beszéd és Nyelvelemző Szoftverek a Versenyképességért és Az Esélyegyenlőségért HunCLARIN Korpuszok és Nyelvtechnológiai Eszközök a Bölcsészet és Társadalomtudományokban, Szeged, 7–22.
Wang, Jiapeng, and Yihong Dong. 2020. “Measurement of Text Similarity: A Survey.” Information 11(9): 421. https://www.mdpi.com/2078-2489/11/9/421 (March 20, 2021).
Welbers, Kasper, Wouter Van Atteveldt, and Kenneth Benoit. 2017. “Text Analysis in R.” Communication Methods and Measures 11(4): 245–65.
Wickham, Hadley, and Garrett Grolemund. 2016. R for Data Science: Import, Tidy, Transform, Visualize, and Model Data. " O’Reilly Media, Inc.".
Young, Lori, and Stuart Soroka. 2012. “Affective News: The Automated Coding of Sentiment in Political Texts.” Political Communication 29(2): 205–31.
Zsibrita, János, Veronika Vincze, and Richárd Farkas. 2013. “Magyarlanc: A Tool for Morphological and Dependency Parsing of Hungarian.” In Proceedings of the International Conference Recent Advances in Natural Language Processing RANLP 2013, 763–71.


This documentation relates to Opera's now deprecated .oex Extension API framework for Opera versions <= 12.15 and also provided by our OEX2NEX shim library.
For the latest Opera Extensions API documentation for Opera versions > 12.15 please consult the latest Opera Extensions API documentation online.
Opera 11.50 for desktop introduces the ability for extensions to share cookies with the browser. As tempting as it is to dive into puns about milk and biscuits, we're going to look at how this new feature can help you make extensions that are easier for people to use. And this feature also just happens to be easy for developers to use as well.
Even non-technical users have heard of cookies thanks to various scary stories in the press. They're the things that sit inside your computer, watch what you're doing and then report back to some evil overlord who will try to sell you stuff you don't need, right? Well, possibly, but the cookies we're sharing in this article are the helpful kind. They do things like keep track of whether you're logged in to a particular website so that every time you view a new page, you don't have to re-enter your username and password. In practice, they can't actually do anything by themselves—they are just a set of strings that can only be seen by the website that set them. It's the website rather than the cookie that then processes the information they refer to.
Incidentally, you can check which websites have set cookies for you in Opera by going to Preferences → Advanced → Cookies → Manage cookies. From there you can edit or delete them individually.
Cookie-sharing can sound like a threat to our privacy but in this case it doesn't mean sharing information with third party websites—it means sharing things like user preferences between a web page and an extension. What we're going to do here is allow an extension to use cookies for websites that a user has already granted permission to.
Note that these shared cookies should not be confused with Local Shared Objects (LSO), otherwise known as Flash cookies.
It doesn't get much easier than this—although we could use XMLHttpRequest, we're simply going to have a popup window that contains an iframe, which in turn contains a mobile version of a website, in this case, Reddit. The entire code is below but if you prefer, you can download the example cookie-sharing extension here.
Note that some websites, such as mobile Facebook, don't allow embedding as iframes for security reasons. If this happens, it is reported as a network issue in Opera's error console.
We need to do two things to be able to share cookies; grant the extension access to a particular domain and enable the cookie-sharing feature. Both of these are done in the extension's config.xml
file by adding the following two lines.
<feature name="opera:share-cookies" required="false"/>
<access origin="http://reddit.com" subdomains="true"/>
The <feature>
element's required
attribute indicates whether the extension will not work if cookies are not shared. The access
element specifies a domain and the possible sub-domains that the extension can access—i.e. the domains that contain the cookies your extension needs. You may need to add more than one access
element if, for example, you also need access to an https domain. It's important to specify the domain and not use a wildcard here in order to prevent third-party cookies, which the user may not want, from being shared. For the sake of completeness, here's the whole config.xml
file for our example extension, which I'll call Reddit Quick:
<?xml version="1.0" encoding="utf-8"?>
<widget xmlns="http://www.w3.org/ns/widgets" id="http://people.opera.com/danield/redditquick" defaultlocale="en">
<name>Reddit Quick</name>
<description xml:lang="en">Check the latest Reddit stories quickly without leaving your current page.</description>
<author href="http://people.opera.com/danield/">Daniel Davis</author>
<icon src="images/icon_64.png"/>
<icon src="images/icon_18.png"/>
<feature name="opera:share-cookies" required="false"/>
<access origin="http://reddit.com" subdomains="true"/>
</widget>
Next is the all-important index.html
file. In this case, the JavaScript within this file will add a button to Opera's toolbar. For the button, we can specify an icon for it to use, a title that appears as a tooltip and a file that it can open. The file will open in a popup window so we should also set how large the popup will be. A height of up to 480 pixels seems to be a safe value for smaller screens such as those on netbooks. Here's the index.html
file in full:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>Reddit Quick (background)</title>
</head>
<body>
<script>
(function() {
// Define some properties for the button
var buttonprops = {
icon: 'images/icon_18.png',
title: 'Reddit Quick',
popup: {
href: 'popup.html',
width: 400,
height: 480
}
};
// Create the button
var button = opera.contexts.toolbar.createItem(buttonprops);
// Add the button to the browser's toolbar
opera.contexts.toolbar.addItem(button);
})();
</script>
</body>
</html>
The final piece of the puzzle is the popup itself. As mentioned earlier this simply contains an iframe so no JavaScript is needed, although I am going to use a bit of CSS to ensure we use the available space as productively as possible.
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>Reddit Quick (popup)</title>
<style>
body {
margin:0;
overflow:hidden;
padding:0;
}
iframe {
border:none;
}
</style>
</head>
<body>
<iframe src="http://www.reddit.com/.compact" width="100%" height="474"></iframe>
</body>
</html>
And there we have it! The result is a popup that shows a mobile version of Reddit. Although that alone is nothing new, the extension does add value for the users. If the user is already logged in to Reddit they now don't have to log in again to the new instance within the popup. Of course, the same cookie-sharing convenience is also possible with Speed Dial extensions using XMLHttpRequest, so you could create an extension that shows users the current number of unread stories or messages for a particular website from the comfort of their Opera Speed Dial. An example of this is the Reddit on Speed Dial extension. There are various possibilities for this easy-to-use feature so we look forward to seeing what you create over at the Opera extensions repository.


futureMAG
The Future of Storytelling — Told by AI.
futureMAG is an NLP project which uses OpenAI's GPT-2 model (345M parameter version) to generate synthetic yet somewhat believable articles for a publication on medium.com. These articles are then cleaned up and automatically published using a python script and Medium.com's publishing api.
Details
This project was designed to be a sort of experiment in what magazines of the future would look like. Essentially, I wanted articles about the future and technology to be written and published by that "futuristic technology."
The project had 4 main steps:
- Scrape articles from tech/futuristic publications (namely OneZero and Futura) and clean them up until we have a decent dataset to finetune the language model. (Details under Dataset Generation.)
- Finetune the language model being careful not to overfit it. (I used the gpt-2-simple library for training.)
- Generate articles using the finetuned model. (Details under Article Generation.)
- Create a short program that cleans up the generated text and retrieves images from unsplash.com to serve as the hero images for the article. Then use Medium.com's web api to publish the article to the futureMAG publication.
Dataset Generation
I ran into a few issues while trying to generate a dataset:
- Medium loads articles on its webpages with javascript, so there was no simple way to retrieve all the articles under a publication using something like BeautifulSoup.
- I had to find some way to clean them up in a way that allowed the neural net to learn an accurate representation of the style, while also trying to minimize clean up work later.
In order to generate a list of articles, I used Selenium and Chrome driver. Essentially I opened the "latest" page of the publication with selenium, then told it to scroll to the end of the page so medium would load more articles. Once no more articles were being loaded, I retrieved the urls and compiled them into a file.
At first, I used BeautifulSoup to download the articles, however this method only retrieved the raw text from the article. In order to minimize post processing, I realized I could train the GPT-2 model on a markdown representation of the articles, with the goal of having the model generate most of the formatting (and minimizing post-processing later). In order to do that, I modified a version of the mediumexporter library, which was written in javascript and retrieved the articles then converted them to a markdown format.
Article Generation
The biggest issue I had with GPT-2 is that it was designed to generate texts only 1028 tokens long, which on average is about a paragraph (but I needed whole articles). In order to work around this, I modified minimaxir's generation script to feed half of the previously generated text as context for the next generation. This allowed me to chain together generations from the language model until it arrived at a full length article. The main issue with this method is that the context from two generations is lost (since we are only passing in context from the most recent generation), which can sometimes lead to the network changing attention quickly and writing about a completely different topic halfway through the article. But when it works, it works lol.
If you want to check out the code, click the github link below, or click the button to go to futureMAG!
sirmammingtonham/futureMAG


Lecture 4 by Nikolai Gad
München, 25. November 2020
A way to extend the functionality of R.
Contains additional functions, data, and more.
Common distribution channels:
Grimmer, J., & Stewart, B. M. (2013). Text as Data: The Promise and Pitfalls of Automatic Content Analysis Methods for Political Texts. Political Analysis, 21(3), 267–297.
Goal is to quantify text so we can do calculations on it.
This necessarily involves reducing complexity.
We discard the word order in each text completely and only look at which words are used and how often in each text.
We also call this tokenising.
Improve unigrams by using bigrams, trigrams, or n-grams.
More advanced text analysis methods exist, but we will not cover that in this class.
The result of this is a
Also known as a document-feature-matrix
Additional preprossing:
| Scale | ||
|---|---|---|
| Categorical | Continuous (scaling) | |
| Supervised | Classification (known categories) | Scaling (known scale) |
| Unsupervised | Clustering (unkown categories) | Exploring dimensions (unknown scale) |
Goal: Either categorise individual documents or assess overall distribution of documents in each category.
Validation, relatively straight forward.
Clustering data - unsupervised methods
Challenge to choose number of clusters.
And challenge to validate clusters:
Continuous (nummeric) response variable.
Goal should be to score actors (or objects) on a political dimension that is useful to our analysis.
So the goal is not to prefectly model the text.
General challenge is an asssumption about ideological dominance.
Four principles of automated text analysis:
Do you agree with these principles?
Tomorrow's exercise will introduce the stringR package
Help us with very basic string manipulation.
Standardised functions for a lot of the procedures talked about today.
Good to know basics: