We are couting cluster-capacity for you and generating new report in every {{.Period}} seconds. We always remember last {{.CacheSize}} records. You can see the results or update the scheduled pod using api-reference specified in /doc sirectory or on the project page: https://github.com/kubernetes-sigs/cluster-capacity /p>


As the world collapses around our ears, there are a few glimmers of brightness to keep us in good cheer. I, for one, have been heartened by the inexorable rise of the sepia-tinged, snail's pace computer game, and am in a mildly non-comatose state following the announcement that Collective Farm Administrator 2.0 is about to hit the shelves in time for Christmas.
 Sitting at your desk in a corner of a virtual barn, you have to make bureaucratic decisions about cows, goats, tractors and similar farmyard appurtenances, fill in lots of paperwork, and drink weak and watery pixellated tea from a grubby pixellated samovar while you await the arrival of the regional collective farm supervisor, who could appear on the screen at any moment, but may just as likely never arrive at all.

For added verisimilitude, scenes such as these remain “stuck” on screen for days on end. Sound effects include the mooing of a tubercular cow and the puttering of a tractor about to run out of fuel.
While you await delivery of your pre-ordered copy of Collective Farm Administrator 2.0, you may indulge in further rustic fun and frolic, this time in full colour, by following this link. My thanks to Ed Baxter of Resonance FM for drawing it to my attention.


arcgis.features.manage_data module¶
These functions are used for both the day-to-day management of geographic data and for combining data prior to analysis.
dissolve_boundaries merges together areas that share a common boundary and a common attribute value. extract_data creates new datasets by extracting features from your existing data. merge_layers copies all the features from two or more existing layers into a new layer. overlay_layers combines two or more layers into one single layer. You can think of overlay as peering through a stack of maps and creating a single map containing all the information found in the stack.
dissolve_boundaries¶
-
arcgis.features.manage_data.
dissolve_boundaries
(input_layer, dissolve_fields=[], summary_fields=[], output_name=None, context=None, gis=None, estimate=False, multi_part_features=True, future=False)¶ -
The dissolve_boundaries method finds polygons that overlap or share a common boundary and merges them together to form a single polygon.
You can control which boundaries are merged by specifying a field. For example, if you have a layer of counties, and each county has a State_Name attribute, you can dissolve boundaries using the State_Name attribute. Adjacent counties will be merged together if they have the same value for State_Name. The end result is a layer of state boundaries.
Parameter
Description
input_layer
Required layer. The layer containing polygon features that will be dissolved. See Feature Input.
dissolve_fields
Optional list of strings. One or more fields on the input_layer that control which polygons are merged. If you don’t supply dissolve_fields , or you supply an empty list of fields, polygons that share a common border (that is, they are adjacent) or polygon areas that overlap will be dissolved into one polygon.
If you do supply values for the dissolve_fields parameter, polygons that share a common border and contain the same value in one or more fields will be dissolved. For example, if you have a layer of counties, and each county has a State_Name attribute, you can dissolve boundaries using the State_Name attribute. Adjacent counties will be merged together if they have the same value for State_Name. The end result is a layer of state boundaries.If two or more fields are specified, the values in these fields must be the same for the boundary to be dissolved.
summary_fields
Optional list of strings. A list of field names and statistical summary type that you wish to calculate from the polygons that are dissolved together. For example, if you are dissolving counties based on State_Name, and each county had a Population field, you can sum Population. The result would be a layer of state boundaries with total population.
fieldName is the name of one of the numeric fields found in the input_layer. summary type is one of the following:
Sum - Adds the total value of all the points in each polygon
Mean - Calculates the average of all the points in each polygon.
Min - Finds the smallest value of all the points in each polygon.
Max - Finds the largest value of all the points in each polygon.
Stddev - Finds the standard deviation of all the points in each polygon.
Example [fieldName1 summaryType1,fieldName2 summaryType2].
output_name
Optional string. If provided, the task will create a feature service of the results. You define the name of the service. If output_name is not supplied, the task will return a feature collection.
context
Optional string. Context contains additional settings that affect task execution. For dissolve_boundaries Points, there are two settings.
Extent (extent)-a bounding box that defines the analysis area. Only those features in the input_layer that intersect the bounding box will be analyzed.
Output Spatial Reference (outSR) the output features will be projected into the output spatial reference.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
estimate
Optional Boolean. If True, the number of credits to run the operation will be returned.
multi_part_features
Optional boolean. Specifies whether multipart features (i.e. features which share a common attribute table but are not visibly connected) are allowed in the output feature class.
Choice list: [‘True’, ‘False’].
True: Specifies multipart features are allowed.
False: Specifies multipart features are not allowed. Instead of creating multipart features, individual features will be created for each part.
The default value is True.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
- Returns
result_layer : feature layer Item if output_name is specified, else Feature Collection.
USAGE EXAMPLE: To dissolve boundaries of polygons with same state name. The dissolved polygons are summarized using population as summary field and standard deviation as summary type. diss_counties = dissolve_boundaries(input_layer=usa_counties, dissolve_fields=["STATE_NAME"], summary_fields=["POPULATION STDDEV"], output_name="DissolveBoundaries")
extract_data¶
-
arcgis.features.manage_data.
extract_data
(input_layers, extent=None, clip=False, data_format=None, output_name=None, gis=None, estimate=False, future=False)¶ -
The
extract_data
method is used to extract data from one or more layers within a given extent. The extracted data format can be a file geodatabase, shapefiles, csv, or kml. File geodatabases and shapefiles are added to a zip file that can be downloaded.Argument
Description
input_layers
Required list of strings. A list of input layers to be extracted. See Feature Input.
extent
Optional layer. The extent is the area of interest used to extract the input features. If not specified, all features from each input layer are extracted. See Feature Input.
clip
Optional boolean. A Boolean value that specifies whether the features within the input layer are clipped within the extent. By default, features are not clipped and all features intersecting the extent are returned.
The default is false.
data_format
Optional string. A keyword defining the output data format for your extracted data.
Choice list:
['FileGeodatabase', 'ShapeFile', 'KML', 'CSV']
The default is ‘CSV’.
If FileGeodatase is specified and the input layer has attachments:
if clip=False, the attachments will be extracted to the output file
if clip=True, the attachments will not be extracted
output_name
Optional string or dict.
When
output_name
is a string, the output item in your My contents page will be named by the value. Other item properties will receive default values.output_name = "my_extracted_item"
To explicitly provide other item properties, use a dict with the following Syntax.
output_name = {"title": "<title>", "tag": "<tags>", "snippet": "<snippet>", "description": "<description>"}
For more information on these and other item properties, see the Item resource page in the ArcGIS REST API.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
estimate
Optional boolean. If True, the number of credits to run the operation will be returned.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
# USAGE EXAMPLE: To extract data from highways layer with the extent of a state boundary. ext_state_highway = extract_data(input_layers=[highways.layers[0]], extent=state_area_boundary.layers[0], clip=True, data_format='ShapeFile', output_name='state highway extracted')
merge_layers¶
-
arcgis.features.manage_data.
merge_layers
(input_layer, merge_layer, merging_attributes=[], output_name=None, context=None, gis=None, estimate=False, future=False)¶ -
The
merge_layers
method copies features from two layers into a new layer. The layers to be merged must all contain the same feature types (points, lines, or polygons). You can control how the fields from the input layers are joined and copied. For example:I have three layers for England, Wales, and Scotland and I want a single layer of Great Britain.
I have two layers containing parcel information for contiguous townships. I want to join them together into a single layer, keeping only the fields that have the same name and type on the two layers.
Argument
Description
input_layer
Required feature layer. The point, line or polygon features with the
merge_layer
. See Feature Input.merge_layer
Required feature layer. The point, line, or polygon features to merge with the
input_layer
. Themerge_layer
must contain the same feature type (point, line, or polygon) as theinput_layer
. See Feature Input.merge_attributes
Optional list. Defines how the fields in
merge_layer
will be modified. By default, all fields from both inputs will be included in the output layer.If a field exists in one layer but not the other, the output layer will still contain the field. The output field will contain null values for the input features that did not have the field. For example, if the
input_layer
contains a field named TYPE but themerge_layer
does not contain TYPE, the output will contain TYPE, but its values will be null for all the features copied from themerge_layer
.You can control how fields in the
merge_layer
are written to the output layer using the following merge types that operate on a specifiedmerge_layer
field:Remove
- The field in themerge_layer
will be removed from the output layer.Rename
- The field in themerge_layer
will be renamed in the output layer. You cannot rename a field in themerge_layer
to a field in theinput_layer
. If you want to make field names equivalent, use Match.Match
- A field in themerge_layer
is made equivalent to a field in theinput_layer
specified by merge value. For example, theinput_layer
has a field named CODE and themerge_layer
has a field named STATUS. You can match STATUS to CODE, and the output will contain the CODE field with values of the STATUS field used for features copied from themerge_layer
. Type casting is supported (for example, float to integer, integer to string) except for string to numeric.
output_name
Optional string. If provided, the method will create a feature service of the results. You define the name of the service. If
output_name
is not supplied, the method will return a feature collection.context
Optional dict. Context contains additional settings that affect task execution. For
merge_layers
, there are two settings.Extent (
extent
)-a bounding box that defines the analysis area. Only those features in theinput_layer
and themerge_layer
that intersect the bounding box will be merged into the output layer.Output Spatial Reference (
outSR
) - the output features will be projected into the output spatial reference.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
estimate
Optional boolean. If True, the estimated number of credits required to run the operation will be returned.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
- Returns
result_layer : feature layer Item if
output_name
is specified, else Feature Collection.
#USAGE EXAMPLE: To merge two layers into a new layer using merge attributes. merged = merge_layers(input_layer=esri_offices, merge_layer=satellite_soffice_lyr, merging_attributes=["State Match Place_Name"], output_name="merge layers")
overlay_layers¶
-
arcgis.features.manage_data.
overlay_layers
(input_layer, overlay_layer, overlay_type='Intersect', snap_to_input=False, output_type='Input', tolerance=None, output_name=None, context=None, gis=None, estimate=False, future=False)¶ -
The
overlay_layers
method combines two or more layers into one single layer. You can think of overlay as peering through a stack of maps and creating a single map containing all the information found in the stack. In fact, before the advent of GIS, cartographers would literally copy maps onto clear acetate sheets, overlay these sheets on a light table, and hand draw a new map from the overlaid data. Overlay is much more than a merging of line work; all the attributes of the features taking part in the overlay are carried through to the final product. Overlay is used to answer one of the most basic questions of geography, “what is on top of what?” For example:What parcels are within the 100-year floodplain? (Within is just another way of saying on top of.)
What roads are within what counties?
What land use is on top of what soil type?
What wells are within abandoned military bases?
Argument
Description
input_layer
Required layer. The point, line, or polygon features that will be overlayed with the
overlay_layer
. See Feature Input.overlay_layer
Required layer. The features that will be overlaid with the
input_layer
features. See Feature Input.overlay_type
Optional string. The type of overlay to be performed.
Choice list: [‘Intersect’, ‘Union’, ‘Erase’]
Intersect
-Computes a geometric intersection of the input layers. Features or portions of features which overlap in both theinput_layer
andoverlay_layer
layer will be written to the output layer. This is the default.Union
-Computes a geometric union of the input layers. All features and their attributes will be written to the output layer. This option is only valid if both theinput_layer
and theoverlay_layer
contain polygon features.Erase
-Only those features or portions of features in theoverlay_layer
that are not within the features in theinput_layer
layer are written to the output.The default value is ‘Intersect’.
snap_to_input
Optional boolean. A Boolean value indicating if feature vertices in the
input_layer
are allowed to move. The default is false and means if the distance between features is less than thetolerance
value, all features from both layers can move to allow snapping to each other. When set to true, only features inoverlay_layer
can move to snap to theinput_layer
features.output_type
Optional string. The type of intersection you want to find. This parameter is only valid when the
overlay_type
is Intersect.Choice list: [‘Input’, ‘Line’, ‘Point’]
Input
- The features returned will be the same geometry type as theinput_layer
oroverlay_layer
with the lowest dimension geometry. If all inputs are polygons, the output will contain polygons. If one or more of the inputs are lines and none of the inputs are points, the output will be line. If one or more of the inputs are points, the output will contain points. This is the default.Line
- Line intersections will be returned. This is only valid if none of the inputs are points.Point
- Point intersections will be returned. If the inputs are line or polygon, the output will be a multipoint layer.
tolerance
Optional float. A float value of the minimum distance separating all feature coordinates as well as the distance a coordinate can move in X or Y (or both). The units of tolerance are the same as the units of the
input_layer
.output_name
Optional string. If provided, the task will create a feature service of the results. You define the name of the service. If
output_name
is not supplied, the task will return a feature collection.context
Optional string. Context contains additional settings that affect task execution. For
overlay_layers
, there are two settings.Extent (
extent
) - a bounding box that defines the analysis area. Only those features in theinput_layer
andoverlay_layer
and that intersect the bounding box will be overlaid.Output Spatial Reference (
outSR
) - the output features will be projected into the output spatial reference.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
- Returns
result_layer : feature layer Item if
output_name
is specified, else Feature Collection.
#USAGE EXAMPLE: To clip a buffer in the shape of Capitol hill neighborhood. cliped_buffer = overlay_layers(buffer, neighbourhood, output_name="Cliped buffer")
create_route_layers¶
-
arcgis.features.manage_data.
create_route_layers
(route_data_item, delete_route_data_item=False, tags=None, summary=None, route_name_prefix=None, folder_name=None, gis=None, estimate=False, future=False)¶ The
create_route_layers
method creates route layer items on the portal from the input route data.A route layer includes all the information for a particular route such as the stops assigned to the route as well as the travel directions. Creating route layers is useful if you want to share individual routes with other members in your organization.
Parameter
Description
route_data
Required item. The item id for the route data item that is used to create route layer items. Before running this task, the route data must be added to your portal as an item.
delete_route_data_item
Required boolean. Indicates if the input route data item should be deleted. You may want to delete the route data in case it is no longer required after the route layers have been created from it.
When
delete_route_data_item
is set to true and the task fails to delete the route data item, it will return a warning message but still continue execution.The default value is False.
tags
Optional string. Tags used to describe and identify the route layer items. Individual tags are separated using a comma. The route name is always added as a tag even when a value for this argument is not specified.
summary
Optional string. The summary displayed as part of the item information for the route layer item. If a value for this argument is not specified, a default summary text “Route and directions for <Route Name>” is used.
route_name_prefix
Optional string. A qualifier added to the title of every route layer item. This can be used to designate all routes that are shared for a specific purpose to have the same prefix in the title. The name of the route is always appended after this qualifier. If a value for the route_name_prefix is not specified, the title for the route layer item is created using only the route name.
folder_name
Optional string. The folder within your personal online workspace (My Content in your ArcGIS Online or Portal for ArcGIS organization) where the route layer items will be created. If a folder with the specified name does not exist, a new folder will be created. If a folder with the specified name exists, the items will be created in the existing folder. If a value for folder_name is not specified, the route layer items are created in the root folder of your online workspace.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
estimate
Optional boolean. If True, the estimated number of credits required to run the operation will be returned.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
- Returns
result_layer : A list (items) or Item
USAGE EXAMPLE: To create route layers from geodatabase item. route = create_route_layers(route_data_item=route_item, delete_route_data_item=False, tags="datascience", summary="example of create route layers method", route_name_prefix="santa_ana", folder_name="create route layers")
generate_tessellation¶
-
arcgis.features.manage_data.
generate_tessellation
(extent_layer, bin_size=1, bin_size_unit='SquareKilometers', bin_type='SQUARE', intersect_study_area=False, output_name=None, context=None, gis=None, estimate=False, future=False)¶ Generates a tessellated grid of regular polygons.
Parameter
Description
extent_layer
Required layer. A layer defining the processing extent.
bin_size
Optional Float. The size of each individual shape that makes up the tessellation.
bin_size_unit
Optional String. Size unit of each individual shape. The allowed values are: ‘SquareKilometers’, ‘Hectares’, ‘SquareMeters’, ‘SquareMiles’, ‘Acres’, ‘SquareYards’, ‘SquareFeet’, ‘SquareInches’, ‘Miles’, ‘Yards’, ‘Feet’, ‘Kilometers’, ‘Meters’, and ‘NauticalMiles’.
bin_type
Optional String. The type of shape to tessellate. Allowed values are: ‘SQUARE’, ‘HEXAGON’, ‘TRIANGLE’, ‘DIAMOND’, or ‘TRANSVERSEHEXAGON’.
intersect_study_area
Optional Boolean. A boolean defines whether to keep only tessellations intersect with the study area.
output_name
Optional string. If provided, the task will create a feature service of the results. You define the name of the service. If output_name is not supplied, the task will return a feature collection.
context
Optional string. Context contains additional settings that affect task execution. For generate_tesselation, there are two settings.
Extent (extent)-a bounding box that defines the analysis area. Only those features in the input_layer that intersect the bounding box will be analyzed.
Output Spatial Reference (outSR) the output features will be projected into the output spatial reference.
gis
Optional, the GIS on which this tool runs. If not specified, the active GIS is used.
estimate
Optional Boolean. If True, the number of credits to run the operation will be returned.
future
Optional boolean. If True, the result will be a GPJob object and results will be returned asynchronously.
- Returns
FeatureLayer or Feature Layer Collection


When Greg Daues at the National Center for Supercomputing Applications (NCSA) needed to transfer 460 Terabytes of NCSA files from the National Institute of Nuclear and Particle Physics (IN2P3) in Lyon, France to Urbana, Illinois, for a project they were working with FNAL, CC-IN2P3 and the Rubin Data Production team, he turned to the HTCondor High Throughput system, not to run computationally intensive jobs, as many do, but to manage the hundreds of thousands of I/O bound transfers.
The Data
IN2P3 made the data available via https, but the number of files and their total size made the management of the transfer an engineering challenge. There were two kinds of files to be transferred, with 3.5 million files with a median size of roughly 100 Mb, and another 3.5 million smaller files, with a median size of about 10 megabytes. Total transfer size is roughly 460 Terabytes.
The Requirements
The requirement for this transfer was to reliably transfer all the files in a reasonably performant way, minimizing the human time to set up, run, and manage the transfer. Note the noni-goal of optimizing for the fastest possible transfer time – reliability and minimizing the human effort take priority here. Reliability, in this context implies:
Failed transfers are identified and re-run (with millions of files, a failed transfer is almost inevitable) Every file will get transferred The operation will not overload the sender, the receiver, or any network in between
The Inspiration
Daues presented unrelated work at the 2017 HTCondor Week workshop. At this workshop, he heard about the work of Phillip Papodopolous at UCSD, and his international Data Placement Lab (iDPL). iDPL used HTCondor jobs solely for transferring data between international sites. Daues re-used and adapted some of these ideas for NCSA’s needs.
The Solution
First, Daues installed a “mini-condor”, an HTCondor pool entirely on one machine, with an access point and eight execution slots on that same machine. Then, given a single large file containing the names of all the files to transfer, he ran the Unix split command to create separate files with either 50 of the larger files, or 200 of the smaller files. Finally, using the HTCondor submit file command
Queue filename matching files *.txt
the condor_submit command creates one job per split file, which runs the wget2 command and passes the list of filenames to wget2. The HTCondor access point can handle tens of thousands of idle jobs, and will schedule these jobs on the eight execution slots. While more slots would yield more overlapped i/o, eight slots were chosen to throttle the total network bandwidth used. Over the course of days, this machine with eight slots maintained roughly 600 MB/seconds.
(Note that the machine running HTCondor did not crash during this run, but if it had, all the jobs, after submission, were stored reliably on the local disk, and at such time as the crashed machine restarted, and the init program restarted the HTCondor system, all interrupted jobs would be restarted, and the process would continue without human intervention.)


Cicada 3301: Reinvented is an initiative by MSTC and IEEE MTT-S DAIICT to provide students from colleges across India, with a platform to prove their development skills by solving some of the prevelent problems of recent times. The 36 hour hackathon would offer the participants problem statements based on different themes. It will be an open invitation for creative minds to indulge in critical thinking, problem solving and most importantly, to showcase their capabilities in the domain of development. The projects made and the ideas ignited would be the participants’ contribution to open source and the global developer community. By the end of the hackathon, the participating teams are to develop any sort of tech-based solutions to the chosen problem statement.
It would surely be an enriching experience, with a great opportunity to learn. Cicada 3301: Reinvented, with the attractive prizes and goodies it has to offer, is designed to provide the thrust of encouragement for young minds to think, develop and come up with something real!
If your ML project is the most original image project build with SashiDo & Teachable Machine by Google, enter the SashiDo's challenge, make sure you meet the requirements, and win big!
Sandeep Singh is very active in the hackathon developer communities and has mentored and judged 80+ Hackathons. He also has a comprehensive developer background and loves to focus his energy on scalability and innovation.
Alon is a former Mellanox engineer, graduate researcher at the Computer Graphics and User Interfaces Laboratory of Columbia University, and research and teaching assistant in the fields of computer networks and distributed cloud networks.Alon is a Techstars alum, NYC Media Lab alum, a Startup Leadership Program (SLP) fellow, and member of the Virtual World Society. Alon is a speaker on emerging technologies and has given talks at major AR/VR tech conferences in the US and Israel.
Prof. P. M. Jat is the faculty mentor of Microsoft Student Technical Club (MSTC), DAIICT. He holds expertise in the field of database management. He teaches courses related to NoSQL databases, Enterprise Computing, and Object Oriented Programming. He also takes keen interest in the latest trends in development.
His research interests include Requirement Engineering, Experimental Software Engineering, Evidence-based Software Engineering, and more. His teaching interests include but are not limited to Software Engineering, Object-Oriented Software Development and Design of Software System.
Shantanu Vishwanadha is a BlockChain Developer and Community Consultant. Shantanu has over 5 years of experience in solving serious Business problems through technology and building amazing softwares that users love. He has also led multiple global scale communities and consulted few companies on community growth.
By Mr. Akhil Bharati
29th May 2021
7:00 to 8:00 PM
This session will be taken by Mr. Akhil Bharati, Senior Blockchain Engineer at Tezos India.
Akhil is a blockchain developer with 2+ years of experience, he’s been building crypto wallets and writing smart contracts on various blockchain based platforms. Interested in building a decentralised financial ecosystem.
By Ms. Angela Bee Chan
29th May 2021
10:00 to 11:00 PM
Working together as a team can be a challenge when it comes to online Hackathons. There are more distractions, it's harder to keep each other accountable, and communications can be easily lost. However, there are some benefits too! Angela Bee Chan has supported almost 500 hackathons in the past decade and will provide her tips and tricks on managing and mobilizing virtual teams. What you'll takeaway is a one page template for you and your team to complete so you know exactly what to expect to achieve during the Hackathon and how to work together. Join her session to find out more!
Angela Bee Chan has used her participation in Hackathons as her ‘second university degree’! She has mentored, organized and supported almost 500 Hackathons over the past decade.
By Dr. Sanket Patel
22nd May 2021
3:00 to 4:00 PM
There exists a tremendous opportunity in the field of industrial and applied electronics. Whether you consider a high speed communication or industry 4.0; electronics is the backbone for cutting-edge technologies. From day to day life applications to the space and defence sector, the field of electronics has versatile potential that can be explored in diversified industries. Driving to become the technology super power, India is pushing for the best in the field of electronics technology areas. Government is coming up with policies that motivate and nurture the technology start-ups. The talk is intended for the students who are willing to start their own electronics oriented venture and who are passionate to be part of a world that is realizing and advancing technology evolution to have a meaningful impact on our society.
Sanket Patel did his PhD in Electronics from DA-IICT in 2015. He designed and developed the world's most affordable color spectrophotometers that are technologically advanced. In Dec’ 20, he was appointed as a consultant to Bharat Electronics Limited (BEL), Ministry of Defence for collaborative R&D in new technology areas related to electronics defence systems. He currently owns 1 Patent, and 15+ research publications in IEEE, Springer and Wiley. He was offered various grants by Council of Scientific and Industrial Research (CSIR) India, IEEE Students Body, and IEEE India Council.
By Mr. Rajni Kant
23rd May 2021
11:00 AM to 12:00 Noon
Over the last hundred years, the human population has exploded from about 1.5 billion to more than seven billion, driving an ever-increasing demand for resources. Next 50 to 60 years, the known terrestrial reserves of minerals will get exhausted because of its growing consumption by the people of the developing countries. The inquisitive mindset of mankind drove him towards search of other potential habitats, resources, which led him to explore space. In the process mankind began thinking of space exploration and colonization. Asteroids were found to be a vast new source of scarce material and mining of the same could solve mineral scarcity, if the financial and technological obstacles can be overcome. Water and other precious metals and mineral resources could be mined to support humanity’s long-term prosperity. Asteroid mining and In-Space Manufacturing (ISM) will be a key player in space colonization/ Human’s expansion into the solar system and reduces the Deep space project cost drastically. This talk is about Asteroids, their mining, In-Space Manufacturing (ISM) and how it could be beneficial/Cost effective for the Space Exploration and Colonization on other celestial bodies.
He did E.C. Engineering from Punjab Technical University. He is currently pursuing the Ph.D. degree from DA-IICT, Gandhinagar, Gujarat. He joined SAC in 2005 and since then he has been working on high power microwave passive filters and multiplexers using various resonator technologies. He was instrumental in developing state of the art technology based 13 channel Temperature Compensated Ku Band Output (TCKO) Multiplexer. His research interests include Multi mode filter, Temperature compensated filter and filter technologies suitable for space applications at millimetre wave frequencies.
By Mr. Ankit Giri
23rd May 2021
9:00 to 10:00 PM
Ankit Giri, currently working as Security Engineer in DevSecOps practice at JPMorgan, is also an independent security researcher. His areas of interests are web, IoT, mobile app, and cloud security. He is a bug bounty enthusiast and has been featured in the Hall of Fame of EFF, GM, PagerDuty, Sony, AT&T, HTC, Mobikwik, and many others. He is the chapter leader of Peerlyst, Delhi NCR & Test Tribe.
By Mr. Alon Grinshpoon
25th May 2021
9:00 to 10:00 PM
The workshop will show how to quickly create AR/VR apps with no technical skills or coding required and scale existing apps by connecting them to the cloud. Workshop participants will learn how to create real-time cloud-connected augmented and virtual reality (AR/VR) apps using the echoAR platform. Participants are encouraged to bring a laptop and a smartphone, or just follow along the live demonstration. Platforms for experimentation include: Google ARCore, WebXR, Vuforia, Unity-based apps, and more.
Alon is a former Mellanox engineer, graduate researcher at the Computer Graphics and User Interfaces Laboratory of Columbia University, and research and teaching assistant in the fields of computer networks and distributed cloud networks.Alon is a Techstars alum, NYC Media Lab alum, a Startup Leadership Program (SLP) fellow, and member of the Virtual World Society. Alon is a speaker on emerging technologies and has given talks at major AR/VR tech conferences in the US and Israel.
By Mr. Sanjeev Tiwari
26th May 2021
2:30 to 3:30 PM
The speaker will share his journey from being a software developer to product manager, along with the experience and duties concerned with his present profession.
Sanjeev has total 13 years of Industry experience. He has worked in different roles throughout his career journey. He started as a PL/SQL and Java developer, then moved to testing to become an Automation Test Engineer. Later, he moved to consulting role and have helped numerous clients in Operational reporting, Analytics and Workforce Planning. He is currently working as Global Product Manager for Workforce Planning & People Insights at Nestle.
By Mr. Prajjwal Khandelwal
27th May 2021
Setup: 7:00 to 8:00 PM
Hands-On: 9:30 to 10:30PM
Prajjawal Khandelwal is a self-made entrepreneur driven by the vision to democratize and decentralize the Internet. He is a blockchain and crypto evangelist motivated by the need to bring revolution and change in the current industrial trends regarding data privacy and misuse of public data. He is specialized in building blockchains, cryptography, and peer-to-peer networking stacks. He is an active community contributor and a tech enthusiast. He has worked on many projects involving blockchains, decentralized applications, machine vision, and NLP. He is a core contributor of Hyperledger Sawtooth, Corda, and Etherium. He is also actively involved in many open-source projects such as Hedera Hashgraph, Apache Airflow, and Beam.
By Ms. Galicia Gordon
29th May 2021
10:00 to 11:00 AM
The speaker will talk about ways to nurture an idea towards building something real.
Galicia Gordon is the Founder of Leading Learners, a global platform with a mission of supporting students through free and accessible resources. Leading Learners has reached students from all corners of the world, including students from Harvard, Columbia, McGill, Oxford, among several top tier institutes. She started Leading Learners as a student in high school, and has since reached 100,000 students globally. Ask Galicia about tips to starting a global platform, critical design features, UI/UX, student career goals, and overall making more meaningful design and work decisions.
A hackathon is an intense event that brings together designers and developers along with industry experts to identify problems and create software solutions, usually within 24-48 hours.
You must be a school/college/university student. That's it!

Doesn't matter, you are still eligible to apply.
No, you should start working only after the hackathon begins. Pre-written codes may become the reason of your disqualification.
Unfinished or unimpressive (as you think) projects should be presented anyway!
We are offering prizes and goodies worth Rs. 57 lakhs! that includes per-participant goodies worth Rs. 28,000 and a great networking opportunity!
A team should consist of 3-5 members.
Yes! The talks/workshops would be open to everyone. We will keep you folks updated with the schedule and the links to the talks.
Reach out to us at microsoftclub@daiict.ac.in


{% extends "django_data_sync/material/sync_app_model_detail.html" %} {% block page_title %} Copy App Model {% endblock page_title %} {% block breadcrumbs %} {{ block.super }}
Are you sure you want to copy this App Model?


Explore and teaste the beauty of great view and a fresh wind from the ocean read more...
Explore and teaste the beauty of a view on a hill and a night under the moon read more...
Explore and teaste the fact of being higher and above all other building read more...


The website that I will be making will be a site where i post my personal opinions on snacks and foods that can be made or bought for those who are on a budget. It's mostly jusnk food, but in my opinion, they're delicious and worth all the calories.
The foods' data is pulled from a JSON file.
- Page 1
Homepage of main site.
- Page 2
A little page about me.
- Page 3
Good snacks that are drinks.
- Page 4
Good snacks that are little food items.
- Page 5
Good snacks that can be made at home (that can be foods or drinks).


|
| Value |
Description |
Notes |
|
| 01 |
Copies |
Maximum number of copies that may be made of a permitted extract |
| 02 |
Characters |
Maximum number of characters in a permitted extract for a specified usage |
| 03 |
Words |
Maximum number of words in a permitted extract for a specified usage |
| 04 |
Pages |
Maximum number of pages in a permitted extract for a specified usage |
| 05 |
Percentage |
Maximum percentage of total content in a permitted extract for a specified usage |
| 06 |
Devices |
Maximum number of devices in ‘share group’ |
| 07 |
Concurrent users |
Maximum number of concurrent users. NB where the number of concurrent users is specifically not limited, set the number of
concurrent users to zero
|
| 08 |
Percentage per time period |
Maximum percentage of total content which may be used in a specified usage per time period; the time period being specified
as another EpubUsageQuantity
|
| 09 |
Days |
Maximum time period in days (beginning from product purchase or activation) |
| 13 |
Weeks |
Maximum time period in weeks |
| 14 |
Months |
Maximum time period in months |
| 27 |
Days (fixed start) |
Maximum time period in days (beginning from the product publication date). In effect, this defines a fixed end date for the
license independent of the purchase or activation date
|
| 28 |
Weeks (fixed start) |
Maximum time period in weeks |
| 29 |
Months (fixed start) |
Maximum time period in months |
| 10 |
Times |
Maximum number of times a specified usage event may occur (in the lifetime of the product) |
| 22 |
Times per day |
Maximum frequency a specified usage event may occur (per day) |
| 23 |
Times per month |
Maximum frequency a specified usage event may occur (per month) |
| 24 |
Times per year |
Maximum frequency a specified usage event may occur (per year) |
| 21 |
Dots per inch |
Maximum resolution of printed or copy/pasted extracts |
| 26 |
Dots per cm |
Maximum resolution of printed or copy/pasted extracts |
| 11 |
Allowed usage start page |
Page number where allowed usage begins. <Quantity> should contain an absolute page number, counting the cover as page 1. (This
type of page numbering should not be used where the e-publication has no fixed pagination). Use with (max number of) Pages,
Percentage of content, or End page to specify pages allowed in Preview
|
| 12 |
Allowed usage end page |
Page number at which allowed usage ends. <Quantity> should contain an absolute page number, counting the cover as page 1.
(This type of page numbering should not be used where the e-publication has no fixed pagination). Use with Start page to specify
pages allowed in a preview
|
|


Civilization
v1.3.5
Unnamed 0
leading the English Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
leading the English Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
Unnamed 1
leading the Zulu Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
leading the Zulu Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
Unnamed 2
leading the Chinese Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
leading the Chinese Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
Unnamed 3
leading the Aztec Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0
leading the Aztec Civilization
Food: 0
Production: 0
Trade: 0
Offensive Strength: 0
Defensive Strength: 0


Preparation time
less than 30 mins
Cooking time
1 to 2 hours
Serves
Makes 2 x 1kg/2lb 4oz batches of mince
This easy braised mince can be used as a base for lots of recipes and makes enough to freeze half for a quick supper.
Heat half of the vegetable oil in a large pan over a high heat. Add the onions, garlic and herbs and fry for 3-4 minutes, or until softened and golden-brown. Turn off the heat and set the pan aside.
Heat half a tablespoon of the remaining oil in a separate pan over a medium heat. Add a third of the beef mince and fry for 4-5 minutes, or until browned.
Transfer the browned mince to the pan containing the onions, garlic and herbs. Repeat the process twice more with the remaining oil and the remaining batches of mince. (Overloading the pan will not speed things up because the pan will lose heat, so take your time.)
Return the pan containing the cooked mince and vegetables to a medium heat. Add the tinned tomatoes and Worcestershire sauce and stir the mixture well to combine. Bring the mixture to a simmer.
Meanwhile, crumble the stock cubes into a large heatproof jug and add 1 litre/1¾ pints of boiling water. Stir until the stock cubes have dissolved. Add the stock to the beef and bring to a simmer. Simmer for 1 hour, uncovered, or until the volume of liquid has reduced slightly and the sauce has thickened.
The braised mince can be eaten straightaway, served with rice or spaghetti. See the tips sections for other ways to use the mince.


--- title: "Contact" layout: page ---
Whether you would like to get in touch about a future project, or just say hello, all inquiries are welcome! I look forward to hearing from you.
Send me an e-mail


Collects is an anonymized social network in the style of the artist Bunny Rogers, created in 2017 for Rhizome's Seven on Seven by Nozlee Samadzadeh and Bunny Rogers. Create your own collects or view the work of others at collectable.art.
Tap on a collect to edit it. When you swipe on a collect you can 1. make it public or private on collectable.art, 2. close or open it to further additions if you are done collecting, or 3. delete it.
| Select your adoptable ribbon | |
| Create a collect |
Tap on any entry to edit it. Swipe on any entry to delete it. If you have closed a collect, you can view but not make changes to it.
| Go back to your collects | |
| View your collect in a browser (private collects, which aren't shown publicly on collectable.art, are always available via this button) | |
| Rename your collect | Select a template to format your collect |
| Create a new entry in your collect |
You can add text and/or an image to each entry. If you have closed a collect, you can view but not make changes to its entries.
| Save changes to your entry and go back to your collect. |


- canBook() - Method in enum padsof.UserType
-
This function indicates if a certain UserType can book an offer.
- canOffer() - Method in enum padsof.UserType
-
This function allows to know if a type of user can make an offer
- canRegister() - Method in enum padsof.UserType
-
This function allows to know if a type of user can register apartments.
- canRent() - Method in enum padsof.UserType
-
This function allows to know if the type of user can rent apartments.
- charToUserType(String) - Static method in enum padsof.UserType
-
This function allows us to convert a certain 'code' to an element of the
enumeration.
- check(Offer) - Method in interface Filters.Filter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.LongTimeFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.PostalCodeFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.PriceFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.RatingFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.ShortTimeFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.StatusFilter
-
Function that checks if certain offer pass the filter
- check(Offer) - Method in class Filters.TypeStayFilter
-
Function that checks if certain offer pass the filter
- comment1 - Variable in class Testing.CommentaryTest
-
- comment1 - Variable in class Testing.OfferTest
-
- comment1 - Variable in class Testing.RatingTest
-
- comment1 - Variable in class Testing.RegisteredUserTest
-
- comment1 - Variable in class Testing.TextualTest
-
- comment2 - Variable in class Testing.CommentaryTest
-
- Commentary - Class in padsof
-
- Commentary(RegisteredUser, GregorianCalendar) - Constructor for class padsof.Commentary
-
This constructor allows us to create a new commentary.
- CommentaryTest - Class in Testing
-
- CommentaryTest() - Constructor for class Testing.CommentaryTest
-
- commentator - Variable in class padsof.Commentary
-
- commentCommentary(Commentary) - Method in class padsof.Commentary
-
This function allows us to comment our commentary.
- commentOffer(Commentary) - Method in class padsof.Offer
-
This function allows to add a new comment to the offer
- comments - Variable in class padsof.Offer
-
- comments - Variable in class padsof.RegisteredUser
-
- comments - Variable in class Testing.OfferTest
-
- comments - Variable in class Testing.RegisteredUserTest
-
- commentsArray - Variable in class padsof.Application
-
- commentsArray - Variable in class padsof.Commentary
-
- createApartment(int, String, String, RegisteredUser) - Method in class padsof.Application
-
This method creates and initializes a new Apartment and adds it to the array.
- createOffer(float, Apartment, RegisteredUser, GregorianCalendar, int, int, int) - Method in class padsof.Application
-
This method creates and initializes a long stay offer and adds it to the array of offers
- createOffer(float, Apartment, RegisteredUser, GregorianCalendar, GregorianCalendar) - Method in class padsof.Application
-
This method creates and initializes a short stay offer and adds it to the array of offers
- creditCard - Variable in class padsof.RegisteredUser
-


FLUX CONNECTS THE BEST PATRONS WITH YOUR VENUE
Interested in partnering with FLUX?
GET FLUX FOR YOUR VENUEInterested in partnering with FLUX?
GET FLUX FOR YOUR VENUEFLUX provides a better experience for your best customers while adding more value to your venue.
Never leave a good client standing outside and never watch potential customers take their business elsewhere.
FLUX helps you offer the seamless experience your clients want.


How does JavaScript compare to HTML and CSS?
HTML and CSS could be described as more of a two-dimensional struture. HTML is like the the bones and basic elements
required of a website. CSS then adds more dimension in terms of appearance and style.
Javascript is more three-dimensional, using more interactive elements with the user, such as drop-down menus, or slideshows, or hiding content on a page.
Explain control flow and loops using an example process from everyday life, for example 'waking up' or 'brushing your teeth'.
One example of control flow could be deciding what to have for breakfast, if there is bread available, you will east this for breakfast. You will continue to have bread until
all of the bread is gone. If there is no bread, you will have a banana instead. An if statement would be used here to figure out what you'll have,
if there is bread, you will eat the bread, or else, you will have a banana.
When eating the bread each day, a loop could be used to describe this. The loop is repeated, ie you eating bread, until the condition is met. That
condition would be that the bread is all gone. Hopefully this helps explain how control flow and loops could be used to describe everyday decisions.
Explain the difference between accessing data from arrays and objects.
When accessing data from an array, you need o specify where in the array the data is kept, as arrays are arranged in an orderly fashion.
Objects however, run on more of a label system, so you could find what you are looking for by writing in the data's label or "topic".
Explain what functions are and why they are useful.
Functions are code used to perform tasks and can return values. In order for it to perform a task, it needs to be called, using a name in which it was defined.
A Function only needs to be defined once, but are useful because they can be used multiple times once defined, which makes your code more efficient.
They're also useful in the way that you can provide the same function with different data, which can allow it to produce different results.


Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.
Lorem Ipsumis simply dummy text of the printing and typesetting industry. Lorem Ipsumis simply dummy text of the printing and typesetting industry.
See more


| CCE ID | Rule Title | Description | Rationale | Variable Setting | NIST 800-53 Mapping |
| Shutdown System When Auditing Failures Occur | The macOS system must shut down by default upon audit failure unless availability is an overriding concern. | The audit service should shut down the computer if it is unable to audit system events. Once audit failure occurs, user and system activity is no longer recorded and malicious activity could go undetected. Audit processing failures include software/hardware errors, failures in the audit capturing mechanisms, and audit storage capacity being reached or exceeded. Responses to audit failure depend on the nature of the failure mode. | AU-5(b) |
||
| Enable audit Service | The audit service is an essential userspace component of
the auditing system, as it is responsible for writing audit records to
disk. |
Without establishing what type of events occurred, when they
occurred, and by whom, it would be difficult to establish, correlate,
and investigate the events leading up to an outage or attack.
Audit record content that may be necessary to satisfy this requirement includes, for example, time stamps, source and destination addresses, user/process identifiers, event descriptions, success/fail indications, filenames involved, and access control or flow control rules invoked. Associating event types with detected events in the operating system audit logs provides a means of investigating an attack, recognizing resource utilization or capacity thresholds, or identifying an improperly configured operating system. |
AU-3 AU-3(1) AU-8(a) AU-8(b) AU-12(3) AU-14(1) |


-webkit-box-flex-group
Specifies groups of dynamically resizing elements that are adjusted to be the same size.
During size adjustment of flex boxes, any boxes with the same group number are adjusted to be the same size.
This property applies only to flexible box layouts. For more information about flexible boxes, see http://www.w3.org/TR/css3-layout/.
-webkit-box-flex-group: <group_number>;
The group number of the flexible element. Integer, nonnegative value.


Select an .oar file to load into {{oar.current.name}}. This is a long-running asynchronous task, please patiently monitor your region as it loads the file..
This is a Var region, here are advanced options for loading displaced oars into larger regions
This oar file may cause problems if you load it onto a normal region, or onto a smaller var region.


CHAPTER THREE. PARSING
are called LL(1). This stands for
Left-to-right parse, Leftmost-derivation,
1-symbol lookahead
. Clearly a recursive-descent (predictive) parser exam-
ines the input left-to-right in one pass (some parsing algorithms do not, but
these are generally not useful for compilers). The order in which a predic-
tive parser expands nonterminals into right-hand sides (that is, the recursive-
descent parser calls functions corresponding to nonterminals) is just the order
in which a leftmost derivation expands nonterminals. And a recursive-descent
parser does its job just by looking at the next token of the input, never looking
more than one token ahead.
We can generalize the notion of FIRST sets to describe the ﬁrst
k
tokens of
a string, and to make an LL(
k
) parsing table whose rows are the nonterminals
and columns are every sequence of
k
terminals. This is rarely done (because
the tables are so large), but sometimes when you write a recursive-descent
parser by hand you a need to look more than one token ahead.
Grammars parsable with LL(2) parsing tables are called LL(2) grammars,
and similarly for LL(3), etc. Every LL(1) grammar is an LL(2) grammar, and
so on. No ambiguous grammar is LL(
k
) for any
k
.
ELIMINATING LEFT RECURSION
Suppose we want to build a predictive parser for
Grammar 3.10.
The two
productions
E
→
E
+
T
E
→
T
are certain to cause duplicate entries in the LL(1) parsing table, since any
token in FIRST
(
T
)
will also be in FIRST
(
E
+
T
)
. The problem is that
E
appears as the ﬁrst right-hand-side symbol in an
E
-production; this is called
left recursion
. Grammars with left recursion cannot be LL(1).
To eliminate left recursion, we will rewrite using right recursion. We intro-
duce a new nonterminal
E
′
, and write
E
→
T E
′
E
′
→
+
T E
′
E
′
→
This derives the same set of strings (on
T
and
+
) as the original two produc-
tions, but now there is no left recursion.
52


Isotope Mass Abundance Spin Mag Moment
12C 12.000000 98.90% 0 13C 13.003355 1.10% 1/2 +0.70241
C I Ground State 1s22s22p2 3P0 Ionization energy 90820.45 cm-1 (11.26030 eV) Ref. J66 C II Ground State 1s22s22p 2P°1/2 Ionization energy 196664.7 cm-1 (24.3833 eV) Ref. MG93


Jasmin Arensdorf
Guessing game questions:
- Can I speak French?
- Do I like to watch science fiction movies?
- Have I ever snorkled?
- Have I gone zip lining?
- Do I know how to fix a leaky faucet?
- Guess a number between 1 to 10.
- Guess the color of one of my raincoats.
The colors of my raincoats are:


Sometimes, a detective or police officer, no matter how great, simply needs help from time to time. It's no big deal, really. The Baker Street Regular is that child that finds himself in the situations with the hero, especially the dangerous ones.
Your first run in with the Baker Street Regular is likely while he is searching through the hero's home or office or stealing something to eat because he cannot afford it. If he is not related to the hero in any way, expect him to have no family, except for maybe a sibling or two, but he is almost always the eldest, and almost always male. If he is an orphan, after scratching his back a couple times, expect him to be forever indebted to you and to get you out of a sticky situation in the nick of time, but don't expect him to just leave. You're stuck with him.
After you manage to win the respect of the Baker Street Regular, he will be an invaluable tool and assistant to your group. Life on the street is going to make him able to hear rumors that you won't be able to while you are out on your investigations. He is always good at hiding, especially in situations where the Big Bad is nearby.
The Baker Street Regular is a pun on the Trope Namer, the Baker Street Irregulars, a mob of orphaned street urchins often employed by Sherlock Holmes to gather rumors, spy, and do various odd jobs. In return for their discretion and loyalty he paid what was, to them, an outrageous sum of money.
"By heavens, Holmes," I said, half rising, "I believe that they are really after us."
"No, it's not quite so bad as that. It is the unofficial force — the Baker Street irregulars."
 There was some show of discipline among them, despite their tumultuous entry, for they instantly drew up in line and stood facing us with expectant faces. One of their number, taller and older than the others, stood forward with an air of lounging superiority which was very funny in such a disreputable little scarecrow.
See also The Informant, who is usually somewhat older and portrayed rather less sympathetically.
Examples:
- Subverted in Black Butler. Doll, aside from not being the eldest (though that is justified due to her elder "siblings" being Genre Blind), gives Ciel help, covers for him, and fits this trope to a T before Ciel goes into an episode and orders for her death.
- In Detective Conan, Ayumi, Genta, and Mitsuhiko, the Detective Boys. They're even referred to as Baker Street Irregulars in an arc. They literally play this when they entered the cyberspace Victorian England AU in the Non-Serial Movie Phantom of Baker Street.
- As the plot approaches the end of Slayers Next, one of these attempts to pickpocket the party, but eventually joins them and befriends Martina. Subverted, as he's the Big Bad.
- In the Post-Crisis retelling of his origin, this is how Jason Todd first met Batman. He was trying to steal the Batmobile's hubcaps at the time.
- The Newsboy Legion are nothing if not this trope. Primarily they are this for the Guardian, but they also work with Jimmy Olsen and Superman. Guardian took them in and became their legal guardian in his secret identity.
- Marvel Comics had its own Newsboy Legion equivalent in Teen Brigade, a team of ham radio buffs (led by Hulk's buddy Rick Jones) who helped superheroes network. They were actually partially responsible for the founding of The Avengers.
 Also appears in the film.
- Modesty Blaise: Samantha 'Sam' Brown is an East End kid who attends a martial arts class run by Willie. She and her gang of street urchins sometimes fill this role for Willie and Modesty.
- Charlie Chaplin in Shanghai Knights.
- Short Round in Indiana Jones and the Temple of Doom.
- The street urchin Toto in American Ninja 2, who never forgets to demand money for service rendered.
- The kid Manco pays to keep tabs on Mortimer in For a Few Dollars More fits the bill.
- Averted with the Blue Blaze Irregulars in The Adventures of Buckaroo Banzai Across the 8th Dimension. They're not all kids, they're not all urchins or orphans, and there is (according to the book, anyway) a training program, required progress in education, and other requirements.
- Subverted in The Arrival when the kid who hooks up with the protagonist turns out to be a spy sent by the aliens. In fact he's an alien himself.
- A Walk Among the Tombstones. T.J. provides both street-smarts and computer literacy to the private eye protagonist, who doesn't have any computer skills.
- The Baker Street Irregulars from Sherlock Holmes, who inspired the trope name.
- They're of great help even in the first case Watson sees, tracking down a singular cab in the entirety of London.
- Deconstructed in the officially approved pastiche The House of Silk, when one of them gets killed, brutally, because they took a mission.
- Akechi Kogoro had several as well, including Yoshio Kobayashi, who later became famous for something else entirely.
- Solar Pons has the Praed Street Irregulars.
- Discworld:
- Nobby Nobbs is introduced in Night Watch as one of these. Vimes sees Nobby spying on him for a whole slew of people, and begins paying Nobby to, in turn, spy on them.
- Sometimes members of the Beggar's Guild, although largely adults and therefore on the very fringes of the trope, act as this for Lord Vetinari as one of many information-gathering channels (it's implied that someone who may in some small way be connected to him spreads rumors that he pays for information, so that they'll come volunteer it to him instead of him needing to send someone looking). It's implied Vimes occasionally gets information from them as well.
- Ostap Bender from Ilya Ilf and Eugene Petrov's The Twelve Chairs employed them to track one of the titular, possibly treasure-holding chairs.
- Ben Fischer had apparently started as this in his Backstory in Hell House, before his powers awakened.
- In The Eagle and the Nightingales, Nightingale hires a group of street children to be her eyes and ears.
- In Honor Harrington while on a secret mission to Mesa, Victor Cachat employees a number of street urchins to serve as a spies and couriers. The Mesan organized crime bosses also employ lots of these. And Victor himself served as one to Noveau Paris' criminal elements in his youth.
- Varys Kingfisher, the royal spymaster in A Song of Ice and Fire, is implied to employ mute (because he had their tongues cut out to prevent idle gossip) yet literate (so they can read secret documents without stealing them) children who wander the sewers and low places of King's Landing as his "little birds."
- Maya from Garrett, P.I. started out as this, hiring out members of the street gang she leads (the Sisters of Doom) to Garrett for information-gathering tasks. Subverted when she grows up enough to decide she'd rather be his Love Interest instead.
- In the Heralds of Valdemar series, Mags rescues gangs of street kids forced to work as thieves for various cruel men and recruits them to unofficially be informants for the Crown (and officially as runners and messenger boys.)
- Game of Thrones: Lord Varys has an Irregulars network he refers to as his "little birds." These in later days fall into the employment of Qyber, the necromancing dishonored Maester put on the Small Council by Cersei Lannister.
- The Pretender episode "Back from the Dead... Again" has Bruno who gets recruited by Jarod to help him for the episode.
- Fittingly for a reimagining of Sherlock Holmes himself, Sherlock has Bill Wiggins, a heroin addict who doubles as a chemistry genius. The pilot episode introduces Sherlock's "homeless network," who are an obvious stand-in for the Irregulars.
- Dirk Gently knows a Hollywood Hacker who happens to be twelve. And gets paid with cigarettes.
- Kamen Rider and Kamen Rider V3 had the Boys' Kamen Rider Squad, a fanclub consisting mostly of preteen boys who would contact the heroes via radio if they spotted suspicious activity.
- Kamen Rider Super-1 had the Junior Rider Team, but they were more an example of Tagalong Kids, trying to investigate things on their own, getting captured, and needing to be rescued by Super-1.
- Kamen Rider Double, who actually is a detective, has a network of informants he calls the Fuuto Irregulars; however, none of them really fit this trope. The closest it gets is with Queen and Elizabeth, a pair of high school students who were already informants for Shotaro before coming to him with a case partway through the series.
- Billy, the page boy to William Gillette's Sherlock Holmes, who was adapted from a similar character in the original Holmes novels.
- Lilly in Ceville.
- The Black Ravens Gang in Professor Layton and the Last Specter is composed entirely of these. In a minor sense, Luke and Flora may also qualify, although they're not street urchins, Flora doesn't help much with the investigations and Luke's parents are still alive and well.
- Brynn from Dreamfall: The Longest Journey acts this way towards April.
- In Mass Effect, Thane would sometimes employ street urchins to gather intelligence for him.
- Clara O'Dea and her urchins in Assassin's Creed: Syndicate. Considering the Victorian London setting, almost certainly a tip of the hat to the Trope Namer.
- Kit Cloudkicker in TaleSpin. Molly can also apply in most episodes she's in.
- Sherlock Holmes in the 22nd Century has the new Baker Street Irregulars: soccer player Wiggins, the Eliza Doolittleish Deidre, and the paraplegic Tennyson (who communicates through electronic beeps only Holmes seems to comprehend ironically).


The DQNSolver
allows to take actions in an environment and adapt it's decision making over time through environmental feedback.
The following UML-Class diagram shows the composition of the Solver:
The construction of a solver requires instances of the Classes DQNEnv
and DQNOpt
.
These instances provide all necessary information about the environment and the decision-making and learning of the Agent.
numberOfStates
describes the length of the Vector (s) of observationsnumberOfActions
describes the number of potential actions to choose fromnumberOfHiddenUnits
: amount of hidden units in the hidden layer of the neural networktrainingMode
: mode of training, defines the explorative behaviour of the solver (decaying or stable)epsilon
: static exploration rate (during non-training mode)epsilonMax
, epsilonMin
, epsilonDecayPeriod
: linear decay of exploration during training modealpha
: discount factor for the network updategamma
: discount factor for the Bellmann functiondoLossClipping
: controll flag for the clipping of the loss function during learninglossClamp
: the size of the loss clippingdoRewardClipping
: controll flag for the clipping of the injected rewardrewardClamp
: the size of the reward clippingexperienceSize
: size of the replay memoryreplayInterval
: interval of memory replayreplaySteps
: size of the replay sample
The solver provides primarily two methods.
The decide
-method allows for the decision making and the learn
-method enables the adaptive learning of the solver.
To decide upon an action the solver needs a vector (s: Array<number>
) of current observations (states) and it then returns the index of the action (a: number
) to be executed.
After the action was executed the solver takes an integer reward (r: number
) to learn
from the effectivity of the action.
The appended scheme gives a brief overview of the concept of the solver.
As seen, the DQNSolver
is constructed with a set of hyperparameters defined via DQNOpt
and the description of the environment defined by DQNEnv
.
The solver is then enabled to make decisions based on a set of observations (s).
The decision making can then be influenced by providing a reward value.
Assuming the solver has decided and learned at least once, the state and action of the current iteration plus the reward, state and action of the last iteration resolve into an experience (called sarsa-tuple) for the replay memory. When aiming for a stable learning, the clipping of the reward and loss is recommended.
For further information please consult the research paper of Mnih et al. (2015) "Human-level control through deep reinforcement learning"


One of the issues that has been really difficult for me to solve with this project is coming up with a good networking protocol. In netsnek, there are servers and players. The game is snake/tron, so the only major information players need to receive from the server is the location of other players. The only major information the server needs to receive from the player is the direction in which the player wants to move. There’s some other info like leaderboards and when the game starts but that’s unrelated to my issue.
My issue is that when sending all the player/server data, either not all of the data is getting through, or the data is getting through too slowly (there’s a lot of lag). This issue pertains to sending and receiving directional/map data between the server and player because as the number of players goes up, the amount of network traffic caused by this communication also increases significantly. My network protocol needs to be reliable, lightweight, and fast.
Here are some things I’ve tried.
My first network protocol was to just send the players the entire map from the server, with the locations of every single snake, every single frame. This, of course, is highly inefficient, but because of the redundant information, it’s not that big of a deal if a packet isn’t received, the user’s display will still update properly when the next packet is sent a fraction of a second later. The issue with this approach is lag. With one or two players, this approach works well, but when you scale up to 5-6 players, the lag starts to become very noticeable. This is because as the number of players increase, not only are you broadcasting more transmissions for each of the new players, you’re also broadcasting larger transmissions, as the size of the map increases proportionally with the number of players. Therefore lag increases quadratically with the number of players, and in a fast-paced game like snake, lag makes the game almost unplayable.
My next and current approach at the time of writing this post was to only update pieces of the map that changed. The server would save the state of the map at the last broadcast and would compare the current state to the state at the last broadcast. If there were differences in any points of the map, the server would then send those differences to the players, and the players would update their screens accordingly.
This approach worked well in solving the lag problem; the game can now support its max of 9 players without any noticeable lag. However, it caused a separate issue. Sometimes not all of the packets would go through, and when this happened, the failed broadcasts would create gaps in the player maps. It caused situations where players would think that squares were empty, but there were actually snake pieces there. I’m not really sure why this is happening, the java socket class uses the TCP protocol, which theoretically ensures the delivery of practically every packet. I think the issue might not be related to the transmission of the packets, but to the reception. I’m using Inputstreamreaders to receive the data so I theorized that the dropped packets could be caused by a buffer overflow on the player end.
To test this theory, I created a separate thread to empty the player buffer and place data into a separate queue as soon as it’s received. This way, I could be sure that there’s no buffer pileup caused by the main thread waiting on the GUI to draw. However, even after making sure that the buffers weren’t filling up, I still had some lost packets.
I think the next approach I’m going to try is a combination of the first two ideas. I’m only going to be transmitting the data for movements that need to be updated, but I’ll transmit that data a few times to ensure the message goes through. I’ll also combine transmissions. Right now, I update each coordinate independently, so basically if 4 snakes move in a frame, I send 4 different packets with snake locations. This makes the packets small but does create a lot of packets. It might help if I combine these transmissions all into a single broadcast. I hope this method works because I really want to work on a different part of the project like the GUI and settings.
I’ll keep you posted on the results.


fun setPreviewFrameListener(listener: (image: Image) -> Unit): CameraView
Set preview frame listener. Be careful while using this listener as it is invoked on each frame, which could be 60 times per second if frame rate is 60 fps. Ideally you should only process next frame once you are done processing previous frame. Don't continuously launch background tasks for each frame, it is not memory efficient, the device will run out of memory very quickly and force close the app.
CameraView(context).apply {
val processing = AtomicBoolean(false)
addCameraOpenedListener { Timber.i("Camera opened.") }
setPreviewFrameListener { image: Image ->
if (processing.compareAndSet(false, true)) {
val result = GlobalScope.async { /* Some background image processing task */ }
result.invokeOnCompletion { t ->
val output = result.getCompleted()
/* ... use the output ... */
// Set processing flag to false
processing.set(false)
}
}
}
addPictureTakenListener { imageData: ByteArray -> Timber.i("Picture taken successfully.") }
addCameraClosedListener { Timber.i("Camera closed.") }
}
listener
- lambda with image of type Image as its
argument which is the preview frame.
It is always of type android.graphics.ImageFormat.YUV_420_888
Return
instance of CameraView it is called on


Nanakuli youngsters learn a 4-stringed instrument that isn’t the ukulele
by Jim MendozaHONOLULU, Hawaii (HawaiiNewsNow) - On Wednesday afternoons, music fills the Boys & Girls Club in Nanakuli.
Youngsters are learning to play a four-stringed instrument ― and it isn’t the ukulele.
"The violin was something that we wanted to bring to the West Side," said Claudia "Lala" Fernandez.
As director of operations for the Boys & Girls Club of Hawaii, Fernandez partnered with the Hawaii Youth Symphomy to bring music instructors and instruments to the Nanakuli clubhouse.
“It’s not often that our elementary youth along our coast line gets to experience orchestra music,” she said.
The weekly violin class is HYS's first classical music program on the Leeward Coast.
“To see the joy on their faces when they hear an instrument or they see it, they get to hold it and touch it. They’re like, ‘Wow!’ It’s so cool because violins are cool," HYS president Randy Wong said.
About 20 kids, grades 2 to 6, immediately signed up when violin lessons started in September. The benefits have extended beyond music.
"It's making them do well academically in school, also in their social well-being when they're here in the club," Fernandez said.
HYS is using a grant from Carnegie Hall to increase children’s access to classical music and music education. Statewide, about 750 kids participate in the youth symphony’s orchestra programs and jazz bands in Clubhouse classes.
"We've just been thinking a lot about what can we do to make music a right and not a privilege. That's our vision and that's our aspiration," Wong said.
The plan is to slowly introduce other instruments into Nanakuli's music program.
"I'm hoping one day our Nanakuli clubhouse will have a symphony band or orchestra where they're able to go out and perform in partnership with Hawaii Youth Symphony at different events throughout the community," Fernandez said.
Next month, the student violinists will perform for their parents. And someday, they could be playing on a much bigger stage.
Copyright 2019 Hawaii News Now. All rights reserved.


Inline Text (taken in part from pagedown-extra's demo)
This is the *first* editor.
------------------------------
Just plain **Markdown**, except that the input is sanitized:
Here's a footnote![^1]
[^1]: And here's the footnote's actual content...
# Markdown Extra
## Tables
| Item | Value |
| ---------------- | -----:|
| Air Conditioner | $1600 |
| Phone | $12 |
| *Pipe* | $1 |
## Fenced Code Blocks
```javascript
var foo = "bar";
```
- One
- Two
- Three
Text via attribute


Works
Here are few of my works
Tribute Page
Survey Form
Product Landing Page
Documentation Page
Contacts
You can find me on...
Github
Linkedin


|
Standard Reference Data Program |
Data Gateway |
Chemistry WebBook |
Go To: Top, Constants of diatomic molecules, References, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Data evaluated as indicated in comments:
L - S.G. Lias
Data compiled as indicated in comments:
LL - S.G. Lias and J.F. Liebman
LBLHLM - S.G. Lias, J.E. Bartmess, J.F. Liebman, J.L. Holmes, R.D. Levin, and W.G. Mallard
LLK - S.G. Lias, R.D. Levin, and S.A. Kafafi
RDSH - H.M. Rosenstock, K. Draxl, B.W. Steiner, and J.T. Herron
B - J.E. Bartmess
View reactions leading to C2+ (ion structure unspecified)
| Quantity | Value | Units | Method | Reference | Comment |
|---|---|---|---|---|---|
| IE (evaluated) | 11.4 ± 0.3 | eV | N/A | N/A | L |
| EA (eV) | Method | Reference | Comment |
|---|---|---|---|
| 3.2730 ± 0.0080 | LPES | Arnold, Bradforth, et al., 1991 | B |
| 3.265 ± 0.022 | LPES | Ervin, Gronert, et al., 1990 | B |
| 3.391 ± 0.017 | LPD | Jones, Mead, et al., 1980 | B |
| 3.30 ± 0.10 | LPES | Yang, Taylor, et al., 1989 | EA given is Vertical Detachment Energy. probably linear structure.; B |
| 3.540 ± 0.050 | PD | Feldman, 1970 | B |
| >2.90 ± 0.50 | EIAE | Thynne and MacNiel, 1971 | From C2H4; B |
| 3.30 ± 0.20 | EIAE | Locht and Momigny, 1970 | From C2H2, C2H4; B |
| >2.9 | EIAE | Trepka and Neuert, 1963 | From C2H4; B |
| 4.0 ± 1.0 | EIAE | Honig, 1954 | From graphite; B |
| IE (eV) | Method | Reference | Comment |
|---|---|---|---|
| 11.41 ± 0.30 | CIEL | Reid, Ballantine, et al., 1995 | LL |
| 11.92 ± 0.09 | DER | Plessis and Marmet, 1986 | LBLHLM |
| 12.15 | DER | Huber and Herzberg, 1979 | LLK |
| 11.1 ± 0.5 | EI | Gupta and Gingerich, 1979 | LLK |
| 10.9 ± 0.4 | EI | Cocke and Gingerich, 1974 | LLK |
| 11.1 ± 1.0 | EI | Cocke and Gingerich, 1972 | LLK |
| 12.0 ± 0.6 | EI | Drowart, Burns, et al., 1959 | RDSH |
| 13. | EI | Field, Franklin, et al., 1957 | RDSH |
Go To: Top, Gas phase ion energetics data, References, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Data compiled by: K.P. Huber and G. Herzberg
| State | Te | ωe | ωexe | ωeye | Be | αe | γe | De | βe | re | Trans. | ν00 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Theoretical work and potential functions Read and Vanerslice, 1962 Fougere and Nesbet, 1966 Verhaegen, Richards, et al., 1967 Verhaegen, 1968. | ||||||||||||
| F 1Πu | [75456.9] | [1557.5] Z | 1.645 | 0.019 | 0.000006 | 1.307 | F ← X R | 74532.9 Z | ||||
| missing citation | ||||||||||||
| g 3Δg | [73183.6] 1 | [1458.06] Z | 1.5238 | 0.170 | 0.0000066 | 1.3579 | g ← a R | 71649.6 Z | ||||
| missing citation | ||||||||||||
| f 3Σg- | 71045.8 | 1360.5 Z | 14.8 | 1.448 2 | 0.04 3 | 0.006 | 0.000010 | 1.393 | f ← a R | 70188.4 Z | ||
| missing citation | ||||||||||||
| State | Te | ωe | ωexe | ωeye | Be | αe | γe | De | βe | re | Trans. | ν00 |
| E 1Σg+ | 55034.7 | 1671.50 Z | 40.02 | 0.248 | 1.7897 | 0.0387 4 | -0.00055 | 0.0000083 | 0.0000006 | 1.2529 | E → A 5 V | 46668.3 Z |
| missing citation | ||||||||||||
| d 1Σu+ | 43239.44 | 1829.57 Z | 13.94 | 1.8332 6 | 0.0196 | 0.00000732 6 | 1.238 | D ↔ X 7 | 43226.74 6 Z | |||
| missing citation; Norrish, Porter, et al., 1952; Messerle, 1968 | ||||||||||||
| e 3Πg | 40796.65 8 | 1106.56 Z | 39.26 | 2.805 9 | 1.1922 | 0.0242 | 0.0000063 | 0.00000029 | 1.5351 | e → a 10 R | 39806.46 Z | |
| missing citation | ||||||||||||
| C' 1Πg | Preliminary constants from perturbations in C 1Πg; see Messerle and Krauss, 1967. | |||||||||||
| State | Te | ωe | ωexe | ωeye | Be | αe | γe | De | βe | re | Trans. | ν00 |
| C 1Πg | 34261.3 | 1809.1 Z | 15.81 11 | 1.7834 | 0.018 11 | 0.0000068 | 1.2552 | C → A 12 VR | 25969.19 Z | |||
| Dieke and Lochte-Holtgreven, 1930; Herzberg and Sutton, 1940; Herzberg, 1945; Cisak, Dabrowska, et al., 1969 | ||||||||||||
| d 3Πg | 20022.50 13 | 1788.22 Z | 16.440 | -0.5067 14 | 1.7527 15 | 0.01608 | -0.001274 | 0.00000674 | 0.000000103 | 1.2661 | d ↔ a 16 VR | 19378.44 Z |
| missing citation; Bugrim, Lyutyi, et al., 1965; missing citation; Phillips and Davis, 1968 | ||||||||||||
| (d ← X) 17 | ||||||||||||
| c 3Σu+ | 13312.1 | 1961.6 18 | 13.7 | 1.87 18 | 1.23 | |||||||
| A 1Πu | 8391.00 | 1608.35 Z | 12.078 | -0.0119 | 1.6134 20 | 0.01686 19 | -0.000054 | 0.00000644 19 | 0.000000036 | 1.31843 | A ↔ X 21 R | 8268.16 Z |
| Ballik and Ramsay, 1963 | ||||||||||||
| State | Te | ωe | ωexe | ωeye | Be | αe | γe | De | βe | re | Trans. | ν00 |
| b 3Σg- | 6434.27 | 1470.45 Z | 11.19 | 0.028 22 | 1.49852 23 | 0.01634 | -0.000087 24 | 0.00000622 | 1.36928 | b → a 25 R | 5632.7 Z | |
| missing citation | ||||||||||||
| a 3Πu | 716.24 26 | 1641.35 Z | 11.67 | 1.63246 27 | 0.01661 | 0.00000644 | 1.31190 | |||||
| X 1Σg+ | 0 | 1854.71 Z | 13.340 28 | -0.172 28 | 1.81984 | 0.01765 28 | -0.00023 | 0.00000692 28 | 0.000000081 | 1.24253 |
| 1 | A0= -8.8+0.020J; A1= -7.4. |
| 2 | Spin splitting constant λ ~0.41. |
| 3 | missing note |
| 4 | Rotational constants reevaluated; Freymark, 1951 gives Be = 1.7930, αe = 0.0421. |
| 5 | Franck-Condon factors Halmann and Laulicht, 1966; electronic transition moment Cooper and Nicholls, 1975. |
| 6 | From Messerle, 1968; slightly different constants in Landsverk, 1939. βe~3E-8. |
| 7 | Radiative lifetime τ=l4.6 ns Smith, 1969, f00= 0.055 Smith, 1969. The corresponding electronic transition moment is in only moderate agreement with Cooper and Nicholls, 1975. Franck-Condon factors Nicholls, Fraser, et al., 1959, Halmann and Laulicht, 1966. |
| 8 | A not determined, but much smaller than for a 3Πu. |
| 9 | ωeze= -0.1271. |
| 10 | Franck-Condon factors Nicholls, Fraser, et al., 1959, Jain, 1964, Halmann and Laulicht, 1966: el. trans. moment Cooper and Nicholls, 1975. |
| 11 | The ΔG and Bv curves are irregular Phillips, 1950, Messerle and Krauss, 1967, 2 and cannot be represented by the constants given without the use of higher order terms. The perturbation is strongest near v=5. Breaking-off at high J observed Messerle and Krauss, 1967 in v=0, 1, 2. |
| 12 | Franck-Condon factors Nicholls, Fraser, et al., 1959, Halmann and Laulicht, 1966; el. trans. moment Cooper and Nicholls, 1975. |
| 13 | A= -16.9. |
| 14 | Kini and Savadatti, 1969 have observed bands up to v'=14 |
| 15 | Numerous small perturbations by higher levels of b 3Σg- Callomon and Gilby, 1963 and X 1Σg+ Phillips, 1968 and by unidentified states. Swan bands emitted in low-pressure oxy-acetylene flames show a distinct intensity alternation ascribed to excitation by collisions with c 3Σu+ carbon molecules Bleekrode and Nieuwpoort, 1965, Bleekrode, 1967. Under certain conditions in discharges through CO the v'=6 progression of the Swan system appears almost exclusively and was at one time considered as a separate band system, the so-called high-pressure bands of carbon Herzberg, 1946, Kunz, Harteck, et al., 1967, Meinel and Messerle, 1968*. Isotope studies Dhumwad and Narasimham, 1968 leave no doubt that the high-pressure bands are the v'=6 progression of the Swan system. |
| 16 | Radiative lifetime τ = 170 ns Smith, 1969, in reasonable agreement with Fink and Welge, 1967 but much shorter than Jeunehomme and Schwenker, 1965. f values obtained from the lifetime measurements as well as by other methods Fairbairn, 1966, Harrington, Modica, et al., 1966, Sviridov, Sobolev, et al., 1966, Arnold, 1968 have been reviewed in Danylewych and Nicholls, 1974. The latter authors' expression for the r dependence of the electronic transition moment was placed on an absolute scale using an average f00 = 0.020. For a more recent measurement of the electronic transition moment see Cooper and Nicholls, 1975. Franck-Condon factors Nicholls, Fraser, et al., 1959, Jain, 1964, Ortenberg, 1964, Spindler, 1965, Halmann and Laulicht, 1966. |
| 17 | In solid matrices; tentative assignment by Barger and Broida, 1965 who also report the observation of d←a. See, however, Weltner and McLeod, 1966. |
| 18 | From perturbations in A 1Πu Ballik and Ramsay, 1963. |
| 19 | Very slightly revised constants in Marenin and Johnson, 1970 based on the same data. |
| 20 | Λ-type doubling, Δvef = -0.00023J(J+1). Perturbations by c 3Σu+. |
| 21 | f00 = 0.0025; see Roux, Cerny, et al., 1976 for a comparison with other absolute measurements. Reasonably consistent with the electronic transition moment obtained by Cooper and Nicholls, 1975. Franck-Condon factors Nicholls, Fraser, et al., 1959, Ortenberg, 1964, Spindler, 1965, Halmann and Laulicht, 1966. |
| 22 | Callomon and Gilby, 1963 |
| 23 | Spin-splitting parameters λ0 = 0.11, γ0 = -0.00365 Veseth, 1975. Small perturbations by levels of X 1Σg+ Ballik and Ramsay, 1963, 2. |
| 24 | Callomon and Gilby, 1963. |
| 25 | Franck-Condon factors Halmann and Laulicht, 1966; electronic transition moment Cooper and Nicholls, 1975. |
| 26 | A = -15.25; Veseth, 1975 gives additional spin-coupling constants. |
| 27 | Λ-type doubling; see Ballik and Ramsay, 1963, 2 and Veseth, 1975. |
| 28 | From Ballik and Ramsay, 1963, very slightly revised constants in Marenin and Johnson, 1970 based on the same data. |
| 29 | Average of thermochemical values Brewer, Hicks, et al., 1962, Kordis and Gingerich, 1973. Smaller values of 6.07 and 6.11 eV have been derived on the basis of a somewhat doubtful extrapolation of the vibrational levels in d 3Πg Messerle and Krauss, 1967, 3 and of an extrapolated limiting curve of the C 1Πg state Messerle and Krauss, 1967. See also Drowart, Burns, et al., 1959. |
| 30 | From photoionization and heat of formation of C2N2 Dibeler and Liston, 1967. |
Go To: Top, Gas phase ion energetics data, Constants of diatomic molecules, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Arnold, Bradforth, et al., 1991
Arnold, D.W.; Bradforth, S.E.; Kitsopoulos, T.N.; Neumark, D.M.,
Vibrationally Resolved Spectra of C2-C11 by Anion Photoelectron Spectroscopy,
J. Chem. Phys., 1991, 95, 8753. [all data]
Ervin, Gronert, et al., 1990
Ervin, K.M.; Gronert, S.; Barlow, S.E.; Gilles, M.K.; Harrison, A.G.; Bierbaum, V.M.; DePuy, C.H.; Lin, W.C.,
Bonds Strengths of Ethylene and Acetylene,
J. Am. Chem. Soc., 1990, 112, 5750. [all data]
Jones, Mead, et al., 1980
Jones, P.L.; Mead, R.D.; Kohler, B.E.; Rosner, S.D.; Lineberger, W.C.,
Photodetachment spectroscopy of C2- autodetaching resonances,
J. Chem. Phys., 1980, 73, 4419. [all data]
Yang, Taylor, et al., 1989
Yang, S.; Taylor, K.J.; Craycraft, M.J.; Conceicao, J.; Pettiette, C.L.; Cherhnovsky, O.; Smalley, R.E.,
UPS of 2-30 Atom Carbon Clusters: Chains and Rings,
Chem. Phys. Lett., 1989, 144, 431. [all data]
Feldman, 1970
Feldman, D.,
Photoablosung von Elektronen bei einigen Stabilen Negativen Ionen,
Z. Naturfor., 1970, 25A, 621. [all data]
Thynne and MacNiel, 1971
Thynne, J.C.J.; MacNiel, K.A.G.,
Negative ion formation by ethylene and 1,1-difluoroethylene,
J. Phys. Chem., 1971, 75, 2584. [all data]
Locht and Momigny, 1970
Locht, R.; Momigny, J.,
Mass Spectrometric Determination of the Electron Affinities of Radicals,
Chem. Phys. Lett., 1970, 6, 273. [all data]
Trepka and Neuert, 1963
Trepka, L.v.; Neuert, H.,
Uber die Entstehenung von Negativen Ionen aus einigen Kohlenwasserstoffen und Alkoholen durch Elektronenstoss,
Z. Naturfor., 1963, 18A, 1295. [all data]
Honig, 1954
Honig, R.E.,
Mass spectrometric study of the molecular sublimation of graphite,
J. Chem. Phys., 1954, 22, 126. [all data]
Reid, Ballantine, et al., 1995
Reid, C.J.; Ballantine, J.A.; Andrews, S.R.; Harris, F.M.,
Charge inversion of ground-state and metastable-state C2+ cations formed from electroionised C2H2 and C2N2, and a re-evaluation of the carbon dimer's ionisation energy,
Chem. Phys., 1995, 190, 113. [all data]
Plessis and Marmet, 1986
Plessis, P.; Marmet, P.,
Electroionization study of acetylene and fragment ions,
Int. J. Mass Spectrom. Ion Processes, 1986, 70, 23. [all data]
Huber and Herzberg, 1979
Huber, K.P.; Herzberg, G.,
Molecular Spectra and Molecular Structure. IV. Constants of Diatomic Molecules,, Van Nostrand Reinhold Co., 1979, ,1. [all data]
Gupta and Gingerich, 1979
Gupta, S.K.; Gingerich, K.A.,
Observation and atomization energies of the gaseous uranium carbides, UC, UC2, UC3, UC4, UC5, and UC6 by high temperature mass spectrometry,
J. Chem. Phys., 1979, 71, 3072. [all data]
Cocke and Gingerich, 1974
Cocke, D.L.; Gingerich, K.A.,
Thermodynamic investigation of the gaseous molecules TiRh, Rh2, and Ti2Rh by mass spectrometry,
J. Chem. Phys., 1974, 60, 1958. [all data]
Cocke and Gingerich, 1972
Cocke, D.L.; Gingerich, K.A.,
Mass spectrometric determination of the bond dissociation energies of the molecules CePd and CeC2,
J. Phys. Chem., 1972, 76, 2332. [all data]
Drowart, Burns, et al., 1959
Drowart, J.; Burns, R.P.; DeMaria, G.; Inghram, M.G.,
Mass spectrometric study of carbon vapor,
J. Chem. Phys., 1959, 31, 1131. [all data]
Field, Franklin, et al., 1957
Field, F.H.; Franklin, J.L.; Lampe, F.W.,
Reactions of gaseous ions. II. Acetylene,
J. Am. Chem. Soc., 1957, 79, 2665. [all data]
Read and Vanerslice, 1962
Read, S.M.; Vanerslice, J.T.,
Potential energy curves for C2,
J. Chem. Phys., 1962, 36, 2366. [all data]
Fougere and Nesbet, 1966
Fougere, P.F.; Nesbet, R.K.,
Electronic structure of C2,
J. Chem. Phys., 1966, 44, 285. [all data]
Verhaegen, Richards, et al., 1967
Verhaegen, G.; Richards, W.G.; Moser, C.M.,
Low-lying valence levels of BN and C2. The ground state of BN,
J. Chem. Phys., 1967, 46, 160. [all data]
Verhaegen, 1968
Verhaegen, G.,
Theoretical calculation of the electronic states of C2+,
J. Chem. Phys., 1968, 49, 4696. [all data]
Norrish, Porter, et al., 1952
Norrish, R.G.W.; Porter, G.; Thrush, B.A.,
Detection of diatomic radical absorption spectra during combustion,
Nature (London), 1952, 169, 582. [all data]
Messerle, 1968
Messerle, G.,
Anregung hoher Rotationsniveaus von C2-Banden,
Z. Naturforsch. A, 1968, 23, 470. [all data]
Messerle and Krauss, 1967
Messerle, G.; Krauss, L.,
Die Dissoziation des C2 - Molekuls durch Rotation,
Z. Naturforsch. A, 1967, 22, 2023. [all data]
Dieke and Lochte-Holtgreven, 1930
Dieke, G.H.; Lochte-Holtgreven, W.,
Uber einige banden des kohlenstoffmolekuls,
Z. Phys., 1930, 62, 767. [all data]
Herzberg and Sutton, 1940
Herzberg, G.; Sutton, R.B.,
Tail bands of the deslandres-d'azambuja system of the C2 molecule,
Can. J. Res. Sect. A, 1940, 18, 74. [all data]
Herzberg, 1945
Herzberg, G.,
Molecular spectra and molecular structure. II. Infrared and Raman spectra of polyatomic molecules, Pub. D. Van Nostrand Company, Inc., Princeton, New Jersey, 1945, 0. [all data]
Cisak, Dabrowska, et al., 1969
Cisak, H.; Dabrowska, K.; Rytel, M.,

New bands in the Swan system of the C2 molecule,
Opt. Spectrosc. Engl. Transl., 1965, 19, 292, In original 524. [all data]
Phillips and Davis, 1968
Phillips, J.G.; Davis, S.P.,
Berkely analyses of molecular spectra, Pub. University of California Press, Berkeley and Los Angeles, 1968, 0. [all data]
Ballik and Ramsay, 1963
Ballik, E.A.; Ramsay, D.A.,
An extension of the Phillips system of C2 and a survey of C2 states,
Astrophys. J., 1963, 137, 84. [all data]
Freymark, 1951
Freymark, H.,
Uber ein neues Bandensystem des C2-Molekuls im Ultravioletten,
Ann. Phys. (Neue Folge), 1951, 8, 221. [all data]
Halmann and Laulicht, 1966
Halmann, M.; Laulicht, I.,
Isotope effects on vibrational transition probabilities. IV. Electronic transitions of isotopic C2, CO, CN, H2, and CH molecules,
Astrophys. J. Suppl. Ser., 1966, 12, 307. [all data]
Cooper and Nicholls, 1975
Cooper, D.M.; Nicholls, R.W.,
Measurments of the electronic transition moments of C2-band systems,
J. Quant. Spectrosc. Radiat. Transfer, 1975, 15, 139. [all data]
Landsverk, 1939
Landsverk, O.G.,
A 1Σ→1Σ transition of the C2 molecule,
Phys. Rev., 1939, 56, 769-777. [all data]
Smith, 1969
Smith, W.H.,
Transition probabilities for the Swan and Mulliken C2 bands,
Astrophys. J., 1969, 156, 791. [all data]
Nicholls, Fraser, et al., 1959
Nicholls, R.W.; Fraser, P.A.; Jarmain, W.R.,
Transition probability parameters of molecular spectra arising from combustion processes,
Combust. Flame, 1959, 3, 13. [all data]
Jain, 1964
Jain, D.C.,
Transition probability parameters of the Swan and the Fox-Herzberg band systems of the C2 molecule,
J. Quant. Spectrosc. Radiat. Transfer, 1964, 4, 427. [all data]
Phillips, 1950
Phillips, J.G.,
On the identification of the 3670 A band of the C2 molecule,
Astrophys. J., 1950, 112, 131. [all data]
Messerle and Krauss, 1967, 2
Messerle, G.; Krauss, L.,
Ein neues c'1Πg - b1Πu - Bandensystem des C2 - Molekuls,
Z. Naturforsch. A, 1967, 22, 2015. [all data]
Kini and Savadatti, 1969
Kini, K.S.; Savadatti, M.I.,
Extension of the C2(A3Πg-X'3Πu) band system,
J. Phys. B:, 1969, 2, 307. [all data]
Callomon and Gilby, 1963
Callomon, J.H.; Gilby, A.C.,
New observations on the Swan bands of C2,
Can. J. Phys., 1963, 41, 995. [all data]
Phillips, 1968
Phillips, J.G.,
Perturbations in the Swan system of the C2 molecule,
J. Mol. Spectrosc., 1968, 28, 233. [all data]
Bleekrode and Nieuwpoort, 1965
Bleekrode, R.; Nieuwpoort, W.C.,
Absorption and emission measurements of C2 and CH electronic bands in low-pressure oxyacetylene flames,
J. Chem. Phys., 1965, 43, 3680. [all data]
Bleekrode, 1967
Bleekrode, R.,
Absorption and emission spectroscopy of C2, CH and OH in low-pressure oxyacetylene flames,
Philips Res. Rep. Suppl., 1967, 7, 1. [all data]
Herzberg, 1946
Herzberg, G.,
On the high pressure bands of carbon and the formation of C2 molecules,
Phys. Rev., 1946, 70, 762. [all data]
Kunz, Harteck, et al., 1967
Kunz, C.; Harteck, P.; Dondes, S.,
Mechanism for excitation of the C2 high-pressure bands (C + C2O → C2(A3Π) + CO),
J. Chem. Phys., 1967, 46, 4157. [all data]
Meinel and Messerle, 1968
Meinel, H.; Messerle, G.,
Investigation of the fine structure of the C2 high-pressure bands,
Astrophys. J., 1968, 154, 381. [all data]
Dhumwad and Narasimham, 1968
Dhumwad, R.K.; Narasimham, N.A.,
Isotope shift studies of the high-pressure carbon bands,
Can. J. Phys., 1968, 46, 1254. [all data]
Fink and Welge, 1967
Fink, E.H.; Welge, K.H.,
Lifetime measurements on CH(A2Δ), CH(B2Σ-), and C2(A3Πg) by the phase-shift method,
J. Chem. Phys., 1967, 46, 4315. [all data]
Jeunehomme and Schwenker, 1965
Jeunehomme, M.; Schwenker, R.P.,
Focused laser-beam experiment and the oscillator strength of the Swan system,
J. Chem. Phys., 1965, 42, 2406. [all data]
Fairbairn, 1966
Fairbairn, A.R.,
A shock-tube study of the oscillator strength of the C2 Swan bands,
J. Quant. Spectrosc. Radiat. Transfer, 1966, 6, 325. [all data]
Harrington, Modica, et al., 1966
Harrington, J.A.; Modica, A.P.; Libby, D.R.,
Shock-tube determination of the C2(A3Π → X3Π) and CF(A2Σ+ → X2Π) band-system oscillator strengths,
J. Chem. Phys., 1966, 44, 3380. [all data]
Sviridov, Sobolev, et al., 1966
Sviridov, A.G.; Sobolev, N.N.; Novgorodov, M.Z.,
Determination of the matrix elements of the dipole moments of the electronic transitions of the Swan band system of the C2 molecule. II. Absorption method,
J. Quant. Spectrosc. Radiat. Transfer, 1966, 6, 337. [all data]
Arnold, 1968
Arnold, J.O.,
A shock tube determination of the electronic transition moment of the C2(Swan), bands,
J. Quant. Spectrosc. Radiat. Transfer, 1968, 8, 1781. [all data]
Danylewych and Nicholls, 1974
Danylewych, L.L.; Nicholls, R.W.,
Intensity measurements on the C2 (d3Πg-a3Πu) Swan band system. I. Intercept and partial band methods,
Proc. R. Soc. London A, 1974, 339, 197-212. [all data]
Ortenberg, 1964
Ortenberg, F.S.,
Calculation of Franck-Condon factors for the NO, C2, and CO band systems,
Opt. Spectrosc. Engl. Transl., 1964, 16, 398, In original 729. [all data]
Spindler, 1965
Spindler, R.J.,
Franck-Condon factors based on RKR potentials with applications to radiative absorption coefficients,
J. Quant. Spectrosc. Radiat. Transfer, 1965, 5, 165. [all data]
Barger and Broida, 1965
Barger, R.L.; Broida, H.P.,
Spectra of C2 in solidified gases at 4º and 20 ºK,
J. Chem. Phys., 1965, 43, 7, 2371-2376. [all data]
Weltner and McLeod, 1966
Weltner, W., Jr.; McLeod, D., Jr.,
J. Chem. Phys., 1966, 45, 3096. [all data]
Marenin and Johnson, 1970
Marenin, I.R.; Johnson, H.R.,
New molecular constants for the Phillips system of C2,
J. Quant. Spectrosc. Radiat. Transfer, 1970, 10, 305. [all data]
Roux, Cerny, et al., 1976
Roux, F.; Cerny, D.; d'Incan, J.,
Experimental oscillator strengths in the C2(A1Πu-X1Σg+) Phillips band system,
Astrophys. J., 1976, 204, 940. [all data]
Veseth, 1975
Veseth, L.,
Molecular parameters for the a3Πu and b3Σg- states in C2,
Can. J. Phys., 1975, 53, 299. [all data]
Ballik and Ramsay, 1963, 2
Ballik, E.A.; Ramsay, D.A.,
The A'3Σg--X'3Πu band system of the C2 molecule,
Astrophys. J., 1963, 137, 61. [all data]
Brewer, Hicks, et al., 1962
Brewer, L.; Hicks, W.T.; Krikorian, O.H.,
Heat of sublimation and dissociation energy of gaseous C2,
J. Chem. Phys., 1962, 36, 182. [all data]
Kordis and Gingerich, 1973
Kordis, J.; Gingerich, K.A.,
Gaseous phosphorus compounds. IX. Mass spectrometric studies of equilibria in the carbon-phosporus system,
J. Chem. Phys., 1973, 58, 5058. [all data]
Messerle and Krauss, 1967, 3
Messerle, G.; Krauss, L.,
Spektroskopische Bestimmung der Dissoziationsenergie des C2-Molekuls aus den 3Πg - Termen,
Z. Naturforsch. A, 1967, 22, 1744. [all data]
Dibeler and Liston, 1967
Dibeler, V.H.; Liston, S.K.,
Mass-spectrometric study of photoionization. VIII.Dicyanogen and the cyanogen halides,
J. Chem. Phys., 1967, 47, 4548. [all data]
Go To: Top, Gas phase ion energetics data, Constants of diatomic molecules, References
| EA | Electron affinity |
| IE (evaluated) | Recommended ionization energy |
Copyright for NIST Standard Reference Data is governed by the Standard Reference Data Act.
|
Standard Reference Data Program |
Data Gateway |
Chemistry WebBook |
If you have comments or questions about this site, please contact us.