| German Shorthaired Pointer Picture |
| Breed Information |
| Popularity |
2017: #102016: #112015: #11 |
| Name |
German Shorthaired Pointer |
| Other names |
GSP, DK, Kurzhaar, Deutscher Kurzhaariger Vorstehhund, Deutsch Kurzhaar |
| Origin |
Germany |
| Breed Group |
Working (AKC:1930)Gun Dog (UKC) |
| Size |
Medium to Large |
| Type |
Purebred |
| Life span |
12-14 years |
| Temperament |
AffectionateBoisterousBoldCooperativeIntelligentTrainable |
| Height |
Male: 23-25 inches (59-64 cm)Female: 21-23 inches (53-58 cm) |
| Weight |
Male: 55-70 pounds (25-32 kg)Female: 45-60 pounds (20-27 kg) |
| Colors |
BlackBlack & WhiteBlack RoanLiverLiver & WhiteLiver RoanWhiteWhite & Liver |
| Litter Size |
7-12 puppies |
| Puppy Price |
Average $600 - $800 USD |
|
|
| Breed Characteristics |
| Adaptability |
4 stars |
| Apartment Friendly |
1 starsThis breed is not recommended for apartment life and does best with a large yard and an active, athletic family. It may be able to jump any fence that is lower than 6 feet tall. Under exercised, bored GSPs are great escape artists. |
| Barking Tendencies |
3 starsOccassional |
| Cat Friendly |
1 starsIn the field, he’s an aggressive hunter, a trait that can carry over into the home if cats, squirrels or birds stray into his territory. |
| Child Friendly |
4 starsGood with Kids: This is a suitable breed for kids and is known to be playful, energetic, and affectionate around them. |
| Dog Friendly |
4 stars |
| Exercise Needs |
5 starsExercise is of paramount importance for these tireless, energetic animals. They are more than a match for even the most active family and they should not be taken on as family pets unless they can be guaranteed plenty of vigorous exercise. They need to be taken on a daily, brisk, long walk, jog or run alongside you when you bicycle. If under-exercised, this breed can become restless and destructive. |
| Grooming |
1 starsLow Maintenance: The German Shorthair’s water-repellent coat has thick, short hair that protects the dog from brush and helps insulate him from the cold. The coat itself is easy to care for — brush it weekly with a rubber hound mitt or firm bristle brush to keep the hair and skin healthy — but the breed has a couple of grooming quirks you should be aware of. |
| Health Issues |
4 starsHypoallergenic: No |
| Intelligence |
5 starsRanking: #17. (See All Rankings) |
| Playfulness |
5 stars |
| Shedding Level |
3 starsModerate Shedding: Routine brushing will help. Be prepared to vacuum often! |
| Stranger Friendly |
3 stars |
| Trainability |
5 starsEasy Training: The German Shorthaired Pointer is intelligent and has a well-deserved reputation of being highly trainable. German Shorthaired Pointers adapt easily to a wide variety of hunting and field jobs including pointing and retrieving on land and water. |
| Watchdog Ability |
3 stars |
|
|


{% extends "newsletter/common.html" %} {% load i18n %} {% block title %} {% trans "Newsletter" %} {{ newsletter.title }} {{ action }} {% trans "activate" %} {% endblock title %} {% block body %} {{ newsletter.title }} Newsletter Activation Your subscription has successfully been activated. Thanks {% endblock body %}
Your subscription has successfully been activated. Thanks


Fees are payable by Cash, Check, Money Order, MasterCard, Visa, American Express or Discover. Go online to www.massrmv.com for additional payment
options. If paying by check, make payable to “MassDOT.” PLEASE FILL OUT FORM CLEARLY IN BLACK OR BLUE INK
IDENTIFICATION REQUIREMENTS |
For most transactions, including license conversions, applicants over the age of 18 must present three forms of ID which include:
• Proof of date of birth • Proof of signature • Proof of Massachusetts residency Applicants under 18 years of age must only provide proof of date of birth. The parent/guardian must sign the certification on the back of this application.
|
You must also produce your social security number (SSN) that the RMV can verify with the U.S. Social Security Administration (SSA) as having been issued to you.
If you do not have an SSN, an acceptable written denial notice not more than 60 days old, from the Social Security Administration (SSA) is required. You must also provide proof of an acceptable visa status, an I-94, and a current non-U.S. Passport.
|
|
Please see the Driver’s Manual for the identification requirements you must satisfy to obtain a license or ID card and the list of
*Acceptable Forms of Identification* that may satisfy those requirements.
The list is also on our website at www.massrmv.com.
|
| MA Assigned License/ID/Permit Number |
License Class |
Social Security Number |
|
|
|
GENERAL INFORMATION |
| Last Name |
First Name |
Middle Name |
Date of Birth |
Sex |
Height |
|
|
|
Month Day Year |
M
F
|
Feet Inches |
| |
|
Mailing Address
(Where you want us to send your Driver’s License/ID card and future notices from the RMV).
U.S. Post Office MAY NOT deliver if your name is NOT on the mailbox.
|
City/State
|
Zip Code
|
Residential Address (Where you actually reside)
Same as above
|
City/State
|
Zip Code
|
REQUIRED INFORMATION
Questions 1-4 to be completed by all applicants. Questions 5-8 to be completed by License/Permit applicants
|
-
Do you want to be, or continue to be, registered as an
organ & tissue donor?
If yes, the RMV will provide this information to federally-designated organ procurement organizations serving the Commonwealth, and will print this designation on your driver’s license/ID card.
Yes
No
-
Are you an active duty member of the U.S. Armed Forces?
Yes
No
-
If you are a veteran of the U.S. Armed Forces, do you want the word “VETERAN” printed on your license/ID? If you are not a veteran, check “No.”
NOTE: If yes, proof of honorable discharge must be presented.
Yes
No
-
Are you currently licensed to drive in any state, country, or jurisdiction? If yes,
where?
class/type?
Yes
No
|
-
In the past 10 years, have you held any class of driver’s license in any other state, country, or jurisdiction?
If yes, where?
Class of License
License #
(inform RMV of previous names) (use additional paper if you need more space)
Yes
No
-
Is your license or RIGHT to operate suspended, revoked, canceled, withdrawn, or disqualified here or in another state, country, or jurisdiction?
If yes, where?
Exp. Date
If yes, why?
Note: If you answered yes, additional documentation may be required.
Yes
No
-
Do you have a cognitive, neurologic, physical, or any other impairment that may affect your functional ability to operate a motor vehicle safely?
(The Commonwealth’s medical standards for safe operation of a motor vehicle are found at http://www.massrmv.com/rmv/medical/policies.htm.)
Yes
No
-
Are you currently taking any medication that may affect your ability to safely operate a motor vehicle?
Note: If you answered yes to questions 7, or 8, an RMV Service Center Representative must contact Medical Affairs.
Yes
No
|
OUT-OF-STATE LICENSE/PERMIT CONVERSION to be completed by applicants converting an out-of-state license or permit |
License/Permit Number
|
State
|
License/Permit Class
D
M
D/M
|
Expiration Date (month/day/year)
|
Issue Date (month/day/year)
|
|
Your out-of-state license/permit must be surrendered to the RMV.
|
RMV USE ONLY:
Date:
Initial:
CDL Downgrade: I understand that my CDL will be downgraded to a Class D, M, or D/M license and I authorize the RMV to process this transaction.
Customer Signature:
|
|
CHANGE OF INFORMATION If you change your address, you must notify the RMV within 30 days. |
|
Check here if your name has changed. Please print your new name in the General Information section and your previous name below.
|
Last Name |
First Name
|
Middle Name |
|
Check here if the address in the General Information section reflects a change of Mailing Address
|
|
Check here if the address in the General Information section reflects a change of Residential Address
|
Check here if your gender designation has changed. Note: Additional documentation will be required.
Change gender designation to:
Male
Female
|
Other
|
f
Check here if your height has changed.
Current height is ft. in.
|
PARENTAL CONSENT FOR MINOR; INFORMATION & CERTIFICATION OF PERSON PROVIDING CONSENT |
|
This section must be completed by a parent of the applicant, the legal guardian, the Massachusetts Child Guardian Division, or the Headmaster of the Boarding School the applicant is attending.
|
|
To the Registrar: I hereby certify I am: (check one)
Parent
legal guardian
Massachusetts Child Guardian Division
boarding school headmaster
|
of the above-named applicant who is less than 18 years of age, but not less than 16 years of age, if applying for a Learner’s Permit or Driver’s License OR who is less than 18 years of age, but not less than 14 years of age, if applying for an ID card, and that my consent is given as required by M.G.L. Chap. 90, Section 8 for the issuance of a Driver’s License; or as required by M.G.L. Chap. 90, Section 8B for a Learner’s Permit; or by M.G.L. Chap. 90, Section 8E for an Identification Card (ID).
False certification is punishable by fine, imprisonment, or both (M.G.L. Chap. 90, Section 24).
|
|
Parent/Guardian’s Address:
|
|
Parent/Guardian’s Signature:
|
Printed Name:
|
|
If the person giving consent IS NOT a parent, proper documentation of authority must be shown.
|
VOTER REGISTRATION to be completed by all applicants
|
|
To vote in Massachusetts you must be: A U.S. CITIZEN, a resident of Massachusetts and at least 18 years old on or before the next election in your city or town, which could be a town meeting, city or town preliminary, city or town election, state primary, state election, special state primary, special state election, or special city or town election.
|
-
Do you want to register to vote?
Yes
No
|
•Check “Yes” if you want to register to vote, or you are changing your name or address and want to be registered to vote with this new information.
•Check “No” if you are currently registered to vote and do not want to change your voter registration
If you answered “yes,” complete question #2 and read the Affirmation Section below.
|
-
Are you a citizen of the United States of America?
Yes
No
NOTE: If you answered “no” to this question, do not complete question #3. You are not eligible to register to vote at this time.
|
-
Please indicate party enrollment or political designation (check one).
|
Democratic
Republican
Libertarian
No Party (unenrolled)
Political Designation (not a political party):
PLEASE ASK THE LICENSE CLERK FOR YOUR VOTER REGISTRATION RECEIPT
AFFIRMATION TO BE READ BY APPLICANTS REGISTERING TO VOTE
I hereby swear (affirm) that I am the person named above, that the above information is true,
that I AM A CITIZEN OF THE UNITED STATES that I am at least 16 years old and I understand that I must be 18 years old to be eligible to vote, that I am not a person under a guardianship which prohibits my registering to vote, that I am not temporarily or permanently disqualified by law from voting because of corrupt practices in respect to elections, that I am not currently incarcerated for a felony conviction, and that I consider this residence to be my home. Signed under the penalty of perjury.
Confidentiality of voter registration information: If you register to vote, the office at which you submit your application will remain confidential and will be used only for voter registration purposes. If you decline to register to vote, the fact that you declined to register will remain confidential and will be used only for voter registration purposes.
Penalty for illegal voter registration: Fine of not more than $10,000 or imprisonment for not more than five years or both (M.G.L., Chap. 56 , Section 8).
|
SIGNATURE OF APPLICANT (application not complete without signature)
Note: This application will be processed through the National Driver Register (NDR) and the Commercial Driver License Information System (CDLIS) to verify the status of operating privileges in other jurisdictions and the social security number will be verified with the Social Security Administration.
have reviewed this completed Application Form including the Voter Registration Section and hereby apply for a Learner’s Permit/Driver’s License or an ID card and swear (affirm), under the penalties of perjury, that the information I have provided is true and complete.
False statements are punishable by fine, imprisonment, or both (M.G.L. c 90 §24).
Signature:
Date:
The Registrar reserves the right to cancel, revoke, or recall, any permit, license, or ID card if it is determined that the applicant was not qualified for such permit, license, or ID card.
|
|
Turning 21? Renew on or after your 21st birthday to receive a standard horizontal license.
|
OFFICIAL NOTICE:
Massachusetts law requires persons convicted of a sex offense to register with their local police departments. For information, call 1-800-93MEGAN.
|
|
FOR CUSTOMER SERVICE:
Call our Contact Center at<PHONE_NUMBER> • Weekdays 9 a.m.- 5 p.m.
|
|
Please visit our website for more information at:
www.massrmv.com
|


--- layout: post title: "A slightly more advanced quickfix" date: 2014-11-24 23:25:00 -0500 comments: false ---
In part one of three, I covered the basics of making a quickfix pattern for a bug -
starting with parsing the Abstract Syntax Tree (AST) and ending with creating a new ASTNode
to replace the broken code.
In part two, this tutorial, we will be tackling a slightly more complicated bug that needs resolving:
Randoms are not super secure.
In cases where they need to be less guessable, it is better to either use a SecureRandom (at the cost of speed), or simply initialize a Random with a long from SecureRandom (mitigates time-based attacks and faster, but still not super secure).
The user will have to decide which one of the two suggested fixes applies, so we need to give them a choice. This tutorial will show how to offer two quickfixes as well as customizing the descriptions to give more information.
If you've already done the first part, you should have an Eclipse project
setup already.
Otherwise, download this preconfigured Eclipse workspace and then install the dev version of FindBugs from
here.
If you want to do this in hard mode, follow the dev setup instructions for fb-contrib quickfixes - it will amount to basically the same thing.
Just like last time, we'll start by modifying the plugin.xml file. The main difference you will notice is that we register two fixes for the same resolution. This will make both fix options pop up on the list of resolutions.
To make two separate fixes, we'll need to override setOptions()
to distinguish between them and then code in the separate fixes.
TypeBinding
s for the visitor implementation below.
This method handles the parsing of any arguments you pass in.
The arguments will be parsed as comma-separated, if you need more than one.
And we simply use the parsed argument from above to determine the fix to apply.
This call is from the FindBugs plugin.eclipse.quickfix.util.ASTUtil class
and will add, if it doesn't already exist, a reference to SecureRandom.
This is a simple way to create a constructor invocation of SecureRandom.
One downside is that it won't deal with imports, potentially leaving a compilation error.
Line 31 corrects this oversight.
Makes a call to new Random()
Chains a newly created SecureRandom to a call of nextLong:
new SecureRandom().
nextLong()
Takes the output of the long generated from the SecureRandom
and uses that to initialize the Random
object we made in 42-44.
The only tricky part to this so far is the creation of the new ASTNodes. Remember that ClassInstanceCreations are when a constructor is called (i.e. a class instance is made). Do not be tempted by the (more logically named) ConstructorInvocation.
This visitor is very straight forward because we only have to look for when a Random is created.
The last piece is supplying custom descriptions, which simply involves overriding the aptly named getDescriptions method.


简洁、直观、强悍、移动设备优先的前端开发框架，让web开发更迅速、简单。
Need reasons to love Bootstrap? Look no further.
Built at Twitter by @mdo and @fat, Bootstrap utilizes LESS CSS, is compiled via Node, and is managed through GitHub to help nerds do awesome stuff on the web.
Bootstrap was made to not only look and behave great in the latest desktop browsers (as well as IE7!), but in tablet and smartphone browsers via responsive CSS as well.

Bootstrap 设计工具推荐


Johnny Buc Lockwood, or Coach Johnny, is dedicated to helping people and especially young people reach their goals.
Having lived a diverse life while pursuing a variety of academic, athletic, creative and entrepreneurial challenges for the past four decades, Johnny brings a no-nonsense approach to his coaching. Johnny has learned the value and importance of pursuing his dreams, setting goals, understanding and overcoming obstacles, while maintaining vision and direction.
As a former troubled teen, Coach Johnny was assisted by a life coach and mentor who guided him from failing out of high school to achieving academic, athletic and personal success. Accepted at Andover after turning his wayward teen life around, Johnny was recruited to play varsity hockey and baseball at The University of Vermont, where he graduated with a BA in English. A few years later he became a Research Fellow at The Institute of Politics at Harvard.
Feeling restless with academia, Johnny ventured off to NYC to pursue his passions where he started a band and established a Wall Street-based wealth management business. He succeeded in both endeavours. His band signed a record contract and played in venues around the country, while his wealth management business attracted and worked with Forbes 400 clients.
The past few years, Coach Johnny has been dedicated to expanding the impact of The 42 Initiative, a 501c3 non profit that he co founded with John Branca. The mission of The 42 Initiative is to bring together young students from all ethnic and economic backgrounds to participate together in Club 42 sports, esports, music and dance programs.
References:
Sophomore Backs 'Cold War' at UVM
Branca '21 Works to Incorperate Equity in Esports
Meet Erin Jones Wesley of Club 42 LA in Inglewood
Let the Games Begin
Inglewood celebrates the return of Little League baseball City partners with Club 42LA and The Estate of Michael Jackson
Recently Coach Johnny has been focusing on his work as the co-owner of Tuscan Dream, one of the leading Tuscany holiday rental specialists in Italy. Tuscan Dream commits to providing travelers from all over the world with the best and most magnificent Tuscany holiday homes and castles to enjoy the unique splendor of Tuscany's phenomenal land
The past few years, Coach Johnny has been dedicated to expanding his charity, Club 42. The 42 Initiative, is a dynamic community based in Los Angeles, CA where youth from all corners are cultivated and supported on diverse pathways to success through sports, music, dance and esports programs. The 42 Initiative supports youth education through tuition awards, tutoring support, STEM classes and other academic opportunities.
"Real riches come from the ability to be at ease alone."
"Society deserves itself."
"Dysfunctional people are like an out of focus selfie...Their character is unrecognizable."
"God is harmony and harmony is God...in all its earthly manifestations."
"If in life you don’t stand up for something, then life will for sure stand down on you."
"Success is not what you think it is, but rather what you feel it is."
"The pain we endure is to pay for the pleasures come before, and pleasures yet to come, our
heartaches pay for some."
"Happiness is the ideal blend of wanting what you have and not having to have what you want."
"Strive to be someone who serves self and society at the same time."
"Free will means we have a choice, and every choice has a consequence."
"Without emotional composure, there can be no wisdom."
"Silence is the oxygen of creation."


BMW i4 Performance Specs Officially Confirmed
And Tesla should be worried.
by Martin BiggLast week, reports claimed to reveal some juicy new details about the BMW i4, but now the German automaker has officially announced the performance specifications of the upcoming electric sedan. BMW claims the i4 "heralds a new era of driving pleasure," combining the driving dynamics, sporty and elegant styling, premium quality, and comfort of a four-door Gran Coupe with emissions-free mobility.
BMW's Tesla Model 3 rival will utilize BMW's fifth-generation eDrive technology, which will debut in the BMW iX3 in 2020, followed by the BMW iNext and BMW i4. According to BMW, the i4 "sets new standards in sporty performance."
The electric motor developed for the BMW i4 produces a maximum output of around 530 hp, which is comparable to the output of a V8 engine in current BMW models fitted with a combustion engine to deliver impressive performance. With this setup, 0-62 mph takes around 4.0 seconds before the BMW i4 reaches a top speed of over 124 mph.
BMW's fifth-generation eDrive technology also includes a newly designed, low-mounted high-voltage battery featuring the latest battery cell technology, an extremely flat design, and optimized energy density. Weighing around 550 kilograms, the battery pack has a capacity of around 80 kWh, resulting in a driving range of approximately 373 miles.
You Might Also Like
This is likely based on Europe's WLTP cycle, which means the range will be closer to 340-350 miles in the US. The high-voltage battery of the BMW i4 can be charged to around 80 percent in around 35 minutes. As a result, it takes around six minutes to charge the i4 up to deliver a range of 62 miles.
In terms of the design, the i4 will essentially be an electric version of the current 4 Series Gran Coupe, combining the proportions of a 4-door coupe with the typical design features of a BMW i model, with dynamically stretched lines and an aerodynamically optimized exterior. Production of the BMW i4 will start in 2021 at the company's main plant in Munich, where other models such as the BMW 3 Series Sedan, BMW 4 Series Coupe, and BMW M4 Coupe are produced.


2.3. FINITE AUTOMATA
i
1
3
2
f
2
1
a-z
a-z
0-9
2
1
0-9
0-9
IF
ID
NUM
0-9
0-9
0-9
5
1
3
4
0-9
2
.
.
0-9
\n
5
1
blank, etc.
2
a-z
3
4
blank, etc.
-
-
any but
\n
1
2
REAL
white space
error
FIGURE 2.3.
Finite automata for lexical tokens. The states are indicated by
circles; ﬁnal states are indicated by double circles. The start
state has an arrow coming in from nowhere. An edge labeled
with several characters is shorthand for many parallel edges.
sion that can match determines its token type. This means that the order of
writing down the regular-expression rules has signiﬁcance.
Thus,
if8
matches as an identiﬁer by the longest-match rule, and
if
matches
as a reserved word by rule-priority.
2.3
FINITE AUTOMATA
Regular expressions are convenient for specifying lexical tokens, but we need
a formalism that can be implemented as a computer program. For this we can
use ﬁnite automata (N.B. the singular of automata is automaton). A ﬁnite
automaton has a ﬁnite set of
states
;
edges
lead from one state to another, and
each edge is labeled with a
symbol
. One state is the
start
state, and certain of
the states are distinguished as
ﬁnal
states.
Figure 2.3
shows some ﬁnite automata. We number the states just for con-
venience in discussion. The start state is numbered 1 in each case. An edge
labeled with several characters is shorthand for many parallel edges; so in
the
ID
machine there are really 26 edges each leading from state 1 to 2, each
labeled by a different letter.
21


SMSMyBus exposes its data via a programming interface. This page describes that interface.
Overview
The getservicebulletins method will return all active service bulletins in the Metro system.
This may include route detours, shelter construction, cancelations, delays, etc.
URL
https://api.smsmybus.com/v1/getservicebulletins
Fields
TBD
Examples
Response
TBD
Error
TBD


Register
Please fill in this form to create an account.
Email
Password
Register
Log in
Please fill in this form to log in your account
Email
Password
Log In
Log Out


Journey of Linux
Presented by
Random (Jamal)
Linux!
Everywhere is Linux
Who use Linux
facebook
twitter
google
amazon
Initial step
Kernel
disto
basic commands
kernel
3 Major distro family
Fedora
Debian
Opensuse
Thank You
https://code4mk.org/linux4you


| Regulation of host protein expression |
A238L |
Nonessential |
Inhibits NF-κ B and NFAT activation |
[
51]
|
|
NL
(DP71L)
|
Nonessential |
Inhibition of activation of peIF2α-ATF4-CHOP signaling pathway and its mediated apoptosis |
[
52,
53]
|
| Interference with innate immune system |
MGF360,MGF505/530
|
Nonessential |
Inhibition of transcription of type I IFN and other cytokines
Increased survival of infected cells
|
[
54,
55,
56,
57]
|
| I329L |
Nonessential |
Inhibits TLR signaling
Inhibiting NF-κ B and IRF3 signaling pathways
|
[
50,
58,
59]
|
| Regulation of apoptosis/autophagy |
A179L |
Nonessential |
A member of the Bcl-2 family
Inhibition of apoptosis in the early stage of infection
Inhibition of cell autophagy
|
[
60,
61]
|
| 4CL (A224L) |
Nonessential |
Inhibition of TNF-alpha-induced caspase 3 activation and apoptosis |
[
54]
|
| EP153R |
Nonessential |
C-type lectin, participate in the process of blood cell adsorption
Regulating apoptosis and inhibiting MHC-1 expression
|
[
62,
63,
64]
|
| P54 (E183L) |
Nonessential |
Participate in viral particle assembly and viral adhesion to host cells
Induce apoptosis in the late stage of infection
|
[
65,
66]
|
| Others |
CD2v
(EP402R)
|
Nonessential |
Mediate erythrocyte adsorption and promote virus transmission
Interacts with cellular AP-1 protein and participates in intracellular transport of virus
Inhibition of lymphocyte proliferation
|
[
58,
67,
68,
69]
|
| L83L |
Nonessential |
Binding host protein IL-1beta to inhibit its antiviral effect |
[
70]
|
|
UK
(DP96R)
|
Nonessential |
Negative regulation of type I IFN expression and NF-κ B signaling by inhibition of TBK1 and IKKβ |
[
71,
72]
|
|
9GL
(B119L)
|
Nonessential |
Influencing virion maturation and viral growth in macrophages and viral virulence in swine |
[
56,
71,
73,
74,
75]
|
|
TK
(A240L)
|
Essential |
Determines virulence |
[
76]
|
|
DP148R
|
Nonessential |
The function is elusive yet.
Deletion of DP148R greatly reduces viral virulence
|
[
77,
78]
|


|
libevent
|
#include <event2/visibility.h>
#include <event2/event-config.h>
#include <stdarg.h>
#include <sys/socket.h>
#include <time.h>
Go to the source code of this file.
Data Structures | |
| struct | evutil_addrinfo |
| A definition of struct addrinfo for systems that lack it. More... | |
| struct | evutil_monotonic_timer |
| Structure to hold information about a monotonic timer. More... | |
Macros | |
| #define | EV_MONOT_FALLBACK 2 |
| #define | EV_MONOT_PRECISE 1 |
| #define | ev_socklen_t socklen_t |
| #define | EVUTIL_CLOSESOCKET(s) evutil_closesocket(s) |
| #define | evutil_offsetof(type, field) ((off_t)(&((type *)0)->field)) |
| Replacement for offsetof on platforms that don't define it. | |
| #define | evutil_socket_t int |
| A type wide enough to hold the output of "socket()" or "accept()". More... | |
| #define | evutil_timercmp(tvp, uvp, cmp) |
| Return true iff the tvp is related to uvp according to the relational operator cmp. More... | |
| #define | evutil_timerisset(tvp) ((tvp)->tv_sec || (tvp)->tv_usec) |
Standard integer types. | |
Integer type definitions for types that are supposed to be defined in the C99-specified stdint.h. Shamefully, some platforms do not include stdint.h, so we need to replace it. (If you are on a platform like this, your C headers are now over 10 years out of date. You should bug them to do something about this.) We define:
| |
| #define | ev_int16_t ... |
| #define | ev_int32_t ... |
| #define | ev_int64_t ... |
| #define | ev_int8_t ... |
| #define | ev_intptr_t ev_int32_t |
| #define | ev_off_t ... |
| #define | ev_ssize_t ssize_t |
| #define | ev_uint16_t ... |
| #define | ev_uint32_t ... |
| #define | ev_uint64_t ... |
| #define | ev_uint8_t ... |
| #define | ev_uintptr_t ev_uint32_t |
Limits for integer types | |
These macros hold the largest or smallest values possible for the ev_[u]int*_t types. | |
| #define | EV_INT16_MAX ((ev_int16_t) 0x7fffL) |
| #define | EV_INT16_MIN ((-EV_INT16_MAX) - 1) |
| #define | EV_INT32_MAX ((ev_int32_t) 0x7fffffffL) |
| #define | EV_INT32_MIN ((-EV_INT32_MAX) - 1) |
| #define | EV_INT64_MAX ((((ev_int64_t) 0x7fffffffL) << 32) | 0xffffffffL) |
| #define | EV_INT64_MIN ((-EV_INT64_MAX) - 1) |
| #define | EV_INT8_MAX 127 |
| #define | EV_INT8_MIN ((-EV_INT8_MAX) - 1) |
| #define | EV_UINT16_MAX ((ev_uint16_t)0xffffUL) |
| #define | EV_UINT32_MAX ((ev_uint32_t)0xffffffffUL) |
| #define | EV_UINT64_MAX ((((ev_uint64_t)0xffffffffUL) << 32) | 0xffffffffUL) |
| #define | EV_UINT8_MAX 255 |
Limits for SIZE_T and SSIZE_T | |
| #define | EV_SIZE_MAX ... |
| #define | EV_SSIZE_MAX ... |
| #define | EV_SSIZE_MIN ((-EV_SSIZE_MAX) - 1) |
Socket error functions | |
These functions are needed for making programs compatible between Windows and Unix-like platforms. You see, Winsock handles socket errors differently from the rest of the world. Elsewhere, a socket error is like any other error and is stored in errno. But winsock functions require you to retrieve the error with a special function, and don't let you use strerror for the error codes. And handling EWOULDBLOCK is ... different. | |
| #define | EVUTIL_INVALID_SOCKET -1 |
| #define | EVUTIL_SET_SOCKET_ERROR(errcode) ... |
| Replace the most recent socket error with errcode. | |
| #define | EVUTIL_SOCKET_ERROR() ... |
| Return the most recent socket error. More... | |
| #define | evutil_socket_error_to_string(errcode) ... |
| Convert a socket error to a string. | |
| #define | evutil_socket_geterror(sock) ... |
| Return the most recent socket error to occur on sock. | |
Manipulation macros for struct timeval. | |
!_WIN32 We define replacements for timeradd, timersub, timerclear, timercmp, and timerisset. | |
| #define | evutil_timeradd(tvp, uvp, vvp) |
| #define | evutil_timerclear(tvp) (tvp)->tv_sec = (tvp)->tv_usec = 0 |
| #define | evutil_timersub(tvp, uvp, vvp) |
evutil_getaddrinfo() error codes | |
These values are possible error codes for evutil_getaddrinfo() and related functions. | |
| #define | EVUTIL_AI_ADDRCONFIG 0x40000 |
| #define | EVUTIL_AI_ALL 0x20000 |
| #define | EVUTIL_AI_CANONNAME 0x2000 |
| #define | EVUTIL_AI_NUMERICHOST 0x4000 |
| #define | EVUTIL_AI_NUMERICSERV 0x8000 |
| #define | EVUTIL_AI_PASSIVE 0x1000 |
| #define | EVUTIL_AI_V4MAPPED 0x10000 |
| #define | EVUTIL_EAI_ADDRFAMILY -901 |
| #define | EVUTIL_EAI_AGAIN -902 |
| #define | EVUTIL_EAI_BADFLAGS -903 |
| #define | EVUTIL_EAI_CANCEL -90001 |
| #define | EVUTIL_EAI_FAIL -904 |
| #define | EVUTIL_EAI_FAMILY -905 |
| #define | EVUTIL_EAI_MEMORY -906 |
| #define | EVUTIL_EAI_NODATA -907 |
| #define | EVUTIL_EAI_NONAME -908 |
| #define | EVUTIL_EAI_SERVICE -909 |
| #define | EVUTIL_EAI_SOCKTYPE -910 |
| #define | EVUTIL_EAI_SYSTEM -911 |
Functions | |
| EVENT2_EXPORT_SYMBOL int | evutil_ascii_strcasecmp (const char *str1, const char *str2) |
| As strcasecmp, but always compares the characters in locale-independent ASCII. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_ascii_strncasecmp (const char *str1, const char *str2, size_t n) |
| As strncasecmp, but always compares the characters in locale-independent ASCII. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_closesocket (evutil_socket_t sock) |
| Do the platform-specific call needed to close a socket returned from socket() or accept(). More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_configure_monotonic_time (struct evutil_monotonic_timer *timer, int flags) |
| Set up a struct evutil_monotonic_timer; flags can include EV_MONOT_PRECISE and EV_MONOT_FALLBACK. | |
| EVENT2_EXPORT_SYMBOL int | evutil_date_rfc1123 (char *date, const size_t datelen, const struct tm *tm) |
| Format a date string using RFC 1123 format (used in HTTP). More... | |
| EVENT2_EXPORT_SYMBOL void | evutil_freeaddrinfo (struct evutil_addrinfo *ai) |
| Release storage allocated by evutil_getaddrinfo or evdns_getaddrinfo. | |
| const EVENT2_EXPORT_SYMBOL char * | evutil_gai_strerror (int err) |
| EVENT2_EXPORT_SYMBOL int | evutil_getaddrinfo (const char *nodename, const char *servname, const struct evutil_addrinfo *hints_in, struct evutil_addrinfo **res) |
| This function clones getaddrinfo for systems that don't have it. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_gettime_monotonic (struct evutil_monotonic_timer *timer, struct timeval *tp) |
| Query the current monotonic time from a struct evutil_monotonic_timer previously configured with evutil_configure_monotonic_time(). More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_gettimeofday (struct timeval *tv, struct timezone *tz) |
| const EVENT2_EXPORT_SYMBOL char * | evutil_inet_ntop (int af, const void *src, char *dst, size_t len) |
| Replacement for inet_ntop for platforms which lack it. | |
| EVENT2_EXPORT_SYMBOL int | evutil_inet_pton (int af, const char *src, void *dst) |
| Replacement for inet_pton for platforms which lack it. | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_listen_socket_ipv6only (evutil_socket_t sock) |
| Set ipv6 only bind socket option to make listener work only in ipv6 sockets. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_listen_socket_reuseable (evutil_socket_t sock) |
| Do platform-specific operations to make a listener socket reusable. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_listen_socket_reuseable_port (evutil_socket_t sock) |
| Do platform-specific operations to make a listener port reusable. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_socket_closeonexec (evutil_socket_t sock) |
| Do platform-specific operations as needed to close a socket upon a successful execution of one of the exec*() functions. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_socket_nonblocking (evutil_socket_t sock) |
| Do platform-specific operations as needed to make a socket nonblocking. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_make_tcp_listen_socket_deferred (evutil_socket_t sock) |
| Do platform-specific operations, if possible, to make a tcp listener socket defer accept()s until there is data to read. More... | |
| EVENT2_EXPORT_SYMBOL void | evutil_monotonic_timer_free (struct evutil_monotonic_timer *timer) |
| Free a struct evutil_monotonic_timer that was allocated using evutil_monotonic_timer_new(). | |
| EVENT2_EXPORT_SYMBOL struct evutil_monotonic_timer * | evutil_monotonic_timer_new (void) |
| Allocate a new struct evutil_monotonic_timer for use with the evutil_configure_monotonic_time() and evutil_gettime_monotonic() functions. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_parse_sockaddr_port (const char *str, struct sockaddr *out, int *outlen) |
| Parse an IPv4 or IPv6 address, with optional port, from a string. More... | |
| EVENT2_EXPORT_SYMBOL void | evutil_secure_rng_add_bytes (const char *dat, size_t datlen) |
| Seed the random number generator with extra random bytes. More... | |
| EVENT2_EXPORT_SYMBOL void | evutil_secure_rng_get_bytes (void *buf, size_t n) |
| Generate n bytes of secure pseudorandom data, and store them in buf. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_secure_rng_init (void) |
| Seed the secure random number generator if needed, and return 0 on success or -1 on failure. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_secure_rng_set_urandom_device_file (char *fname) |
| Set a filename to use in place of /dev/urandom for seeding the secure PRNG. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_snprintf (char *buf, size_t buflen, const char *format,...) |
| Replacement for snprintf to get consistent behavior on platforms for which the return value of snprintf does not conform to C99. | |
| EVENT2_EXPORT_SYMBOL int | evutil_sockaddr_cmp (const struct sockaddr *sa1, const struct sockaddr *sa2, int include_port) |
| Compare two sockaddrs; return 0 if they are equal, or less than 0 if sa1 preceeds sa2, or greater than 0 if sa1 follows sa2. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_socketpair (int d, int type, int protocol, evutil_socket_t sv[2]) |
| Create two new sockets that are connected to each other. More... | |
| EVENT2_EXPORT_SYMBOL ev_int64_t | evutil_strtoll (const char *s, char **endptr, int base) |
| Parse a 64-bit value from a string. More... | |
| EVENT2_EXPORT_SYMBOL int | evutil_vsnprintf (char *buf, size_t buflen, const char *format, va_list ap) |
| Replacement for vsnprintf to get consistent behavior on platforms for which the return value of snprintf does not conform to C99. | |
Common convenience functions for cross-platform portability and related socket manipulations.
| #define EVUTIL_SOCKET_ERROR | ( | ) | ... |
Return the most recent socket error.
Not idempotent on all platforms.
| #define evutil_socket_t int |
A type wide enough to hold the output of "socket()" or "accept()".
On Windows, this is an intptr_t; elsewhere, it is an int.
| #define evutil_timeradd | ( | tvp, | |
| uvp, | |||
| vvp | |||
| ) |
| #define evutil_timercmp | ( | tvp, | |
| uvp, | |||
| cmp | |||
| ) |
Return true iff the tvp is related to uvp according to the relational operator cmp.
Recognized values for cmp are ==, <=, <, >=, and >.
| #define evutil_timersub | ( | tvp, | |
| uvp, | |||
| vvp | |||
| ) |
| EVENT2_EXPORT_SYMBOL int evutil_ascii_strcasecmp | ( | const char * | str1, |
| const char * | str2 | ||
| ) |
As strcasecmp, but always compares the characters in locale-independent ASCII.
That's useful if you're handling data in ASCII-based protocols.
| EVENT2_EXPORT_SYMBOL int evutil_ascii_strncasecmp | ( | const char * | str1, |
| const char * | str2, | ||
| size_t | n | ||
| ) |
As strncasecmp, but always compares the characters in locale-independent ASCII.
That's useful if you're handling data in ASCII-based protocols.
| EVENT2_EXPORT_SYMBOL int evutil_closesocket | ( | evutil_socket_t | sock | ) |
Do the platform-specific call needed to close a socket returned from socket() or accept().
| sock | The socket to be closed |
| EVENT2_EXPORT_SYMBOL int evutil_date_rfc1123 | ( | char * | date, |
| const size_t | datelen, | ||
| const struct tm * | tm | ||
| ) |
Format a date string using RFC 1123 format (used in HTTP).
If tm
is NULL, current system's time will be used. The number of characters written will be returned. One should check if the return value is smaller than datelen
to check if the result is truncated or not.
| EVENT2_EXPORT_SYMBOL int evutil_getaddrinfo | ( | const char * | nodename, |
| const char * | servname, | ||
| const struct evutil_addrinfo * | hints_in, | ||
| struct evutil_addrinfo ** | res | ||
| ) |
This function clones getaddrinfo for systems that don't have it.
For full details, see RFC 3493, section 6.1.
Limitations:
For a nonblocking variant, see evdns_getaddrinfo.
| EVENT2_EXPORT_SYMBOL int evutil_gettime_monotonic | ( | struct evutil_monotonic_timer * | timer, |
| struct timeval * | tp | ||
| ) |
Query the current monotonic time from a struct evutil_monotonic_timer previously configured with evutil_configure_monotonic_time().
Monotonic time is guaranteed never to run in reverse, but is not necessarily epoch- based, or relative to any other definite point. Use it to make reliable measurements of elapsed time between events even when the system time may be changed.
It is not safe to use this funtion on the same timer from multiple threads.
| EVENT2_EXPORT_SYMBOL int evutil_make_listen_socket_ipv6only | ( | evutil_socket_t | sock | ) |
Set ipv6 only bind socket option to make listener work only in ipv6 sockets.
According to RFC3493 and most Linux distributions, default value for the sockets is to work in IPv4-mapped mode. In IPv4-mapped mode, it is not possible to bind same port from different IPv4 and IPv6 handlers.
| sock | The socket to make in ipv6only working mode |
| EVENT2_EXPORT_SYMBOL int evutil_make_listen_socket_reuseable | ( | evutil_socket_t | sock | ) |
Do platform-specific operations to make a listener socket reusable.
Specifically, we want to make sure that another program will be able to bind this address right after we've closed the listener.
This differs from Windows's interpretation of "reusable", which allows multiple listeners to bind the same address at the same time.
| sock | The socket to make reusable |
| EVENT2_EXPORT_SYMBOL int evutil_make_listen_socket_reuseable_port | ( | evutil_socket_t | sock | ) |
Do platform-specific operations to make a listener port reusable.
Specifically, we want to make sure that multiple programs which also set the same socket option will be able to bind, listen at the same time.
This is a feature available only to Linux 3.9+
| sock | The socket to make reusable |
| EVENT2_EXPORT_SYMBOL int evutil_make_socket_closeonexec | ( | evutil_socket_t | sock | ) |
Do platform-specific operations as needed to close a socket upon a successful execution of one of the exec*() functions.
| sock | The socket to be closed |
| EVENT2_EXPORT_SYMBOL int evutil_make_socket_nonblocking | ( | evutil_socket_t | sock | ) |
Do platform-specific operations as needed to make a socket nonblocking.
| sock | The socket to make nonblocking |
| EVENT2_EXPORT_SYMBOL int evutil_make_tcp_listen_socket_deferred | ( | evutil_socket_t | sock | ) |
Do platform-specific operations, if possible, to make a tcp listener socket defer accept()s until there is data to read.
Not all platforms support this. You don't want to do this for every listener socket: only the ones that implement a protocol where the client transmits before the server needs to respond.
| sock | The listening socket to to make deferred |
| EVENT2_EXPORT_SYMBOL struct evutil_monotonic_timer* evutil_monotonic_timer_new | ( | void | ) |
Allocate a new struct evutil_monotonic_timer for use with the evutil_configure_monotonic_time() and evutil_gettime_monotonic() functions.
You must configure the timer with evutil_configure_monotonic_time() before using it.
| EVENT2_EXPORT_SYMBOL int evutil_parse_sockaddr_port | ( | const char * | str, |
| struct sockaddr * | out, | ||
| int * | outlen | ||
| ) |
Parse an IPv4 or IPv6 address, with optional port, from a string.
Recognized formats are:
If no port is specified, the port in the output is set to 0.
| str | The string to parse. |
| out | A struct sockaddr to hold the result. This should probably be a struct sockaddr_storage. |
| outlen | A pointer to the number of bytes that that 'out' can safely hold. Set to the number of bytes used in 'out' on success. |
| EVENT2_EXPORT_SYMBOL void evutil_secure_rng_add_bytes | ( | const char * | dat, |
| size_t | datlen | ||
| ) |
Seed the random number generator with extra random bytes.
You should almost never need to call this function; it should be sufficient to invoke evutil_secure_rng_init(), or let Libevent take care of calling evutil_secure_rng_init() on its own.
If you call this function as a replacement for the regular entropy sources, then you need to be sure that your input contains a fairly large amount of strong entropy.  Watch out!
| dat | a buffer full of a strong source of random numbers |
| datlen | the number of bytes to read from datlen |
| EVENT2_EXPORT_SYMBOL void evutil_secure_rng_get_bytes | ( | void * | buf, |
| size_t | n | ||
| ) |
Generate n bytes of secure pseudorandom data, and store them in buf.
Current versions of Libevent use an ARC4-based random number generator, seeded using the platform's entropy source (/dev/urandom on Unix-like systems; CryptGenRandom on Windows). This is not actually as secure as it should be: ARC4 is a pretty lousy cipher, and the current implementation provides only rudimentary prediction- and backtracking-resistance. Don't use this for serious cryptographic applications.
| EVENT2_EXPORT_SYMBOL int evutil_secure_rng_init | ( | void | ) |
Seed the secure random number generator if needed, and return 0 on success or -1 on failure.
It is okay to call this function more than once; it will still return 0 if the RNG has been successfully seeded and -1 if it can't be seeded.
Ordinarily you don't need to call this function from your own code; Libevent will seed the RNG itself the first time it needs good random numbers. You only need to call it if (a) you want to double-check that one of the seeding methods did succeed, or (b) you plan to drop the capability to seed (by chrooting, or dropping capabilities, or whatever), and you want to make sure that seeding happens before your program loses the ability to do it.
| EVENT2_EXPORT_SYMBOL int evutil_secure_rng_set_urandom_device_file | ( | char * | fname | ) |
Set a filename to use in place of /dev/urandom for seeding the secure PRNG.
Return 0 on success, -1 on failure.
Call this function BEFORE calling any other initialization or RNG functions.
(This string will NOT be copied internally. Do not free it while any user of the secure RNG might be running. Don't pass anything other than a real /dev/...random device file here, or you might lose security.)
This API is unstable, and might change in a future libevent version.
| EVENT2_EXPORT_SYMBOL int evutil_sockaddr_cmp | ( | const struct sockaddr * | sa1, |
| const struct sockaddr * | sa2, | ||
| int | include_port | ||
| ) |
Compare two sockaddrs; return 0 if they are equal, or less than 0 if sa1 preceeds sa2, or greater than 0 if sa1 follows sa2.
If include_port is true, consider the port as well as the address. Only implemented for AF_INET and AF_INET6 addresses. The ordering is not guaranteed to remain the same between Libevent versions.
| EVENT2_EXPORT_SYMBOL int evutil_socketpair | ( | int | d, |
| int | type, | ||
| int | protocol, | ||
| evutil_socket_t | sv[2] | ||
| ) |
Create two new sockets that are connected to each other.
On Unix, this simply calls socketpair(). On Windows, it uses the loopback network interface on <IP_ADDRESS>, and only AF_INET,SOCK_STREAM are supported.
(This may fail on some Windows hosts where firewall software has cleverly decided to keep <IP_ADDRESS> from talking to itself.)
Parameters and return values are as for socketpair()
| EVENT2_EXPORT_SYMBOL ev_int64_t evutil_strtoll | ( | const char * | s, |
| char ** | endptr, | ||
| int | base | ||
| ) |
Parse a 64-bit value from a string.
Arguments are as for strtol.


The goal of the dynamic domain (DD) track is to support research in dynamic, exploratory search of complex information domains. DD systems receive relevance feedback as they explore a space of subtopics within the collection in order to satisfy a user's information need.
In order to take part in the DD track, you need to be a registered participant of TREC. The TREC Call for Participation, at
http://trec.nist.gov/pubs/call2015.html, includes instructions on how to register. You must register before May 1, 2015 in order to participate.
The datasets and relevance judgments will be made generally available to non-participants after the TREC 2015 cycle, in February 2016. So register to participate if you want early access.
For 2015 there are three domains, each with different data:
Illicit Goods: this data is related to how illicit and counterfeit goods such as fake viagra are made, advertised, and sold on the Internet. The dataset comprises 5,000,000 million posts from underground hacking forums, arranged into threads.
Ebola: this data is related to the Ebola outbreak in Africa in 2014-2015. The dataset comprises 30 million tweets relating to the outbreak, and 500,000 web pages from sites hosted in the affected countries and designed to provide information to citizens and aid workers on the ground.
Local Politics: this data is related to regional politics in the Pacific Northwest and the small-town politicians and personalities that work it. The dataset comprises 1,000,000 web news items from the TREC 2014 KBA Stream Corpus.
Polar Sciences: this data is a set of 50,000+ crawled web pages, scientific data (HDF, NetCDF files, Grib files), zip files, PDFs, images and science code related to the polar sciences and available publicly from the NSF funded
Advanced Cooperative Artic Data and Information System (ACADIS), NASA funded
Antarctic Master Directory (AMD), and National Snow and Ice Data Center (NSIDC)
Arctic Data Explorer.
All the datasets are formatted using the streamcorpus format described at
http://streamcorpus.org. That site includes documentation and tools for working with the data. For the DD track, you will be working with the datasets as static corpora, meaning that for purposes of the task you can index and search the datasets without processing them in any particular stream order.
Within each domain, there will be 25-50 topics that represent user search needs. An example topic for the Ebola domain might be titled, "foreign aid health workers." The topics will be developed by the NIST assessors. Each topic will have a number of subtopic interests that make up the various pieces that the user wants to know. Following the above example, subtopics might include "how many foreign health workers are in Freetown" and "what clinics are primarily staffed by foreign health workers".
DD systems will receive an initial query for each topic, where the query is two to four words and additionally indicates the domain by a number 1, 2, 3 or 4. In response to that query, systems may return up to five documents to the user. The simulated user will respond by indicating which of the retrieved documents are relevant to their interests in the topic, and to which subtopic the document is relevant to. Additionally, the simulated user will identify passages from the relevant documents and assign the passages to the subtopics with an integer relevance rating of 1, 2, 3 or 4. (Guidelines on the relevance rating are in preparation.) The system may then return another five documents for more feedback. Systems should stop when they believe they have covered all the user's subtopics sufficiently. The subtopics are not known the system in advance; systems must discover the subtopics from the user's responses.
The system interactions with the user will be simulated using a jig that the track coordinators will provide to you. This jig will be implemented in Python, will run on Windows, Mac OS, and Linux, and will provide a local shell-based API for your DD system to operate against. The API jig will include all relevance information for the task, but your system may only interact with this information through the jig. The jig produces an output file documenting the interaction that you send to NIST as your formal track participation.
The test harness is under development here:
https://github.com/trec-dd/trec-dd-simulation-harness
and a two-minute video of interacting with the initial version (2015-01-16) is available here:
https://www.dropbox.com/s/d2h666pddjqxnsb/2015-01-16-TREC-DD-simulation-harness-demo.mov?dl=0
The primary measures will be Cube Test, µ-ERR, and session NDCG. Reference scripts will be provided by the track coordinators. We will also likely report other diagnostic measures such as basic precision and recall.
The CubeTest proposes that a search process can be understood by analogy to water filling a compartmentalized task cube. The time-sensitivity is represented by the fact that searchers want the multi-faceted components of the cube filled as quickly as possible.
Reference: Jiyun Luo, Christopher Wing, Hui Yang, Marti Hearst. The Water Filling Model and The Cube Test: Multi-Dimensional Evaluation for Professional Search. CIKM 2013.
http://cs-sys-1.uis.georgetown.edu/~xd47/InfoSense/publication/cikm2013.pdf
µ-ERR is an extension to the cascade model of ERR by defining an outer loop in which the user changes the entity profile each time they find a useful piece of new information.
Reference: Oliver Chappelle, Don Metzler, Y Zhang, ACM 2009 Expected reciprocal rank for graded relevance.
http://dl.acm.org/citation.cfm?id=1646033
session-nDCG generalizes the nDCG scoring function to multi-query session evaluation.
Reference: Evangelos Kanoulas, Ben Carterette, Paul D. Clough, Mark Sanderson. Evaluating Multi-Query Sessions. SIGIR 2011.
http://dl.acm.org/citation.cfm?id=2009916.2010056
In TREC, a "run" is the output of a search system over all topics. Participating groups typically submit more than one run corresponding to different parameter settings or algorithmic choices. The maximum number of runs allowed for DD 2015 is five from each team.
The jig outputs a correctly-formatted run file, but for reference (or if you are performing manual searches), the format is as follows. The run is a plain text line-oriented format:
<topic> <step> <document-id> <score> <runtag>
where <topic> is the topic number,<step> is the step number, starting from 1, <document-id> is a document identifier from the datasets, <score> is a floating-point number indicating your systems retrieval score for that document, and <runtag> is an identifier such as "NISTrun1" that identifies the team and the specific run. Whitespace separates each field.
Participants are expected to submit at least one run by the deadline.
Runs may be fully automatic, or manual. Manual indicates intervention by a person at any stage of the retrieval. We welcome unusual approaches to the task including human-in-the-loop searching, as this helps us set upper performance bounds.
- Domain collections available: May 1
- Topics available to participants: May 1
- Runs due from participants: Aug 1
- Evaluation results returned: Sep 15
- TREC 2015 notebook paper deadline: October
- TREC 2015 conference: November 17-20, 2015


This mobile Website is been developed as an assessment piece. It has been built using JQuery and JQuery mobile. All images are from either
www.iconearchive.com or
http://umutavci.deviantart.com/art/
weather-icon-set-165476034
The weather data is sourced from openweathermaps.org
Built by Aaron Humphreys
Contact UsThank you for taking the time to provide feedback on your experience. Your feedback will be reviewed. Thank you for your participation.


Most Popular Video Tags for all Countries
Publish Time by View Percentage
Publish Time by Video Count
Categories by Average Views
Average Likes, Dislikes, and Comments for all Countries


@(errorMessage: String)(implicit session: play.api.mvc.Session) @import helper._ @header("Pastes: Create account")
The Anon user hasn't been initialized yet. Please enter a password.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/olean.20viewer.html ---
Hi all, I'm ready to present a first cut at an olean file parser, written in Lean and Rust. I'm hoping it can be useful for people that want to do analysis on lean files without having to grep the files or something. Plus this makes lots of other goodies accessible like notations and VM code for definitions.
That's a cool idea. Does the olean file format contain enough information for building useful linting tools? For example, could it be used to identify redundant imports?
yes
well, you would have to figure out what definitions come from where, so you would have to read all the olean files not just the target file
I thought olean is OS-dependent
@Kenny Lau, I don't think it is. I managed to move olean files between windows and os x.
then what’s stopping us from removing olean from gitignore?
because lean cares deeply about timestamps, and git won't get these right
(besides that most people have a deep revulsion to binary artifacts in version control :-)
I can say for sure now that it's not OS dependent
although it is pretty haphazard
Because of the way intermediate exprs are saved and reused, you can't skip over any part of the file. If some macro is not understood, then everything stops
Thanks for writing this. I don't have an immediate use, but was always curious what was in those files. I'm curious how much Lean 4 will help with runtime performance (assuming they keep .olean files).
Hi all, I'm ready to present a first cut at an olean file parser, written in Lean and Rust. I'm hoping it can be useful for people that want to do analysis on lean files without having to grep the files or something. Plus this makes lots of other goodies accessible like notations and VM code for definitions.
It looks like a very useful tool (once documented), but is it wise to do it for Lean 3? From Sebastian's talk that we watch yesterday, it seems this tool will have to be rewritten from the beginning for Lean 4. Maybe it would make more sense to focus on stuff that will be easier to port (like modules over multiple rings), unless this olean tool is something you could use for academic purposes (papers, thesis...).
meh, I've been hearing that for a long time
I expect it will require a lot of adjustment for lean 4; in fact it's best to think of this as documenting the lean 3 olean file format
which isn't going to change since lean 3 is EOL
lean 4 offers lots of things that may make this less necessary, but right now, in lean 3, it's difficult to get at some information without lots of hackery. Well here's a nice package of hackery so that you don't have to
Yeah, you should be able to use Lean's actual implementation in Lean 4 for this
it's a brave new world
@Sebastian Ullrich This probably doesn't affect lean 4 because it's been changed too much, but I discovered a very peculiar condition by checking the olean parser against everything in mathlib. I've got it down to just one error, in group_theory.coset
. The offending definition is:
@[elab_as_eliminator, elab_strategy, to_additive quotient_add_group.induction_on] lemma induction_on {C : quotient s → Prop} (x : quotient s) (H : ∀ z, C (quotient_group.mk z)) : C x := quotient.induction_on' x H attribute [elab_as_eliminator, elab_strategy] quotient_add_group.induction_on
The bizarre part here is the use of the elab_strategy
attribute, which is supposed to be internal-use-only. This attribute has data, an enum which can have three possible values. Unlike lean's deserializer, I'm validating the byte before storing it in the enum, and I'm finding weird random numbers like 126
instead of 0,1,2
like expected.
Since elab_strategy
is internal only, it shouldn't even be allowed in user files, but I guess it is in this case. I checked what the parser does when it reads an elab_strategy, and it calls elaborator_strategy_attribute_data::parse(p)
, which isn't implemented, so it falls back on the default implementation which does nothing. So the m_status
variable ends up filled with random junk, which then gets written into the olean file during serialization.
Ah, interesting. Yeah, all attribute parsing will have to be reimplemented in Lean in Lean 4.
argh... #eval
and example
leave no trace in the olean file. I was hoping to get a hold of some code to execute, but this makes things harder
I upgraded the viewer so it can now follow lean cross references in a project. One application of this is viewing the dependencies of a file. Here is the list of dependencies of analysis.real
, in the order lean sees them:
$ cargo run -- -p ../mathlib -d analysis.real Finished dev [unoptimized + debuginfo] target(s) in 0.09s Running `target\debug\olean-rs.exe -p ../mathlib -d analysis.real` can't find init.data.lemmas path = ["C:\\Users\\Mario\\lean\\lean\\library", "C:\\Users\\Mario\\lean\\lean\\lib\\lean\\library", "C:\\Users\\Mario\\lean\\mathlib\\./."] can't find analysis.emetric_space path = ["C:\\Users\\Mario\\lean\\lean\\library", "C:\\Users\\Mario\\lean\\lean\\lib\\lean\\library", "C:\\Users\\Mario\\lean\\mathlib\\./."] init.core init.logic [snip] init.data init data.prod data.dlist data.dlist.basic category.basic tactic.basic tactic.cache logic.basic data.option.defs logic.function tactic.rcases tactic.generalize_proofs tactic.split_ifs data.list.defs data.sum tactic.ext tactic.tauto tactic.replacer tactic.simpa meta.rb_map category.functor category.applicative category.traversable.basic tactic.squeeze tactic.interactive tactic.finish data.subtype data.set.basic algebra.order order.basic order.lattice data.bool data.option.basic tactic.pi_instances order.bounded_lattice order.complete_lattice order.bounds data.equiv.basic algebra.group algebra.ordered_group algebra.ring data.nat.cast algebra.ordered_ring data.nat.basic data.buffer data.buffer.parser tactic.alias tactic.mk_iff_of_inductive_prop logic.relator logic.relation data.sigma.basic data.sigma data.fin data.list.basic data.list.perm tactic.wlog algebra.order_functions tactic.monotonicity.basic order.boolean_algebra order.complete_boolean_algebra order.galois_connection data.set.lattice category.traversable.instances category.traversable.lemmas category.traversable category.traversable.derive tactic.monotonicity.interactive tactic data.nat.sqrt data.nat.pairing data.equiv.nat data.equiv.encodable data.equiv.denumerable logic.embedding order.order_iso data.vector data.vector2 category.traversable.equiv data.array.lemmas data.list.sort data.quot data.char data.string algebra.field algebra.char_zero algebra.ordered_field data.int.basic algebra.group_power data.multiset data.finset algebra.big_operators data.fintype data.equiv.list data.set.finite data.set.function data.set.countable order.conditionally_complete_lattice data.real.cau_seq data.real.cau_seq_completion data.nat.gcd data.pnat data.int.sqrt data.rat algebra.archimedean data.real.basic data.real.nnreal order.zorn data.list order.filter order.liminf_limsup algebra.module algebra.pi_instances data.set.intervals data.equiv.algebra analysis.topology.topological_space analysis.topology.continuity analysis.topology.uniform_space data.finsupp linear_algebra.basic data.nat.prime algebra.gcd_domain data.int.gcd ring_theory.associated ring_theory.ideals analysis.topology.topological_structures analysis.metric_space tactic.converter.old_conv tactic.converter.interactive tactic.norm_num tactic.ring tactic.linarith analysis.real
How hard would it to be to produce a "class hierarchy", showing all the classes defined and which ones extend which others?
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Kris Koeckritz
About
Portfolio
Contact
(current)
Featured
Cras justo odio
Dapibus ac facilisis in
Vestibulum at eros
Contact
Name
Email
I will guard your email with my life.
Message
Submit


Please login below to begin uploading your drone videos. You can create a free account by clicking the "Join" button above.
Forgot Password
Find Your Account. Please Enter Email.
Reset Password
Join
Please join using one of the social networks below. This will allow Travel By Drone to tag you after submitting new videos. If you'd prefer not to use a social media account, then you can create a custom account below.


{% if object %}
{% if language_mismatch %}
{% trans "WARNING" %}! {% trans "You are using the currently active language" %}
({{ current_language_name }})
{% trans "to edit a content whose 'original editing language' is" %}
{{ object.get_language_name }}:
{% trans "this WILL CHANGE its 'original editing language'" %}!
{% else %}
{% if object.original_language %}{% trans "OK" %}.{% endif %}
{% trans "You are using the currently active language" %}
({{ current_language_name }})
{% trans "to edit a content whose 'original editing language' is" %}
{% if object.original_language %}{% trans "also" %}{% else %}{% trans "still" %}{% endif %}
{{ object.get_language_name }}.
{% if not object.original_language %}{% trans "This will set its 'original editing language'" %}{% endif %}.
{% endif %}
{% else %}
{% trans "IMPORTANT NOTICE! The content that you are creating will take the currently active language" %}
({{ current_language_name }})
{% trans "as its 'original editing language'" %}.
{% trans "Afterwards, you should edit it using always the same language, and you will be able to add translations to other languages" %}.
{% endif %}


Smart Gardening
Device
Device:
Device ID :
Device Status :
Offline
Device Date/Time :
00:00:00
Settings
Auto Schedule

Manual (Over Internet)
Watering Schedule
Every 6 Hour
Every 8 Hour
Every 12 hour
Every 24 hour
Duration (in Minutes)
  Prefered Start Time
Logs


The largest open source product in CC’s portfolio is CC Search: a search engine for CC licensed and public domain creative works.
The product involves the following components:
CC Catalog ingests and processes CC licensed and public domain works, then makes that data available to CC Catalog API. CC Catalog API is publicly accessible, and is used to serve the data from the catalog to CC Search.
The highlights on our roadmap for the current and upcoming quarters are as follows:
| Task Name | Task Description |
|---|---|
| Improve Search Algorithm with Popularity Data Integration | Make changes to the search algorithm that incorporate image popularity data gathered from sources that provide it. |
| Move data cleaning pipeline from API to Catalog | Move our data cleaning code from the ingestion step of the API to the initial data processing step of the Catalog to eliminate unnecessary repetitive data cleaning. |
| Implement architecture for schema for new metadata [AWS Grant] | Update Catalog schema to include new metadata generated through AWS Rekognition. |
| Plan search algorithm changes for new metadata [AWS Grant] | Plan out search algorithm changes to incorporate image metadata generated via AWS Rekognition. |
| License Explanation/Compliance Improvements | Improve how and where we explain licenses, and consider ways to make it easier for reusers to understand and comply with license requirements. |
| Offline old CC Search | Offline Old Search (oldsearch.creativecommons.org) and redirect traffic to CC Search. Prior to this, build in messaging on Old Search, and support similar functionality on CC Search. See "Meta Search Integration" for related work. |
| Web Monetization: Phase 1 | Research and test potential integrations for Web Monetization into CC Search and other CC web properties. |
| 3D Support in UI | Support rendering of 3D objects on frontend of CC Search. |
| Improved Support Pages | Improve the support pages on CC Search, which includes the Collections page, for a better experience. Add explanation text for collections, improve flow. |
| Accessibility Improvements | Make accessibility improvements to the UI. |
| Internationalization Infrastructure | Build infrastructure necessary for internationalization, to allow CC Search to be accessible in other languages. |
| Improve Common Crawl Infrastructure | Update our Common Crawl provider infrastructure to: (1) use Apache Airflow instead of AWS tools like Data Pipeline & Glue for processing data (2) unify provider processing to use the same base classes as API providers |
| Design Sprint: Audio UI for CC Search | Designing and prototyping an upcoming user interface for searching for audio on CC Search. |
| Audio Support and Integration | Design and user test UIs for audio. Ingest a pilot collection of audio to the Catalog, build support in the API. Integrate design to frontend to allow users to search for CC licensed audio. |
| Run Rekognition on 100m images [AWS Grant] | Generate metadata via machine learning (using AWS Rekognition) on a set of ~100 million high quality images from the CC Catalog. |
| Switch from Common Crawl to API | For all possible providers, use their APIs to ingest data into the CC Catalog instead of scraping websites via Common Crawl data. |
| Task Name | Task Description |
|---|---|
| Search Relevance Improvements: Language Analysis, Quality Metrics, Minimums | None |
| Plan UI Updates in Response to Metadata [AWS Grant] | Design updates to the CC Search UI in response to new metadata available as a result of applying machine learning to selected images in the Catalog. At a minimum, we expect new filters will be an option. Integration of design will take place subsequently. |
| Provider Review Automation | Automate the process of finding new providers of CC-licensed content to index into the CC Catalog. |
| Usage/Reuse Metrics Dashboard | Build an analytics UI that is fed by Google Analytics and our internal analytics database. |
| Scrape all images and set up feed for new ones | Once the Rekognition crawl finishes, we want to crawl the rest of the catalog (but not feed them to rekognition). This will give us useful metadata like dimensions and quality. |
| Improve Documentation for Community Contributors | Create better documentation for community contributors by consolidating internal and public documentation and making it available for everyone. |
| Improve Catalog Deployment and Provisioning | Manage Catalog deployment and provisioning entirely through infrastructure as code. |
| API documentation improvements | Make CC Catalog API documentation more accessible to CC Search users, and improve user experience. |
| CC Search HTML Embed | Design and build an embed of CC Search that can be placed on any website, as a starting point to discover objects in CC Search. Components from Design Library must be used, with the goal of simplicity. |
| Plan use of ccREL for easily adding content to cccatalog | Plan out the usage of scraping ccREL metadata from the internet to index new content into the CC Catalog. |
| User Persona Redevelopment | Update CC Search user personas based on user research during 2020. |
| Support multiple languages in CC Search | Design and implement seamless support for multiple languages in CC Search, as content in languages becomes available. This is preceded by Internationalization Infrastructure work. |
| Implement UI Updates for new Metadata [AWS Grant] | Implement design updates to the CC Search UI. Designs will be created in response to new metadata available as a result of applying machine learning to selected images in the Catalog. At a minimum, we expect new filters to be rolled out. |
| Implement Search Algorithm Changes [AWS Grant] | Update our search algorithm to use metadata gathered using machine learning analysis (using AWS Rekognition). |
| Ensure Infrastructure Code is Open Source [AWS Grant] | Release the infrastructure code used to power the CC Catalog, API, and CC Search projects publicly. |
| Enrich CC Catalog data with data from Common Crawl | Enrich CC Catalog and data found in the wild using Common Crawl, for example, to track where CC-licensed content is reused. |
Review our Pipeline of Future Ideas here if you want to see what else has been suggested for CC Search.
To contribute code, take the following steps:
There are two ways you can show your interest in contributing to the design of CC Search:
Before you start work on any design project, get familiar with our design library in Figma. All CC Search designs use this design library.
When we’re rolling out a specific feature, we do usability tests to test the proposed experience.
At any point in time, we’re engaging with our users through user interviews, where we learn more about attitudes towards the product as it stands, and dig into expansion areas we’re considering.
If you’re interested, we invite you to sign up for a time via this Calendly link.
Visit our Usability page for more details on how to participate.


var bigPicture: Bitmap
REQUIRED Bitmap big picture for NotificationCompat.BigPictureStyle This value doesn't have a backing resource because it won't make any sense to show a resource here
See Also
NotificationCompat.BigPictureStyle.bigPicture
Getter
REQUIRED Bitmap big picture for NotificationCompat.BigPictureStyle This value doesn't have a backing resource because it won't make any sense to show a resource here
Getter See Also
NotificationCompat.BigPictureStyle.bigPicture
Setter
REQUIRED Bitmap big picture for NotificationCompat.BigPictureStyle This value doesn't have a backing resource because it won't make any sense to show a resource here
Setter See Also


UNIX
Section: Linux Programmer's Manual (7)Updated: 2008-12-01
Index Return to Main Contents
NAME
unix, AF_UNIX, AF_LOCAL - Sockets for local interprocess communicationSYNOPSIS
#include <sys/socket.h>#include <sys/un.h>
unix_socket = socket(AF_UNIX, type, 0);
error = socketpair(AF_UNIX, type, 0, int *sv);
DESCRIPTION
The AF_UNIX (also known as AF_LOCAL) socket family is used to communicate between processes on the same machine efficiently. Traditionally, Unix sockets can be either unnamed, or bound to a file system pathname (marked as being of type socket). Linux also supports an abstract namespace which is independent of the file system.Valid types are: SOCK_STREAM, for a stream-oriented socket and SOCK_DGRAM, for a datagram-oriented socket that preserves message boundaries (as on most Unix implementations, Unix domain datagram sockets are always reliable and don't reorder datagrams); and (since Linux 2.6.4) SOCK_SEQPACKET, for a connection-oriented socket that preserves message boundaries and delivers messages in the order that they were sent.
Unix sockets support passing file descriptors or process credentials to other processes using ancillary data.
Address Format
A Unix domain socket address is represented in the following structure:#define UNIX_PATH_MAX 108 struct sockaddr_un { sa_family_t sun_family; /* AF_UNIX */ char sun_path[UNIX_PATH_MAX]; /* pathname */ };
sun_family always contains AF_UNIX.
Three types of address are distinguished in this structure:
- *
- pathname: a Unix domain socket can be bound to a null-terminated file system pathname using bind(2). When the address of the socket is returned by getsockname(2), getpeername(2), and accept(2), its length is sizeof(sa_family_t) + strlen(sun_path) + 1, and sun_path contains the null-terminated pathname.
- *
- unnamed: A stream socket that has not been bound to a pathname using bind(2) has no name. Likewise, the two sockets created by socketpair(2) are unnamed. When the address of an unnamed socket is returned by getsockname(2), getpeername(2), and accept(2), its length is sizeof(sa_family_t), and sun_path should not be inspected.
- *
- abstract: an abstract socket address is distinguished by the fact that sun_path[0] is a null byte ('\0'). All of the remaining bytes in sun_path define the "name" of the socket. (Null bytes in the name have no special significance.) The name has no connection with file system pathnames. The socket's address in this namespace is given by the rest of the bytes in sun_path. When the address of an abstract socket is returned by getsockname(2), getpeername(2), and accept(2), its length is sizeof(struct sockaddr_un), and sun_path contains the abstract name. The abstract socket namespace is a non-portable Linux extension.
Socket Options
For historical reasons these socket options are specified with a SOL_SOCKET type even though they are AF_UNIX specific. They can be set with setsockopt(2) and read with getsockopt(2) by specifying SOL_SOCKET as the socket family.- SO_PASSCRED
- Enables the receiving of the credentials of the sending process ancillary message. When this option is set and the socket is not yet connected a unique name in the abstract namespace will be generated automatically. Expects an integer boolean flag.
Sockets API
The following paragraphs describe domain-specific details and unsupported features of the sockets API for Unix domain sockets on Linux.Unix domain sockets do not support the transmission of out-of-band data (the MSG_OOB flag for send(2) and recv(2)).
The send(2) MSG_MORE flag is not supported by Unix domain sockets.
The use of MSG_TRUNC in the flags argument of recv(2) is not supported by Unix domain sockets.
The SO_SNDBUF socket option does have an effect for Unix domain sockets, but the SO_RCVBUF option does not. For datagram sockets, the SO_SNDBUF value imposes an upper limit on the size of outgoing datagrams. This limit is calculated as the doubled (see socket(7)) option value less 32 bytes used for overhead.
Ancillary Messages
Ancillary data is sent and received using sendmsg(2) and recvmsg(2). For historical reasons the ancillary message types listed below are specified with a SOL_SOCKET type even though they are AF_UNIX specific. To send them set the cmsg_level field of the struct cmsghdr to SOL_SOCKET and the cmsg_type field to the type. For more information see cmsg(3).- SCM_RIGHTS
- Send or receive a set of open file descriptors from another process. The data portion contains an integer array of the file descriptors. The passed file descriptors behave as though they have been created with dup(2).
- SCM_CREDENTIALS
-
Send or receive Unix credentials.
This can be used for authentication.
The credentials are passed as a
struct ucred
ancillary message.
Thus structure is defined in
<sys/socket.h>
as follows:
struct ucred { pid_t pid; /* process ID of the sending process */ uid_t uid; /* user ID of the sending process */ gid_t gid; /* group ID of the sending process */ };
Since glibc 2.8, the _GNU_SOURCE feature test macro must be defined in order to obtain the definition of this structure.
The credentials which the sender specifies are checked by the kernel. A process with effective user ID 0 is allowed to specify values that do not match its own. The sender must specify its own process ID (unless it has the capability CAP_SYS_ADMIN), its user ID, effective user ID, or saved set-user-ID (unless it has CAP_SETUID), and its group ID, effective group ID, or saved set-group-ID (unless it has CAP_SETGID). To receive a struct ucred message the SO_PASSCRED option must be enabled on the socket.
ERRORS
- EADDRINUSE
- Selected local address is already taken or file system socket object already exists.
- ECONNREFUSED
- connect(2) called with a socket object that isn't listening. This can happen when the remote socket does not exist or the filename is not a socket.
- ECONNRESET
- Remote socket was unexpectedly closed.
- EFAULT
- User memory address was not valid.
- EINVAL
- Invalid argument passed. A common cause is the missing setting of AF_UNIX in the sun_type field of passed addresses or the socket being in an invalid state for the applied operation.
- EISCONN
- connect(2) called on an already connected socket or a target address was specified on a connected socket.
- ENOMEM
- Out of memory.
- ENOTCONN
- Socket operation needs a target address, but the socket is not connected.
- EOPNOTSUPP
- Stream operation called on non-stream oriented socket or tried to use the out-of-band data option.
- EPERM
- The sender passed invalid credentials in the struct ucred.
- EPIPE
- Remote socket was closed on a stream socket. If enabled, a SIGPIPE is sent as well. This can be avoided by passing the MSG_NOSIGNAL flag to sendmsg(2) or recvmsg(2).
- EPROTONOSUPPORT
- Passed protocol is not AF_UNIX.
- EPROTOTYPE
- Remote socket does not match the local socket type (SOCK_DGRAM vs. SOCK_STREAM)
- ESOCKTNOSUPPORT
- Unknown socket type.
Other errors can be generated by the generic socket layer or by the file system while generating a file system socket object. See the appropriate manual pages for more information.
VERSIONS
SCM_CREDENTIALS and the abstract namespace were introduced with Linux 2.2 and should not be used in portable programs. (Some BSD-derived systems also support credential passing, but the implementation details differ.)NOTES
In the Linux implementation, sockets which are visible in the file system honor the permissions of the directory they are in. Their owner, group and their permissions can be changed. Creation of a new socket will fail if the process does not have write and search (execute) permission on the directory the socket is created in. Connecting to the socket object requires read/write permission. This behavior differs from many BSD-derived systems which ignore permissions for Unix sockets. Portable programs should not rely on this feature for security.Binding to a socket with a filename creates a socket in the file system that must be deleted by the caller when it is no longer needed (using unlink(2)). The usual Unix close-behind semantics apply; the socket can be unlinked at any time and will be finally removed from the file system when the last reference to it is closed.
To pass file descriptors or credentials over a SOCK_STREAM, you need to send or receive at least one byte of non-ancillary data in the same sendmsg(2) or recvmsg(2) call.
Unix domain stream sockets do not support the notion of out-of-band data.
EXAMPLE
See bind(2).SEE ALSO
recvmsg(2), sendmsg(2), socket(2), socketpair(2), cmsg(3), capabilities(7), credentials(7), socket(7)COLOPHON
This page is part of release 3.22 of the Linux man-pages project. A description of the project, and information about reporting bugs, can be found at http://www.kernel.org/doc/man-pages/.
Index
This document was created by man2html, using the manual pages.
Time: 05:34:16 GMT, December 24, 2015


I'm still learning a lot, so stay tuned 👀
I made this game in collaboration with my friends Sophia and Tom. The premise of the game is that you play the role of an artificial guardian guiding a girl through a research facility. The story can take multiple paths, and it's up to the player to decide how to save this girl.
We made this for the 2019 UNC Game Jam. We kept the technologies pretty simple, nothing fancy outside of JQuery and 3D CSS. We think it turned out quite nicely.
We had to make a simple minesweeper game for our web development class.
I thought emojis were cute, and I loved the idea of making it a have watermelon color scheme, so here we are.
Being a TA for a giant Computer Science class means making the right tools to help me get the job done. When dealing with 400 students at once, attendance becames a difficult challenge. A solution I made for this problem is creating an attendance taking software suite that works in two parts, a web front end and a java back end. The web front end displays a link to a Google form that students and the class enter their attendance on. It also displays a 5 digit authentication code based on a hash of the current time stamp, which the student must enter into their form before submission. The code changes every 20 seconds, and the student must enter their code in before that time. This gives us a way to ensure that students are physically attending class.
The second part of this solution is a java back end that calculates the attendance of every student every day, and generates a csv that is able to upload directly into our learning management system. This program also verifies the authentication code for every student every day, and allows us to provide attendance grades rapidly to students.
One of my favorite game series of all time is Pokémon. I recently started playing one of the newer games, and I realized I didn't know a single one of the new ones past generation 4. So, why not make a little project out of it and make a really simple Pokédex?
The really special thing about this website is the color scheme system, it actually changes colors based on whichever Pokémon you select!
After my sophomore year I interned at Garmin in Kansas City. Kansas City was also hosting a hackathon during that summer, seemed like the perfect chance for me to make an app for a Garmin smartwatch.
This app basically points you in the direction of the nearest coffee shop, and shows you how far it is to get there. We use the GPS on the device and the FourSquare API to find that information for us, it was quite surprsing to see the API call work so flawlessly on that device.
I made this Android app as a final project for my android app development class. The goal of the application is to essentially provide a user with a much better way to study using flash cards.
I used machine learning to identify which cards a user had difficulty with, and then prioritzed those to help them study better
You're the newest software engineer at work, and you've been asked to debug code! Will you be able to squash all the bugs and keep your job?
I made this game as part of a GameJam at UNC with a lot of my friends, I'm still not sure if we made a game or a Windows 95 Emulator
Think you have what to takes to place on the Trivia leaderboards? Try your shot at lots of different categories and see where you place!
I made this game during COVID-19, and it was born out of me missing all the different trivia events I used to do at Chapel Hill. I used OpenTriviaDB as the api to load questions in from, and I built my own API and database to store all the high scores users get on different categories.


--- layout: post title: All the Same date: '2004-08-11T15:44:00-04:00' tags: - '2004' tumblr_url: http://poetry.liabogoev.com/post/938351521/all-the-same ---
We are all the same,
No, it’s not a lie.

We are all the same,
in many different ways.
We are all on this Earth,
For many, many days.
Though no one,
is quite the same,
We are all playing,
the same big game.
It doesn’t matter,
The clothes we wear,
The way we walk,
The color of our hair.
People are the same,
Two eyes, one head
Two ears, one mouth
Though the color we may dread.
The way we live is different.
The things we do are, too.
The things we eat are also there.
Yes, that is very true.
We all learn important things,
Like how to read and spell.
All of us learn it,
Though some not very well.
We all enjoy ourselves,
In one way or another.
Maybe with a sister,
Maybe with a brother.
Those are just some reasons,
That we are all the same.
Some winning, some losing,
In this big, harsh, game.


Street covered in vomit and dog mess is so bad it's like a 'disgusting toilet'
Fed up resident, who says he's like Victor Meldrew, puts out plant pots next to piles of mess to shame owners
by Jenny MoodyA busy street in South Derbyshire has been described as a 'disgusting toilet' because it is plagued with dog mess and vomit.
Mick Cramp has been left disgusted at the state of the streets in Hatton, particularly Station Road where he lives, as some dog owners continually fail to clear up after their pets and huge piles of sick on the pavements are assumed to be left by those leaving the pubs at either end of the street.
He says unsuspecting mums pushing children then get it on their pushchairs as they pass by.
He says the street is the worst one in the village and must be one of the worst in the area.
Parking is also an issue, particularly near to the Nisa store, with people leaving their vehicles on the pavement, leaving pedestrians having to walk in the gutter.
The 72-year-old is leading the fight to get something done to clean up the streets in the village once and for all. And he says it's left him feeling like Victor Meldrew as he refuses to let the issue drop.
Victor Meldrew was the TV comedy character from the hit show One Foot in the Grave known for his constant complaining.

Mr Cramp said: "I might be Victor Meldrew but someone has got to do it.
"I have lived in this village for 40-odd years and I don't think it has ever been this bad. I think that it has got a damn sight worse.
"It is getting in a right state, there was new stuff this morning. Other people are seeing it around the village and are getting fed up with it.
 These supposedly responsible animals owners are letting their dogs poo all over the place. There are loads of responsible dog owners who have always got plastic bags on them.
"They must walk their dogs at night as it is worse in the morning but nobody seems to see them.
"It is spread all over the village.
"The dog mess is on the road for the school run for the kiddies and you can see tracks in it where people have gone through it with pushchairs.
"Some of it is white stuff and it's terrible. I am trying to bring it to someone's attention to try to get something done about it.
"If people are walking through it all the while it gets worn away by the time the clean team get it."
Mr Cramp said this is not the fault of the cleaning team as they have other areas to get to as well.
Any problem he sees he reports to the clerk of the parish council so a record is kept of the problem.
He said that in some places cars park close to the wall which means people have to walk in the gutter.
Mr Cramp said: "We have problems with vomit, parking outside Nisa on the road and close to wall so villagers have a job to get past them and have to walk into the flow of traffic.
"If I see something like that I try to do something about it or try to get someone else to do something about it.
"I don't always win but if I don't try nobody knows about it."


Go Get items that others no longer need.
Contact about this item.
Contact Email:


FORBIDDEN PLANET A Film Review Copyright Dragan Antulov 2000
One of the most widespread forms of amusement among movie fans is "Kevin Bacon game" - connecting various, often quite different, films based on the actors who appeared in them. Movie fans who like to explore the essence of films play another kind of "Kevin Bacon game" - connecting various films based on ideas or characters that appeared in them. One of the most spectacular of such sequences, in which we can trace the original ideas centuries back, is the sequence that begins with William Shakespeare's THE TEMPEST and ends with STAR TREK. There is an important link between 16th Century play and 20th Century cult SF-series, and that link happens to be SF-film with the cult following of its own. This film is FORBIDDEN PLANET, 1956 space opera directed by Fred M. Wilcox.
The plot of the film is set in 22nd Century. Starship is sent from Earth to solar system of Altair. Captain J.J. Adams (played by Leslie Nielsen) has the task to investigate apparent lack of communication with scientific colony that had settled on its fourth planet two decades ago. When the ship approaches the planet, the expedition receives warning by Doctor Morbius (played by Walter Pidgeon), the only remaining member of the expedition. He claims that he doesn't need outside help and that the starship should leave. Adams nevertheless orders the landing and his expedition is greeted by strange, exotic, yet barren world. The only thing that stands out are structures inhabited by Doctor Morbius, his young daughter Altaira (played by Annie Francis) and exotic household appliance called "Robbie the Robot". Morbius reluctantly agrees to help Adams in his investigation, explaining that all the members of his expedition, with exception of his family, succumbed to mysterious force which caused very violent and messy deaths. Stranded on the barren planet, Morbius had begun to explore its underground and found ruins of mighty and ultra-developed civilisation of Krell, people who mysteriously perished centuries ago. Their superior technology persevered, allowing Morbius to create many technological wonders, including "Robbie", despite his lack of formal engineering skills. While some members of the starship crew are intrigued by this finding, most of them are aroused by attractive yet sexually inexperienced Altaira, including Captain Adams. However, after a while, Adams would find that this bizarre planet has lifeforms different from Morbius family and more inimical to his ship and crew.
At first glance, FORBIDDEN PLANET looks like an embodiment of everything that is bad about Hollywood's 1950s science fiction. The predictions of future are laughable, starships look like flying saucers, their crews are made entirely out of white males who speak with American accent. Comic relief in the form of Cookie (played by Earl Holliman) is an incarnation of all cliches of the period. "Robbie the Robot", on the other hand, doesn't just look obsolete - he looks like too obvious attempt by producers to attract juvenile audience, and, compared to this, Lucas and Spielberg look like masters of subtlety. Even on purely technical level director Wilcox manages to shoot himself in the foot when one shot during Altaira's skinny-dipping scene reveals Annie Frances wearing swimsuit. However, despite these flaws, FORBIDDEN PLANET is considered one of the most important science fiction films ever made.
The importance of FORBIDDEN PLANET is in the influence it had on numerous filmmakers till this day, mostly in the form of basic plot. That speaks a lot of about ingenuity and intelligence of screenwriter Cyril Hume, who, unlike many other SF writers, didn't use the premise as a simple excuse for standard action/horror plot, but actually built the real, intriguing story on it and led it to its logical and effective conclusion. Thanks to that, even the viewers who are accustomed to CGI graphics, different standards of sex, violence and language would actually appreciate this film. Despite antiquated special effects, slow rhythm, old-fashioned morality of the characters, FORBIDDEN PLANET doesn't insult viewer's intelligence. It is exactly what is supposed to be - a science fiction film from beginning to the end.
Even on technical levels, FORBIDDEN PLANET is successful film. Special effects were best of its age, and even today some of the scenes might impress the viewers. There was even some room for experimenting, and musical of Bebe and Louis Barron is the very first example of completely electronic soundtrack for Hollywood feature film. This experiment resulted in eerie, surreal atmosphere that seems quite appropriate for the film. Although the actors in this film don't usually belong to Hollywood major league, they do quite a decent job. That includes young Leslie Nielsen of comedic POLICE SQUAD fame as starship captain, and despite his usual deadpan delivery, this non- comic role is rather impressive; "trekkies" wouldn't have much trouble seeing shades of proto-Kirk in Nielsen's version of Adams. On the other hand, Walter Pidgeon is also quite effective as Morbius, and Anne Francis as his attractive daughter delivers seductive combination of sexuality and childlike innocence. Hume's dialogue, despite some usual cliches, has enough room for some rather entertaining double entendres.
All in all, FORBIDDEN PLANET, even after almost half of century, is not only important but very entertaining and intelligent piece of science fiction cinema and it should be recommended to all fans of that particular genre.
RATING: 8/10 (+++)
Written on December 28th 2000
Dragan Antulov a.k.a. Drax Fido: 2:381/100 E-mail<EMAIL_ADDRESS>E-mail<EMAIL_ADDRESS>E-mail<EMAIL_ADDRESS>Filmske recenzije na hrvatskom/Movie Reviews in Croatian http://film.purger.com
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