Tila Duhaime
Democrat
I am not currently employed outside the home. I do occasional legal work as a solo practitioner in intellectual property for a handful of clients. I also currently serve on the Transportation Advisory Board for the City of Boulder, an appointed position I have held for three and a half years. I have been the chairperson for that Board since April 2020. Prior to moving to Colorado in 2012 I worked as a community organizer for Transportation Alternatives in New York City.
I received a BA from the University of California, Berkeley in 1996 and a JD from Columbia University in 2000. I am a member in good standing of the bar of the state of Colorado.
80302
I have been moderately politically active my entire adult life, predominantly working for particular candidates in local and national elections rather than for particular issues or any political party at large. I have traveled to other states to engage voters in swing states and observe polls, observed polls and knocked on doors in my own city, and engaged in phonebanking, postcard writing, and other direct voter-to-voter outreach efforts over the years. I typically donate my time rather than money to such efforts, but I am a regular donor to CoPIRG which does legislative advocacy in Colorado. I may have donated to NARAL Pro-Choice Colorado in the time period specified, but do not recall for certain. I donated to Phil Weiser's campaign for CO Attorney General in 2018, and to Diane Mitsch Bush's campaign in 2018 and possibly 2020. I have made donations to Western Resource Advocates and the Rocky Mountain Immigrant Advocacy Network (RMIAN) in at least 2018.
I am a member of the Colorado Bar. I am a lifetime member of Transportation Alternatives, in New York City. I am also a member of Community Cycles and its Advocacy Committee in Boulder CO. Since April 2017 I have been an appointed member of Boulder's Transportation Advisory Board, and since April of this year have served as the chairperson of the Board, including conducting public hearings from time to time in the course of the business of that Board. I have done extensive volunteer work for the PTA of my local public school, but in light of COVID such opportunities are quite limited these days.
Most of my advocacy efforts and interests involve people who do not typically have strong, organized groups or associations working on their behalf, and who often lack a voice or representation in our government. I have worked in Colorado to advance the visibility and protection of vulnerable road users; typically, pedestrians and cyclists who are disproportionately injured on our transportation network. Advocates for this work in the past few decades have illustrated the interconnections between transportation policy, land use decisions, infrastructure priorities, legal framework, public communication strategies, and engineering decisions that are fundamental governmental functions at every level. I have engaged with local nonprofits, state lawmakers, district attorneys and other law enforcement officers, members of the general public and elected officials at various levels of government to help advance lifesaving changes on our road networks. I have also been trained by RMIAN to represent minor immigrants facing deportation proceedings in Colorado to advance their cases through the immigration court process, although I have not to date been assigned a client. While helping a family member get back on his feet after being released from prison, my eyes were opened to the multiple, lifelong obstacles former felons face in establishing themselves in a community, accessing community resources, finding and keeping employment, or engaging with their government. As a parent of a child with a developmental disability, I have also learned quite a lot in recent years about special-needs populations in our public school system, the legal protections for them, and ways in which those systems still fail to adequately serve them. I have engaged in small advocacy efforts on behalf of my child and families like ours who have additional challenges accessing education and being able to participate in the community at large.
I have seen first hand the powerlessness of people who are already in legal trouble, whether it is people facing criminal charges or those who have served time and are trying to re-enter the community, and believe they deserve due process and protection of our legal system. Our society treats them as unsympathetic figures, but they are real people with real struggles who cannot assert themselves without help. Many people cannot vote but still have rights in our system: the very young, people seeking asylum, former felons, non-native English speakers, people who cannot read English, and more. I want to ensure our government takes them into account. I believe that every citizen deserves to have her interests considered and included in our representative government.
A successful attorney must be able to understand the conflict from perspective of the opposing side, and this is key to finding any mutually satisfying solution. In my role as an appointed city official, both in Boulder and previously in New York City, I have often had to forge a consensus opinion or recommendation where there was no clear majority viewpoint at the beginning of discussion. I am able to frame a problem or question from a broad enough perspective to have universal agreement (for example: no one should die in car crashes on our roads); starting from a common place means that any disagreements involve how to fix the problem, rather than whether we should be working on it in the first place. Being able to articulate others' discomfort with a proposal, in a way they agree is fair, is essential to overcoming it. I've had lots of practice in all of these situations.
One of the more gratifying experiences from my recent work on the Transportation Advisory Board was working with city staff to develop a decision matrix to prioritize projects among multiple applications for street enhancements in light of limited city resources to fund, design, and install them. How do we weigh the need and merit of similar street treatments on different sections of the city, with different public amenities, different populations of users, different risk factors? I am proud of the result of our work, even though we found the need to revise it within two years to better reflect our community priorities and to provide better equity for poorer areas. It left future applicants with a better idea of what was a qualifying set of circumstances, and gave the prioritization process a sense of fair, transparent objectivity that will be important for years to come.
F


Try /api/echo/hello
Check GitHub repository for more info.
Reddit discussion
Working Heroku deployment (might be sleeping)


specializes in creating beautiful and unique Weddings, Social Engagements and Corporate Events. We provide a multitude of services ranging from Day-of to Full Service Event Coordination, and everything in between. Your coordinator will collaborate with you to produce an unforgettable event that will be tailored to you and your vision. During a complimentary initial consultation, you will have the opportunity to look through our portfolios, learn more about our services and ask any questions you may have. Once we determine what services are needed through this consultation, a proposal will be created and customized especially to your needs.


{% extends "upload.html" %} {% block content %}
Error Occured: File is not uploaded, please upload again


I'M READY LET'S GO!


--- layout: page title: About header-img: "img/about-bg.png" ---
Python and SQL developer, economics major, and statistics enthusiast.


N.A.S.T-y Dash
Interval:
Hourly
Daily
Monthly
Yearly
Period:
Search
Loading...
×
Experiencing a lack of data?
That's not right, feel free to
seed additional random data to the DB
. (now - 2 years limit)


Wind power forecasting map
2014-02-05
Problem statement
In Tamil Nadu, electricity is significantly relying on wind power based renewable energy source. If much wind is there, there will be minimal power cuts and vice versa. The second-tier urban area like Coimbatore, this dependence is much visible, and so one of the simple predictors of long power cuts is lack of adequate wind power in the nearby wind park area for example. On the other hand operators of windmills or power transmission sector, if they know much early about the forecast of wind power in their area, they have many advantages in preparing for storing the surplus energy source or find alternatives in the situation of low wind power.
Predicting the wind power is the problem of multidomain variables especially of meteorological predictions and engineering variables from the specific wind turbine used to generate the energy using wind power. One of the solutions is to use the existing empirical observation data from similar windmills or park to see how the variable is changing in the wind speed or meteorological domain of our area of interest (AOI).
Computations
Wind power is the third power of the wind speed. Based on this equation wind power can be calculated
w = ½ r A v3 where w is power, r is air density, A is the rotor area, and v is the wind speed.
r = (1.325 x P) / T where T is the temperature in Fahrenheit + 459.69 and P is the pressure in inches of Mercury adjusted for elevation
Based on //www.iowaenergycenter.org/wind-energy-manual/wind-and-wind-power/wind-speed-and-power/#sthash.4UBSpEQx.dpuf
Steps
- Collect Numerical weather prediction (NWP) data of AOI. Mostly in the form of netCDF.
- Convert netCDF into GeoTIFF for the wind speed variable band while conversion made it into an array object and execute the wind power calculation equations in the array.
- Convert the wind power calculated array into GeoTIFF and visualize it in webGIS and implement query interface for the public user and operator user.
- Make a vector of urban locality and nearby wind park with points of the wind turbine.
- Based on the use case query,
- if a common public is querying how much energy would be nearby wind park is producing, the program calculates polygon vector calculation using the GeoTIFF (array) of wind power
- If an operator is asking for a specific turbine energy production, calculate point vector calculation using the GeoTIFF (array) of wind power
- Iterate the steps 1 to 4 for daily dynamic mapping of the wind power or based on the time frame availability of NWP data.
Views
- Use the wind prediction map for establishing windmills, so done site suitability analysis.
- The problem addresses already established windmills, there were few GIS components involved as a solution, even though a visualization part is involved it is minimal use here, how the user is going to be interested in the dynamic entity of weather.
- So the problem is restated as Wind power forecasting map: a lightweight, event detection subscribable web application, based on work of http://earth.nullschool.net/about.html and https://github.com/cambecc/air


Or how to get all your X from A to B for very little C. In this post I create an R implementation of optimizing a “minimum cost flow problem” in R using graph theory and the lpSolve package. This can be useful for transportation and allocation applications in supply chain, logistics, and planning.
Recently I came across a business problem that I interpreted as a “minimum cost flow problem”. According to Wikipedia it is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated.
I was hoping for a readily available implementation of an algorithm for this problem via an R-package, but my search on CRAN did not yield any results. So I turned to StackOverflow. You can find my question here. Ultimately, I ended up answering it myself. If this is useful to you, I’d appreciate your upvote :)
Let’s start off by building an example graph for illustrating the problem. I used a manually created edgelist
, defining a directional graph. Each edge has a from
node and a to
node, given as numeric ID, as well as a capacity c (the maximum number of units that can pass through this connection), and a cost a (the cost of passing a single unit through this connection). The edgelist data frame can be turned into a graph object using the igraph
package and its graph_from_edgelist
function.
```r library(tidyverse) library(igraph) library(magrittr)
edgelist <- data.frame( from = c(1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8), to = c(2, 3, 4, 5, 6, 4, 5, 6, 7, 8, 7, 8, 7, 8, 9, 9), ID = seq(1, 16, 1), capacity = c(20, 30, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99), cost = c(0, 0, 1, 2, 3, 4, 3, 2, 3, 2, 3, 4, 5, 6, 0, 0))
g <- graph_from_edgelist(as.matrix(edgelist[,c(‘from’,’to’)]))
E(g)$capacity <- edgelist$capacity E(g)$cost <- edgelist$cost
plot(g, edge.label = E(g)$capacity) plot(g, edge.label = E(g)$cost) ```
The result looks like this:
Note that the example I chose only uses non-standard capacities in the edges coming out of node 1, and only uses non-zero cost values in the edges of the middle layer. I separated cost and capacity out like that to keep it simple for this example. In a real world application the values are likely more mixed, and there would probably be a lot more edges.
With our example graph we are now ready to formulate the objective function and the constraints of our optimization. I use the function below to generate the inputs for our solver. They consist of a left-hand side lhs
(a vector of integers representing coefficients of the flow through each edge), a direction dir
(<, ==, >), and a right-hand side rhs
giving the numeric value that will need to be met by each constraint.
Our objective is to minimize the total cost incurred, subject to the relevant constraints
Constraints are grouped into three major categories: 1. capacity constraints: Flow f through any given edge x can’t be higher than the edge’s capacity c.
I have implemented all of that in the function below:
```r createConstraintsMatrix <- function(edges, total_flow) {
# Edge IDs to be used as names names_edges <- edges$ID # Number of edges numberof_edges <- length(names_edges)
# Node IDs to be used as names names_nodes <- c(edges$from, edges$to) %>% unique # Number of nodes numberof_nodes <- length(names_nodes)
# Build constraints matrix constraints <- list( lhs = NA, dir = NA, rhs = NA)
#’ Build capacity constraints ———————————————— #’ Flow through each edge should not be larger than capacity. #’ We create one constraint for each edge. All coefficients zero #’ except the ones of the edge in question as one, with a constraint #’ that the result is smaller than or equal to capacity of that edge.
# Flow through individual edges constraints$lhs <- edges$ID %>% length %>% diag %>% set_colnames(edges$ID) %>% set_rownames(edges$ID) # should be smaller than or equal to constraints$dir <- rep(‘<=’, times = nrow(edges)) # than capacity constraints$rhs <- edges$capacity
#’ Build node flow constraints ———————————————– #’ For each node, find all edges that go to that node #’ and all edges that go from that node. The sum of all inputs #’ and all outputs should be zero. So we set inbound edge coefficients as 1 #’ and outbound coefficients as -1. In any viable solution the result should #’ be equal to zero.
nodeflow <- matrix(0, nrow = numberof_nodes, ncol = numberof_edges, dimnames = list(names_nodes, names_edges))
for (i in names_nodes) {
# input arcs
edges_in <- edges %>%
filter(to == i) %>%
select(ID) %>%
unlist
# output arcs
edges_out <- edges %>%
filter(from == i) %>%
select(ID) %>%
unlist
# set input coefficients to 1
nodeflow[
rownames(nodeflow) == i,
colnames(nodeflow) %in% edges_in] <- 1
# set output coefficients to -1
nodeflow[
rownames(nodeflow) == i,
colnames(nodeflow) %in% edges_out] <- -1 }
# But exclude source and target edges # as the zero-sum flow constraint does not apply to these! # Source node is assumed to be the one with the minimum ID number # Sink node is assumed to be the one with the maximum ID number sourcenode_id <- min(edges$from) targetnode_id <- max(edges$to) # Keep node flow values for separate step below nodeflow_source <- nodeflow[rownames(nodeflow) == sourcenode_id,] nodeflow_target <- nodeflow[rownames(nodeflow) == targetnode_id,] # Exclude them from node flow here nodeflow <- nodeflow[!rownames(nodeflow) %in% c(sourcenode_id, targetnode_id),]
# Add nodeflow to the constraints list constraints$lhs <- rbind(constraints$lhs, nodeflow) constraints$dir <- c(constraints$dir, rep(‘==’, times = nrow(nodeflow))) constraints$rhs <- c(constraints$rhs, rep(0, times = nrow(nodeflow)))
#’ Build initialisation constraints —————————————— #’ For the source and the target node, we want all outbound nodes and #’ all inbound nodes to be equal to the sum of flow through the network #’ respectively
# Add initialisation to the constraints list constraints$lhs <- rbind(constraints$lhs, source = nodeflow_source, target = nodeflow_target) constraints$dir <- c(constraints$dir, rep(‘==’, times = 2)) # Flow should be negative for source, and positive for target constraints$rhs <- c(constraints$rhs, total_flow * -1, total_flow)
return(constraints) }
constraintsMatrix <- createConstraintsMatrix(edgelist, 30) ```
This should return something like this. We can see the rows corresponding to capacity constraints as lines with just a single 1 value in lhs
, a <=
in dir
, and the capacity of the corresponding edge in the rhs
. Node flow constraints show as one row per node, 1 for incoming nodes and -1 for outgoing nodes, ==
in dir
, and zero in rhs
. Finally, the initialisation constraints are implemented with negative coefficients for all edges leaving the source node and positive coefficients for all edges reaching the target node.
```r $lhs 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 11 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 12 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 13 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 14 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 1 0 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 3 0 1 0 0 0 -1 -1 -1 0 0 0 0 0 0 0 0 4 0 0 1 0 0 1 0 0 -1 -1 0 0 0 0 0 0 5 0 0 0 1 0 0 1 0 0 0 -1 -1 0 0 0 0 6 0 0 0 0 1 0 0 1 0 0 0 0 -1 -1 0 0 7 0 0 0 0 0 0 0 0 1 0 1 0 1 0 -1 0 8 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 -1 source -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 target 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
$dir [1] “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” “<=” [15] “<=” “<=” “==” “==” “==” “==” “==” “==” “==” “==” “==”
$rhs [1] 20 30 99 99 99 99 99 99 99 99 99 99 99 99 99 99 0 [18] 0 0 0 0 0 0 -30 30 ```
We can now feed all of this information to lpSolve
to calculate the optimal flow values of each edge. Our example is relatively small, but because all values are integers it will compile relatively fast, even for much larger number of edges. I have successfully run a similar version of this code for a network with several thousands of edges in less than a minute on my laptop.
```r library(lpSolve)
solution <- lp( direction = ‘min’, objective.in = edgelist$cost, const.mat = constraintsMatrix$lhs, const.dir = constraintsMatrix$dir, const.rhs = constraintsMatrix$rhs)
solution$solution ```
To finish off, we write the resulting solution back to the igraph
object and visualise the flow in the optimal solution in a plot
```r E(g)$flow <- solution$solution
E(g)$color[E(g)$cost == 0] <- ‘royalblue’ E(g)$color[E(g)$cost == 1] <- ‘yellowgreen’ E(g)$color[E(g)$cost == 2] <- ‘gold’ E(g)$color[E(g)$cost >= 3] <- ‘firebrick’
# cost as colour plot(g, edge.width = E(g)$flow) ```
As you can see, the flow from node 1 is split between edges 1 and 2 because of the limiting capacity, even though this means that some of the flow will have to go from node 3 to node 5 at a higher cost. Expensive edges are avoided all together and have zero flow.
That’s all for now, thanks for reading! I hope it is helpful for someone out there. If you have any comments, questions, or suggestions, please send me an email or tweet. Any feedback would be much appreciated.


--- layout: post title: no title date: '2008-06-09T08:23:19+01:00' tags: [] tumblr_url: http://backlog.robbevan.com/post/37695758/coen-bros-burn-after-reading-2008-trailer ---
Coen Bros: Burn After Reading (2008) Trailer


People who live here
In this sub section, we’re going to
ask you about all the people that live at or
are visiting Address not found.
Information you will need:
- Names of the people living at this
address
- Names of the visitors staying in the
household on 13 October 2019


Involved in content writing and strategy of the Star Alliance campaign “You Make a Difference,” a digital and social effort targeting Chinese frequent flyers who travel internationally, along with their friends, colleagues and families.
The campaign invited those in a traveler’s inner circle to send Thank You messages via WeChat. Once a message was sent, the recipient selected the participating Star Alliance airline frequent-flyer program in which he or she wants to win Star Alliance Gold Status and connects to the Elite Gathering group. The message sender can enter a contest for a pair of Star Alliance “Round the World” trips.


GraphCase extends Entity
GraphCase class
Tags
Table of Contents
- $_propDict : array<string|int, mixed>
- The array of properties available to the model
- __construct() : mixed
- Construct a new Entity
- getClosedBy() : IdentitySet|null
- Gets the closedBy The user who closed the case.
- getClosedDateTime() : DateTime|null
- Gets the closedDateTime The date and time when the case was closed. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- getCreatedDateTime() : DateTime|null
- Gets the createdDateTime The date and time when the entity was created. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- getCustodians() : array<string|int, mixed>|null
- Gets the custodians Returns a list of case custodian objects for this case. Nullable.
- getDescription() : string|null
- Gets the description The case description.
- getDisplayName() : string|null
- Gets the displayName The case name.
- getExternalId() : string|null
- Gets the externalId The external case number for customer reference.
- getId() : string|null
- Gets the id Read-only.
- getLastModifiedBy() : IdentitySet|null
- Gets the lastModifiedBy The last user who modified the entity.
- getLastModifiedDateTime() : DateTime|null
- Gets the lastModifiedDateTime The latest date and time when the case was modified. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- getLegalHolds() : array<string|int, mixed>|null
- Gets the legalHolds Returns a list of case legalHold objects for this case. Nullable.
- getNoncustodialDataSources() : array<string|int, mixed>|null
- Gets the noncustodialDataSources Returns a list of case noncustodialDataSource objects for this case. Nullable.
- getODataType() : string|null
- Gets the ODataType
- getOperations() : array<string|int, mixed>|null
- Gets the operations Returns a list of case operation objects for this case. Nullable.
- getProperties() : array<string|int, mixed>
- Gets the property dictionary of the Entity
- getReviewSets() : array<string|int, mixed>|null
- Gets the reviewSets Returns a list of reviewSet objects in the case. Read-only. Nullable.
- getSettings() : Settings|null
- Gets the settings
- getSourceCollections() : array<string|int, mixed>|null
- Gets the sourceCollections Returns a list of sourceCollection objects associated with this case.
- getStatus() : CaseStatus|null
- Gets the status The case status. Possible values are unknown, active, pendingDelete, closing, closed, and closedWithError. For details, see the following table.
- getTags() : array<string|int, mixed>|null
- Gets the tags Returns a list of tag objects associated to this case.
- jsonSerialize() : array<string|int, mixed>
- Serializes the object by property array Manually serialize DateTime into RFC3339 format
- setClosedBy() : GraphCase
- Sets the closedBy The user who closed the case.
- setClosedDateTime() : GraphCase
- Sets the closedDateTime The date and time when the case was closed. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- setCreatedDateTime() : GraphCase
- Sets the createdDateTime The date and time when the entity was created. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- setCustodians() : GraphCase
- Sets the custodians Returns a list of case custodian objects for this case. Nullable.
- setDescription() : GraphCase
- Sets the description The case description.
- setDisplayName() : GraphCase
- Sets the displayName The case name.
- setExternalId() : GraphCase
- Sets the externalId The external case number for customer reference.
- setId() : Entity
- Sets the id Read-only.
- setLastModifiedBy() : GraphCase
- Sets the lastModifiedBy The last user who modified the entity.
- setLastModifiedDateTime() : GraphCase
- Sets the lastModifiedDateTime The latest date and time when the case was modified. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
- setLegalHolds() : GraphCase
- Sets the legalHolds Returns a list of case legalHold objects for this case. Nullable.
- setNoncustodialDataSources() : GraphCase
- Sets the noncustodialDataSources Returns a list of case noncustodialDataSource objects for this case. Nullable.
- setODataType() : Entity
- Sets the ODataType
- setOperations() : GraphCase
- Sets the operations Returns a list of case operation objects for this case. Nullable.
- setReviewSets() : GraphCase
- Sets the reviewSets Returns a list of reviewSet objects in the case. Read-only. Nullable.
- setSettings() : GraphCase
- Sets the settings
- setSourceCollections() : GraphCase
- Sets the sourceCollections Returns a list of sourceCollection objects associated with this case.
- setStatus() : GraphCase
- Sets the status The case status. Possible values are unknown, active, pendingDelete, closing, closed, and closedWithError. For details, see the following table.
- setTags() : GraphCase
- Sets the tags Returns a list of tag objects associated to this case.
Properties
$_propDict
The array of properties available to the model
protected
array<string|int, mixed>
$_propDict
Methods
__construct()
Construct a new Entity
public
__construct([array<string|int, mixed> $propDict = array() ]) : mixed
Parameters
- $propDict : array<string|int, mixed> = array()
-
A list of properties to set
Return values
mixed —getClosedBy()
Gets the closedBy The user who closed the case.
public
getClosedBy() : IdentitySet|null
Return values
IdentitySet|null —The closedBy
getClosedDateTime()
Gets the closedDateTime The date and time when the case was closed. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
getClosedDateTime() : DateTime|null
Return values
DateTime|null —The closedDateTime
getCreatedDateTime()
Gets the createdDateTime The date and time when the entity was created. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
getCreatedDateTime() : DateTime|null
Return values
DateTime|null —The createdDateTime
getCustodians()
Gets the custodians Returns a list of case custodian objects for this case. Nullable.
public
getCustodians() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The custodians
getDescription()
Gets the description The case description.
public
getDescription() : string|null
Return values
string|null —The description
getDisplayName()
Gets the displayName The case name.
public
getDisplayName() : string|null
Return values
string|null —The displayName
getExternalId()
Gets the externalId The external case number for customer reference.
public
getExternalId() : string|null
Return values
string|null —The externalId
getId()
Gets the id Read-only.
public
getId() : string|null
Return values
string|null —The id
getLastModifiedBy()
Gets the lastModifiedBy The last user who modified the entity.
public
getLastModifiedBy() : IdentitySet|null
Return values
IdentitySet|null —The lastModifiedBy
getLastModifiedDateTime()
Gets the lastModifiedDateTime The latest date and time when the case was modified. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
getLastModifiedDateTime() : DateTime|null
Return values
DateTime|null —The lastModifiedDateTime
getLegalHolds()
Gets the legalHolds Returns a list of case legalHold objects for this case. Nullable.
public
getLegalHolds() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The legalHolds
getNoncustodialDataSources()
Gets the noncustodialDataSources Returns a list of case noncustodialDataSource objects for this case. Nullable.
public
getNoncustodialDataSources() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The noncustodialDataSources
getODataType()
Gets the ODataType
public
getODataType() : string|null
Return values
string|null —The ODataType
getOperations()
Gets the operations Returns a list of case operation objects for this case. Nullable.
public
getOperations() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The operations
getProperties()
Gets the property dictionary of the Entity
public
getProperties() : array<string|int, mixed>
Return values
array<string|int, mixed> —The list of properties
getReviewSets()
Gets the reviewSets Returns a list of reviewSet objects in the case. Read-only. Nullable.
public
getReviewSets() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The reviewSets
getSettings()
Gets the settings
public
getSettings() : Settings|null
Return values
Settings|null —The settings
getSourceCollections()
Gets the sourceCollections Returns a list of sourceCollection objects associated with this case.
public
getSourceCollections() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The sourceCollections
getStatus()
Gets the status The case status. Possible values are unknown, active, pendingDelete, closing, closed, and closedWithError. For details, see the following table.
public
getStatus() : CaseStatus|null
Return values
CaseStatus|null —The status
getTags()
Gets the tags Returns a list of tag objects associated to this case.
public
getTags() : array<string|int, mixed>|null
Return values
array<string|int, mixed>|null —The tags
jsonSerialize()
Serializes the object by property array Manually serialize DateTime into RFC3339 format
public
jsonSerialize() : array<string|int, mixed>
Return values
array<string|int, mixed> —The list of properties
setClosedBy()
Sets the closedBy The user who closed the case.
public
setClosedBy(IdentitySet $val) : GraphCase
Parameters
- $val : IdentitySet
-
The closedBy
Return values
GraphCase —setClosedDateTime()
Sets the closedDateTime The date and time when the case was closed. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
setClosedDateTime(DateTime $val) : GraphCase
Parameters
- $val : DateTime
-
The closedDateTime
Return values
GraphCase —setCreatedDateTime()
Sets the createdDateTime The date and time when the entity was created. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
setCreatedDateTime(DateTime $val) : GraphCase
Parameters
- $val : DateTime
-
The createdDateTime
Return values
GraphCase —setCustodians()
Sets the custodians Returns a list of case custodian objects for this case. Nullable.
public
setCustodians(Custodian $val) : GraphCase
Parameters
- $val : Custodian
-
The custodians
Return values
GraphCase —setDescription()
Sets the description The case description.
public
setDescription(string $val) : GraphCase
Parameters
- $val : string
-
The description
Return values
GraphCase —setDisplayName()
Sets the displayName The case name.
public
setDisplayName(string $val) : GraphCase
Parameters
- $val : string
-
The displayName
Return values
GraphCase —setExternalId()
Sets the externalId The external case number for customer reference.
public
setExternalId(string $val) : GraphCase
Parameters
- $val : string
-
The externalId
Return values
GraphCase —setId()
Sets the id Read-only.
public
setId(string $val) : Entity
Parameters
- $val : string
-
The id
Return values
Entity —setLastModifiedBy()
Sets the lastModifiedBy The last user who modified the entity.
public
setLastModifiedBy(IdentitySet $val) : GraphCase
Parameters
- $val : IdentitySet
-
The lastModifiedBy
Return values
GraphCase —setLastModifiedDateTime()
Sets the lastModifiedDateTime The latest date and time when the case was modified. The Timestamp type represents date and time information using ISO 8601 format and is always in UTC time. For example, midnight UTC on Jan 1, 2014 is 2014-01-01T00:00:00Z
public
setLastModifiedDateTime(DateTime $val) : GraphCase
Parameters
- $val : DateTime
-
The lastModifiedDateTime
Return values
GraphCase —setLegalHolds()
Sets the legalHolds Returns a list of case legalHold objects for this case. Nullable.
public
setLegalHolds(LegalHold $val) : GraphCase
Parameters
- $val : LegalHold
-
The legalHolds
Return values
GraphCase —setNoncustodialDataSources()
Sets the noncustodialDataSources Returns a list of case noncustodialDataSource objects for this case. Nullable.
public
setNoncustodialDataSources(NoncustodialDataSource $val) : GraphCase
Parameters
- $val : NoncustodialDataSource
-
The noncustodialDataSources
Return values
GraphCase —setODataType()
Sets the ODataType
public
setODataType(string $val) : Entity
Parameters
- $val : string
-
The ODataType
Return values
Entity —setOperations()
Sets the operations Returns a list of case operation objects for this case. Nullable.
public
setOperations(CaseOperation $val) : GraphCase
Parameters
- $val : CaseOperation
-
The operations
Return values
GraphCase —setReviewSets()
Sets the reviewSets Returns a list of reviewSet objects in the case. Read-only. Nullable.
public
setReviewSets(ReviewSet $val) : GraphCase
Parameters
- $val : ReviewSet
-
The reviewSets
Return values
GraphCase —setSettings()
Sets the settings
public
setSettings(Settings $val) : GraphCase
Parameters
- $val : Settings
-
The settings
Return values
GraphCase —setSourceCollections()
Sets the sourceCollections Returns a list of sourceCollection objects associated with this case.
public
setSourceCollections(SourceCollection $val) : GraphCase
Parameters
- $val : SourceCollection
-
The sourceCollections
Return values
GraphCase —setStatus()
Sets the status The case status. Possible values are unknown, active, pendingDelete, closing, closed, and closedWithError. For details, see the following table.
public
setStatus(CaseStatus $val) : GraphCase
Parameters
- $val : CaseStatus
-
The status
Return values
GraphCase —setTags()
Sets the tags Returns a list of tag objects associated to this case.
public
setTags(Tag $val) : GraphCase
Parameters
- $val : Tag
-
The tags


 Without your love I know I would have neva found my way, I love you.
To express the love that I feel for you is quite difficult in words are not enough to describe what can only be felt. Loving you has been a journey of transformation for me, for you changed me & molded me into a strong and confident person that I am today. You’re the reason why I wake every morning with a smile on my face. You bring the joi from within into my life & the fact that I have you makes life worth living. I love you and always will.
We both know we have a very special relation- without ever needing to say so – how in love we are. But now I want to say you are very precious to me. I love to be close to you. You are more beautiful than sunshine, more precious than anything. You are sweetest & loveliest. You are exquisite & delightful, special & unique. And what’s most astounding of all, you want to be with me.
I remember the first time we talked. It was one of the best moments of my life. The time we spent together was so enchanting that each moment without you feel like a punishment to me. I only know how difficult it was for me to restrain myself from rushing to you & to conc on my work.
We slowly developed a deep love, & eventually we both knew it. It was so beautiful a feeling. I am madly in love with you, my darling.
My life is beautiful because of you my love. You showed me the meaning of love not with your words but with your care. I know your shy nature doesn’t let you open up to me; But your eyes speak up the love you have for me.
In life there are certain things that words cannot describe. The feeling I have when I talk to you, when I think about you, and when I dream about you, is amazing. I've never felt like this, before in my life. My love for you has grown so much over the past couple of months. I would have never imagined that we would be where we are today. I don't think that our love will ever fade or wither. I'll always be there for you. My life is perfect with you in it. Thank you, my love for making my life so beautiful.
I do not know how to express or analyse the conflicting emotions that have surged like a storm through my heart all night long. I only know that first and foremost in all my thoughts has been the glorious confirmation you gave me last night - without effort, unconsciously, as of course of all I have ever thought of your mind and heart.
You have the greatest soul, the noblest nature, the sweetest, most loving heart I have ever known, and my love, my reverence, my admiration for you, you have increased in one evening as I should have thought only a lifetime of intimate, loving association could have increased them. You are more wonderful and lovely in my eyes than you ever were before; and my pride and joy and gratitude that you should love me with such a perfect love are beyond all expression, except in some great poem which I cannot write.
I never knew the meaning of true love till the day I met you and having you as my sweetheart is like a dream come true for me. I become a little weak when it comes to speak my feelings in front of you, so I have thought to pen down my feelings, as I did not want to miss a chance to let you know that you are an true companion, my best friend and my soulmate. I just wish to tell you that I love you till eternity. I am madly in love with your gentle smile, the spark in your eyes, your warm touch and essence of the bond that we share. I cherish each and every moment spent with you. With you in my life I feel to be the luckiest person on this earth. You really mean the world to me. I love you.
I Love You
I love you for being my Queen,
I love you for being my partner and my friend.
I love you for the caring and joy that you
share without end.
I love you for the warm tender touch and
the things you do for me.
I love you for the way you help all my dreams come true and for filling my world with your love. I love you for all you are and what you are. I love you Today, Tomorrow, Forever... I'll never stop loving you.
I thought of you. I'm always thinking of you. You mean the world and more to me. I had never felt true happiness until I met you, and I can never thank you enough for making me feel this way. I'll always be there for you, and I'll always I had the most amazing time in video with you, and I care waits to see what the future has in store for us. I have a feeling it's going to be incredible.
I apologize for getting jealous & angry sometimes. I want you to spent all your time with me, & want you to be the most comfortable with me, so I get jealous sometimes, I apologize for the same. Thank you for everything you do for me, for your constant support, & for always being there for me. I’m so glad to have you in my life!

Your foreva


Effective rate can either take into consideration the actual amount actively lent OR consider only exchange 15% fee


{{ define "main" }}
Name
Email Address
Contact Number
Message
Click this if the download didn't automatically occured.


Click the button to add a new row at the first position of the table and then add cells and content.
Name
Phone
Row1 cell1
Row1 cell2
Row2 cell1
Row2 cell2
Name:
phone:
add


--- layout: default title: Mentorship ---
{{ mentorship.content | strip_html | truncate: 350 }} Read more {{ mentorship.date | date_to_string }} - {% include read-time.html %}


ali azam
Zaidithis is just for testing and nothing else
This is just a text
GTRRRFfffRRTs
i dont know what this does
la la la la
| Heading 1 | Heading 2 | Heading 3 |
| data 1 | data 2 | data 3 |
| data 4 | data 5 | data 6 |
| data 7 | data 8 | data 9 |
this is just a demo text lalalalalalalalalalalallalaalalalalalalal


ALWAYS...PATSY CLINE
November 1 - 4 & 9 - 11, 2012
Director - Wess Hughes
Musical Director - Michelle Howells
Choreographer - Jennifer Odom-Townsend
THE CAST
Patsy Cline - Missy Sanderson
Louise Seger - Catherine Nowicki
The Jordandaires
Jay Baggett, Danny McDonald, Shane Cockrell, Ben West
The Anita Kerr Singers
Frankie Bennett, Sheryl Boone, Kathy Lee, Susie Rustin
The Esquire Ballroom Crowd
Lacy Cockrell, Lynn Deas, Lexy Harvey, Ann Hodges, Logan Holder,
Marian Latimer, Laurie Myrick, Acie Smith
The Bodacious Bobcats Band
Uncle Ken 'Bob' Cranford, Lowery 'Bob' Hicks, Michelle 'Bob' Howells,
Wynn 'Bob' Maily, Kenny 'Bob' McMinn, Bob 'Bob' Saxton
The Grand Ole Opry Talent Show
Cousin Minnie Pearl.....Bethany Sharp
Venita Apperwhite, Landon & Katelyn Bryant, Roy 'Shorty' Carruth,
Roxy Comardelle, Patsy Graham, The Gospel Strings, Lexy Harvey,
Angie Hodge, Missy Jones, Albert Ray, Bob Saxton, Ronnie Smith,
Betty Strickland, Blake Windham


| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
ARRAY_DESCRIPTOR |
6 |
public static final int |
CHAR |
10 |
public static final int |
PARAM_LIST |
4 |
public static final int |
PARAM_LIST_OR_ID |
2 |
public static final int |
STRING |
8 |
public static final int |
YYEOF |
-1 |
public static final int |
YYINITIAL |
0 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
ACCESS_SPEC |
4 |
public static final int |
ANNOTATION_DIRECTIVE |
5 |
public static final int |
ANNOTATION_VISIBILITY |
6 |
public static final int |
ARRAY_DATA_DIRECTIVE |
7 |
public static final int |
ARRAY_TYPE_PREFIX |
8 |
public static final int |
ARROW |
9 |
public static final int |
BOOL_LITERAL |
10 |
public static final int |
BYTE_LITERAL |
11 |
public static final int |
CATCH_DIRECTIVE |
13 |
public static final int |
CATCHALL_DIRECTIVE |
12 |
public static final int |
CHAR_LITERAL |
14 |
public static final int |
CLASS_DESCRIPTOR |
15 |
public static final int |
CLASS_DIRECTIVE |
16 |
public static final int |
CLOSE_BRACE |
17 |
public static final int |
CLOSE_PAREN |
18 |
public static final int |
COLON |
19 |
public static final int |
COMMA |
20 |
public static final int |
DOTDOT |
21 |
public static final int |
DOUBLE_LITERAL |
22 |
public static final int |
DOUBLE_LITERAL_OR_ID |
23 |
public static final int |
END_ANNOTATION_DIRECTIVE |
24 |
public static final int |
END_ARRAY_DATA_DIRECTIVE |
25 |
public static final int |
END_FIELD_DIRECTIVE |
26 |
public static final int |
END_LOCAL_DIRECTIVE |
27 |
public static final int |
END_METHOD_DIRECTIVE |
28 |
public static final int |
END_PACKED_SWITCH_DIRECTIVE |
29 |
public static final int |
END_PARAMETER_DIRECTIVE |
30 |
public static final int |
END_SPARSE_SWITCH_DIRECTIVE |
31 |
public static final int |
END_SUBANNOTATION_DIRECTIVE |
32 |
public static final int |
ENUM_DIRECTIVE |
33 |
public static final int |
EOF |
-1 |
public static final int |
EPILOGUE_DIRECTIVE |
34 |
public static final int |
EQUAL |
35 |
public static final int |
ERROR_CHANNEL |
100 |
public static final int |
FIELD_DIRECTIVE |
36 |
public static final int |
FIELD_OFFSET |
37 |
public static final int |
FLOAT_LITERAL |
38 |
public static final int |
FLOAT_LITERAL_OR_ID |
39 |
public static final int |
I_ACCESS_LIST |
90 |
public static final int |
I_ANNOTATION |
91 |
public static final int |
I_ANNOTATION_ELEMENT |
93 |
public static final int |
I_ANNOTATIONS |
92 |
public static final int |
I_ARRAY_ELEMENT_SIZE |
95 |
public static final int |
I_ARRAY_ELEMENTS |
94 |
public static final int |
I_CATCH |
96 |
public static final int |
I_CATCHALL |
97 |
public static final int |
I_CATCHES |
98 |
public static final int |
I_CLASS_DEF |
99 |
public static final int |
I_ENCODED_ARRAY |
100 |
public static final int |
I_ENCODED_ENUM |
101 |
public static final int |
I_ENCODED_FIELD |
102 |
public static final int |
I_ENCODED_METHOD |
103 |
public static final int |
I_END_LOCAL |
104 |
public static final int |
I_EPILOGUE |
105 |
public static final int |
I_FIELD |
106 |
public static final int |
I_FIELD_INITIAL_VALUE |
108 |
public static final int |
I_FIELD_TYPE |
109 |
public static final int |
I_FIELDS |
107 |
public static final int |
I_IMPLEMENTS |
110 |
public static final int |
I_LABEL |
111 |
public static final int |
I_LINE |
112 |
public static final int |
I_LOCAL |
113 |
public static final int |
I_LOCALS |
114 |
public static final int |
I_METHOD |
115 |
public static final int |
I_METHOD_PROTOTYPE |
117 |
public static final int |
I_METHOD_RETURN_TYPE |
118 |
public static final int |
I_METHODS |
116 |
public static final int |
I_ORDERED_METHOD_ITEMS |
119 |
public static final int |
I_PACKED_SWITCH_ELEMENTS |
120 |
public static final int |
I_PACKED_SWITCH_START_KEY |
121 |
public static final int |
I_PARAMETER |
122 |
public static final int |
I_PARAMETER_NOT_SPECIFIED |
124 |
public static final int |
I_PARAMETERS |
123 |
public static final int |
I_PROLOGUE |
125 |
public static final int |
I_REGISTER_LIST |
127 |
public static final int |
I_REGISTER_RANGE |
128 |
public static final int |
I_REGISTERS |
126 |
public static final int |
I_RESTART_LOCAL |
129 |
public static final int |
I_SOURCE |
130 |
public static final int |
I_SPARSE_SWITCH_ELEMENTS |
131 |
public static final int |
I_STATEMENT_ARRAY_DATA |
132 |
public static final int |
I_STATEMENT_FORMAT10t |
133 |
public static final int |
I_STATEMENT_FORMAT10x |
134 |
public static final int |
I_STATEMENT_FORMAT11n |
135 |
public static final int |
I_STATEMENT_FORMAT11x |
136 |
public static final int |
I_STATEMENT_FORMAT12x |
137 |
public static final int |
I_STATEMENT_FORMAT20bc |
138 |
public static final int |
I_STATEMENT_FORMAT20t |
139 |
public static final int |
I_STATEMENT_FORMAT21c_FIELD |
140 |
public static final int |
I_STATEMENT_FORMAT21c_STRING |
141 |
public static final int |
I_STATEMENT_FORMAT21c_TYPE |
142 |
public static final int |
I_STATEMENT_FORMAT21ih |
143 |
public static final int |
I_STATEMENT_FORMAT21lh |
144 |
public static final int |
I_STATEMENT_FORMAT21s |
145 |
public static final int |
I_STATEMENT_FORMAT21t |
146 |
public static final int |
I_STATEMENT_FORMAT22b |
147 |
public static final int |
I_STATEMENT_FORMAT22c_FIELD |
148 |
public static final int |
I_STATEMENT_FORMAT22c_TYPE |
149 |
public static final int |
I_STATEMENT_FORMAT22s |
150 |
public static final int |
I_STATEMENT_FORMAT22t |
151 |
public static final int |
I_STATEMENT_FORMAT22x |
152 |
public static final int |
I_STATEMENT_FORMAT23x |
153 |
public static final int |
I_STATEMENT_FORMAT30t |
154 |
public static final int |
I_STATEMENT_FORMAT31c |
155 |
public static final int |
I_STATEMENT_FORMAT31i |
156 |
public static final int |
I_STATEMENT_FORMAT31t |
157 |
public static final int |
I_STATEMENT_FORMAT32x |
158 |
public static final int |
I_STATEMENT_FORMAT35c_METHOD |
159 |
public static final int |
I_STATEMENT_FORMAT35c_TYPE |
160 |
public static final int |
I_STATEMENT_FORMAT3rc_METHOD |
161 |
public static final int |
I_STATEMENT_FORMAT3rc_TYPE |
162 |
public static final int |
I_STATEMENT_FORMAT45cc_METHOD |
163 |
public static final int |
I_STATEMENT_FORMAT4rcc_METHOD |
164 |
public static final int |
I_STATEMENT_FORMAT51l |
165 |
public static final int |
I_STATEMENT_PACKED_SWITCH |
166 |
public static final int |
I_STATEMENT_SPARSE_SWITCH |
167 |
public static final int |
I_SUBANNOTATION |
168 |
public static final int |
I_SUPER |
169 |
public static final int |
IMPLEMENTS_DIRECTIVE |
40 |
public static final int |
INLINE_INDEX |
41 |
public static final int |
INSTRUCTION_FORMAT10t |
42 |
public static final int |
INSTRUCTION_FORMAT10x |
43 |
public static final int |
INSTRUCTION_FORMAT10x_ODEX |
44 |
public static final int |
INSTRUCTION_FORMAT11n |
45 |
public static final int |
INSTRUCTION_FORMAT11x |
46 |
public static final int |
INSTRUCTION_FORMAT12x |
47 |
public static final int |
INSTRUCTION_FORMAT12x_OR_ID |
48 |
public static final int |
INSTRUCTION_FORMAT20bc |
49 |
public static final int |
INSTRUCTION_FORMAT20t |
50 |
public static final int |
INSTRUCTION_FORMAT21c_FIELD |
51 |
public static final int |
INSTRUCTION_FORMAT21c_FIELD_ODEX |
52 |
public static final int |
INSTRUCTION_FORMAT21c_STRING |
53 |
public static final int |
INSTRUCTION_FORMAT21c_TYPE |
54 |
public static final int |
INSTRUCTION_FORMAT21ih |
55 |
public static final int |
INSTRUCTION_FORMAT21lh |
56 |
public static final int |
INSTRUCTION_FORMAT21s |
57 |
public static final int |
INSTRUCTION_FORMAT21t |
58 |
public static final int |
INSTRUCTION_FORMAT22b |
59 |
public static final int |
INSTRUCTION_FORMAT22c_FIELD |
60 |
public static final int |
INSTRUCTION_FORMAT22c_FIELD_ODEX |
61 |
public static final int |
INSTRUCTION_FORMAT22c_TYPE |
62 |
public static final int |
INSTRUCTION_FORMAT22cs_FIELD |
63 |
public static final int |
INSTRUCTION_FORMAT22s |
64 |
public static final int |
INSTRUCTION_FORMAT22s_OR_ID |
65 |
public static final int |
INSTRUCTION_FORMAT22t |
66 |
public static final int |
INSTRUCTION_FORMAT22x |
67 |
public static final int |
INSTRUCTION_FORMAT23x |
68 |
public static final int |
INSTRUCTION_FORMAT30t |
69 |
public static final int |
INSTRUCTION_FORMAT31c |
70 |
public static final int |
INSTRUCTION_FORMAT31i |
71 |
public static final int |
INSTRUCTION_FORMAT31i_OR_ID |
72 |
public static final int |
INSTRUCTION_FORMAT31t |
73 |
public static final int |
INSTRUCTION_FORMAT32x |
74 |
public static final int |
INSTRUCTION_FORMAT35c_METHOD |
75 |
public static final int |
INSTRUCTION_FORMAT35c_METHOD_ODEX |
76 |
public static final int |
INSTRUCTION_FORMAT35c_TYPE |
77 |
public static final int |
INSTRUCTION_FORMAT35mi_METHOD |
78 |
public static final int |
INSTRUCTION_FORMAT35ms_METHOD |
79 |
public static final int |
INSTRUCTION_FORMAT3rc_METHOD |
80 |
public static final int |
INSTRUCTION_FORMAT3rc_METHOD_ODEX |
81 |
public static final int |
INSTRUCTION_FORMAT3rc_TYPE |
82 |
public static final int |
INSTRUCTION_FORMAT3rmi_METHOD |
83 |
public static final int |
INSTRUCTION_FORMAT3rms_METHOD |
84 |
public static final int |
INSTRUCTION_FORMAT45cc_METHOD |
85 |
public static final int |
INSTRUCTION_FORMAT4rcc_METHOD |
86 |
public static final int |
INSTRUCTION_FORMAT51l |
87 |
public static final int |
INTEGER_LITERAL |
88 |
public static final int |
INVALID_TOKEN |
89 |
public static final int |
LINE_COMMENT |
170 |
public static final int |
LINE_DIRECTIVE |
171 |
public static final int |
LOCAL_DIRECTIVE |
173 |
public static final int |
LOCALS_DIRECTIVE |
172 |
public static final int |
LONG_LITERAL |
174 |
public static final int |
MEMBER_NAME |
175 |
public static final int |
METHOD_DIRECTIVE |
176 |
public static final int |
NEGATIVE_INTEGER_LITERAL |
177 |
public static final int |
NULL_LITERAL |
178 |
public static final int |
OPEN_BRACE |
179 |
public static final int |
OPEN_PAREN |
180 |
public static final int |
PACKED_SWITCH_DIRECTIVE |
181 |
public static final int |
PARAM_LIST_OR_ID_PRIMITIVE_TYPE |
183 |
public static final int |
PARAMETER_DIRECTIVE |
182 |
public static final int |
POSITIVE_INTEGER_LITERAL |
184 |
public static final int |
PRIMITIVE_TYPE |
185 |
public static final int |
PROLOGUE_DIRECTIVE |
186 |
public static final int |
REGISTER |
187 |
public static final int |
REGISTERS_DIRECTIVE |
188 |
public static final int |
RESTART_LOCAL_DIRECTIVE |
189 |
public static final int |
SHORT_LITERAL |
190 |
public static final int |
SIMPLE_NAME |
191 |
public static final int |
SOURCE_DIRECTIVE |
192 |
public static final int |
SPARSE_SWITCH_DIRECTIVE |
193 |
public static final int |
STRING_LITERAL |
194 |
public static final int |
SUBANNOTATION_DIRECTIVE |
195 |
public static final int |
SUPER_DIRECTIVE |
196 |
public static final int |
VERIFICATION_ERROR_TYPE |
197 |
public static final int |
VOID_TYPE |
198 |
public static final int |
VTABLE_INDEX |
199 |
public static final int |
WHITE_SPACE |
200 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
ACCESS_SPEC |
4 |
public static final int |
ANNOTATION_DIRECTIVE |
5 |
public static final int |
ANNOTATION_VISIBILITY |
6 |
public static final int |
ARRAY_DATA_DIRECTIVE |
7 |
public static final int |
ARRAY_TYPE_PREFIX |
8 |
public static final int |
ARROW |
9 |
public static final int |
BOOL_LITERAL |
10 |
public static final int |
BYTE_LITERAL |
11 |
public static final int |
CATCH_DIRECTIVE |
13 |
public static final int |
CATCHALL_DIRECTIVE |
12 |
public static final int |
CHAR_LITERAL |
14 |
public static final int |
CLASS_DESCRIPTOR |
15 |
public static final int |
CLASS_DIRECTIVE |
16 |
public static final int |
CLOSE_BRACE |
17 |
public static final int |
CLOSE_PAREN |
18 |
public static final int |
COLON |
19 |
public static final int |
COMMA |
20 |
public static final int |
DOTDOT |
21 |
public static final int |
DOUBLE_LITERAL |
22 |
public static final int |
DOUBLE_LITERAL_OR_ID |
23 |
public static final int |
END_ANNOTATION_DIRECTIVE |
24 |
public static final int |
END_ARRAY_DATA_DIRECTIVE |
25 |
public static final int |
END_FIELD_DIRECTIVE |
26 |
public static final int |
END_LOCAL_DIRECTIVE |
27 |
public static final int |
END_METHOD_DIRECTIVE |
28 |
public static final int |
END_PACKED_SWITCH_DIRECTIVE |
29 |
public static final int |
END_PARAMETER_DIRECTIVE |
30 |
public static final int |
END_SPARSE_SWITCH_DIRECTIVE |
31 |
public static final int |
END_SUBANNOTATION_DIRECTIVE |
32 |
public static final int |
ENUM_DIRECTIVE |
33 |
public static final int |
EOF |
-1 |
public static final int |
EPILOGUE_DIRECTIVE |
34 |
public static final int |
EQUAL |
35 |
public static final int |
FIELD_DIRECTIVE |
36 |
public static final int |
FIELD_OFFSET |
37 |
public static final int |
FLOAT_LITERAL |
38 |
public static final int |
FLOAT_LITERAL_OR_ID |
39 |
public static final int |
I_ACCESS_LIST |
90 |
public static final int |
I_ANNOTATION |
91 |
public static final int |
I_ANNOTATION_ELEMENT |
93 |
public static final int |
I_ANNOTATIONS |
92 |
public static final int |
I_ARRAY_ELEMENT_SIZE |
95 |
public static final int |
I_ARRAY_ELEMENTS |
94 |
public static final int |
I_CATCH |
96 |
public static final int |
I_CATCHALL |
97 |
public static final int |
I_CATCHES |
98 |
public static final int |
I_CLASS_DEF |
99 |
public static final int |
I_ENCODED_ARRAY |
100 |
public static final int |
I_ENCODED_ENUM |
101 |
public static final int |
I_ENCODED_FIELD |
102 |
public static final int |
I_ENCODED_METHOD |
103 |
public static final int |
I_END_LOCAL |
104 |
public static final int |
I_EPILOGUE |
105 |
public static final int |
I_FIELD |
106 |
public static final int |
I_FIELD_INITIAL_VALUE |
108 |
public static final int |
I_FIELD_TYPE |
109 |
public static final int |
I_FIELDS |
107 |
public static final int |
I_IMPLEMENTS |
110 |
public static final int |
I_LABEL |
111 |
public static final int |
I_LINE |
112 |
public static final int |
I_LOCAL |
113 |
public static final int |
I_LOCALS |
114 |
public static final int |
I_METHOD |
115 |
public static final int |
I_METHOD_PROTOTYPE |
117 |
public static final int |
I_METHOD_RETURN_TYPE |
118 |
public static final int |
I_METHODS |
116 |
public static final int |
I_ORDERED_METHOD_ITEMS |
119 |
public static final int |
I_PACKED_SWITCH_ELEMENTS |
120 |
public static final int |
I_PACKED_SWITCH_START_KEY |
121 |
public static final int |
I_PARAMETER |
122 |
public static final int |
I_PARAMETER_NOT_SPECIFIED |
124 |
public static final int |
I_PARAMETERS |
123 |
public static final int |
I_PROLOGUE |
125 |
public static final int |
I_REGISTER_LIST |
127 |
public static final int |
I_REGISTER_RANGE |
128 |
public static final int |
I_REGISTERS |
126 |
public static final int |
I_RESTART_LOCAL |
129 |
public static final int |
I_SOURCE |
130 |
public static final int |
I_SPARSE_SWITCH_ELEMENTS |
131 |
public static final int |
I_STATEMENT_ARRAY_DATA |
132 |
public static final int |
I_STATEMENT_FORMAT10t |
133 |
public static final int |
I_STATEMENT_FORMAT10x |
134 |
public static final int |
I_STATEMENT_FORMAT11n |
135 |
public static final int |
I_STATEMENT_FORMAT11x |
136 |
public static final int |
I_STATEMENT_FORMAT12x |
137 |
public static final int |
I_STATEMENT_FORMAT20bc |
138 |
public static final int |
I_STATEMENT_FORMAT20t |
139 |
public static final int |
I_STATEMENT_FORMAT21c_FIELD |
140 |
public static final int |
I_STATEMENT_FORMAT21c_STRING |
141 |
public static final int |
I_STATEMENT_FORMAT21c_TYPE |
142 |
public static final int |
I_STATEMENT_FORMAT21ih |
143 |
public static final int |
I_STATEMENT_FORMAT21lh |
144 |
public static final int |
I_STATEMENT_FORMAT21s |
145 |
public static final int |
I_STATEMENT_FORMAT21t |
146 |
public static final int |
I_STATEMENT_FORMAT22b |
147 |
public static final int |
I_STATEMENT_FORMAT22c_FIELD |
148 |
public static final int |
I_STATEMENT_FORMAT22c_TYPE |
149 |
public static final int |
I_STATEMENT_FORMAT22s |
150 |
public static final int |
I_STATEMENT_FORMAT22t |
151 |
public static final int |
I_STATEMENT_FORMAT22x |
152 |
public static final int |
I_STATEMENT_FORMAT23x |
153 |
public static final int |
I_STATEMENT_FORMAT30t |
154 |
public static final int |
I_STATEMENT_FORMAT31c |
155 |
public static final int |
I_STATEMENT_FORMAT31i |
156 |
public static final int |
I_STATEMENT_FORMAT31t |
157 |
public static final int |
I_STATEMENT_FORMAT32x |
158 |
public static final int |
I_STATEMENT_FORMAT35c_METHOD |
159 |
public static final int |
I_STATEMENT_FORMAT35c_TYPE |
160 |
public static final int |
I_STATEMENT_FORMAT3rc_METHOD |
161 |
public static final int |
I_STATEMENT_FORMAT3rc_TYPE |
162 |
public static final int |
I_STATEMENT_FORMAT45cc_METHOD |
163 |
public static final int |
I_STATEMENT_FORMAT4rcc_METHOD |
164 |
public static final int |
I_STATEMENT_FORMAT51l |
165 |
public static final int |
I_STATEMENT_PACKED_SWITCH |
166 |
public static final int |
I_STATEMENT_SPARSE_SWITCH |
167 |
public static final int |
I_SUBANNOTATION |
168 |
public static final int |
I_SUPER |
169 |
public static final int |
IMPLEMENTS_DIRECTIVE |
40 |
public static final int |
INLINE_INDEX |
41 |
public static final int |
INSTRUCTION_FORMAT10t |
42 |
public static final int |
INSTRUCTION_FORMAT10x |
43 |
public static final int |
INSTRUCTION_FORMAT10x_ODEX |
44 |
public static final int |
INSTRUCTION_FORMAT11n |
45 |
public static final int |
INSTRUCTION_FORMAT11x |
46 |
public static final int |
INSTRUCTION_FORMAT12x |
47 |
public static final int |
INSTRUCTION_FORMAT12x_OR_ID |
48 |
public static final int |
INSTRUCTION_FORMAT20bc |
49 |
public static final int |
INSTRUCTION_FORMAT20t |
50 |
public static final int |
INSTRUCTION_FORMAT21c_FIELD |
51 |
public static final int |
INSTRUCTION_FORMAT21c_FIELD_ODEX |
52 |
public static final int |
INSTRUCTION_FORMAT21c_STRING |
53 |
public static final int |
INSTRUCTION_FORMAT21c_TYPE |
54 |
public static final int |
INSTRUCTION_FORMAT21ih |
55 |
public static final int |
INSTRUCTION_FORMAT21lh |
56 |
public static final int |
INSTRUCTION_FORMAT21s |
57 |
public static final int |
INSTRUCTION_FORMAT21t |
58 |
public static final int |
INSTRUCTION_FORMAT22b |
59 |
public static final int |
INSTRUCTION_FORMAT22c_FIELD |
60 |
public static final int |
INSTRUCTION_FORMAT22c_FIELD_ODEX |
61 |
public static final int |
INSTRUCTION_FORMAT22c_TYPE |
62 |
public static final int |
INSTRUCTION_FORMAT22cs_FIELD |
63 |
public static final int |
INSTRUCTION_FORMAT22s |
64 |
public static final int |
INSTRUCTION_FORMAT22s_OR_ID |
65 |
public static final int |
INSTRUCTION_FORMAT22t |
66 |
public static final int |
INSTRUCTION_FORMAT22x |
67 |
public static final int |
INSTRUCTION_FORMAT23x |
68 |
public static final int |
INSTRUCTION_FORMAT30t |
69 |
public static final int |
INSTRUCTION_FORMAT31c |
70 |
public static final int |
INSTRUCTION_FORMAT31i |
71 |
public static final int |
INSTRUCTION_FORMAT31i_OR_ID |
72 |
public static final int |
INSTRUCTION_FORMAT31t |
73 |
public static final int |
INSTRUCTION_FORMAT32x |
74 |
public static final int |
INSTRUCTION_FORMAT35c_METHOD |
75 |
public static final int |
INSTRUCTION_FORMAT35c_METHOD_ODEX |
76 |
public static final int |
INSTRUCTION_FORMAT35c_TYPE |
77 |
public static final int |
INSTRUCTION_FORMAT35mi_METHOD |
78 |
public static final int |
INSTRUCTION_FORMAT35ms_METHOD |
79 |
public static final int |
INSTRUCTION_FORMAT3rc_METHOD |
80 |
public static final int |
INSTRUCTION_FORMAT3rc_METHOD_ODEX |
81 |
public static final int |
INSTRUCTION_FORMAT3rc_TYPE |
82 |
public static final int |
INSTRUCTION_FORMAT3rmi_METHOD |
83 |
public static final int |
INSTRUCTION_FORMAT3rms_METHOD |
84 |
public static final int |
INSTRUCTION_FORMAT45cc_METHOD |
85 |
public static final int |
INSTRUCTION_FORMAT4rcc_METHOD |
86 |
public static final int |
INSTRUCTION_FORMAT51l |
87 |
public static final int |
INTEGER_LITERAL |
88 |
public static final int |
INVALID_TOKEN |
89 |
public static final int |
LINE_COMMENT |
170 |
public static final int |
LINE_DIRECTIVE |
171 |
public static final int |
LOCAL_DIRECTIVE |
173 |
public static final int |
LOCALS_DIRECTIVE |
172 |
public static final int |
LONG_LITERAL |
174 |
public static final int |
MEMBER_NAME |
175 |
public static final int |
METHOD_DIRECTIVE |
176 |
public static final int |
NEGATIVE_INTEGER_LITERAL |
177 |
public static final int |
NULL_LITERAL |
178 |
public static final int |
OPEN_BRACE |
179 |
public static final int |
OPEN_PAREN |
180 |
public static final int |
PACKED_SWITCH_DIRECTIVE |
181 |
public static final int |
PARAM_LIST_OR_ID_PRIMITIVE_TYPE |
183 |
public static final int |
PARAMETER_DIRECTIVE |
182 |
public static final int |
POSITIVE_INTEGER_LITERAL |
184 |
public static final int |
PRIMITIVE_TYPE |
185 |
public static final int |
PROLOGUE_DIRECTIVE |
186 |
public static final int |
REGISTER |
187 |
public static final int |
REGISTERS_DIRECTIVE |
188 |
public static final int |
RESTART_LOCAL_DIRECTIVE |
189 |
public static final int |
SHORT_LITERAL |
190 |
public static final int |
SIMPLE_NAME |
191 |
public static final int |
SOURCE_DIRECTIVE |
192 |
public static final int |
SPARSE_SWITCH_DIRECTIVE |
193 |
public static final int |
STRING_LITERAL |
194 |
public static final int |
SUBANNOTATION_DIRECTIVE |
195 |
public static final int |
SUPER_DIRECTIVE |
196 |
public static final int |
VERIFICATION_ERROR_TYPE |
197 |
public static final int |
VOID_TYPE |
198 |
public static final int |
VTABLE_INDEX |
199 |
public static final int |
WHITE_SPACE |
200 |


More than 10 years, Arkademy Travel Services has grow at a steady pace and become one of Indonesia's leading travel agent offering a complete travel solution for both leisure and business travels. The company has over 500 staff within 24 branches across the country


BORN ON THE FOURTH OF JULY A film review by Eugene Miya in the public domain
Born on the Fourth of July Directed by Oliver Stone
Why would anyone want to see this film? Sounds like a Springsteen song.
Some people like Tom Cruise. I can understand; I paid ASC dues for a while. It's not comedy, and it's not one of those macho man films, but I think there were some people in the audience who thought it might have been. This film won't have many repeat attendees. It was emotionally draining for a few people.
It is a long film, nearly 2.5 hours. A few of the scenes might seem down and out. I guess life is kind of like that, and as I get older, I have tended to get tired of some of the current same-as-always fare. So you might not like this (my) view. I don't know if people want Vietnam films, judging from popular expression of support in Panama--an irony it happens at the same time.
I went to see this film because when I was growing up I remember Dad watching the tube and seeing a fellow named Ron Kovic in a wheelchair and my Dad exclaiming, "That man is a Communist." It happened more than once, and that was my introduction to The Vietnam Veteran Against the War.
This film is not for weak stomachs. It does not show some aspects of life in a very positive manner: values, non-White races, women [to a degree], Catholicism, the VA [especially], people with handicaps, and others "we" don't treat well. Especially the VA: I know that from personal experience because I remember spending lots of time at VA hospitals [Westwood and Long Beach] with my Dad who was a Legionnaire (and I was a Son: still recall the preamble, visiting WWII vets, and I know that those and other earlier Vets tended to look down up the Nam vets.
The obvious comparison is Hal Ashby's COMING HOME. This is a different story, a real one. You can go borrow Kovic's book from a library (is it still in print?). So you can check the deals as I did for Michael Fox's CASUALTIES OF WAR. I do not think it is possible to spoil the film by recounting the sequence of events: it is a very graphic, very visual film.
I think this is one of the most powerful films of the year. It is very similar in tone to Stone's earlier PLATOON (incidental music is the same). There are no BIG names in this film. Tom Berringer and Wilhelm Dafoe from that earlier film appear in this film: Berringer as a recruiting sergeant (I remember when that happened in my life) and Dafoe as another vet in a chair. The details are well taken care of, perhaps too obvious in attention to having a few long scenes: the anti-war books before Kovic changed his mind (JOHNNY GOT HIS GUN and ALL QUIET ON THE WESTERN FRONT), Life Magazines, the TV footage; oh, Stone himself appears as a newscaster interviewing a colonel on the tube. Ron Kovic himself is in the film as another wheelchair-bound vet.
This is another one of those "male-bonding" films, to use the cliche. It does not speak well of fixed roles, or how we treat our fellow man. A signal the film sends out (from the 50s) is that it is an honor to give your life for your country: the ultimate sacrifice. But the film shows that to die is preferable to coming back "less than whole." These men who returned have made the ultimate sacrifice.
I don't know how well it will do in the box-office in the long run. I went to see the film at a nearly full Saturday matinee when I was waiting for a long computer run. Do I used Leeper's scale? Dare I gave it a +3? Sure. May even be a +4. But people like Kovic's mother would question that (remember, I said that some women do not appear in a favorable light). That's Leeper's scale. Only time will tell.
Okay, you had your chance (that concludes commentary). Synopsis follows-- nothing else. Again, it's visceral, so I don't think I will give any earth- shattering thing away.
The film begins with two boys paying Army (Ron) on Long Island in 1956. (I remember the surplus helmet I had.) Well done, down to throwing the dirt. It's the 4th of July, Ron's birthday. They attend a parade, see the soldiers, the disabled vets. One first notices one of the vets wincing at the sound of firecrackers (I never saw anything like that growing up, but the parade was well done; I've walked in three or four myself). Ron's future "sweetheart" is shown. Not into girls yet. It moves to a time when Kennedy is stepping into office (the "ask not what you country can do for you..." speech; this evoked the only cheer in my audience). But Ron's mother is worried about Communism. Said many times through the film.
The next scenes show Ron getting older. He's into wrestling, and he loses. He's working very hard, the American dream. His mother catches him with a Playboy (I am surprised she did not do the equivalent to washing his mouth with soap). The group pressure is shown. A recruiting team visits. He decides to become a Marine. His Dad, a WWII Vet, isn't so sure he should do this, not saying why, not a strong-willed father figure. The concept of duty to country was well shown. His brother playing Dylan.
It's too bad the film is as long as it is. It would be a great film if it had the training scenes from FULL METAL JACKET at this point, but the film now cuts to a beach near the DMZ. It's a village they are preparing to check out. They open fire early, the confusion starts, and the pressure of authority (command) is there. Ron, on his second tour (that part seemed a bit less probable), and his men (one new) check out for friendly casualties. They wasted a few. The wounds are very graphic--there is a way the skin parts on a grazing wound and they show this. But then they are under attack. The confusion of battle and retreat is well portrayed. NVA, bullets. Looking toward the sun, movement, Ron shoots. It's the new man. From Georgia. Not a pretty sight.
The Major denies Ron killed his own man, but Ron is feeling it. They don't tell you that 10-12% of the casualties of a war are caused by "friendly fire" (explored by a Carol Burnett film of that title). Remember that when you see Panama casualty figures.
Ron is getting a bit frosty; his mind is off somewhere else. Some months later, Ron's squad is advancing on another village. The NVA open up. Someone gets it thru the head. Ron gets his heel blown off, but still the fighter, he keeps shooting. He gets hit. Point of view includes getting hauled out. This is the only film I know which shows the exit wound as well as an entry wound. Ron has a gaping hole in his back. The aid station is a nightmare. Soldiers dying. Just when you thought it was bad....
The VA hospital is shown as a real nightmare. COMING HOME was clean compared to this. Ron tries real hard; he still has his fighting spirit. He's trying to regain the use of his legs when the doctors are telling him no hope. When he falls, it's a compound fracture on a paraplegic. He tragically loses his leg. The chair forever now. This whole sequence is not for weak stomaches. And it forebode more: "America Love it or Leave."
He finally goes home. Things are different. One "sleeze" peer has gone into business (was in college). He gets a chance to feel better; he's in parade dress and to speak on the 4th from a platform. When he gets a memory from a baby crying. He can't finish, but he runs into an old buddy who has also been there. Lost friends are discussed in a way only a Vet can joke about.
He sees his sweetheart. A demonstration [Readjustment Blues by John Denver would have been right here]. Ron is slowly becoming a problem. His hair starting to get longer. He has a confrontation with a WWII Vet.
Down in Mexico, he sees other wheelchair-bound vets. He is killing time. Gets into a fight with Dafoe, tragic humor at its best. What are you going to do, Ron? He visits the parents of the man he killed. Many tokens of past soldiers in the house. You can guess for yourself if he tells a story of bravery or the truth. A powerful moment.
The film concludes which Ron (a Republican) getting into the 1972 Republican convention and "disrupting it." One of the vets is really an undercover cop, trying to get him specifically (this really happened). The media coverage. Then the 1976 Democratic convention. His book is out. He is "home."
This film would appear a real downer except at the very beginning and end. The problem is that many of these people, policies, attitudes still exist. It would be really hard to create an uplifting ending. It is a film about principles.
It is somewhat ironic the film was shot in the Philippines where so much recent blood has been shed. One hears a a couple dozen killed in Panama, but few remember that over 300 Americans were wounded, some by friendly fire, some to probably go thru what Kovic did. Then what of the 1000 Panamanians? What of the millions of Vietnamese? Okay, so this is commentary. Finis.
Another gross generalization from
--eugene miya, NASA Ames Research Center<EMAIL_ADDRESS>{ncar,decwrl,hplabs,uunet}!ames!eugene
.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Study offers first large-sample evidence of the effect of ethics training on financial sector
| Source: | University of Notre Dame |
| Summary: | New research from Notre Dame offers the first large-sample study on how rules and ethics training affects behavior and employment decisions in the financial sector. |
Can ethics be taught? New research suggests yes, offering the first large-sample study on how rules and ethics training affects behavior and employment decisions in the financial sector.
"Can Ethics be Taught? Evidence from Securities Exams and Investment Adviser Misconduct" is forthcoming in the Journal of Financial Economics from Zachary Kowaleski, assistant professor of accountancy in the University of Notre Dame's Mendoza College of Business, along with Andrew Sutherland from the MIT Sloan School of Management and Felix Vetter, a doctoral candidate at the London School of Economics.
"Skeptics often criticize the lack of empirical evidence that shows ethics training works," Kowaleski says. "A key barrier has been difficulty observing both training and subsequent behavior. We overcome this barrier by using a change to the ethics content on a qualification exam and an investment adviser's record of misbehavior."
The researchers studied nearly 1.2 million investment advisers and financial representatives working at U.S. broker-dealers between 2007 and 2017, with a focus on the consequences of a 2010 change in the investment adviser qualification exam. That year, coverage shifted from the rules and ethics section to the technical material section. The rules and ethics section covers allowable forms of compensation, disclosure requirements and prohibitions of unethical business practices, while the technical section covers such topics as capital market theory, investment vehicle characteristics, ratios and financial reporting. Prior to the change, rules and ethics questions received an 80 percent weight. After the change, they were weighted only 50 percent.
The authors compared individuals with similar current employers, locations, qualifications and experience, but who took different versions of the exam.
They discovered those passing the older exam containing more rules and ethics coverage were one-fourth less likely to commit misconduct, including obvious offenses such as fraud, theft or deception. This reveals the exam alters individuals' perception of acceptable conduct and not just their awareness of specific rules.
Kowaleski notes it's surprising to see an effect.
"Behavioral ethics research shows that business people often do not recognize when they are making ethical decisions," he says. "They approach these decisions by weighing costs and benefits, and by using emotion or intuition."
These results are consistent with the exam playing a "priming" role, where early exposure to rules and ethics material prepares the individual to behave appropriately later. Those passing the exam without prior misconduct appear to respond most to the amount of rules and ethics material covered on their exam. Those already engaging in misconduct, or having spent several years working in the securities industry, respond least or not at all.
The study also examines what happens when people with more ethics training find themselves surrounded by bad behavior, revealing these individuals are more likely to leave their jobs.
"We study this effect both across organizations and within Wells Fargo, during their account fraud scandal," Kowaleski explains. "That those with more ethics training are more likely to leave misbehaving organizations suggests the self-reinforcing nature of corporate culture."
Kowaleski studies the effect of the institutional setting on behavior. He previously worked in PwC's audit practice, and served as an economic research fellow, studying broker-dealer audits, at the Public Company Accounting Oversight Board.
make a difference: sponsored opportunity
Story Source:
Materials provided by University of Notre Dame. Original written by Shannon Roddel.
Note: Content may be edited for style and length.
Journal Reference:
- Zach Kowaleski, Andrew Sutherland, Felix Vetter. Can Ethics be Taught? Evidence from Securities Exams and Investment Adviser Misconduct. SSRN Electronic Journal, 2019; DOI: 10.2139/ssrn.3457588
Cite This Page:
| MLA | University of Notre Dame. "Study offers first large-sample evidence of the effect of ethics training on financial sector." ScienceDaily. ScienceDaily, 21 November 2019. <www.sciencedaily.com/releases/2019/11/191121134517.htm>. |
| APA | University of Notre Dame. (2019, November 21). Study offers first large-sample evidence of the effect of ethics training on financial sector. ScienceDaily. Retrieved November 21, 2019 from www.sciencedaily.com/releases/2019/11/191121134517.htm |
| Chicago | University of Notre Dame. "Study offers first large-sample evidence of the effect of ethics training on financial sector." ScienceDaily. www.sciencedaily.com/releases/2019/11/191121134517.htm (accessed November 21, 2019). |


- Title, author and date
- Use a YAML header in your document to do this
---
title: Example Markdown document
author: Daniel Anderson
date: "2015-11-11"
---
Daniel Anderson
CourseR
---
title: Example Markdown document
author: Daniel Anderson
date: "2015-11-11"
---
The following lines of code uses the read.table
function, to read the trees
data into an object named trees
. Columns are separated by a pipe, |,
missing data are coded 999, and, and the column names are Girth, Height, and
Volume
trees <- read.table("./data/trees.txt",
sep = "|", na = "999",
col.names = c("Girth", "Height", "Volume"))
head(trees)
## Girth Height Volume
## 1 8.3 NA NA
## 2 NA 65 10.3
## 3 NA 63 NA
## 4 10.5 72 16.4
## 5 10.7 NA NA
## 6 10.8 NA 19.7
mean()
and display it in text. If
there are missing data in the vector that you are trying to calculate the mean
from, you will also need to include the additional argument na.rm = TRUE
.
Make some manipulation to the data (e.g., remove a few random cases) and
report the mean in text again, using code.The mean girth of trees in the sample was 13.57. For trees below 70 feet the mean girth was 12.75.
pairs(trees)
Create the following matrix (which we created during the first class, if you saved your syntax) \[\mathbf{m} = \left [ \begin{array}{ccccc} 18 & 32 & 11 & 41 & 73 \\\ 61 & 47 & 22 & 87 & 63 \\\ 44 & 52 & 23 & 42 & 77 \\\ 23 & 17 & 5 & 72 & 83 \end{array} \right ] \]
m <- matrix(c(18, 32, 11, 41, 73,
61, 47, 22, 87, 63,
44, 52, 23, 42, 77,
23, 17, 5, 72, 83
),
byrow = TRUE, ncol = 5
)
m
## [,1] [,2] [,3] [,4] [,5]
## [1,] 18 32 11 41 73
## [2,] 61 47 22 87 63
## [3,] 44 52 23 42 77
## [4,] 23 17 5 72 83
1) Use three different methods to subset the matrix and obtain the following vector \[\mathbf{v} = \left [ \begin{array}{ccc} 52 & 42 & 77 \end{array} \right ] \]
m[3, c(2,4,5)]
m[ ,c(2,4,5)][3, ]
m[3, m[3, ] == 52 |
m[3, ] == 42 |
m[3, ] == 77 ]
m[3, c(FALSE, TRUE, FALSE, TRUE, TRUE)]
m[3, ][ m[3, ] > 40 &
m[3, ] != 44 ]
subset(m, c(FALSE, FALSE, TRUE, FALSE),
select = c(2,4,5), drop = TRUE)
## [1] 52 42 77
## [1] 52 42 77
## [1] 52 42 77
## [1] 52 42 77
## [1] 52 42 77
## [1] 52 42 77
2) Subset \(\mathbf{m}\) again to get \(\mathbf{v2} = \left [\begin{array}{cc} 87 & 42 \end{array} \right ]\). Then create a new matrix using the following steps:
One possible method
v <- m[c(2,3), 4]
v
## [1] 87 42
m2 <- m[ ,-5]
m2[2, ] <- v + m2[2, ]
m2[4, ] <- v + m2[4, ]
m2
## [,1] [,2] [,3] [,4]
## [1,] 18 32 11 41
## [2,] 148 89 109 129
## [3,] 44 52 23 42
## [4,] 110 59 92 114
If you don't have the rmarkdown library installed, first run
install.packages("rmarkdown")
Then, to render to document
library(rmarkdown)
render("yourFile.Rmd", "html_document")
Note that your working directory must be set to the same location as the .Rmd
file, or you can provide a path to the file in the render
function.


A concise way to create new lists from other sequences, for example applying some operations to each element (like ‘map’ in other languages), or selecting elements that satisfy a certain condition (like ‘filter’ in other languages).
{{ "idioms_examples/list_comprehension/listComprehension.py"| pygment_file|safe }}It is more readable and also improve the performance:
{{ "idioms_examples/list_comprehension/listComprehension_perf.py"| pygment_file|safe }}Is an easy and elegant way to construct a dictionary. Is a similar case as list comprehensions
{{ "idioms_examples/dict_comprehension/dict_comprehension.py"| pygment_file|safe }}It is more readable and also improve the performance:
{{ "idioms_examples/dict_comprehension/results_performance.py"| pygment_file|safe }}A decorator is the name used for a software design pattern. Decorators dynamically alter the functionality of a function, method, or class without having to directly use subclasses or change the source code of the function being decorated. [1]
{{ "idioms_examples/decorator/decorator.py"| pygment_file|safe }}Are special methods that can be invoked by special syntax [1]. For example:
{{ "idioms_examples/magic_methods/magic_methods.py"| pygment_file|safe }}That code in Python2 could be improved with the use of the decorator functools.total_ordering
A complete list well documented can be found here
Finally is a optional clause intended for cleaning-up actions. It is always executed before leaving the try statement. For example:
{{ "idioms_examples/finally_block/finally.py"| pygment_file|safe }}The with statement allows you to execute two related operations as a pair, with a block of code in between [1]. Opening a file is the typical example. It opens the file in the with Statement and closes it when the block ends:
{{ "idioms_examples/with_statement/with.py"| pygment_file|safe }}But there are more like threading.Lock for threads and you can define your owns context managers with the use of __enter__ and __exit__ methods in a class or with the use of contextlib library [2]. For example:
{{ "idioms_examples/with_statement/with_custom.py"| pygment_file|safe }}[1] The with statement by example
The built-in enumerate returns a enumerate object from an object that can be iterable. The next method, return a tuple containing a count (from 0 by default) and the the next value of the iterable object. It is useful when you need the index of the iterable. For example:
{{ "idioms_examples/enumerate/enumerate.py"| pygment_file|safe }}Generator functions allow you to define a function that can be used as an iterator. For example:
{{ "idioms_examples/generators/generators_1.py"| pygment_file|safe }}You can also define a generator class with the use of __iter__ and __next__ magic methods
A concise way of making generators are generator expressions: Generator expressions
In the following example you can also see that can improve the performance because it doesn't build the full list in memory.
For example:
{{ "idioms_examples/generators/generators_2.py"| pygment_file|safe }}To fully understand generators, you should understand the keyword yield
The keyword yield allows you to write generators. It is used as a return statement, but when you run the funcion, it will just return a generator, the code won't run.
Try to undertand the following example:
{{ "idioms_examples/yield/yield.py"| pygment_file|safe }}Generator expressions are a concise way to create generators. The syntax is the same as list comprehensions but are more memory efficient because don't store the whole list in memory
{{ "idioms_examples/generator_expr/generators.py"| pygment_file|safe }}defaultdict is a subclass of the built-in dict class. The functionality is the same as a dictionary. The powerful is that you can define a default value when the key is not found and it doesn't raise KeyError.
For example, with int as default_factory
{{ "idioms_examples/defaultdict/defaultdict_int.py"| pygment_file|safe }}With list as default_factory:
{{ "idioms_examples/defaultdict/defaultdict_list.py"| pygment_file|safe }}You can use more default values as set or dict and also you can define your own constant function with the use of itertools.repeat [1]
defaultdict can improve the redability and the maintenance and sometimes the performance, but actually, the keyword in for checking a key in a dictionary is really fast
namedTuple is a factory functions for creating tuples with fields that can be accessible by attribute lookup as well as being indexable and iterable [1] They are useful for storing the results of some functions. For example, in the next case it returns a point, but you is not really readable:
{{ "idioms_examples/namedTuple/namedTuple_bad.py"| pygment_file|safe }}You can also unpack the point with x, y = get_point()
, but you get 2 variables and for multiple points it could be confusing. The alternative is the use of namedTuple:
It is more readable, easier to use and more maintainable
deque (double-ended-queue) is a generalization of queues and stacks. It supports thread-safe and memory efficient, with approximately O(1) performance.
One example of the use of deque methods is shown below:
{{ "idioms_examples/deque/deque.py"| pygment_file|safe }}Counter is a dict subclass for counting objects. It supports 3 methods: elements(), most_common([n]) and substract([iterable-or-mapping])
{{ "idioms_examples/counter/counter.py"| pygment_file|safe }}A class method is the function that belongs to the class. It receives the class as first argument and doesn't need an instance of the class to be called. @classmethod is a function decorator for a class-method.
{{ "idioms_examples/classmethod/classmethod.py"| pygment_file|safe }}A static method doesn't receive an implicit first argument, therefore that method "doesn't have" any reference to the class from inside. @staticmethod is a function decorator for a static-method.
{{ "idioms_examples/staticmethod/staticmethodDec.py"| pygment_file|safe }}This built-in returns a generator of tuples, where the i-th tuple contains the i-th element from each of the argument sequences or iterables [1].
{{"idioms_examples/zip/zip.py" | pygment_file|safe }}This function is like zip, generate a iterator of tuples from each of the argument sequences. If any sequence is shorter, Generates a new iterator from all the iterables given. If any iterable is shorter, the last tuples are formed from the largest tuple and a default value giver or None.
Better explained with one example:
{{"idioms_examples/izip_longest/iziplong.py"| pygment_file|safe}}starmap is like map (cumputes a function using arguments obtained from iterable arguments), but the difference is that the iterable here is a tuple
map(func, iter1, iter2)
is similar to starmap(func, map(iter1, iter2))
This a useful function to return n independent iterators from a single iterator. Important: When a copy is made, the original iterator shouldn't be used because the copies could get advanced without the tee objects being informed
{{"idioms_examples/tee/tee.py"| pygment_file|safe}}It is useful to group an interable given a function. For example:
{{"idioms_examples/group_by/group_by.py"| pygment_file|safe}}Given a class defining one comparison ordering methods (>, <, >=, <=) and == , this class decorator supplies the rest.
{{"idioms_examples/total_ordering/total_ordering.py"| pygment_file|safe}}Apply function to every item of iterable and return a list of the results. [1]
{{ "idioms_examples/map/map_def.py"| pygment_file|safe }}In this case we can see a how to compute the square of a list of numbers
{{ "idioms_examples/map/map_bad.py"| pygment_file|safe }}A better way of doing that is with the use of map. In this case it applies a lambda function:
{{ "idioms_examples/map/map_ok.py"| pygment_file|safe }}But the more pythonic way could be done with the use of list comprehensions in this case
Construct a list from those elements of iterable for which function returns true. [1]
{{ "idioms_examples/filter/filter_def.py"| pygment_file|safe }}Apply function of two arguments cumulatively to the items of iterable, from left to right, so as to reduce the iterable to a single value. [1]
{{ "idioms_examples/reduce/reduce_def.py"| pygment_file|safe }}lambda is a keyword of Python that allows to construct anonymus functions in one line
The simpliest example can be shown below:
{{ "idioms_examples/lambda/lambda_def.py"| pygment_file|safe }}But it can be applied to map, filter and reduce. Or other functions:
{{ "idioms_examples/lambda/lambda_sort.py"| pygment_file|safe }}Dictionaries in Python are like objects in Java. This kind of structures allows you to store items indexed by a key. This structures are basic in Python, and could be very powerful if you know how to manage them.
There are multiple ways, but one idiomatic practice in Python is EAFP (it's Easier to Ask for Forgiveness than Permission). Jeff Knupp explain it in one of his articles [1]. Here we describe multiples examples:
The default way could be with the use of d = dict()
or d = {}
, but it can be also accomplised with the use of dict comprehensions as we explain in other section:
If you want a copy of the dictionary's list, you can use dict.items()
and returns a list with (key, value) pairs.
But if you want to iterate over the dictionary is better to use an iterator:
In order to concatenate multiple copies of the same sequence, the most Pythonic approach is with the use of *
:
For concatenating 2 list, the best approach is to sum them up:
{{ "idioms_examples/seq-op/seq_op_sum.py"| pygment_file|safe }}[1] "Fluent Python" - Using + and * with sequences
Sometimes, for creating a new string is necessary to concatenate multiple strings
The best way is the use of .format() method. It has less disadvantages and is more powerful:
{{ "idioms_examples/str-op/str_op_ok_format.py"| pygment_file|safe }}When you have to concatenate multiple string from a finite sequence, the easiest way could be a for-loop, but there is one better
The use of join is simpliest, with better results and better performance [2]
{{ "idioms_examples/str-op/str_op_ok_join.py"| pygment_file|safe }}


--- layout: page title: About header-img: "img/about-bg.png" ---
Chelsea is a mom, knitter, British TV lover, Gryffindor whovian, and overall nerd.


Home
Rotation 2
3D Printing
This Rotation was dedicated to learning CAD (Computer Aided Design). Using Autodesk Fusion 360, I designed a wax seal to be 3D printed
I had difficulty using the software at first, but it got easier as I used it more. I am by no means an expert but tasks such as navigating,
designing, and placing things have gotten easier. Things such as placing a circle where I needed it became far easier as I worked with the
program
Pictured above are two pictures showing the design on the computer and the design being exported. However, when the print completed I realized
I forgot to make the stamp a mirror so it would stamp in a readable fashion. I then adjusted my design to fix this error.
Pictured below are images of the final product with an adjusted stamp face that will produce a satisfactory seal.


Particle Swarm Optimization (PSO) is a population-oriented stochastic search technique similar to genetic algorithms, evolutionary strategies, and other evolutionary computation algorithms. The technique discovers solutions for N-dimensional parameterized problems: basically it discovers the point in N-dimensional space which maximizes some quality function.
PSO works approximately as follows: a "swarm" of candidate solutions ("particles") are placed randomly throughout the space and with a random initial velocity. Each particle measures the quality of its present location in space. This velocity vector affects how each particle moves in the space, and it is changed each timestep according to a weighted sum of the following values:
The demo visualize the PSO running on the cost function Rastrigin.
The potential field is a Rastrigin function. Particle Swarm will restart randomly every 40 seconds :)