@escowles could you clarify this question?
This is an updated set of possible values in the existing travel category list (https://github.com/pulibrary/approvals/blob/main/app/models/request.rb#L66). I believe that "Required Business/Teleworkers on-site" and "Education/Training" map to the existing values, and "Acquisitions/Collections" and "Conferences" are new, if that helps avoid doing a data migration to expand this list.
Thanks @escowles. Most of the trips in the system (for IT at least) have been recorded as business travel so if there is a need to filter specifically for teleworkers on site we wouldn't be able to do so on the category value. Is that okay? Or is there a need to filter to just on-site teleworkers in this category?
I don't think there is a need to filter to just on-site teleworkers — that was lumped in with other business travel.
mentioned
by esmé cowles at 2023-06-05 13:01:06.subscribed
by esmé cowles at 2023-06-05 13:01:06.mentioned
by esmé cowles at 2023-06-05 13:57:48.subscribed
by esmé cowles at 2023-06-05 13:57:48.This is now working from aspace staging to sftp staging. Next steps:
referenced
by Max Kadel at 2023-06-05 19:22:01.merged
by Max Kadel at 2023-06-05 19:22:01.closed
by Max Kadel at 2023-06-05 19:22:01.head_ref_deleted
by Max Kadel at 2023-06-05 19:22:02.closed
by Max Kadel at 2023-06-05 19:22:03.closed
by Trey Pendragon at 2023-06-05 18:41:41.closed
by James R. Griffin III at 2023-06-05 14:04:05.referenced
by Trey Pendragon at 2023-06-05 15:08:07.merged
by Trey Pendragon at 2023-06-05 15:08:07.closed
by Trey Pendragon at 2023-06-05 15:08:08.head_ref_deleted
by Trey Pendragon at 2023-06-05 15:08:10.closed
by Trey Pendragon at 2023-06-05 18:40:48.closed
by Trey Pendragon at 2023-06-05 18:40:54.closed
by Trey Pendragon at 2023-06-05 18:41:06.unassigned
by Shaun Ellis at 2023-06-05 19:20:25.If we "special case" in this scenario, we want to make sure there are other areas where we want to do the same kind of special case. For example, the cloud fixity status on a fileset page.
Implementation Note: We may be able to make event queries return "fake" events for cloud fixity objects that have a preservation object but no events. (Null object where null = success)
Implementation ticket should have an Acceptance Criterian that it is documented this in docs/use_cases
.
Example: https://figgy.princeton.edu/catalog/4b8e1559-2695-4f2b-9620-f8105a0405d9
I think the problem here is that the imported ARK is the PDF ARK, so it's trying to update an ARK with /pdf
at the end. We should strip that on metadata import.
Imported identifier:
ark:/88435/dc1c18ds73h/pdf
renamed
by Trey Pendragon at 2023-06-05 19:57:47.renamed
by Trey Pendragon at 2023-06-05 19:57:59.renamed
by Trey Pendragon at 2023-06-05 19:58:37.labeled
by Trey Pendragon at 2023-06-05 20:14:37.referenced
by Trey Pendragon at 2023-06-05 23:23:48.referenced
by Bess Sadler at 2023-06-05 15:58:01.merged
by Bess Sadler at 2023-06-05 15:58:01.closed
by Bess Sadler at 2023-06-05 15:58:01.head_ref_deleted
by Bess Sadler at 2023-06-05 15:58:02.referenced
by Bess Sadler at 2023-06-05 15:59:23.merged
by Bess Sadler at 2023-06-05 15:59:23.closed
by Bess Sadler at 2023-06-05 15:59:23.head_ref_deleted
by Bess Sadler at 2023-06-05 15:59:24.referenced
by Bess Sadler at 2023-06-05 16:00:44.merged
by Bess Sadler at 2023-06-05 16:00:45.closed
by Bess Sadler at 2023-06-05 16:00:45.head_ref_deleted
by Bess Sadler at 2023-06-05 16:00:46.Closing because it is outdated.
closed
by Robert-Anthony Lee-Faison at 2023-06-05 16:01:23.head_ref_deleted
by Robert-Anthony Lee-Faison at 2023-06-05 16:01:31.Increasing the ssh config value to ServerAliveInterval 120 seems to be have potentially addressed this issue.
Initially it was set to 30 but several failures were still recorded afterward.
referenced
by Liz Garcia at 2023-06-05 19:28:05.merged
by Liz Garcia at 2023-06-05 19:28:05.closed
by Liz Garcia at 2023-06-05 19:28:05.closed
by Liz Garcia at 2023-06-05 19:28:06.referenced
by Jane Sandberg at 2023-06-05 19:43:44.merged
by Jane Sandberg at 2023-06-05 19:43:44.closed
by Jane Sandberg at 2023-06-05 19:43:44.head_ref_deleted
by Jane Sandberg at 2023-06-05 19:43:50.See also https://docs.vmware.com/en/VMware-vSphere/7.0/com.vmware.vsphere.resmgmt.doc/GUID-117972E3-F5D3-4641-9EAC-F9DD2B0761C3.html It's not clear what "unlimited" actually means in this context.
referenced
by None at 2023-06-05 14:57:04.merged
by None at 2023-06-05 14:57:04.closed
by None at 2023-06-05 14:57:04.head_ref_deleted
by None at 2023-06-05 14:57:06.closed
by None at 2023-06-05 14:57:07.In reviewing heap usage on staging, the heap is not increasing to a concerning amount. Therefore, we decided not to prioritize this analysis for now, but can revisit it when we want to investigate further.
The benchmarking data is too big for Github! 😱 Let's create a new directory in Google Drive.
Screenshot of Datadog dashboard for duration of load test on staging -
See documentCache config for the catalog - https://github.com/pulibrary/pul_solr/blob/0b70cb2bb4714df7aae0d0910e9287a215800819/solr_configs/catalog-production-v2/conf/solrconfig.xml#L129-L131
There is code that references capping the title field length, but that does not appear to be happening for this object.
labeled
by Max Kadel at 2023-06-05 14:19:49.assigned
by Max Kadel at 2023-06-05 19:23:16.Deployed to staging, successfully created OpenUrl for Aeon that was not too long.
coverage: 95.368%. remained the same when pulling 5424425ecdb60c9ea5cc2ff74aae1715a28ba1f5 on i3604aeon404 into 04dc667c51aaa65dad62c255e22886af6537ae99 on main.
ready_for_review
by Max Kadel at 2023-06-05 19:53:02.referenced
by Kevin Reiss at 2023-06-05 21:10:46.merged
by Kevin Reiss at 2023-06-05 21:10:46.closed
by Kevin Reiss at 2023-06-05 21:10:47.head_ref_deleted
by Kevin Reiss at 2023-06-05 21:10:47.referenced
by James R. Griffin III at 2023-06-05 12:15:59.merged
by James R. Griffin III at 2023-06-05 12:15:59.closed
by James R. Griffin III at 2023-06-05 12:15:59.head_ref_deleted
by James R. Griffin III at 2023-06-05 12:16:00.assigned
by Kate Lynch at 2023-06-05 20:13:56.unassigned
by Kate Lynch at 2023-06-05 20:14:08.assigned
by Kate Lynch at 2023-06-05 20:14:28.We talked about this at check-in 6/5. Will bring this up in ansible open house this weekend.
labeled
by Kevin Reiss at 2023-06-05 15:15:27.We continue to have timeout issues using password authentication and<EMAIL_ADDRESS>within the Alma environment and lib-sftp-prod1 and lib-sftp-staging1. Alma can give us a public key we can register on each box to use key-based auth instead when connected from the Alma environment. @mzelesky and I gave key-based authentication from Alma a manual test in staging using the Alma sandbox and it worked much faster.
@kayiwa @acozine a couple of questions?
- Alma can give keys as RSA or ECDSA, should we go with the latter?
the latter.
- Is there a pattern in princeton ansible for managing a public key that we only want to be in the user's authorized_keys files on certain boxes?
look at how we use cdh (that can be expanded) here
- Are there any concerns with having a user utilize password based authentications in certain contexts (i.e. bibdata/lib-jobs using<EMAIL_ADDRESS>with a password), but also have the same user configured in the external Alma environment to utilize a public key?
No there aren't.
labeled
by Kevin Reiss at 2023-06-05 14:54:54.labeled
by Kevin Reiss at 2023-06-05 14:55:04.renamed
by Kevin Reiss at 2023-06-05 14:55:14.mentioned
by Francis Kayiwa at 2023-06-05 15:23:57.subscribed
by Francis Kayiwa at 2023-06-05 15:23:57.mentioned
by Alicia Cozine at 2023-06-05 15:23:57.subscribed
by Alicia Cozine at 2023-06-05 15:23:57.mentioned
by Francis Kayiwa at 2023-06-05 15:24:33.subscribed
by Francis Kayiwa at 2023-06-05 15:24:33.mentioned
by Alicia Cozine at 2023-06-05 15:24:33.subscribed
by Alicia Cozine at 2023-06-05 15:24:33.transferred
by Kevin Reiss at 2023-06-05 15:24:34.mentioned
by None at 2023-06-05 16:08:16.subscribed
by None at 2023-06-05 16:08:16.mentioned
by Francis Kayiwa at 2023-06-05 16:19:58.subscribed
by Francis Kayiwa at 2023-06-05 16:19:58.mentioned
by Alicia Cozine at 2023-06-05 16:19:58.subscribed
by Alicia Cozine at 2023-06-05 16:19:58.mentioned
by None at 2023-06-05 16:19:58.subscribed
by None at 2023-06-05 16:19:58.referenced
by Max Kadel at 2023-06-05 19:21:01.merged
by Max Kadel at 2023-06-05 19:21:01.closed
by Max Kadel at 2023-06-05 19:21:01.head_ref_deleted
by Max Kadel at 2023-06-05 19:21:02.closed
by Max Kadel at 2023-06-05 19:21:04.referenced
by Jane Sandberg at 2023-06-05 20:37:46.merged
by Jane Sandberg at 2023-06-05 20:37:46.closed
by Jane Sandberg at 2023-06-05 20:37:47.head_ref_deleted
by Jane Sandberg at 2023-06-05 20:37:48.closed
by Jane Sandberg at 2023-06-05 20:37:48.closed
by Trey Pendragon at 2023-06-05 18:41:36.We are going to implement the "little truck" delivery note in the Request Cart, as outlined in ticket #1154. This seems like it will solve the problem at the point of need.
Can we change it to say "up to 3 business days" please? Giving hours can be misleading. We also note it can take 2-3 business days not just 48 hours.
I also think that ADAPT wants to see the text in the finding aids as noted in the original ticket.
closed
by Trey Pendragon at 2023-06-05 18:41:30.


Callan's Website
Movie Blog Post
This is some text that represents a paragraph or body of text that will make up the blog post.
EDA Blog Posts
Reflection
Time and Habits
Technical Part 1
Technical Part 2
Emotional Intelligence
Technical Part 3
Meditation Process
Technical Part 4
Daily Mindfulness
Self-Confidence
Technical Part 5
Technical Part 6
Control
Motivation
Technical Part 7
Connecting


Many consider the wax as an African product and they think it is manufactured in Africa. However, the wax is a Dutch product imported on the African continent. The loincloth is an integral part of the African culture, and nowadays it is part of the fashion on the international level. From the narrow corridor of the Kinshasa Of Dantokpa in Cotonou or Adawlato in Lome, from "the Red Castle" shops in Paris to the continental-inspired parades in Paris, Milan or New York, an all powerful godfather Dominates African fashion: the wax.The loincloth has had an unprecedented success since 2016.
There are currently on the African market different types of loincloths namely:One of the reasons why the loincloth remains known and knows this success is due to the fact that the loincloth is also used as a means of communication. Indeed the loincloths in africa are named after crises, social mutations, suffering and the joys. It always brings together the emotional and social life in a current subject.
| Wax names | Names meaning |
|---|---|
| "Tu sors, je sors" meaning "You go out, I go out" | Women 's clothes that mark a feminist awareness that others rightly or wrongly call the emancipation of women with the. That she claims both her place of wife and that of companion and that she no longer wants to be the one who awaits her husband when he is without justification out of the matrimonial home.. |
| "L'oeil de ma rivale" meaning "The eye of my rival" | "The eye of my rival "convokes the family tensions, because by this direct information, the members of the family and their immediate relatives are called to act, to take position. This wax reveals the discrepancies between the co-wives and between them and their husbands. This loincloth requires that the situation be dedramatised |
| "Reconciliation" | Green, white and birds that fly in the same direction refer respectively to hope, peace and solidarity for a common destiny |
Wax sample
This website Crcrea is about the wax but more precisely the brand Crcrea. It is a good website because:


Why MXNet came to be?
Why was MXNet developed in the first place ?
Probably, if you've stumbled upon this page, you've heard of deep learning. Deep learning denotes the modern incarnation of neural networks, and it's the technology behind recent breakthroughs in self-driving cars, machine translation, speech recognition and more. While widespread interest in deep learning took off in 2012, deep learning has become an indispensable tool for countless industries.
It might not come as a surprise that researchers have investigated neural networks for decades. Warren McCulloch and Walter Pitts suggested the forerunner of today's artificial neurons back in 1943. Each neuron is connected to other neurons along edges, analogous to the synapses that connect real neurons. And associated with each edge is a weight that indicates whether the connection is excitatory or inhibitatory and the strength of the connection.
In the 1980s, the modern version of neural networks took shape. Researchers arranged artificial neurons into layers. Neurons in any layer get input from the neurons in the layers below them. And, in turn, their output feeds into the neurons in the layer above. Typically, the lowest layer represents the input to a neural network. After computing the values of each layer, the output values are read out from the topmost layer. The behavior of the network is determined by the setting of the weights. And the process of learning in neural networks is precisely the process of searching for good settings of these weights.
All that we need is an algorithm that tells us how to perform this search. And since David Rumelhart and colleagues introduced the backpropagation learning algorithm to train neural networks, nearly all the major ideas have been in place. Still, for many years neural networks took a backseat to classical statistical methods like logistic regression and support vector machines (SVMs). So you might reasonably ask, what's changed to garner such interest?
Scale and Computation
The two biggest factors driving innovation in deep learning now are data and computation. With distributed cloud computing and parallelism across GPU cores, we can train models millions of times faster than researchers could in the 1980s. The availability of large, high-quality datasets is another factor driving the field forward. In the 1990s, the best datasets in computer vision had thousands of low-resolution images and ground truth assignments to a small number of classes.  The falling price of storage and high network bandwidth make it affordable to work with big data at will.
In this new world, with bigger datasets and abundant computation, neural networks dominate on most pattern recognition problems. Over the last five years, neural networks have come to dominate on nearly every problem in computer vision, replacing classical models and hand-engineered features. Similarly, nearly every production speech recognition system now relies on neural networks, where replacing the hidden Markov models that previously held sway.
While GPUs and clusters present a huge opportunity for accelerating neural network training, adapting traditional machine learning code to take advantage of these resources can be challenging. The familiar scientific computing stacks (Matlab, R, or NumPy & SciPy) give no straight-forward way to exploit these distributed resources.
Acceleration libraries like MXNet offer powerful tools to help developers exploit the full capabilities of GPUs and cloud computing. While these tools are generally useful and applicable to any mathematical computation, MXNet places a special emphasis on speeding up the development and deployment of large-scale deep neural networks. In particular, we offer the following capabilities: * Device Placement: With MXNet, it's easy to specify where each data structures should live. * Multi-GPU training: MXNet makes it easy to scale computation with number of available GPUs. * Automatic differentiation: MXNet automates the derivative calculations that once bogged down neural network research. * Optimized Predefined Layers: While you can code up your own layers in MXNet, the predefined layers are optimized for speed, outperforming competing libraries.
Deep Nets on Fast Computers
While MXNet can accelerate any numerical computation, we developed the library with neural networks in mind. However you plan to use MXNet, neural networks make for a powerful motivating example to display MXNet's capabilities.
Neural networks are just functions for transforming input arrays X
into output arrays Y
.
In the case of image classification, X
might represent the pixel values of an image, and Y
might represent the corresponding probabilities that the image belongs to each of 10
classes.
For language translation, X
and Y
both might denote sequences of words. We'll revisit the way you might represent sequences in subsequent tutorials - so for now it's safe to think of X
and Y
as fixed length vectors.
To perform this mapping, neural networks stack layers of computation. Each layer consists of a linear function followed by a nonlinear transformation. In MXNet we might express this as:
python
hidden_linear = mx.sym.dot(X, W)
hidden_activation = mx.sym.tanh(hidden_linear)
The linear transformations consist of multiplication by parameter arrays (W
above).
When we talk about learning we mean finding the right set of values for W
.
With just one layer, we can implement the familiar family of linear models,
including linear and logistic regression, linear support vector machines (SVMs), and the perceptron algorithm.
With more layers and a few clever constraints, we can implement all of today's state-of-the-art deep learning techniques.
Of course, tens or hundreds of matrix multiplications can be computationally taxing. Generally, these linear operations are the computational bottleneck. Fortunately, linear operators can be parallelized trivially across the thousands of cores on a GPU. But low-level GPU programming requires specialized skills that are not common even among leading researchers in the ML community. Moreover, even for CUDA experts, implementing a new neural network architecture shouldn't require weeks of programming to implement low-level linear algebra operations. That's where MXNet comes in. * MXNet provides optimized numerical computation for GPUs and distributed ecosystems, from the comfort of high-level environments like Python and R * MXNet automates common workflows, so standard neural networks can be expressed concisely in just a few lines of code
Now let's take a closer look at the computational demands of neural networks and give a sense of how MXNet helps us to write better, faster, code. Say we have a neural network trained to recognize spam from the content of emails. The emails may be streaming from an online service (at inference time), or from a large offline dataset D (at training time). In either case, the dataset typically must be managed by the CPU.
To compute the transformation of a neural network quickly, we need both the parameters and data points to make it into GPU memory. For any example X, the parameters W are the same. Moreover the size of the model tends to dwarf the size of an individual example. So we might arrive at the natural insight that parameters should always live on the GPU, even if the dataset itself must live on the CPU or stream in. This prevents IO from becoming the bottleneck during training or inference.
Fortunately, MXNet makes this kind of assignment easy. ```python import mxnet.ndarray as nd
X = nd.zeros((10000, 40000), mx.cpu(0)) #Allocate an array to store 1000 datapoints (of 40k dimensions) that lives on the CPU W1 = nd.zeros(shape=(40000, 1024), mx.gpu(0)) #Allocate a 40k x 1024 weight matrix on GPU for the 1st layer of the net W2 = nd.zeros(shape=(1024, 10), mx.gpu(0)) #Allocate a 1024 x 1024 weight matrix on GPU for the 2nd layer of the net ```
Similarly, MXNet makes it easy to specify the computing device
with mx.Context(mx.gpu()): # Absent this statement, by default, MXNet will execute on CPU
h = nd.tanh(nd.dot(X, W1))
y = nd.sigmoid(nd.dot(h1, W2))
Thus, with only a high-level understanding of how our numerical computation maps onto an execution environment, MXNet allows us to exert fine-grained control when needed.
Nuts and Bolts
MXNet supports two styles of programming: imperative programming (supported by the NDArray API) and symbolic programming (supported by the Symbol API). In short, imperative programming is the style that you're likely to be most familiar with. Here if A and B are variables denoting matrices, then C = A + B
is a piece of code that when executed sums the values referenced by A
and B
and stores their sum C
in a new variable. Symbolic programming, on the other hand, allows functions to be defined abstractly through computation graphs. In the symbolic style, we first express complex functions in terms of placeholder values. Then, we can execute these functions by binding them to real values.
Imperative Programming with NDArray
If you're familiar with NumPy, then the mechanics of NDArray should be old hat. Like the corresponding numpy.ndarray
, mxnet.ndarray
(mxnet.nd
for short) allows us to represent and manipulate multi-dimensional, homogenous arrays of fixed-size components. Converting between the two is effortless:
# Create a numpy array from an mxnet NDArray
A_np = np.array([[0,1,2,3,4],[5,6,7,8,9]])
A_nd = nd.array(A)
# Convert back to a numpy array
A2_np = A_nd.asnumpy()
Other deep learning libraries tend to rely on NumPy exclusively for imperative programming and the syntax. So you might reasonably wonder, why do we need to bother with NDArray? Put simply, other libraries only reap the advantages of GPU computing when executing symbolic functions. By using NDArray, MXNet users can specify device context and run on GPUs. In other words, MXNet gives you access to the high-speed computation for imperative operations that Tensorflow and Theano only give for symbolic operations.
X = mx.nd.array([[1,2],[3,4]])
Y = mx.nd.array([[5,6],[7,8]])
result = X + Y
Symbolic Programming in MXNet
In addition to providing fast math operations through NDArray, MXNet provides an interface for defining operations abstractly via a computation graph.
With mxnet.symbol
, we define operations abstractly in terms of place holders. For example, in the following code a
and b
stand in for real values that will be supplied at run time.
When we call c = a+b
, no numerical computation is performed. This operation simply builds a graph that defines the relationship between a
, b
and c
. In order to perform a real calculation, we need to bind c
to real values.
a = mx.sym.Variable('a')
b = mx.sym.Variable('b')
c = a + b
executor = c.bind(mx.cpu(), {'a': X, 'b': Y})
result = executor.forward()
Symbolic computation is useful for several reasons. First, because we define a full computation graph before executing it, MXNet can perform sophisticated optimizations to eliminate unnecessary or repeated work. This tends to give better performance than imperative programming. Second, because we store the relationships between different variables in the computation graph, MXNet can then perform efficient auto-differentiation.
However Symbolic programming is error-prone and very slow to iterate with, as the graph needs to be computed before it is processed.
Gluon for briding the gap between the two
MXNet Gluon aims to bridge the gap between the imperative nature of MXNet and its symbolic capabilities and keep the advantages of both through hybridization.
Conclusions
Given its combination of high performance, clean code, access to a high-level API, and low-level control, MXNet stands out as a unique choice among deep learning frameworks.


Star Wars and all associated names and/or images are copyright Lucasfilm Ltd. Information and images were freely collected from api
starwars-api
.


WITNESS LIST County Affairs Committee May 16, 2001-9:00A SB 1780 For: Allison, Jim (County Judges and Commissioners Association of Texas) Castellano, Ramiro (Hidalgo County Sheriff's Department) McWilliams, Major Don (Sheriff Tommy Thomas of Harris County) Sisk, Cathy (Harris County Attorney) Against: Amboree, Robert (Afro American Sheriff's Deputy League) Barrera, Humberto Rios (Mexican American Sheriff's Organization) Christensen, Ed (Harris County Deputies Organization) Hutmacher, James (Bexar County Sheriff's Deputies Law Enforcement Organization) Sylvester, James (Travis County Sheriff's Officers Association)


“Transforming the young ones for a better society ”
WHO ARE WE?
We are a non-profit making organisation, committed to the responsibility of reaching out to the young especially the “TEENAGERS” by engaging them in practical life knowledge in career choices and day to day living
OUR GOALS
Give Inspiration
Lorem, ipsum dolor sit amet consectetur adipisicing elit. Quos aperiam accusamus error autem saepe beatae eos vitae! Unde, voluptatem ratione. Vel ratione maxime assumenda explicabo repellendus quam magni molestiae illum?
Read MoreScholarship Opportunities
Lorem, ipsum dolor sit amet consectetur adipisicing elit. Quos aperiam accusamus error autem saepe beatae eos vitae! Unde, voluptatem ratione. Vel ratione maxime assumenda explicabo repellendus quam magni molestiae illum?
Read MoreSupport the Less Privileged
Lorem, ipsum dolor sit amet consectetur adipisicing elit. Quos aperiam accusamus error autem saepe beatae eos vitae! Unde, voluptatem ratione. Vel ratione maxime assumenda explicabo repellendus quam magni molestiae illum?
Read More


|
Ext.NET
5.3.0
.NET Component Framework for Enterprise Level Apps
|
Public Member Functions | |
| TreeNodeDirectEvents () | |
| TreeNodeDirectEvents (Observable parent) | |
| Public Member Functions inherited from Ext.Net.ComponentDirectEvents | |
| ComponentDirectEvents () | |
| ComponentDirectEvents (Observable parent) | |
| virtual void | ClearDirectEvents () |
| Public Member Functions inherited from Ext.Net.BaseItem | |
| virtual bool | HasExplicitValue (string name) |
| void | EnsureDataBind () |
| virtual void | Call (string name) |
| virtual void | Call (string name, params object[] args) |
| virtual void | AddScript (string script) |
| virtual void | AddScript (string script, params object[] args) |
| virtual bool | IsEmptyObject () |
| T | Apply< T > (IApply config) |
| BaseItem | Apply (object config) |
| virtual void | LoadViewState (object state) |
| virtual object | SaveViewState () |
| virtual void | TrackViewState () |
| void | SetDirty () |
| virtual void | DataBind () |
| virtual IControlBuilder | ToNativeBuilder () |
Properties | |
| virtual ComponentDirectEvent | BeforeChildrenRendered [get] |
| Fires right before the child nodes for this node are rendered More... | |
| virtual ComponentDirectEvent | BeforeClick [get] |
| Fires before click processing. Return false to cancel the default action. More... | |
| virtual ComponentDirectEvent | BeforeCollapse [get] |
| Fires before this node is collapsed, return false to cancel. More... | |
| virtual ComponentDirectEvent | BeforeExpand [get] |
| Fires before this node is collapsed, return false to cancel. More... | |
| virtual ComponentDirectEvent | CheckChange [get] |
| Fires when a node with a checkbox's checked property changes. More... | |
| virtual ComponentDirectEvent | Click [get] |
| Fires when this node is clicked More... | |
| virtual ComponentDirectEvent | Collapse [get] |
| Fires when this node is collapsed More... | |
| virtual ComponentDirectEvent | ContextMenu [get] |
| Fires when this node is right clicked More... | |
| virtual ComponentDirectEvent | DblClick [get] |
| Fires when this node is double clicked More... | |
| virtual ComponentDirectEvent | DisabledChange [get] |
| Fires when the disabled status of this node changes More... | |
| virtual ComponentDirectEvent | Expand [get] |
| Fires when this node is expanded More... | |
| virtual ComponentDirectEvent | TextChange [get] |
| Fires when the text for this node is changed More... | |
| override ConfigOptionsCollection | ConfigOptions [get] |
| Properties inherited from Ext.Net.ComponentDirectEvents | |
| virtual Observable | Parent [get, set] |
| Properties inherited from Ext.Net.BaseItem | |
| virtual string | InstanceOf [get] |
| ItemState | State [get] |
| virtual DefaultValueMode | DefaultValueMode [get, set] |
| virtual bool | DesignMode [get] |
| bool | AutoDataBind [get, set] |
| ResourceManager | ResourceManager [get] |
| virtual Control | Owner [get, set] |
| The Owner Control for this Listener. More... | |
| virtual bool | IsDefault [get] |
| Does this object currently represent it's default state. More... | |
| bool | IsTrackingViewState [get] |
| EventHandlerList | Events [get] |
| EventHandler | DataBinding |
| Control?? | BindingContainer [get] |
| virtual ConfigItemCollection?? | CustomConfig [get] |
| Collection of custom js config More... | |
| virtual ConfigOptionsCollection | ConfigOptions [get] |
| virtual ConfigOptionsExtraction | ConfigOptionsExtraction [get] |
| System.Web.Mvc.HtmlHelper?? | HtmlHelper [get, set] |
| Properties inherited from Ext.Net.IXObject | |
| ConfigOptionsCollection | ConfigOptions [get] |
| ConfigOptionsExtraction | ConfigOptionsExtraction [get] |
| DefaultValueMode | DefaultValueMode [get, set] |
Additional Inherited Members | |
| Protected Member Functions inherited from Ext.Net.BaseItem | |
| BaseItem (Control owner) | |
| BaseItem () | |
| virtual void | OwnerUpdate (Control owner) |
| virtual void | OnDataBinding (EventArgs e) |
|
inline |
|
inline |
|
get |
Fires right before the child nodes for this node are rendered
|
get |
Fires before click processing. Return false to cancel the default action.
|
get |
Fires before this node is collapsed, return false to cancel.
|
get |
Fires before this node is collapsed, return false to cancel.
|
get |
Fires when a node with a checkbox's checked property changes.
|
get |
Fires when this node is clicked
|
get |
Fires when this node is collapsed
|
get |
|
get |
Fires when this node is right clicked
|
get |
Fires when this node is double clicked
|
get |
Fires when the disabled status of this node changes
|
get |
Fires when this node is expanded
|
get |
Fires when the text for this node is changed


--- Day 14: Chocolate Charts ---
You finally have a chance to look at all of the produce moving around. Chocolate, cinnamon, mint, chili peppers, nutmeg, vanilla... the Elves must be growing these plants to make hot chocolate! As you realize this, you hear a conversation in the distance. When you go to investigate, you discover two Elves in what appears to be a makeshift underground kitchen/laboratory.
The Elves are trying to come up with the ultimate hot chocolate recipe; they're even maintaining a scoreboard which tracks the quality score
(0
-9
) of each recipe.
Only two recipes are on the board: the first recipe got a score of 3
, the second, 7
. Each of the two Elves has a current
recipe: the first Elf starts with the first recipe, and the second Elf starts with the second recipe.
To create new recipes, the two Elves combine their current recipes. This creates new recipes from the digits of the sum of the current recipes'
scores. With the current recipes' scores of 3
and 7
, their sum is 10
, and so two new recipes would be created: the
first with score 1
and the second with score 0
. If the current recipes' scores were 2
and 3
, the sum,
5
, would only create one recipe (with a score of 5
) with its single digit.
The new recipes are added to the end of the scoreboard in the order they are created. So, after the first round, the scoreboard is
3, 7, 1, 0
.
After all new recipes are added to the scoreboard, each Elf picks a new current recipe. To do this, the Elf steps forward through the scoreboard a number
of recipes equal to 1 plus the score of their current recipe. So, after the first round, the first Elf moves forward 1 + 3 = 4
times, while the second Elf moves forward 1 + 7 = 8
times. If they run out of recipes, they loop back around to the beginning. After the
first round, both Elves happen to loop around until they land on the same recipe that they had in the beginning; in general, they will move to different
recipes.
Drawing the first Elf as parentheses and the second Elf as square brackets, they continue this process:
(3)[7]
(3)[7] 1 0
3 7 1 [0](1) 0
3 7 1 0 [1] 0 (1)
(3) 7 1 0 1 0 [1] 2
3 7 1 0 (1) 0 1 2 [4]
3 7 1 [0] 1 0 (1) 2 4 5
3 7 1 0 [1] 0 1 2 (4) 5 1
3 (7) 1 0 1 0 [1] 2 4 5 1 5
3 7 1 0 1 0 1 2 [4](5) 1 5 8
3 (7) 1 0 1 0 1 2 4 5 1 5 8 [9]
3 7 1 0 1 0 1 [2] 4 (5) 1 5 8 9 1 6
3 7 1 0 1 0 1 2 4 5 [1] 5 8 9 1 (6) 7
3 7 1 0 (1) 0 1 2 4 5 1 5 [8] 9 1 6 7 7
3 7 [1] 0 1 0 (1) 2 4 5 1 5 8 9 1 6 7 7 9
3 7 1 0 [1] 0 1 2 (4) 5 1 5 8 9 1 6 7 7 9 2
The Elves think their skill will improve after making a few recipes (your puzzle input). However, that could take ages; you can speed this up considerably by identifying the scores of the ten recipes after that. For example:
- If the Elves think their skill will improve after making
9
recipes, the scores of the ten recipes after the first nine on the scoreboard would be5158916779
(highlighted in the last line of the diagram). - After
5
recipes, the scores of the next ten would be0124515891
. - After
18
recipes, the scores of the next ten would be9251071085
. - After
2018
recipes, the scores of the next ten would be5941429882
.
What are the scores of the ten recipes immediately after the number of recipes in your puzzle input?


class Minitest::Reporters::DelegateReporter
Public Class Methods
new(reporters, options = {})
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 4 def initialize(reporters, options = {}) @reporters = reporters @options = options @all_reporters = nil end
Public Instance Methods
io()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 10 def io all_reporters.first.io unless all_reporters.empty? @options[:io] end
passed?()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 29 def passed? all_reporters.all?(&:passed?) end
record(result)
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 19 def record(result) all_reporters.each do |reporter| reporter.record result end end
report()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 25 def report all_reporters.each(&:report) end
start()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 15 def start all_reporters.each(&:start) end
Private Instance Methods
all_reporters()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 46 def all_reporters @all_reporters ||= init_all_reporters end
guard_reporter(reporters)
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 60 def guard_reporter(reporters) guards = Array(reporters.detect { |r| r.class.name == "Guard::Minitest::Reporter" }) return guards unless ENV['RM_INFO'] warn 'RM_INFO is set thus guard reporter has been dropped' unless guards.empty? [] end
init_all_reporters()
click to toggle source
# File lib/minitest/minitest_reporter_plugin.rb, line 50 def init_all_reporters return @reporters unless defined?(Minitest::Reporters.reporters) && Minitest::Reporters.reporters (Minitest::Reporters.reporters + guard_reporter(@reporters)).each do |reporter| reporter.io = @options[:io] if reporter.respond_to?(:add_defaults) reporter.add_defaults(@options.merge(:total_count => total_count(@options))) end end end
total_count(options)
click to toggle source
stolen from minitest self.run
# File lib/minitest/minitest_reporter_plugin.rb, line 35 def total_count(options) filter = options[:filter] || '/./' filter = Regexp.new $1 if filter =~ /\/(.*)\//


[1]
music, video, photo, podcast, everything..; really expensive
[2]
Video, earbuds, click wheel.; Software updates, synching can be annoying.
[3]
Bonus 10 GB, thinner design; Nothing, design is very strange, probably as scratchable as nano..


Have you ever wanted more, to do more now is your chance learn what's underneath your surface
In Partnership with Microsoft Surface
Find Out More'Everything isn't as it seems. Unlock your potentials with a range of different Surfaces'
Get Started!Highlight the image and click the button for information/price


{% extends "base.html" %} {% block title %} Library {% endblock %} {% block header %}
A rich library with all genres of books, lists, bibliographies and reviews of library materials.
{% endblock %} {% block content %}There are no books in the library yet.
{% endif %}


roprov: Low-Level Support for Provenance Capture Between in-Memory R
Objects
A suite of classes and methods which provide low-level support for modeling provenance between in-memory R objects. This is an infrastructure package and is not intended to be used directly by end-users.
| Version: |
0.1.2 |
| Depends: |
methods, fastdigest |
| Imports: |
CodeDepends (≥ 0.3.5), igraph |
| Published: |
2018-11-06 |
| Author: |
Gabriel Becker |
| Maintainer: |
Gabriel Becker <gabembecker at gmail.com> |
| License: |
Artistic-2.0 |
| Copyright: |
Genentech, Inc. |
| NeedsCompilation: |
no |
| CRAN checks: |
roprov results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=roprov
to link to this page.


Social Drafters is a student-run initiative in the field of humanities and social sciences. We, at Social Drafters, aim for an efficient dissemination of information and knowledge. We provide a platform for students from the field of humanities, to showcase their critical thinking and academic capabilities by publishing their research articles. Alongside, we also provide the students with information about the latest events and opportunities available to them.


From a young age, I was an avid tech junkie. In every respect, I would find any opportunity to get my hands on any hardware or software that happened my way. From building my own computer to eventually writing my own applications. The addiction only got worse after conceding to audio and visual engineering. Creating video content, mixing and recording music and the amazing things technology and hardware was capable of doing. Not long after, the infatuation of software and programming took hold. I now work in web development and learn in the most progressive and faced paced industry I have come to experience. I have been quick and eager to learn and have found a place as a Web Developer and aspiring Web Applications Developer. I still consider myself a music and film junkie, but equally thrive in the world of DevOps and look forward to building a strong and reputable career in my field. Tom Morello and Chris Cornell are as much appreciated as coffee in a 500ml star wars mug.


ASSEMBLE
Blog
GitHub Repo
Partial Globbing Example
Partial Globbing Example
Single Partial
Heads up!
This not an important alert!
Globbing


Bullying is a big issue that happens all around the world, yet it's not a big deal. Every 7 seconds someone is getting bullyied. If you think about it deeper that's a lot of kids getting bullied. Most teenageres will start to have terrible thoughts about themselves, which isn't healthy.
If you see bullying you can help stop it. Once you see someone bullying someone stand by them to not make them feel alone and speak out to the bully. If the bully doesn't stop then, talk to a grown up that you know can help stop it. Since there are different ways of bullying i'll give an example of cyberbullying. You may tell your guardian or go to the police. To show proof to the police make sure to take screenshot it will be helpful.
Since bullying isn't getting know as much, we can all do something different to help. I have have some examples. If you wanna start small you can go around your neighborhood and talk to people about bullying.We can do marchs saying how bullting is impacting a whole lot of peoples.We can we webites and make ads to make it pop around to gt it known more.
"I feel sad and mad about bullying. In my opinion it isn't something that I want it to be in the world."
"What i think about bully is that it can affect you in a bad ways and it is not healthy."
 Just stop hurting eachother and BE YOUSELF"


HTML5 is the latest evolution of the standard that defines HTML. The term represents two different concepts: It is a new version of the language HTML, with new elements, attributes, and behaviors, and a larger set of technologies that allows more diverse and powerful Web sites and applications.Sep 20, 2016.
CSS3 is the latest standard for CSS. CSS3 is completely backwards-compatible with earlier versions of CSS. This section teaches you about the new features in CSS3!.CSS3 has been split into "modules". It contains the "old CSS specification" (which has been split into smaller pieces)
Bootstrap is the most popular HTML, CSS, and JavaScript framework for developing responsive, mobile-first web sites.Bootstrap is completely free to download and use! Bootstrap makes front-end web development faster and easier. It's made for folks of all skill levels, devices of all shapes, and projects of all sizes.
CJavaScript is an object-based scripting language that is lightweight and cross-platform. JavaScript is not compiled but translated. The JavaScript Translator (embedded in browser) is responsible to translate the JavaScript code.
jQuery is a fast, small, and feature-rich JavaScript library. It makes things like HTML document traversal and manipulation, event handling, animation, and Ajax much simpler with an easy-to-use API that works across a multitude of browsers.
AngularJS is a very powerful JavaScript Framework. It is used in Single Page Application (SPA) projects. It extends HTML DOM with additional attributes and makes it more responsive to user actions. AngularJS is open source, completely free, and used by thousands of developers around the world. It is licensed under the Apache license version 2.0.
React is front end library developed by Facebook. It's used for handling view layer for web and mobile apps. ReactJS allows us to create reusable UI components. It is currently one of the most popular JavaScript libraries and it has strong foundation and large community behind it.
SQL is a database computer language designed for the retrieval and management of data in relational database. SQL stands for Structured Query Language.Our SQL tutorial will teach you how to use SQL to access and manipulate data in: MySQL, SQL Server, Access, Oracle, Sybase, DB2, and other database systems.
PHP is a server scripting language, and a powerful tool for making dynamic and interactive Web pages. PHP is a widely-used, free, and efficient alternative to competitors such as Microsoft's ASP.The PHP Hypertext Preprocessor (PHP) is a programming language that allows web developers to create dynamic content that interacts with databases. PHP is basically used for developing web based software applications. This tutorial helps you to build your base with PHP.
Firebase gives you the tools to develop high-quality apps, grow your user base, and earn more money. We cover the essentials so you can monetize your business and focus on your users.


| RPC Control Functions {pbdRPC} | R Documentation |
These sets of controls are used to provide default values in pbdRPC package.
RPC.CT(verbose = FALSE, intern = FALSE, wait = TRUE, check.exec = FALSE, use.shell.exec = TRUE, pause = TRUE) RPC.LI(exec.type = "ssh", args = "", pport = "22", user = "snoweye", hostname = "<IP_ADDRESS>", priv.key = "~/.ssh/id_rsa", priv.key.ppk = "./id_rsa.ppk") RPC.RR(check = "ps ax|grep '[r]emoter::server'", kill = "kill -9 $(ps ax|grep '[r]emoter::server'|awk '{print $1}')", start = "nohup Rscript -e 'remoter::server()' > .rrlog 2>&1 < /dev/null &", preload = "source ~/work-my/00_set_devel_R; ")
verbose, intern, wait, check.exec, use.shell.exec, pause |
RPC control for |
exec.type, args, pport, user, hostname, priv.key, priv.key.ppk |
|
check, kill, start, preload |
RPC remoter commands used by |
Wei-Chen Chen<EMAIL_ADDRESS>Programming with Big Data in R Website: http://r-pbd.org/


Course Name:
TA Name:
Please rate your overall experience with the TA:
Very Bad Bad Good Very Good
Please leave any comments you have regarding your TA below:
Your Name (Optional):
Check the box below to be contacted by the Insturctor via Email:
I wish to be contacted by the Instructor Your Contact Info(Email, Phone Number, etc.):


|
NASA's Hubble Space Telescope snapped this shot of Mars on Aug. 26, 2003, when the Red Planet was 34.7 million miles from Earth. The picture was taken just 11 hours before Mars made its closest approach to us in 60,000 years. Credit: NASA/ESA |
Mars is the fourth planet from the sun. Befitting the red planet's bloody color, the Romans named it after their god of war. The Romans copied the ancient Greeks, who also named the planet after their god of war, Ares. Other civilizations also typically gave the planet names based on its color — for example, the Egyptians named it "Her Desher," meaning "the red one," while ancient Chinese astronomers dubbed it "the fire star."
Physical characteristics
Regolith
The bright rust color Mars is known for is due to iron-rich minerals in its regolith — the loose dust and rock covering its surface. The soil of Earth is a kind of regolith, albeit one loaded with organic content. According to NASA, the iron minerals oxidize, or rust, causing the soil to look red.
Geology
The cold, thin atmosphere means liquid water currently cannot exist on the Martian surface for any length of time. This means that although this desert planet is just half the diameter of Earth, it has the same amount of dry land.
The red planet is home to both the highest mountain and the deepest, longest valley in the solar system. Olympus Mons is roughly 17 miles (27 kilometers) high, about three times as tall as Mount Everest, while the Valles Marineris system of valleys — named after the Mariner 9 probe that discovered it in 1971 — can go as deep as 6 miles (10 km) and runs east-west for roughly 2,500 miles (4,000 km), about one-fifth of the distance around Mars and close to the width of Australia or the distance from Philadelphia to San Diego.
Mars has the largest volcanoes in the solar system, including Olympus Mons, which is about 370 miles (600 km) in diameter, wide enough to cover the entire state of New Mexico. It is a shield volcano, with slopes that rise gradually like those of Hawaiian volcanoes, and was created by eruptions of lavas that flowed for long distances before solidifying. Mars also has many other kinds of volcanic landforms, from small, steep-sided cones to enormous plains coated in hardened lava. Some minor eruptions might still occur on the planet.
Scientists think the Valles Marineris formed mostly by rifting of the crust as it got stretched. Individual canyons within the system are as much as 60 miles (100 km) wide. They merge in the central part of the Valles Marineris in a region as much as 370 miles (600 km) wide. Large channels emerging from the ends of some canyons and layered sediments within suggest the canyons might once have been filled with liquid water.
Channels, valleys, and gullies are found all over Mars, and suggest that liquid water might have flowed across the planet's surface in recent times. Some channels can be 60 miles (100 km) wide and 1,200 miles (2,000 km) long. Water may still lie in cracks and pores in underground rock.
Many regions of Mars are flat, low-lying plains. The lowest of the northern plains are among the flattest, smoothest places in the solar system, potentially created by water that once flowed across the Martian surface. The northern hemisphere mostly lies at a lower elevation than the southern hemisphere, suggesting the crust may be thinner in the north than in the south. This difference between the north and south might be due to a very large impact shortly after the birth of Mars.
The number of craters on Mars varies dramatically from place to place, depending on how old the surface is. Much of the surface of the southern hemisphere is extremely old, and so has many craters — including the planet's largest, 1,400-mile-wide (2,300 km) Hellas Planitia — while that of northern hemisphere is younger and so has fewer craters. Some volcanoes have few craters, which suggests they erupted recently, with the resulting lava covering up any old craters. Some craters have unusual-looking deposits of debris around them resembling solidified mudflows, potentially indicating that impactor hit underground water or ice.
Polar caps
Vast deposits of what appear to be finely layered stacks of water ice and dust extend from the poles to latitudes of about 80 degrees in both hemispheres. These were probably deposited by the atmosphere over long spans of time. On top of much of these layered deposits in both hemispheres are caps of water ice that remain frozen all year round. Additional seasonal caps of frost appear in the wintertime. These are made of solid carbon dioxide, also known as "dry ice," which has condensed from carbon dioxide gas in the atmosphere, and in the deepest part of the winter, this frost can extend from the poles to latitudes as low as 45 degrees, or halfway to the equator. The dry ice layer appears to have a fluffy texture, like freshly fallen snow, according to the report in the Journal of Geophysical Research-Planets.
Climate
Mars is much colder than Earth, in large part due to its greater distance from the sun. The average temperature is about minus 80 degrees Fahrenheit (minus 60 degrees Celsius), although they can vary from minus 195 F (minus 125 C) near the poles during the winter to as much as 70 F (20 C) at midday near the equator.
The carbon-dioxide-rich atmosphere of Mars is also roughly 100 times less dense than Earth's on average, but it is nevertheless thick enough to support weather, clouds and winds. The density of the atmosphere varies seasonally, as winter forces carbon dioxide to freeze out of the Martian air.
NASA’s Mars Reconnaissance Orbiter found the first definitive detections of carbon-dioxide snow clouds, making Mars the only body in the solar system known to host the unusual winter weather. The red planet also causes water-ice snow to fall from the clouds.
The dust storms of the Mars are the largest in the solar system, capable of blanketing the entire red planet and lasting for months. One theory as to why dust storms can grow so big on Mars starts with airborne dust particles absorbing sunlight, warming the Martian atmosphere in their vicinity. Warm pockets of air flow toward colder regions, generating winds. Strong winds lift more dust off the ground, which in turn heats the atmosphere, raising more wind and kicking up more dust.
Orbital characteristics
The axis of Mars, like Earth's, is tilted with relation to the sun. This means that like Earth, the amount of sunlight falling on certain parts of the planet can vary widely during the year, giving Mars seasons.
However, the seasons that Mars experiences are more extreme than Earth's because the red planet's elliptical, oval-shaped orbit around the sun is more elongated than that of any of the other major planets. When Mars is closest to the sun, its southern hemisphere is tilted toward the sun, giving it a short, very hot summer, while the northern hemisphere experiences a short, cold winter. When Mars is farthest from the sun, the northern hemisphere is tilted toward the sun, giving it a long, mild summer, while the southern hemisphere experiences a long, cold winter.
Composition & structure
Atmospheric composition (by volume):
95.32 percent carbon dioxide, 2.7 percent nitrogen, 1.6 percent argon, 0.13 percent oxygen, 0.08 percent carbon monoxide, minor amounts of water, nitrogen oxide, neon, hydrogen-deuterium-oxygen, krypton, xenon
Magnetic field: Mars currently has no global magnetic field, but there are regions of its crust that can be at least 10 times more strongly magnetized than anything measured on Earth, remnants of an ancient global magnetic field.
Chemical composition: Mars likely has a solid core composed of iron, nickel, and sulfur. The mantle of Mars is probably similar to Earth's in that it is composed mostly of peridotite, which is made up primarily of silicon, oxygen, iron and magnesium. The crust is probably largely made of the volcanic rock basalt, which is also common in the crusts of the Earth and the moon, although some crustal rocks, especially in the northern hemisphere, may be a form of andesite, a volcanic rock that contains more silica than basalt does.
Internal structure: Scientists think that on average, the Martian core is about 1,800 and 2,400 miles in diameter (3,000 and 4,000 km), its mantle is about 900 to 1,200 miles (5,400 to 7,200 km) wide and its crust is about 30 miles (50 km) thick.
Orbit & rotation
Average distance from the sun: 141,633,260 miles (227,936,640 km). By comparison: 1.524 times that of Earth
Perihelion (closest): 128,400,000 miles (206,600,000 km). By comparison: 1.404 times that of Earth
Aphelion (farthest): 154,900,000 miles (249,200,000 km). By comparison: 1.638 times that of Earth
The moons of Mars
The two moons of Mars, Phobos and Deimos, were discovered by American astronomer Asaph Hall over the course of a week in 1877. Hall had almost given up his search for a moon of Mars, but his wife, Angelina, urged him on — he discovered Deimos the next night, and Phobos six days after that. He named the moons after the sons of the Greek war god Ares — Phobos means "fear," while Deimos means "rout."
Both Phobos and Deimos are apparently made of carbon-rich rock mixed with ice and are covered in dust and loose rocks. They are tiny next to Earth's moon, and are irregularly shaped, since they lack enough gravity to pull themselves into a more circular form. The widest Phobos gets is about 17 miles (27 km), and the widest Deimos gets is roughly nine miles (15 km).
Both moons are pockmarked with craters from meteor impacts. The surface of Phobos also possesses an intricate pattern of grooves, which may be cracks that formed after the impact created the moon's largest crater — a hole about 6 miles (10 km) wide, or nearly half the width of Phobos. They always show the same face to Mars, just as our moon does to Earth.
It remains uncertain how Phobos and Deimos were born. They may have been asteroids captured by Mars' gravitational pull, or they may have been formed in orbit around Mars the same time the planet came into existence. Ultraviolet light reflected from Phobos provides strong evidence for its capture origin, according to astronomers at the University of Padova in Italy.
Phobos is gradually spiraling toward Mars, drawing about 6 feet (1.8 meters) closer to the red planet each century. Within 50 million years, Phobos will either smash into Mars or break up and form a ring of debris around the planet.
Both moons are potential targets for exploration. One NASA plan envisions bombarding Phobos with small, spiky spherical rovers called hedgehogs.
Credit: Karl Tate, SPACE.com
Research & exploration
The first person to watch Mars with a telescope was Galileo Galilei, and in the century after him, astronomers discovered its polar ice caps. In the 19th and 20th centuries, researchers believed they saw a network of long, straight canals on Mars, hinting at civilization, although later these often proved to be mistaken interpretations of dark regions they saw.
Robot spacecraft began observing Mars in the 1960s, with the United States launching Mariner 4 there in 1964 and Mariners 6 and 7 in 1969. They revealed Mars to be a barren world, without any signs of the life or civilizations people had imagined there. In 1971, Mariner 9 orbited Mars, mapping about 80 percent of the planet and discovering its volcanoes and canyons.
NASA's Viking 1 lander touched down onto the surface of Mars in 1976, the first successful landing onto the Red Planet. It took the first close-up pictures of the Martian surface but found no strong evidence for life.
The next two craft to successfully reach Mars were the Mars Pathfinder, a lander, and Mars Global Surveyor, an orbiter, both launched in 1996. A small robot onboard Pathfinder named Sojourner — the first wheeled rover to explore the surface of another planet — ventured over the planet's surface analyzing rocks.
In 2001, the United States launched the Mars Odyssey probe, which discovered vast amount of water ice beneath the Martian surface, mostly in the upper three feet (one meter). It remains uncertain whether more water lies underneath, since the probe cannot see water any deeper.
In 2003, the closest Mars had passed to Earth in nearly 60,000 years, NASA launched two rovers, nicknamed Spirit and Opportunity, which explored different regions of the Martian surface, and both found signs that water once flowed on the planet's surface. In 2008, NASA sent another mission, Phoenix, to land in the northern plains of Mars and search for water,
Two orbiters — NASA's Mars Reconnaissance Orbiter and ESA's Mars Express — are keeping Mars Odyssey company over the planet. In 2011, NASA's Mars Science Laboratory mission, with its rover named Mars Curiosity, began to investigate Martian rocks to determine the geologic processes that created them and find out more about the present and past habitability of Mars. Among its findings is the first meteorite on the surface of the red planet.
In September 2014, India’s Mars Orbiter Mission reached the red planet, making it the fourth nation to successfully enter orbit around Mars.
Robots aren’t the only ones looking to buy a ticket to Mars. A workshop group of government, academic, and industry scientists have found that a NASA-led manned mission to Mars should be possible by the 2030s. But NASA isn’t the only one with Martian astronaut hopefuls.. The Mars One colony project is looking to send private citizens on a one-way trip to the red planet.
Possibility of life
Mars could have once harbored life. Some conjecture that life might still exist there even today. A number of researchers have even speculated that life on Earth may have seeded Mars, or that life on Mars seeded Earth.
The most public scientific claim for life on Mars came in 1996. Geologist David McKay at NASA's Johnson Space Center in Houston and his colleagues focused on rocks blasted off the surface of Mars by cosmic impacts that landed on Earth. Within they found complex organic molecules, grains of a mineral called magnetite that can form within some kinds of bacteria, and tiny structures that resembled fossilized microbes. However, these claims have proven controversial, and there is no consensus as to whether they are signs of life.
Mars may have possessed oceans on its surface in the past, providing an environment for life to develop. Although the red planet is a cold desert today, researchers suggest that liquid water may be present underground, providing a potential refuge for any life that might still exist there. The rover Curiosity has found evidence for a lake that could have once supported life on the red planet, after previously establishing that the planet had the key ingredients present for life to evolve.
Enthusiasm and excitement on Earth over the possibility of life on the red planet are revealed by the flurry of excitement that greets interesting objects spotted by orbiters and landers. While the Face on Mars garnered attention for the past four decades after it was first spotted by Viking 1, rovers today show close-ups of objects — such as a weathered Martian rock claimed to be a ‘thigh bone’ and a likely shiny rock that raised furor on the internet as a UFO light.
Additional resources
- Read about and see pictures of more than 40 missions to Mars.
- Follow the rover Curiosity as it makes its way across the Martian terrain.
- Learn more about Mars at NASA's Solar System Exploration website.
Related:
- How Big is Mars?
- How Far Away is Mars?
- Does Mars Have an Atmosphere?
- How Cold is Mars?
- What is Mars Made Of?
- How Was Mars Formed?
Also see:
- Solar System Planets overview
- Solar System Facts overview
Learn more about each of the primary planets:


March 10, 2019
Columbia China Dance hosted its first ever showcase “Castle in the Air,”《镜花水月》, highlighting Chinese classical, folk, and contemporary style dances. Members from outside the Columbia community were invited to perform as well, including dancers from Asian Fusion Dance at NYU and Sunshine Dance. With the collaborative efforts of more than 80 performers and backstage workers, the showcase was a success, receiving extensive attention and praise from the greater NYC community. Columbia China Dance was also honored to have famous Chinese dancer, Lijun Zhou (周丽君), teach members her signature dance, Deux Belles (尤物). Following the performance, board members and Ms. Zhou were interviewed by many media and were featured twice by People’s Daily Online.
People’s Daily Online (人民网):
Interview by 势Wave at Columbia


Snow Viz by
@liquidx
iOS Slopes
iOS Snoww
Android Ski tracker
Android Ski Tracks
(Android) Trace Snow


|
Employing circuit and field simulation has reduced engineering time from three months to two weeks for a gas pedal position inductance sensor. |
|
ANSYS technology helps the largest European manufacturer of two-wheeled motor vehicles to efficiently improve the design of crankshafts. |
|
Simulation of fuel and electronics systems helps Parker Aero decrease development time and costs, and reduce ri |
|
Astrobotic Technology is using simulation to develop a robot to reliably travel to the moon and across the lunar surface. |
|
Rockwell Automation ensures that designs will work by bridging the gap between mechanical and electrical simulation and employing ANSYS technology up front in the design process. |
|
QuEST Global helped Hennessy Industries design a frame for a tire-balancing machine more quickly and efficiently than could have been accomplished with standard build and test methods. |


© Copyright 2000-2008 by the University of Washington. Written by Joseph Felsenstein. Permission is granted to copy this document provided that no fee is charged for it and that this copyright notice is not removed.
Restdist reads the same restriction sites format as Restml and computes a restriction sites distance. It can also compute a restriction fragments distance. The original restriction fragments and restriction sites distance methods were introduced by Nei and Li (1979). Their original method for restriction fragments is also available in this program, although its default methods are my modifications of the original Nei and Li methods.
These two distances assume that the restriction sites are accidental byproducts of random change of nucleotide sequences. For my restriction sites distance the DNA sequences are assumed to be changing according to the Kimura 2-parameter model of DNA change (Kimura, 1980). The user can set the transition/transversion rate for the model. For my restriction fragments distance there is an implicit assumption of a Jukes-Cantor (1969) model of change. The user can also set the parameter of a correction for unequal rates of evolution between sites in the DNA sequences, using a Gamma distribution of rates among sites. The Jukes-Cantor model is also implicit in the restriction fragments distance of Nei and Li(1979). It does not allow us to correct for a Gamma distribution of rates among sites.
The restriction sites distances use data coded for the presence or absence of individual restriction sites (usually as + and - or 0 and 1). My distance is based on the proportion, out of all sites observed in one species or the other, which are present in both species. This is done to correct for the ascertainment of sites, for the fact that we are not aware of many sites because they do not appear in any species.
My distance starts by computing from the particular pair of species the fraction
n++ f = --------------------- n++ + 1/2 (n+- + n-+)where n++ is the number of sites contained in both species, n+- is the number of sites contained in the first of the two species but not in the second, and n-+ is the number of sites contained in the second of the two species but not in the first. This is the fraction of sites that are present in one species which are present in both. Since the number of sites present in the two species will often differ, the denominator is the average of the number of sites found in the two species.
If each restriction site is s nucleotides long, the probability that a restriction site is present in the other species, given that it is present in a species, is
Qs,where Q is the probability that a nucleotide has no net change as one goes from the one species to the other. It may have changed in between; we are interested in the probability that that nucleotide site is the same base in both species, irrespective of what has happened in between.
The distance is then computed by finding the branch length of a two-species tree (connecting these two species with a single branch) such that Q equals the s-th root of f. For this the program computes Q for various values of branch length, iterating them by a Newton-Raphson algorithm until the two quantities are equal.
The resulting distance should be numerically close to the original restriction sites distance of Nei and Li (1979) when divergence is small. Theirs computes the probability of retention of a site in a way that assumes that the site is present in the common ancestor of the two species. Ours does not make this assumption. It is inspired by theirs, but differs in this detail. Their distance also assumes a Jukes-Cantor (1969) model of base change, and does not allow for transitions being more frequent than transversions. In this sense mine generalizes theirs somewhat. Their distance does include, as mine does as well, a correction for Gamma distribution of rate of change among nucleotide sites.
I have made their original distance available here (option N).
For restriction fragments data we use a different distance. If we average over all restriction fragment lengths, each at its own expected frequency, the probability that the fragment will still be in existence after a certain amount of branch length, we must take into account the probability that the two restriction sites at the ends of the fragment do not mutate, and the probability that no new restriction site occurs within the fragment in that amount of branch length. The result for a restriction site length of s is:
Q2s f = -------- 2 - Qs(The details of the derivation are given in my book Inferring Phylogenies (Felsenstein, 2004).) Given the observed fraction of restriction sites retained, f, we can solve a quadratic equation from the above expression for Qs. That makes it easy to obtain a value of Q, and the branch length can then be estimated by adjusting it so the probability of a base not changing is equal to that value.
Alternatively, if we use the Nei and Li (1979) restriction fragments distancen (available in this program using menu option N), this involves solving for g in the nonlinear equation
g = [ f (3 - 2g) ]1/4and then the distance is given by
d = - (2/r) loge(g)where r is the length of the restriction site.
Comparing these two restriction fragments distances in a case where their underlying DNA model is the same (which is when the transition/transversion ratio of the modified model is set to 0.5), you will find that they are very close to each other, differing very little at small distances, with the modified distance becoming smaller than the Nei/Li distance at larger distances. It will therefore matter very little which one you use.
Although these distances are designed for restriction sites and restriction fragments data, they can be applied to RAPD and AFLP data as well. RAPD (Randomly Amplified Polymorphic DNA) and AFLP (Amplified Fragment Length Polymorphism) data consist of presence or absence of individual bands on a gel. The bands are segments of DNA with PCR primers at each end. These primers are defined sequences of known length (often about 10 nucleotides each). For AFLPs the relevant length is the primer length, plus three nucleotides. Mutation in these sequences makes them no longer be primers, just as in the case of restriction sites. Thus a pair of 10-nucleotide primers will behave much the same as a 20-nucleotide restriction site, for RAPDs (26 for AFLPs). You can use the restriction sites distance as the distance between RAPD or AFLP patterns if you set the proper value for the total length of the site to the total length of the primers (plus 6 in the case of AFLPs). Of course there are many possible sources of noise in these data, including confusing fragments of similar length for each other and having primers near each other in the genome, and these are not taken into account in the statistical model used here.
The input is fairly standard, with one addition. As usual the first line of the file gives the number of species and the number of sites, but there is also a third number, which is the number of different restriction enzymes that were used to detect the restriction sites. Thus a data set with 10 species and 35 different sites, representing digestion with 4 different enzymes, would have the first line of the data file look like this:
10 35 4
The site data are in standard form. Each species starts with a species name whose maximum length is given by the constant "nmlngth" (whose value in the program as distributed is 10 characters). The name should, as usual, be padded out to that length with blanks if necessary. The sites data then follows, one character per site (any blanks will be skipped and ignored). Like the DNA and protein sequence data, the restriction sites data may be either in the "interleaved" form or the "sequential" form. Note that if you are analyzing restriction sites data with the programs Dollop or Mix or other discrete character programs, at the moment those programs do not use the "aligned" or "interleaved" data format. Therefore you may want to avoid that format when you have restriction sites data that you will want to feed into those programs.
The presence of a site is indicated by a "+" and the absence by a "-". I have also allowed the use of "1" and "0" as synonyms for "+" and "-", for compatibility with Mix and Dollop which do not allow "+" and "-". If the presence of the site is unknown (for example, if the DNA containing it has been deleted so that one does not know whether it would have contained the site) then the state "?" can be used to indicate that the state of this site is unknown.
The options are selected using an interactive menu. The menu looks like this:
Restriction site or fragment distances, version 3.69 Settings for this run: R Restriction sites or fragments? Sites N Original or modified Nei/Li model? Modified G Gamma distribution of rates among sites? No T Transition/transversion ratio? 2.000000 S Site length? 6.0 L Form of distance matrix? Square M Analyze multiple data sets? No I Input sequences interleaved? Yes 0 Terminal type (IBM PC, ANSI, none)? ANSI 1 Print out the data at start of run? No 2 Print indications of progress of run? Yes Y to accept these or type the letter for one to change |
The user either types "Y" (followed, of course, by a carriage-return) if the settings shown are to be accepted, or the letter or digit corresponding to an option that is to be changed.
The R option toggles between a restriction sites distance, which is the default setting, and a restriction fragments distance. In both cases, another option appears, the N (Nei/Li) option. This allows the user to choose the original Nei and Li (1979) restriction sites or fragments distances rather than my modified versions, which are the defaults.
If the G (Gamma distribution) option is selected, the user will be asked to supply the coefficient of variation of the rate of substitution among sites. This is different from the parameters used by Nei and Jin, who introduced Gamma distribution of rates in DNA distances, but related to their parameters: their parameter a is also known as "alpha", the shape parameter of the Gamma distribution. It is related to the coefficient of variation by
CV = 1 / a1/2
or
a = 1 / (CV)2
(their parameter b is absorbed here by the requirement that time is scaled so that the mean rate of evolution is 1 per unit time, which means that a = b). As we consider cases in which the rates are less variable we should set a larger and larger, as CV gets smaller and smaller.
The Gamma distribution option is not available when using the original Nei/Li restriction fragments distance.
The T option is the Transition/transversion option. The user is prompted for a real number greater than 0.0, as the expected ratio of transitions to transversions. Note that this is the resulting expected ratio of transitions to transversions. The default value of the T parameter if you do not use the T option is 2.0. The T option is not available when you choose the original Nei/Li restriction fragment distance, which assumes a Jukes-Cantor (1969) model of DNA change, for which the transition/transversion ratio is in effect fixed at 0.5.
The S option selects the site length. This is set to a default value of 6. It can be set to any positive integer. While in the Restml program there is an upper limit on the restriction site length (set by memory limitations), in Restdist there is no effective limit on the size of the restriction sites. A value of 20, which might be appropriate in many cases for RAPD or AFLP data, is typically not practical in Restml, but it is useable in Restdist.
Option L specifies that the output file will have a square matrix of distances. It can be used to change to lower-triangular data matrices. This will usually not be necessary, but if the distance matrices are going to be very large, this alternative can reduce their size by half. The programs which are to use them should then of course be informed that they can expect lower-triangular distance matrices.
The M, I, and 0 options are the usual Multiple data set, Interleaved input, and screen terminal type options. These are described in the main documentation file.
Option 1 specifies that the input data will be written out on the output file before the distances. This is off by default. If it is done, it will make the output file unusable as input to our distance matrix programs.
Option 2 turns off or on the indications of the progress of the run. The program prints out a row of dots (".") indicating the calculation of individual distances. Since the distance matrix is symmetrical, the program only computes the distances for the upper triangle of the distance matrix, and then duplicates the distance to the other corner of the matrix. Thus the rows of dots start out at full length, and then get shorter and shorter.
The output file contains on its first line the number of species. The distance matrix is then printed in standard form, with each species starting on a new line with the species name, followed by the distances to the species in order. These continue onto a new line after every nine distances. If the L option is used, the matrix of distances is in lower triangular form, so that only the distances to the other species that precede each species are printed. Otherwise the distance matrix is square with zero distances on the diagonal. In general the format of the distance matrix is such that it can serve as input to any of the distance matrix programs.
If the option to print out the data is selected, the output file will precede the data by more complete information on the input and the menu selections. The output file begins by giving the number of species and the number of characters.
The distances printed out are scaled in terms of expected numbers of substitutions per DNA site, counting both transitions and transversions but not replacements of a base by itself, and scaled so that the average rate of change, averaged over all sites analyzed, is set to 1.0. Thus when the G option is used, the rate of change at one site may be higher than at another, but their mean is expected to be 1.
The constants available to be changed are "initialv" and "iterationsr". The constant "initialv" is the starting value of the distance in the iterations. This will typically not need to be changed. The constant "iterationsr" is the number of times that the Newton-Raphson method which is used to solve the equations for the distances is iterated. The program can be speeded up by reducing the number of iterations from the default value of 20, but at the possible risk of computing the distance less accurately.
5 13 2 Alpha ++-+-++--+++- Beta ++++--+--+++- Gamma -+--+-++-+-++ Delta ++-+----++--- Epsilon ++++----++--- |
(Note that when the options for displaying the input data are turned off, the output is in a form suitable for use as an input file in the distance matrix programs).
5 Species, 13 Sites Name Sites ---- ----- Alpha ++-+-++--+ ++- Beta ++++--+--+ ++- Gamma -+--+-++-+ -++ Delta ++-+----++ --- Epsilon ++++----++ --- Alpha 0.000000 0.022368 0.107681 0.082634 0.095581 Beta 0.022368 0.000000 0.107681 0.082634 0.056895 Gamma 0.107681 0.107681 0.000000 0.192466 0.207319 Delta 0.082634 0.082634 0.192466 0.000000 0.015949 Epsilon 0.095581 0.056895 0.207319 0.015949 0.000000 |


This Is A Opensource Icons Library By Ocean Of Anything. From Here You Can Get Meterial Icons Of Various Types Of Files And Folders. You Can Copy The Link OF The Icon You Want And Use It In Your Project. In HTML You Can Use img and embed Tag


Just... edit the text.
You know you want to.
I couldn't possibly condone downloading an image of the amusing changes you come up with and, say, posting it to Twitter with the hashtag #EdStone.
Image from the Guardian, which I will of course take down if they don't like it.


The HTTP Session Management Module enables you to customize how you manage your session data.
Depending on your usage model, the HTTP Session Management Module enables you to accomplish the following tasks:
- Replicate session data across multiple peers.
- Partition data across multiple servers.
- Manage your session data in many other customizable ways.
Using Geode for session management has many advantages:
tc Server integration
The Geode module offers clean integration into the tc Server environment with minimal configuration changes necessary.
Scalability
Applications with a small number of frequently-accessed sessions can replicate session information on all members in the system. However, when the number of concurrent sessions being managed is large, data can be partitioned across any number of servers (either embedded within your application server process or managed by Geode cache servers), which allows for linear scaling. Additionally, capacity can be dynamically added or removed in a running system and Geode re-executes a non-blocking, rebalancing logic to migrate data from existing members to the newly added members. When the session state memory requirements exceed available memory, each partition host can overflow to disk.
Server-managed session state
Session state can be managed independent of the application server cluster. This allows applications or servers to come and go without impacting session lifetimes.
Shared nothing cluster-wide persistence
Session state can be persisted (and recovered) - invaluable for scenarios where sessions manage critical application state or have long lifetimes. Geode uses a shared nothing persistence model where each member can continuously append to rolling log files without ever needing to seek on disk, providing very high disk throughput. When data is partitioned, the total disk throughput can come close to the aggregate disk transfer rates across each of the members storing data on disk.
Session deltas
When session attributes are updated, only the updated state that is sent over the wire (to cache servers and to replicas). This provides fast updates even for large sessions. Session state is always managed in a serialized state on the servers, avoiding the need for the cache servers to be aware of the application classes.
Tiered caching
Applications can configure a local or near cache for in-process caching of the most frequently used session state. This local cache delegates to a farm of cache servers where the entire session state is partitioned across any number of peer cache servers. The local cache can be configured to consume a certain percentage of the total heap available before least-recently used (LRU) eviction. This is a simpler and more effective way to manage LRU caches as opposed to alternate strategies based on count or memory size, which increase the risk of getting an “OutOfMemoryException”.
Application server sizing
Another aspect of tiered-caching functionality is that session replication can be configured so that session objects are stored external to the application server process. This allows the heap settings on the application server to be much smaller than they would otherwise need to be.
High availability (HA), disk-based overflow, synchronization to backend data store, other Geode features
All the popular Geode features are available. For example: more than one synchronous copy of the session state can be maintained providing high availability (HA); the session cache can overflow to disk if the memory capacity in the cache server farm becomes insufficient; state information can be written to a backend database in a synchronous or asynchronous manner.


|
| def | __init__ (self, gameState, costFn=lambda x:1, goal=(1, 1), start=None, warn=True) |
| |
|
def | getStartState (self) |
| |
|
def | isGoalState (self, state) |
| |
| def | getSuccessors (self, state) |
| |
| def | getCostOfActions (self, actions) |
| |
| def | getStartState (self) |
| |
| def | isGoalState (self, state) |
| |
| def | getSuccessors (self, state) |
| |
| def | getCostOfActions (self, actions) |
| |
A search problem defines the state space, start state, goal test,
successor function and cost function. This search problem can be
used to find paths to a particular point on the pacman board.
The state space consists of (x,y) positions in a pacman game.
Note: this search problem is fully specified; you should NOT change it.
| def searchAgents.PositionSearchProblem.getSuccessors |
( |
|
self, |
|
|
|
state |
|
) |
| |
Returns successor states, the actions they require, and a cost of 1.
As noted in search.py:
For a given state, this should return a list of triples,
(successor, action, stepCost), where 'successor' is a
successor to the current state, 'action' is the action
required to get there, and 'stepCost' is the incremental
cost of expanding to that successor


Peter Blegvad, from “The Unborn Byron”:
Spread the word, tomorrow morn
A future poet shall be born.
From my mother I shall fall
Into the womb that holds us all.
My life shall be a meteor
Which generations shall adore.
For my unbuttoned liberty
The unborn will remember me.
Mr Key, from “The Tiny Newborn Mr Key”:
1959, this very morn
The tiny Mr Key was born
He was a full month premature
When he knocked his fist upon the door
Of the world beyond his mother's womb
A tiny bright spark in the gloom
And soon the words poured out of him
They pour out still, with ceaseless vim.


--- layout: post status: publish published: true title: Marshaling Delegates as __cdecl author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 373 wordpress_url: http://winterdom.com/2008/01/marshalingdelegatesas__cdecl date: '2008-01-11 05:42:56 +0000' date_gmt: '2008-01-11 05:42:56 +0000' categories: - ".NET" tags: [] comments: - id: 1237 author: namalik author_email<EMAIL_ADDRESS>author_url: http://www.namalik.com date: '2009-11-23 01:55:20 +0000' date_gmt: '2009-11-23 01:55:20 +0000' content: I love you man. I spend the two days struggling with it. Thanks a lot for the post. - id: 1722 author: Fred author_email<EMAIL_ADDRESS>author_url: '' date: '2011-05-27 12:10:14 +0000' date_gmt: '2011-05-27 12:10:14 +0000' content: Many thanks ---
I spent some time the last couple of days working on some C# code that used P/Invoke to interact with an unmanaged library consisting of several function calls and some callback procedures.
One of the issues I ran into was that I needed to pass to one of the library's functions a delegate for it to use as a callback procedure. Doing this is usually not much of a problem, but this time I'd get an AccessViolationException after my managed callback function returned, signaling that the stack was probably getting corrupted somewhere.
After looking around quite a bit I realized my mistake: The C API I was invoking used the C calling convention (__cdecl), instead of the __stdcall convention used in the Windows API.
I was correctly decorating my P/Invoke signatures with CallingConvention=CallingConvention.Cdecl in the [DllImport] attribute, but this only affect the APIs I called directly; the delegate instance I was passing as callback was getting marshaled as a __stdcall procedure, thus causing the problem.
I remembered that in the old days of .NET 1.0/1.1 there was nothing built into the .NET framework that you could directly use to signal the P/Invoke layer to marshal a delegate as a __cdecl function, so you usually had to resort to creating a little wrapper using Managed C++ or, even runtime code generation.
Fortunately, I discovered that .NET 2.0 had built-in support for this, though finding it took a while. Hopefully this post will make it easier to find in the future.
The .NET Framework 2.0 contains a the new UnmanagedFunctionPointerAttribute class, which can be used to decorate a delegate declaration. One of the fields of this attribute can be used to specify the calling convention you want to use when an instance of the delegate needs to be marshaled to unmanaged code as a callback function.
With this, I could simply declare my delegate like this:
Nifty and very useful stuff.


What is AtomScript?
AtomScript is an interpreted programming language designed to make programming easier and more efficient. You can use AtomScript to easily create computer programs or dynamically create your website.
This is a documentation of the language. It includes both the web and the desktop versions. You will find documentation and explanations of various methods and objects allowing you to start creating your AtomScript program.


Macros | |
| #define | MSDD_STATE_READ_CBW (1 << 0) |
| Driver is expecting a command block wrapper. More... | |
| #define | MSDD_STATE_WAIT_CBW (1 << 1) |
| Driver is waiting for the transfer to finish. More... | |
| #define | MSDD_STATE_PROCESS_CBW (1 << 2) |
| Driver is processing the received command. More... | |
| #define | MSDD_STATE_WAIT_HALT (1 << 3) |
| Driver is halted because pipe halt or wait reset. More... | |
| #define | MSDD_STATE_SEND_CSW (1 << 4) |
| Driver is starting the transmission of a command status wrapper. More... | |
| #define | MSDD_STATE_WAIT_CSW (1 << 5) |
| Driver is waiting for the CSW transmission to finish. More... | |
| #define | MSDD_STATE_WAIT_RESET (1 << 6) |
| Driver is waiting for the MassStorageReset. More... | |
| #define MSDD_STATE_PROCESS_CBW (1 << 2) |
Driver is processing the received command.
| #define MSDD_STATE_READ_CBW (1 << 0) |
Driver is expecting a command block wrapper.
| #define MSDD_STATE_SEND_CSW (1 << 4) |
Driver is starting the transmission of a command status wrapper.
| #define MSDD_STATE_WAIT_CBW (1 << 1) |
Driver is waiting for the transfer to finish.
| #define MSDD_STATE_WAIT_CSW (1 << 5) |
Driver is waiting for the CSW transmission to finish.
| #define MSDD_STATE_WAIT_HALT (1 << 3) |
Driver is halted because pipe halt or wait reset.
| #define MSDD_STATE_WAIT_RESET (1 << 6) |
Driver is waiting for the MassStorageReset.


§268-14 Payment of claims. The department of transportation may upon such terms and conditions as it may impose and under such rules and regulations as it may adopt, pay claims arising under its operation of ferries or terminals or compromise or settle the claims. No claim shall be paid by the department or any settlement or compromise thereof be made except from its operating revenues derived from its operation of ferries or terminals or from the proceeds of insurance recoveries. [L 1963, c 186, §13; Supp, §114-13; HRS §268-14]
Cross References
Rulemaking procedure, see chapter 91.


- Offer
Wall. Our App may display a third-party
hosted "offer wall." Such an offer wall allows
third-party advertisers to offer virtual currency,
gifts, or other items to users in return for the
acceptance and completion of an advertisement offer.
Such an offer wall may appear in our App and be
displayed to you based on certain data, such as your
geographic area or demographic information. When you
click on an offer wall, you will be brought to an
external website belonging to other persons and will
leave our App. A unique identifier, such as your
user ID, will be shared with the offer wall provider
in order to prevent fraud and properly credit your
account with the relevant reward. Please note that
we do not control third-party websites and have no
responsibility in relation to the content of such
websites. The inclusion of a link towards a
third-party website does not imply an endorsement by
us of such website. Accordingly, we do not make any
warranty regarding such third-party websites and we
will not be liable for any loss or damage caused by
the use of such websites. In addition, when you
access any third-party website, please understand
that your rights while accessing and using those
websites will be governed by the privacy notice and
terms of service relating to the use of those
websites.
4. DO WE
USE COOKIES AND OTHER TRACKING
TECHNOLOGIES?
In
Short: We may use cookies and
other tracking technologies to collect and store
your information.
We may use cookies and
similar tracking technologies (like web beacons and
pixels) to access or store information. Specific
information about how we use such technologies and how
you can refuse certain cookies is set out in our Cookie
Notice
.
5. HOW DO
WE HANDLE YOUR SOCIAL
LOGINS?
In Short:
If you choose to register or
log in to our services using a social media account,
we may have access to certain information about
you.
Our
App
offers you the ability to register and login using your
third-party social media account details (like your
Facebook or Twitter logins). Where you choose to do
this, we will receive certain profile information about
you from your social media provider. The profile
information we receive may vary depending on the social
media provider concerned, but will often include your
name, email address, friends list, profile picture as
well as other information you choose to make public on
such social media platform.
We will use the
information we receive only for the purposes that are
described in this privacy notice or that are otherwise
made clear to you on the relevant
App
.
Please note that we do not control, and are not
responsible for, other uses of your personal information
by your third-party social media provider. We recommend
that you review their privacy notice to understand how
they collect, use and share your personal information,
and how you can set your privacy preferences on their
sites and apps.
6.
In
Short: We are not responsible
for the safety of any information that you share
with third-party providers who advertise, but are
not affiliated with, our
Website.
The
App
may contain advertisements from third parties that are
not affiliated with us and which may link to other
websites, online services or mobile applications. We
cannot guarantee the safety and privacy of data you
provide to any third parties. Any data collected by
third parties is not covered by this privacy notice. We
are not responsible for the content or privacy and
security practices and policies of any third parties,
including other websites, services or applications that
may be linked to or from the
App
.
You should review the policies of such third parties and
contact them directly to respond to your questions.
7.
In
Short: We keep your
information for as long as necessary to fulfill the
purposes outlined in this privacy notice unless
otherwise required by law.
We will only keep your
personal information for as long as it is necessary for
the purposes set out in this privacy notice, unless a
longer retention period is required or permitted by law
(such as tax, accounting or other legal requirements).
No purpose in this notice will require us keeping your
personal information for longer than
the period of time in
which users have an account with us
.
When we have no ongoing
legitimate business need to process your personal
information, we will either delete or anonymize such
information, or, if this is not possible (for example,
because your personal information has been stored in
backup archives), then we will securely store your
personal information and isolate it from any further
processing until deletion is possible.
8.
In
Short: We aim to protect your
personal information through a system of
organizational and technical security
measures.
We have implemented
appropriate technical and organizational security
measures designed to protect the security of any
personal information we process. However, despite our
safeguards and efforts to secure your information, no
electronic transmission over the Internet or information
storage technology can be guaranteed to be 100% secure,
so we cannot promise or guarantee that hackers,
cybercriminals, or other unauthorized third parties will
not be able to defeat our security, and improperly
collect, access, steal, or modify your information.
Although we will do our best to protect your personal
information, transmission of personal information to and
from our
App
is at your own risk. You should only access the
App
within a secure environment.
9.
In
Short:
You may
review, change, or terminate your account at any
time.
If you have questions or
comments about your privacy rights, you may email us at
<EMAIL_ADDRESS>.
Account
Information
If you
would at any time like to review or
change the information in your account
or terminate your account, you can:
-
Contact us
using the contact information
provided.
Upon your request to
terminate your account, we will deactivate or delete
your account and information from our active
databases. However, we may retain some information
in our files to prevent fraud, troubleshoot
problems, assist with any investigations, enforce
our Terms of Use and/or comply with applicable legal
requirements.
Opting out
of email marketing: You can
unsubscribe from our marketing email list at any
time by clicking on the unsubscribe link in the
emails that we send or by contacting us using the
details provided below. You will then be removed
from the marketing email list — however, we may
still communicate with you, for example to send you
service-related emails that are necessary for the
administration and use of your account, to respond
to service requests, or for other non-marketing
purposes. To otherwise opt-out, you may:
-
Contact us using the
contact information provided.
10.
CONTROLS FOR DO-NOT-TRACK
FEATURES
Most web browsers and
some mobile operating systems and mobile
applications include a Do-Not-Track ("DNT") feature
or setting you can activate to signal your privacy
preference not to have data about your online
browsing activities monitored and collected. At this
stage no uniform technology standard for recognizing
and implementing DNT signals has been finalized. As
such, we do not currently respond to DNT browser
signals or any other mechanism that automatically
communicates your choice not to be tracked online.
If a standard for online tracking is adopted that we
must follow in the future, we will inform you about
that practice in a revised version of this privacy
notice.
11. DO
CALIFORNIA RESIDENTS HAVE SPECIFIC
PRIVACY
RIGHTS?
In
Short: Yes, if you are a
resident of California, you are granted specific
rights regarding access to your personal
information.
California Civil Code
Section 1798.83, also known as the "Shine The Light"
law, permits our users who are California residents
to request and obtain from us, once a year and free
of charge, information about categories of personal
information (if any) we disclosed to third parties
for direct marketing purposes and the names and
addresses of all third parties with which we shared
personal information in the immediately preceding
calendar year. If you are a California resident and
would like to make such a request, please submit
your request in writing to us using the contact
information provided below.
If you are under 18
years of age, reside in California, and have a
registered account with
the App
,
you have the right to request removal of unwanted
data that you publicly post on the
App
.
To request removal of such data, please contact us
using the contact information provided below, and
include the email address associated with your
account and a statement that you reside in
California. We will make sure the data is not
publicly displayed on the
App
,
but please be aware that the data may not be
completely or comprehensively removed from all our
systems (e.g. backups, etc.).
12. DO
WE MAKE UPDATES TO THIS
NOTICE?
In
Short: Yes, we will update this
notice as necessary to stay compliant with
relevant laws.
We may update this
privacy notice from time to time. The updated
version will be indicated by an updated "Revised"
date and the updated version will be effective as
soon as it is accessible. If we make material
changes to this privacy notice, we may notify you
either by prominently posting a notice of such
changes or by directly sending you a notification.
We encourage you to review this privacy notice
frequently to be informed of how we are protecting
your information.
13.
HOW CAN YOU CONTACT US ABOUT THIS
NOTICE?
If you have questions
or comments about this notice, you may
email us
at
<EMAIL_ADDRESS>or by
post
to:
Food Owl
DGARAGE 11,
Kamla Nehru Marg
Ujjain
, MP
456010
India
14.

Based on the
applicable laws of your country, you may have the
right to request access to the personal information
we collect from you, change that information, or
delete it in some circumstances. To request to
review, update, or delete your personal information,
please submit a
request form by clicking here
.


Stereotype Threats
Speaking of the unspoken
April 24th 2014
Stereotype threat is a very interesting concept. We were encouraged to look into it for DBC week 6 and think about how stereotype threat may impact our lives and specifically at Dev Bootcamp. Throughout my life, I have rarely felt any negative stereotypes being portrayed on me.
It is a fascinating phenomenon that when people feel that they belong to a certain stereotype that they gravitate towards the expectations of that stereotype. As I pursue web development, there will undoubtedly be stereotypes associated with software engineers that I will face. I am interested to see if people will percieve me as differently being a web developer as opposed to a business person.
I will make sure to maintain perspective on stereotypes through DBC, and be aware about how they impact my life and the lives of my teammates.