text:
User:Anandsuict

This page is Created by Anand Lanjewar for posting homework and In Class work, he is the same user: Anandsuic. This page is dedicated for subject i.e. Technology Exploitation.

AdSense
Google AdSense is an advertising software created by Google Corporation which allows website owners to inroll this program enabling text, image, and video ads on their websites. The Google controls these advertisements and make income on per click or/and per impression basic. Many websites use AdSense to monetize their content; it is the most popular advertising network.
 * AdSense has been particularly important for delivering advertising revenue to small websites that do not have the resources for developing advertising sales programs and sales people. To fill a website with advertisements that are relevant to the topics discussed, webmasters implement a brief script on the websites' pages. Websites that are content-rich have been very successful with this advertising program, as noted in a number of publisher case studies on the AdSense website.

There are three ways of generating revenue adopted by most of the webmasters : 1.	They use a wide range of traffic-generating techniques, including but not limited to online ads.

2.	They build valuable content on their websites that attracts AdSense advertisements, which pay out the most when they are clicked.

3.	They use text content on their websites that encourages visitors to click on advertisements. Note that Google prohibits webmasters from using phrases like "Click on my AdSense ads" to increase click rates. The phrases accepted are "Sponsored Links" and "Advertisements".

Google AdSense is a free program that allows online publishers to earn revenue by displaying relevant ads on a wide variety of online content, including:

Site search results:

Easily add a custom search engine to one’s site, and earn from ads on the search results pages.

Websites:

Display ads on one’s website that are suited to his audience's interests, and earn from valid clicks or impressions.

Mobile webpages and apps:

Connect individual’s mobile users with the right ad at the right time as they seek information on

Abuse & Criticism:

This has abused of being used by some webmasters who create websites tailored to lure searchers from Google and other engines onto their AdSense website to make money from clicks. Such websites often contain nothing but a large amount of interconnected, automated content including spam blogs, wikipedia. Some of the pages of the websites lead to dangerous virus center where visitor compute can get easily damaged by contained material on website.

AdWords
Google’s major revenue generator is the AdWords, AdWords offerspay per click (PPC) advertising, cost-per-thousand (CPM) advertising, and site-targeted advertising for text, banner, and rich-media ads. The AdWords program includes local, national, and international distribution. Google's text advertisements are short, consisting of one headline and two additional text lines. Customers who want to make advertisement select the words that should trigger their ads and the maximum amount they will pay per click. When a user searches on Google, ads (also known as creatives by Google) for relevant words are shown as "sponsored links" on the right side of the screen, and sometimes above the main search results. Clickthrough rates (CTR) for the ads are about 8% for the first ad, 5% for the second one, and 2.5% for the third one. Search results can return from 0 to 12 ads. The ordering of the paid-for listings depends on other advertisers' bids (PPC) and the "quality score" of all ads shown for a given search. The quality score is calculated by historical click-through rates, relevance of an advertiser's ad text and keywords, an advertiser's account history, and other relevance factors as determined by Google. The quality score is also used by Google to set the minimum bids for an advertiser's keywords. The minimum bid takes into consideration the quality of the landing page as well, which includes the relevancy and originality of content, navigability, and transparency into the nature of the business.

Features:

Control where one’s adertisement is showing: Google AdWords helps individual advertise to people who are already interested in what he offer. His ads can show at the exact moment when they are searching on Google for hia products or services.

For example, if people search for something related to his products or services on www.google.co.uk, they may see his ad alongside or above Google search results, depending on which words or phrases he associated with his ad. Sincehis ad is relevant to what they're seeking, these potential customers are more likely to click on it to visit his website, where they can learn more or make a purchase.

Budget and Costs control:

Google AdWords can be tailored to fit any budget.

Pay when somebody clicks on ad:

Google AdWords allows costmers to adapt their advertising to the evolving demands of their business. If they have a sale, they can easily make changes to their ads to include their new offer, which can go live immediately.

Know what's working, and what's not:

Google AdWords removes the guesswork about the effectiveness of customers advertising. It allows them to track the performance of their ads so they can easily see how well they are working.

Recommendation:

I would recommend Adsense to SUIC to promote their product effectively generating revenue by making ad of other products on SUIC website.

Anandsuict 04:19, 13 March 2011 (UTC)

1. Introduction:
A Nanowire Battery is new technology invented by Stanford University Team led by Dr. Yi Cui, Assistant Professor of Material Science and Engineering of Stanford University. In this technology silicon nanowires are used as the active lithium storage material for the battery electrode. Traditional graphite anode was replaced by a stainless steel anode covered in silicon nanowires. Silicon is an attractive anode material for lithium batteries because it has a low discharge potential and the highest known theoretical charge. This hi-performance lithium battery is rechargeable with higher energy capacity and longer cycle life for applications devices. This battery is the fastest in charging and discharging since ever.

Parameter of Batteries:
Let’s look at the basic fact of the batteries, how these characters which concerns a lot to make decision choosing batteries:

Energy storage:

Energy density is the total amount of energy stored in a given battery space per unit volume. It is used to measure capacity of storing the energy which would used to produce power or power density. It gives estimate that how long battery can run. For example in notebook message pop ups describing: low battery 30% (45 min, please charge your battery or change battery pack). It simply shows that how much battery is stored (left). When the battery is fully charged is shows fully charged: 4hrs. Now, here specification of battery allows storing maximum amount of energy per volume. When same energy storage is calculated by weight per unit becomes specific energy calculation. These terms usually interchange when we talk or discuss about battery or energy. The energy per unit volume is also a useful parameter fuels.

Specific energy: is defined as the energy per unit weight or mass. Common metric units are J/kg. This determines the size of the battery smaller the size, lower the energy. Ex. AAA battery.

Power density: Power density (or volume power density or volume specific power) is the amount of power (time rate of energy transfer) per unit volume (Wikipedia, 2010). It measure how rapid is the output of energy. For example, in electric vehicle, the capacity of going fast is the power density where as how far is energy density. In energy transformers like batteries, fuel cells, motors, etc. but also power supply units or similar, power density refers to a volume. It is then also called volume power density which is expressed as W/m3. Volume power density is sometimes an important consideration where space is constrained. In reciprocated internal combustion engines, power density- power per swept volume is an important metric.

Cycle life:

The cycle life of a battery is the number of recharging cycles the battery can go through before it reaches the point where it can be recharged only to a defined percentage of its original capacity. Cycle life for a lead-acid battery is between 250 and 500 cycles, depending on the quality of the manufacturer's products and the depth of discharge (down at most to 60% of rated capacity). NiCd, NiMH, and Li-ion batteries are usually good for 500–700 charge-discharge cycles (Medicalelectronicsdesign, 2006). Where as nonowire battry gives more than 3,000 charge-discharge cycles (Wikipedia, 2011). down only to 80% of their rated capacity. In all cases, regardless of the battery chemistry used, the deeper the depth of discharges, the fewer the number of cycles the user can expect from the battery. For example notebook battery allows to recharge 3,00 times. It means we can charge battery after every discharge for 300 times, that is the cycle life. It typically decides how long we can make use of the battery.

Calendar Life:
in spite of cycle life, calendar life is also important and differs from cycle life, it is the overall life of the battery regardless whether we use it or not. It is the maximum length battery use, after which it loses the purpose and becomes unusable. If the battery life or calendar life is 3 years, we can use it for three years. If we don’t use it still it gets damaged after the given period. Charge Discharge Method: C rate refers to ratio of period of charging and discharging. Examples: 1C, 2C. C2. Here 1C means an hour charging will last an hour. 2C shows that to use battery for an hour we need to charge for 2 hours and lastly C2 takes half an hour for same period of battery use (YouTube, 2010). Safety: it is big issue in handling power, storing and using. AAA size battery may not bring a lot damage at the time of explosion. If the explosion happens in vehicles where 700 to 800 cell are used, that will bring absolute disaster so the safety is in priority.

Nanowires Technology:
According to Dr. Yi Cui, “Silicon can store a lot of lithium but the volume expansion is too high, by using nanowires solves the problem of volume expansion and can achieve extremely high capacity, lithium storage capacity with multiple cycles. This is 10 times more than the current technology. So the implication of this discovery is very, very exciting, it means having a better battery” (G M Volt, 2007). Traditional silicon anodes were researched and dismissed due to the tendency of silicon to crack and become unusable because it swelled with lithium during operation. The nano-wires do not suffer from this flaw. According to Dr. Cui, the battery reached 10 time density on the first charge and platitude to 8times density on subsequent charges. In order to take advantage of this anode advancement, an equivalent cathode advancement is required to achieve the increased storage density. The team expects to reach 3,000 charge cycles by 2012. Reaching this goal would make nano-wire batteries viable for use in electric vehicles.

Important feature of Nanowire Battery:
First important thing is it has 3,000 charge-discharge periods or cycle life. It ses stainless steel as anode different than other technology users. Since it is measured in nano scale calculation the size of the battery is much smaller. Energy density power density is higher than traditional batteries and also much safer.

This Nanowires Batteries are applicable to consumer electronic devices like cellular phones, PDAs, video games, and notebooks. These all devices need strong batteries but small in size, the Nanowires batteries will be the best choice in coming days. Not only the small devices said above but also this battery can be used vehicles. It is well born in the human’s mind that the present energy sources are scare and it is needed to have an option to that. However this may serve several problems and expected to be delivered by the first quarter of 2011.

--Anand Lanjewar 03:30, 27 February 2011 (UTC):This secondary research made by user is a partial requirement of Technology Exploitation, subject included in SUIC MBA International Program.

Business Model
Manufacturer (direct)

SUIC NANOWIRE BATTERIES CO. LTD.

Introduction of the firm:

SUIC NANOWIRE BATTERIES CO. LTD. is battery manufacturer firm based in Bangkok, Thailand which produces batteries using nonowire technology invented by Dr. Yi Cue. We supply Nanowire batteries to firms producing medical devices such as Ventricular Assistance Device, that is used to partially or completely replace the function of a failing heart: “HeartWare” and HeartMate II. Heartware International Inc. is producer of “HeartWare” and HeartMate was invented and produced by Thoratec Corporation.

Project Plan

Nanowire battery manufacturing project has been taken by Anand Lanjewar and Maetini with partnership of fifty percent each. The project requires the budget of 90 million Thai Baht.

Purchasing License

Since our project is small in size and produces the limited units of battery Dr. Yi Cue is agree to let use his patent on payment some small amount. It cost one million US dollars in one time purchase cost, but however we also agreed to pay him 5% of net income constantly in the end of each financial year.

Manufacturing Plant

SUIC NANOWIRE BATTERIES CO. LTD. has purchased the 15 acres of land paying THB 550,000 per acre with total of 8.25 million Thai Baht in Nakhon Pathom Province 29 Kilometers from Head Office. 5.75 million Thai are spent on building a plant facilities including shelter, building and parking etc. Plant is equipped with manufacturing machines and other technical instruments which cost 15 million THB. One million is spent on five years lease of Head Office which also operational office. 30 million THB is a part of current asset, working capital.

Human Recourses

Firm will headed by Ms Maetini (CEO) total number of employees needed is 140. Including 17 managers and ten engineers,70 employees at inline production and other 41 staff at various posts including front office and secretary to CEO and Senior Manages.

Production

SUIC NANOWIRE BATTERIES CO. LTD. determined to start production by February 2013 manufacturing 2,000 units per day. The unit will be sold at US$10, supply to “HeartWare” and “HeartMate”. Both the firms have agreed to buy minimum of 350,000 units per year each. This will generate at least total revenue of 18,000,000 THB per month. 216,000,000 THB per year.

--Anandsuict 15:06, 18 March 2011 (UTC)

SugarCRM

SugarCRM is an open-source software-solution vendor which produces the Sugar Customer Relationship Management (CRM) system. Sugar allows us to monitor market trends and key customer accounts based on real time data. This has allowed us to refine our business strategy continuously to better meet our customers' needs.

SugarCRM is Open Soure Software to make Sale force automation, it is information systems that enhance comfort and convenience with a team of sales, such as record data of people in the audience, the conversion of prospects into customers or reminder for Contact customers or prospects, etc. In addition, sales data can be then sent to the Sales Market Research. To analyze sales data to be used for further marketing strategies.

Sugar CRM Open Source for a work function will be divided according to the roles of users as follows.
 * •	Sales Module is used to help and facilitate the sales work, such as the IMF's target, the notification of appointments with clients.
 * •	Support Module that make up a record of problems in the Product of customers and solution approach. And tracking corrective actions *with different Issues.
 * •	Marketing Module that allows the marketing department. Sales data for the various Campaigns and the problem of the Product, analyzing to determine the marketing strategy.

In addition, the Feature SugarCRM also help to create more Modules by the user and doed not need to know how to program it enabling us to create forms to collect information. In addition, SugarCRM is provided to assist in decision-making process.

Supply Chain Now™
JDA's Supply Chain Now™ is  a supply chain management package delivering  a return on investment with reduced risk in as fast as four months. JDA provides all information on its website http://www.jda.com. It is effective software bring results with four months of implementation of JDA's Supply Chain Now™.

JDA’s Supply Chain Now is helpful in many ways:

JDA Supply Chain Now increases the Growth and Efficiency of the firm: This package helps to make smart decisions in less time. It also improve the basic supply chain management Capabilities. It brings changes in organization by:

• Automatic forecasting and planning of inventory • Takes less time in data collection and analyzing. • Help in making decisions that are favored by supply chain planners • Capable supply chain issue’s notification in advance  allows to eliminate unnecessary expediting expenses. • Easily make changes in supply chain according to business conditions.

JDA Supply Chain Now Promises Financial Success with Low-Risk Delivery:

1) the expected return on investment;

2) the business processes, resources and skills required to be successful; and

3) the time-to-benefit.

Supply Chain Now helps  meeting customer expectations, lowering operational costs and maintaining proper inventory levels by improved demand-supply alignment.

• Better knowledge of customer demand patterns • Enhancing inventory positioning in locations and time demand • Synchronized inventory, distribution and production or purchasing decisions Like many other manufacturers, Oxford Industries needed to streamline its global supply chain planning processes. The company, which operates private-label and licensed-apparel Low Risk, Speed-to-Value Supply Chain Optimization businesses.

Anandsuict8:12, 13 March 2011 (UTC)

title: User:Anandsuict


text:
Ultra wideband

Antenna is a transformer that transforms electrical signals into electromagnetic waves or vice versa

Electrical signals -->  voltages and currents from a transmission line Electromagnetic -->    electric and magnetic ﬁelds

ULTRA WIDEBAND Bandwidth more than 20% of carrier frequency or more than 0.5 GHz.

Very short duration pulses less than a few nsec transmitted – typically less than 1 nsec

CHARACTERISTICS FOR UWB COMM.

High data rate achieved higher than 110 Mbps

High processing gain: the ratio of the RF bandwidth of the signal to the information bandwidth of the signal

Higher bandwidth 7500 MHZ.

Low-cost digital signal processing hardware is often used in modern digital radios to generate several modulation methods.

A UWB radio can use several pulses to send one information bit thereby increasing SNR in the receiver

Under software control, the UWB system can dynamically trade date rate, power consumption, and range.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Ultra wideband


text:
User:Egm6341.s11.team2/hwk4

=Problem 4.1 Verifying the Accuracy of the Simple Simpson‘s Rule For a Cubic Polynomial=

''' This problem was solved without referring to S10 homework. '''

From the lecture slide Mtg18-2

Given: The Integrand in the Form of a Simple Third Degree Polynomial
The integrand is

Show: That the Simple Simpsons's Rule Integrates Exactly
Verify that Simple Simpson ‘ Rule can integrate cubic polynomials exactly by numerically integrating the given function using Simple Simpson ‘ s Rule and compare the result with the same result.

Solution: By Exact and Numeric Integration
The exact value of integration $$\displaystyle I$$ is,

The numerical result by simple Simpson ‘ s rule is,

Hence,

In this case we have verified Simple Simpson ‘ s rule can integrate cubic polynomial exactly.

=Problem 4.2 "One Step in the Proof of the Simple Simpson's Error Theorem"=

''' This problem was solved without referring to S10 homework. '''

Given: The Error Resulting from Numeric Integration
In order to prove Simple Simpson's Error Theorem, we define

Find: The First Derivative of the Error
Find the first derivative of the first term of (4.2.1) since it is needed to compute the first derivative of (4.2.2).

Solution: Differentiation
Suppose there is a constant $$ k \in \left] { - t,t} \right[ $$ and then the first term can be written as

Then we can find out the first derivative of (4.2.3) is

Therefore the first derivative of the first term of (4.2.1) is

=Problem 4.3 Verification of the Goal Function at Particular Point=

''' This problem was solved without referring to S10 homework. '''

From the lecture slide Mtg20-3

Given: The Goal Function
The Goal function in proof of error of SSET is,

where,

Solution: By Taking Derivatives and Using Definitions
In the lecture slide 19 we have already got,

where

Then we have,

Hence,

=Problem 4.4 "Another Step in The Proof of the Simple Simpson's Error Theorem"=

''' This problem was solved without referring to S10 homework. '''

Given: The Error Associated with the Simple Simpson's Rule
In order to prove Simple Simpson's Error Theorem, we define

Find: The Third Derivative of the Error
The third derivative of (4.4.1)

Solution: By Differentiation
From Problem 4.2, we have the first derivative of (4.4.1):

Then we can compute the second derivative of (4.4.1) use the above equation (4.4.2)

At last we can get the third derivative of (4.4.1) use the above equation (4.4.3)

=Problem 4.5: Show Relationship in the Simple Simpson's Error Theorem=

''' This problem was solved without referring to S10 homework. '''

From the lecture slide Mtg 21-1

Find: The Relation Between $$ \xi\ \ $$ and $$ \zeta_4\ \ $$
Try to establish a relation between $$ \xi\ \ $$ and $$ \zeta_4\ \ $$.

Solution: By Transformation of Variables
Let

Transforming coordinates $$\displaystyle \left( t=\zeta_4, x=\xi\right) $$ gives:

With Eqn 5.1-7, the proof is as follows:

The fourth derivative of $$\displaystyle F \left(\zeta_4\right) $$ is

Substituting $$\displaystyle \frac{dx}{h} $$ for $$\displaystyle  dt $$ and $$\displaystyle  f\left(\xi\right) $$ for $$\displaystyle  F\left(\zeta_4\right) $$ in Eqn 5.8 gives:

Substitute Eqn 5.11 into Eqn 5.1 gives:

By transforming $$\displaystyle t=\zeta_4 $$ and $$\displaystyle x=\xi $$, Eqn 5.4 becomes

=Problem 4.6: Numerical Integration Using Non-Uniform Discretization =

Lecture 21-1

The Matlab code for this problem was written with assistance of problem 3 in Egm6341.s10.team3.sa/HW2

Given: A Known Function
$$ f(x) = \frac{1} $$ and $$ x \in [ - 1,1] $$

A) Find and Plot The Roots of the Legendre Polynomial
Use the roots of the Legendre polynomial, $$ \displaystyle{p_n}({x_i}) = 0 $$ and increase n until $${E_n} = I - {I_n} \leqslant {10^{ - 6}}$$. Plot $$ \displaystyle f_n^l(x)$$ and $$ \displaystyle f(x)$$.

B) Find and Plot The Roots of the Chebyshev Polynomial
Use the roots of the Chebyshev polynomial and increase n until $${E_n} = I - {I_n} \leqslant {10^{ - 6}}$$. Plot $$ \displaystyle f_n^l(x)$$ and $$ \displaystyle f(x)$$.

C) Find and Plot The Gauss-Legendre Quadrature
Use Gauss-Legendre quadrature and increase n until $${E_n} = I - {I_n} \leqslant {10^{ - 6}}$$

A) Using the roots of the Legendre polynomial as the nodes
Figures 6-1 and 6-2 show the results of using the roots of the Legendre polynomial as the nodes. The error is less than the acceptable lever for n=16. The Matlab code is shown below the figures. More details are described in the Matlab code.

 * HW4 P6 A.png

 * HW4 P6 A error.png

B) Using the roots of the Chebyshev polynomial as the nodes
Figures 6-3 and 6-4 show the results of using the roots of the Chevyshev polynomial as the nodes. The error is less than the acceptable lever for n=16. The Matlab code is shown below the figures. More details are described in the Matlab code.

 * HW4 P6 B.png

 * HW4 P6 B error.png

C) Using Gauss-Legendre quadrature
Figures 6-5 shows the results of using the Gauss-Legendre quadrature. The error is less than the acceptable lever for n=17. The Matlab code is shown below the figures. More details are described in the Matlab code.

 * HW4 P6 C error.png

D) Comparison
Based on the results of the previous subsections, the associated error with all the three methods reaches the acceptable level at the same n. The Gauss-Legendre Polynomial takes n=17 iterations to drop below the acceptable level for this function. Overall the Legendre Polynomial does only slightly better than the other two.

=Problem 4.7: Determining the Upper Bound of the Error in the Composite Simpson's Rule =

''' This problem was solved without referring to S10 homework. '''

Given: The Error as the Difference between Actual and Numeric
The error $$ \displaystyle E_n $$ in the Composite Simpson's rule

 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= I-I_n \\ &= \int\limits_{a}^{b} f(x)dx - \dfrac{h}{3}[f(x_0)+4f(x_1)+2f(x_2)+...+2f(x_{n-2})+4f(x_{n-1})+f(x_n)]\\ \end{align}$$ (7.0)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Show: The Error for the the Composite Simpson's Rule is Bounded Above
That the error for the Composite Simpson's Rule is given by,
 * {| style="width:100%" border="0"

$$ \displaystyle \left| {E}_{n}^{2} \right| \leq \frac{(b-a)^{5}}{2880 n^{4}} M_{4} = \frac{(b-a)h^{4}}{2880} M_{4} \quad where \quad M_{4} := max \left| f^{4}(\xi) \right| \quad s.t. \quad \xi \in [a,b] $$     (7.1)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Solution: Relating the Error in the Simple Simpson's Rule to the Partitioning of Intervals in the Composite Simpson's Rule
Consider the error $$ \displaystyle E_n $$ which is defined as the difference between the actual value of the integral, $$ \displaystyle I $$ and the value obtained from numerically integrating using the Composite Simpson's Rule, $$ \displaystyle I_n $$ where $$ \displaystyle n \geq 2 $$ is an even integer,

 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= I-I_n \\ &= \int\limits_{a}^{b} f(x)dx - \dfrac{h}{3}[f(x_0)+4f(x_1)+2f(x_2)+...+2f(x_{n-2})+4f(x_{n-1})+f(x_n)]\\ \end{align}$$ (7.2) Observe that the following pattern arises from the terms $$ \displaystyle I_n $$ in (7.2)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

 * {| style="width:100%" border="0"

$$ \begin{align}\displaystyle & f(x_0)+4f(x_1)+{\color{red}2f(x_2)}+...+{\color{green}2f(x_{n-2})}+4f(x_{n-1})+f(x_n) = \\ & \left[ f(x_0)+4f(x_1) + {\color{red}f(x_2)} \right] + \left[ {\color{red} f(x_2)}+4f(x_3) + f(x_4) \right] + \cdots \\ & \left[ f(x_{n-4})+4f(x_{n-3}) + {\color{green}f(x_{n-2})} \right] + \left[ {\color{green}f(x_{n-2})}+4f(x_{n-1}) + f(x_{n}) \right] \end{align} $$ The above relation allows us to write the terms inside of the summation as what is shown in (7.3). We must also take precautions to ensure that the partitioning of not only the summation, but also the partitioning of the integral contain the same subintervals namely, $$ \displaystyle [x_{2i-2},x_{2i}] $$. Both are accounted for defining $$ \displaystyle h:=\frac{b-a}{n} $$ and letting $$ \displaystyle x_i = a + ih $$ where $$ \displaystyle i = 0,1,2,...,n $$.
 * style="width:98%" |
 * style="width:98%" |
 *
 * }
 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= \sum_{i=1}^{n/2}\left[ \int\limits_{x_{2i-2}}^{x_{2i}} f(x)dx \right] - \dfrac{h}{3}\sum_{i=1}^{n/2} \left[ f(x_{2i-2})+4f(x_{2i-1})+f(x_{2i}) \right]\\ &= \sum_{i=1}^{n/2} \left[ \int\limits_{x_{2i-2}}^{x_{2i}} f(x)dx-\dfrac{h}{3}[f(x_{2i-2})+4f(x_{2i-1})+f(x_{2i})]\right]\\ where \quad h&=\frac{b-a}{n} = \frac{x_i - x_{i-1}}{n} \end{align}$$ (7.3)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

We know that for the Simple Simson's Rule the error associated with the Lagrange Interpolation in, $$ \displaystyle E_2 $$ is,
 * {| style="width:100%" border="0"

$$ \displaystyle {E_2} = \frac{x_{i+1}-x_{i-1}}{2}f^{(4)}(\xi) \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}] $$     (7.4)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Which implies for the Composite Simpson's Rule
 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} \left| {E_n} \right| &\leq  \sum_{i=1}^{n/2} max \left| \frac{(x_{i+1}-x_{i-1})^5}{90\cdot 2^5}f^{(4)}(\xi) \right| \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}]\\ &= \frac{(x_{i+1}-x_{i-1})^5}{90} \cdot \sum_{i=1}^{n/2} {\color{red}\underbrace{max \left| f^{(4)}(\xi)\right|}_{M_4}} \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}] \end{align} $$ (7.5)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Where $$ M_{4} $$ is defined on $$ \displaystyle [a,b] $$ as
 * {| style="width:100%" border="0"

$$ \displaystyle M_{4} := max \left| f^{(4)}(\xi)\right| \quad s.t. \quad \xi \in [a,b] $$     (7.6) Next we will consider $$ \displaystyle \bar{M}_{4} \leq n \cdot M_{4} $$ allowing us to write $$ \displaystyle E_n $$ as,
 * style="width:98%" |
 * style="width:98%" |
 *
 * }
 * {| style="width:100%" border="0"

$$ \begin{align} \displaystyle \left| {E_n} \right| & \leq \left| \frac{(b-a)^{5}}{2880n^{5}}nM_{4} \right| \\ &= \left| \left(\frac{(b-a)}{2880}\right) {\color{red} \left( \frac{(b-a)^4} {n^4}\right)} M_{4}\right| \\ &= \left| \frac{(b-a){\color{red}h^{4}}}{2880}M_{4} \right| \end{align} $$ (7.7)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Therefore showing that the error associated with the Composite Simpson's Rule is

=Problem 4.8 Comparison of error bound in different estimation method with numerical result=

''' This problem was solved without referring to S10 homework. '''

From the lecture slide Mtg22-2

Background
The maximum error of composite trapezoidal rule is ,

where $$\displaystyle {{M}_{2}}$$ is the maximum of $$\displaystyle \left| {{f}^{(2)}}(.) \right|$$

The maximum error of composite Simpson ‘ s rule is ,

where $$\displaystyle {{M}_{4}}$$ is the maximum of $$\displaystyle \left| {{f}^{(4)}}(.) \right|$$

Given
In the Problem 2.4, we have numerically calculate the order $$\displaystyle n$$ such that the following integration, with Taylor series expansion, composite trapezoidal rule and composite Simpson ‘ s rule, is with error less than $$\displaystyle Q={{10}^{-6}}$$.

where $$\displaystyle [a,b]=[-1,1]$$

And in Problem 2.3 we have the remainder of Taylor expansion of $$\displaystyle f(x)=\frac{{{e}^{x}}-1}{x}$$ is,

where $$\displaystyle \xi \in [0,x]$$

Find
(1)Use different error bound of Taylor series, composite trapezoidal rule and composite Simpson ‘ s rule to calculate the smallest order n needed such that the error of numerical integration of that in Problem 2.4 is less than $$\displaystyle Q={{10}^{-6}}$$. And then compare them with the actual numerical calculation.

(2)Numerically find the power of h in error by plotting the logarithm of error versus the logarithm of h. The slope of the linear regression fit line is equal to the power of h.

Taylor series comparison
Using the same method in Mtg7 we can find the error bound of Taylor series,

Since we have set n to be even,

The error should be within $$\displaystyle Q$$

By WolframAlpha we have,

which coincide with the result in Problem 2.4.

Composite trapezoidal rule comparison
By 4.8.1 we have,

where $$\displaystyle {{M}_{2}}$$ can be calculated by WolframAlpha ,

Then we have,

Calculated by WolframAlpha we have,

While in Problem 2.4 we have $$\displaystyle n=512$$, the order produced by the error bound is larger than the numerical result.

Composite Simpson's rule comparison
By 8.2 we have,

where $$\displaystyle {{M}_{4}}$$ can be calculated by WolframAlpha ,

Then we have,

Calculated by WolframAlpha we have,

In Problem 2.4 we calculated the case $$\displaystyle n=8$$ and $$\displaystyle n=16$$, the former case failed to satisfy the condition that $$\displaystyle \left| {{E}_{n}} \right|\le Q={{10}^{-6}}$$ while the latter succeed. This is a verification of the result above.

Conclusion
From the case of Taylor series and composite trapezoidal rule we can see the order of estimation given by the error bound is larger than or equal to that given by numerical calculation. This can be explained as: the error bound is stricter because it denotes the maximal error hence it is reasonably larger than or equal to the real error and thus requires higher order.

While in case of composite Simpson ‘ s rule we didn ‘ t calculate the case $$\displaystyle n=9$$, but the case $$\displaystyle n=8$$ and $$\displaystyle n=16$$ have demonstrate that if the error bound is satisfied with error limit then the numerical result must be satisfied.

Solution to part (2)
Figure 4.8-1 shows a plot of the logarithm of the Taylor series approximation for values of n = 2,4,8,16. This data was then fitted with a least square linear regression. The slope of this line is 16, however, this value increases as n is increased (and h is consequently decreased). Thus, the power of h is not a constant and the error using Taylor series shrinks at a faster rate than composite trapezoidal or Simpson's rule.

 * Egm6341.s11.team2.hw4_8_1.jpg

Figure 4.8-2 shows the logarithm of the composite trapezoidal rule error for varying values of log(h). The linear regression line has a slope of 2, Thus h appears as a quadratic term in finding the error.

 * Egm6341.s11.team2.hw4_8_2.jpg

Figure 4.8-3 shows the logarithm of the composite Simpson's rule error for varying values of log(h). The linear regression line has a slope of 4. Consequently, h appears as a 4th-order term in finding the integration error using the composite Simpson's rule.

 * Egm6341.s11.team2.hw4_8_3.jpg

=Problem 4.9: Determining the Conditions For Which an Upper Bound of the Error in the Simple Simpson's Rule Exists=

''' This problem was solved without referring to S10 homework. '''

Given: The Error in the Simple Simpson's Rule, the IMVT and Rolle's Theorem
It was previously show in | Problem 3.8 that the error in the Simple Simpson's Rule is given by

Introduced in | Lecture 16-1 was the Derivative Mean Value Theorem(DMVT). It is shown below and is required for this proof.

Derivative Mean Value Theorem:

Given a continuously differentiable function $$\displaystyle f(x) \ s.t. \ f: \mathbb{R} \rightarrow \mathbb{R} $$, then there exists at least one point $$\displaystyle \xi \in [a,b] $$ such that

Another important theorem introduced in | Lecture 16-1 is Rolle's Theorem.

Rolle's Theorem:

If $$\displaystyle f(a)=f(b)=constant$$, then there exists at least one $$\displaystyle \xi [a,b] $$ such that $$\displaystyle f'(\xi)=0 $$.

Part A: For the case with $$ t^4 $$
That the following holds for the case when $$\displaystyle t^4 $$

Part B: For the Case With $$ t^6 $$
That the following holds for the case when $$\displaystyle t^6 $$

Show: What Happens For the Case With $$ t^5 $$
Find $$ \displaystyle G^{(3)}(0) $$ and follow same steps in the proof to see what happens.

Solution: For $$t^4 $$ and $$ t^6 $$
For the purpose of this proof let us define

Next let $$ \displaystyle e(t) $$ shown in (9.6) be defined as

Part A: For the case with $$ t^4 $$
Let us first differentiate $$ \displaystyle G(t) $$ defined in (9.4) three times.

Using (9.7) we know that,

We must next apply Rolle's Theorem three times to see that

Substituting (9.11) and (9.12) into (9.10)

Applying the DMVT shown in (9.2) to the third derivative of F

Substituting the LHS of (9.14) into (9.13) gives

We also know that the error associated with the Simple Simpson's Rule, $$ E_2 $$ is

From (9.15) and (9.16) we get

The relationship between $$ \displaystyle \xi $$ and $$ \displaystyle \zeta_4 $$ was established in Problem 4.5.

Substituting (9.18) into (9.17) gives

Comment: Regarding the Result Obtained
This result is interesting because it contains a $$\displaystyle \zeta_{3} $$ term which one would not expect. This is a direct consequence of $$\displaystyle \zeta_{3} $$ having order one and order two in the resulting equation of (9.15). As a result we do not the anticipated cancellation of $$\displaystyle \zeta_{3} $$ as is seen for the $$ \displaystyle t^5 $$ case.

Part B: For the Case With $$ t^6 $$
For this part we will consider the case with $$ \displaystyle t^6 $$ shown below,

Let us first differentiate $$ \displaystyle G(t) $$ defined in (9.5) three times.

Applying Rolle's Theorem, the DMVT and making the same substitutions as what was done in (9.11) to (9.14) gives

Using the error associated with the Simple Simpson's Rule given in (9.16) results in

The relationship between $$ \displaystyle \xi $$ and $$ \displaystyle \zeta_4 $$ was established in Problem 4.5.

Substituting (9.18) into (9.24) gives

Comment: Regarding the Result Obtained
This result is interesting because it contains a $$\displaystyle \zeta_{3} $$ term which one would not expect. This is a direct consequence of $$\displaystyle \zeta_{3} $$ having order one and order two in the resulting equation of (9.23). As a result we do not the anticipated cancellation of $$\displaystyle \zeta_{3} $$ as is seen for the $$ \displaystyle t^5 $$ case.

Solution: For $$ t^5 $$
It follow from (9.11) that the three derivatives of interest are

Now lets focus our attention to what happens when $$\displaystyle G^{(3)}(t = 0)$$ in (9.28)

This means that the only way $$ \displaystyle G^{(3)}(t=0)=0 $$ is if $$ \displaystyle t=\zeta_3 $$ which a consequence of Rolle's Theorem (9.3).

Differentiating (9.28) one more time to obtain $$ \displaystyle G^{(4)} $$ is

Letting $$ \displaystyle t=\zeta_4 $$ results in

Next we will solve for $$\displaystyle e(1)$$ to get

Using the previously established relationship between $$\displaystyle \xi$$ and $$\displaystyle \zeta_4$$ gives

Where

Comment: Regarding the Result Obtained
In summary this means that as long as we have $$\displaystyle f(x) \in \mathcal{P}_{3}$$ we get that $$\displaystyle f^{(4)}(x) = 0 $$.

And therefore the Simple Simpson's rule is exact for polynomials of degree less than 3,   $$\displaystyle \quad i.e \quad e(1) = 0 \Rightarrow E_{2} = 0 $$.

=Problem 4.10: Comparisons Between Composite Trapezoidal and Composite Simpson's Rules=

''' This problem was solved without referring to S10 homework. '''

From the lecture slide Mtg 22-3

Find: The Numerical Integration Using the Composite Trapezoid and Composite Simpson's Rule
a) Produce a table similar to table 5.1, page 255, Atkinson text book using the composite Trapezoidal rule (Atkinson is cos(x) instead of sin(x)).

b) Produce a table similar to table 5.3, page 258, Atkinson text book using the composite Simpson's rule (Atkinson is cos(x) instead of sin(x)).

Part (a): Composite Trapezoid Rule For Computing Numerical Integrals
The given integral is: $$I=\int_{0}^{\pi} e^{x} \sin \left ( x \right )\cdot dx$$ where $$f\left ( x \right )=e^{x} \sin \left ( x \right )$$ is the integrand and $$\;x\in \left [ 0,\pi \right ]$$. We will use the composite trapezoidal rule to obtain the following tabulated results:

Part (b): Composite Simpson's Rule for Computing Numerical Integrals
The given integral is: $$I=\int_{0}^{\pi} e^{x} \sin \left ( x \right )\cdot dx$$ where $$f\left ( x \right )=e^{x} \sin \left ( x \right )$$ is the integrand and $$\;x\in \left [ 0,\pi \right ]$$. We will use composite simpson's rule to generate the following tabulated results:

Concluding Remarks: Composite Trapezoid Versus Composite Simpson's
=References=

=Contributing Members & Referenced Lecture=

title: User:Egm6341.s11.team2/hwk4


text:
User:Egm6341.s11.team2.cleveland/HW4

=Problem 4.7: Determining the Upper Bound of the Error in the Composite Simpson's Rule =

Given: The Error by the Difference between Actual and Numeric
The error $$ \displaystyle E_n $$ in the Composite Simpson's rule

 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= I-I_n \\ &= \int\limits_{a}^{b} f(x)dx - \dfrac{h}{3}[f(x_0)+4f(x_1)+2f(x_2)+...+2f(x_{n-2})+4f(x_{n-1})+f(x_n)]\\ \end{align}$$ (7.0)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Show: The Error for the the Composite Simpson's Rule is Bounded Above
That the error for the Composite Simpson's Rule is given by,
 * {| style="width:100%" border="0"

$$ \displaystyle \left| {E}_{n}^{2} \right| \leq \frac{(b-a)^{5}}{2880 n^{4}} M_{4} = \frac{(b-a)h^{4}}{2880} M_{4} \quad where \quad M_{4} := max \left| f^{4}(\xi) \right| \quad s.t. \quad \xi \in [a,b] $$     (7.1)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Solution: Relating the Error in the Simple Simpson's Rule to the Partitioning of Intervals in the Composite Simpson's Rule
Consider the error $$ \displaystyle E_n $$ which is defined as the difference between the actual value of the integral, $$ \displaystyle I $$ and the value obtained from numerically integrating using the Composite Simpson's Rule, $$ \displaystyle I_n $$ where $$ \displaystyle n \geq 2 $$ is an even integer,

 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= I-I_n \\ &= \int\limits_{a}^{b} f(x)dx - \dfrac{h}{3}[f(x_0)+4f(x_1)+2f(x_2)+...+2f(x_{n-2})+4f(x_{n-1})+f(x_n)]\\ \end{align}$$ (7.2) Observe that the following pattern arises from the terms $$ \displaystyle I_n $$ in (7.2)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

 * {| style="width:100%" border="0"

$$ \begin{align}\displaystyle & f(x_0)+4f(x_1)+{\color{red}2f(x_2)}+...+{\color{green}2f(x_{n-2})}+4f(x_{n-1})+f(x_n) = \\ & \left[ f(x_0)+4f(x_1) + {\color{red}f(x_2)} \right] + \left[ {\color{red} f(x_2)}+4f(x_3) + f(x_4) \right] + \cdots \\ & \left[ f(x_{n-4})+4f(x_{n-3}) + {\color{green}f(x_{n-2})} \right] + \left[ {\color{green}f(x_{n-2})}+4f(x_{n-1}) + f(x_{n}) \right] \end{align} $$ The above relation allows us to write the terms inside of the summation as what is shown in (7.3). We must also take precautions to ensure that the partitioning of not only the summation, but also the partitioning of the integral contain the same subintervals namely, $$ \displaystyle [x_{2i-2},x_{2i}] $$. Both are accounted for defining $$ \displaystyle h:=\frac{b-a}{n} $$ and letting $$ \displaystyle x_i = a + ih $$ where $$ \displaystyle i = 0,1,2,...,n $$.
 * style="width:98%" |
 * style="width:98%" |
 *
 * }
 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} {E_n} &= \sum_{i=1}^{n/2}\left[ \int\limits_{x_{2i-2}}^{x_{2i}} f(x)dx \right] - \dfrac{h}{3}\sum_{i=1}^{n/2} \left[ f(x_{2i-2})+4f(x_{2i-1})+f(x_{2i}) \right]\\ &= \sum_{i=1}^{n/2} \left[ \int\limits_{x_{2i-2}}^{x_{2i}} f(x)dx-\dfrac{h}{3}[f(x_{2i-2})+4f(x_{2i-1})+f(x_{2i})]\right]\\ where \quad h&=\frac{b-a}{n} = \frac{x_i - x_{i-1}}{n} \end{align}$$ (7.3)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

We know that for the Simple Simson's Rule the error associated with the Lagrange Interpolation in, $$ \displaystyle E_2 $$ is,
 * {| style="width:100%" border="0"

$$ \displaystyle {E_2} = \frac{x_{i+1}-x_{i-1}}{2}f^{(4)}(\xi) \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}] $$     (7.4)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Which implies for the Composite Simpson's Rule
 * {| style="width:100%" border="0"

$$ \displaystyle \begin{align} \left| {E_n} \right| &\leq  \sum_{i=1}^{n/2} max \left| \frac{(x_{i+1}-x_{i-1})^5}{90\cdot 2^5}f^{(4)}(\xi) \right| \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}]\\ &= \frac{(x_{i+1}-x_{i-1})^5}{90} \cdot \sum_{i=1}^{n/2} {\color{red}\underbrace{max \left| f^{(4)}(\xi)\right|}_{M_4}} \quad s.t. \quad \xi \in [x_{i-1},x_{i+1}] \end{align} $$ (7.5)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Where $$ M_{4} $$ is defined on $$ \displaystyle [a,b] $$ as
 * {| style="width:100%" border="0"

$$ \displaystyle M_{4} := max \left| f^{(4)}(\xi)\right| \quad s.t. \quad \xi \in [a,b] $$
 * style="width:98%" |
 * style="width:98%" |

(7.6) Next we will consider $$ \displaystyle \bar{M}_{4} \leq n \cdot M_{4} $$ allowing us to write $$ \displaystyle E_n $$ as,
 *
 * }
 * {| style="width:100%" border="0"

$$ \begin{align} \displaystyle \left| {E_n} \right| & \leq \left| \frac{(b-a)^{5}}{2880n^{5}}nM_{4} \right| \\ &= \left| \left(\frac{(b-a)}{2880}\right) {\color{red} \left( \frac{(b-a)^4} {n^4}\right)} M_{4}\right| \\ &= \left| \frac{(b-a){\color{red}h^{4}}}{2880}M_{4} \right| \end{align} $$ (7.7)
 * style="width:98%" |
 * style="width:98%" |
 *
 * }

Therefore showing that the error associated with the Composite Simpson's Rule is

=Problem 4.9: Determining the Conditions For Which Upper Bound of the Error in the Simple Simpson's Rule Exists=

Given: The Error in the Simple Simpson's Rule, the IMVT and Rolle's Theorem
It was previously show in | Problem 3.8 that the error in the Simple Simpson's Rule is given by

Introduced in | Lecture 16-1 was the Derivative Mean Value Theorem(DMVT). It is shown below and is required for this proof.

Derivative Mean Value Theorem:

Given a continuously differentiable function $$\displaystyle f(x) \ s.t. \ f: \mathbb{R} \rightarrow \mathbb{R} $$, then there exists at least one point $$\displaystyle \xi \in [a,b] $$ such that

Another important theorem introduced in | Lecture 16-1 is Rolle's Theorem.

Rolle's Theorem:

If $$\displaystyle f(a)=f(b)=constant$$, then there exists at least one $$\displaystyle \xi [a,b] $$ such that $$\displaystyle f'(\xi)=0 $$.

Part A: For the case with $$ t^4 $$
That the following holds for the case when $$\displaystyle t^4 $$

Part B: For the Case With $$ t^6 $$
That the following holds for the case when $$\displaystyle t^6 $$

Show: What Happens For the Case With $$ t^5 $$
Find $$ \displaystyle G^{(3)}(0) $$ and follow same steps in the proof to see what happens.

Solution: For $$t^4 $$ and $$ t^6 $$
For the purpose of this proof let us define

Next let $$ \displaystyle e(t) $$ shown in (9.6) be defined as

Part A: For the case with $$ t^4 $$
Let us first differentiate $$ \displaystyle G(t) $$ defined in (9.4) three times.

Using (9.7) we know that,

We must next apply Rolle's Theorem three times to see that

Substituting (9.11) and (9.12) into (9.10)

Applying the DMVT shown in (9.2) to the third derivative of F

Substituting the LHS of (9.14) into (9.13) gives

We also know that the error associated with the Simple Simpson's Rule, $$ E_2 $$ is

From (9.15) and (9.16) we get

The relationship between $$ \displaystyle \xi $$ and $$ \displaystyle \zeta_4 $$ was established in Problem 4.5.

Substituting (9.18) into (9.17) gives

This result is interesting because it contains a $$\displaystyle \zeta_{3} $$ term which one would not expect. This is a direct consequence of $$\displaystyle \zeta_{3} $$ having order one and order two in the resulting equation of (9.15). As a result we do not the anticipated cancellation.

Part B: For the Case With $$ t^6 $$
For this part we will consider the case with $$ \displaystyle t^6 $$ shown below,

Let us first differentiate $$ \displaystyle G(t) $$ defined in (9.5) three times.

Applying Rolle's Theorem, the DMVT and making the same substitutions as what was done in (9.11) to (9.14) gives

Using the error associated with the Simple Simpson's Rule given in (9.16) results in

The relationship between $$ \displaystyle \xi $$ and $$ \displaystyle \zeta_4 $$ was established in Problem 4.5.

Substituting (9.18) into (9.24) gives

Solution: For $$ t^5 $$
It follow from (9.11) that the three derivatives of interest are

Now lets focus our attention to what happens when $$\displaystyle G^{(3)}(t = 0)$$ in (9.28)

This means that the only way $$ \displaystyle G^{(3)}(t=0)=0 $$ is if $$ \displaystyle t=\zeta_3 $$ which a consequence of Rolle's Theorem (9.3).

Differentiating (9.28) one more time to obtain $$ \displaystyle G^{(4)} $$ is

Letting $$ \displaystyle t=\zeta_4 $$ results in

Next we will solve for $$\displaystyle e(1)$$ to get

Using the previously established relationship between $$\displaystyle \xi$$ and $$\displaystyle \zeta_4$$ gives

Where

In summary this means that as long as we have $$\displaystyle f(x) \in \mathcal{P}_{3}$$ we get that $$\displaystyle f^{(4)}(x) = 0 $$.

And therefore the Simple Simpson's rule is exact for polynomials of degree less than 3,   $$\displaystyle \quad i.e \quad e(1) = 0 \Rightarrow E_{2} = 0 $$.

title: User:Egm6341.s11.team2.cleveland/HW4


text:
Talk:Psycholinguistics/Discourse

Good start! Your content seems pretty good, so I have focused my suggestions mostly on some mechanical aspects that could be improved. First of all, more description is needed in some places. More detailed description of what a speech act is would be helpful. Also, you mention the “network view” without explaining what it is. Check that all terms are explained and described, and assume your reader has no expertise on this topic.

There are some stylistic problems I noticed: several sentences end in the middle, e.g. “We have just discussed how our ability to make inferences comes from our own general knowledge and from.” Closer grammar editing is needed. “Inferences facilitates this by filling in gaps a of missing information and by connection individual events with others in the text,” is one of several quite awkward sentences. It’s vaguely clear what you mean, but difficult to read. Please also edit for spelling: you use “delayed” for “decayed” at one point, as well as a few other small spelling errors. It is difficult at times to differentiate your example sentences from your own writing—enclosing examples in quotation marks or putting them in italics would make your chapter read more smoothly. I inserted some quotation marks in one of the earlier paragraphs to show you what I mean. N.B. “Neil” and “Louis” are not phonologically similar, but “Armstrong” and “Armstrong” are—rephrase this sentence to make it clear you mean their full names, not just their first names!

References also need adjusting. You cite the textbook several times—I think Dr. Newman advised us not to do that but instead to find the sources Jay himself cites and use them. Several facts have been taken from the textbook and not attributed to their authors. For example, the discussion of slowed reading times with anaphors: Jay credits Garrod & Sanford, 1990 and they are not in your list of references or mentioned in the paragraph. Much of your chapter needs to be cited. If most of what you’re writing is well-known enough to be considered common knowledge and not cited, you should look for more detailed sources and include more specific information from influential sources.

The structure is often confusing and I think this is the most pressing problem in the chapter. Most importantly, you need to provide an introduction explaining what discourse is—assume your reader has never heard the word before and has no prior knowledge of anything you will talk about. You can outline the subtopics you will discuss in the intro paragraph, and possibly discuss any differing opinions or points of view on the topic (although you could also do this in a separate section, depending how much you want to discuss), for example the product vs. process debate. You also need a conclusion, where you can summarize the important points. You have a section on macrostructure, but not one on microstructure. You should probably mention this distinction right off the bat (in the intro) rather than revealing half way through that everything in the previous sections was about microstructure.

You need to work on your transitions. Do not simply give the introductory sentence to the next section at the end of the previous section! Bring the previous section to the point where you have said all you can say without introducing the next topic, then begin the next section. You may have to change the order of your sections to make it flow more logically. Several places you had whole paragraphs in the wrong section (like the end of the anaphora section, which is about cohesion and coherence)

The vast majority of the chapter is on writing and reading and conversation is barely mentioned. You should increase the section on social communication—this is the perfect place to expand and give examples of what you talked about in the earlier sections. Perhaps include a section on cultural influences on discourse (or other external factors, like gender, etc.) Politeness is also a fascinating topic.

I’m sorry if this seems like a lot of criticism: your chapter is off to a good start! I hope my advice can help tighten up your writing so the content is clearer and easier to understand. Egreer 18:16, 26 February 2011 (UTC)

title: Talk:Psycholinguistics/Discourse


text:
Talk:Psycholinguistics/Acoustic Phonetics

On the whole, very good and informative! A few things could be improved on, of course, as always.

The introduction is worded in a way that is a bit convoluted to understand. Perhaps it could begin with, “Acoustic phonetics is...”, rather than having the subject at the end of the sentence. In general, the phrasing in the introduction could be clearer, just to make it easier for one who was not well-versed in the topic to understand. Maybe check out a style manual to get a better sense of where the subject of a sentence should be within the sentence. Also, it might be a good idea to outline the points you will be discussing in the introduction, briefly, but just so that the reader is aware of the subtopics being presented. As is described in the grading rubric, the introduction should mirror the progression of topics in the chapter.

The body is good and definitely describes the main facts regarding acoustic phonetics, but there are no citations throughout and as such you need to give references to back up your points. All you need to do to solve this problem is provide the appropriate references for your facts and then it’s fine. There are some spelling errors throughout (one I saw was “verticle”, which should be “vertical”, in the section on fricatives), as well as some sentences that don’t make sense due to what appear to be typos, so you might want to proofread it a couple of times, or use a spell check or something. The paragraphs themselves seem to be well-organized, and no paragraph seems to me to be out of place. Also, your images are great, and are excellent for giving a visual representation of what the paragraphs are saying. My only problem was with the section on how to read a spectrogram, which I found to be a bit unclear, so you might want to explain it in a way that is as if you are describing it to someone who really has no idea. You don’t seem to have a conclusion, so you might want to write one up; the rubric suggests you summarize, integrate and discuss the implications: basically, just wrap up what was proposed in your introduction, with a wider scope, the big picture.

The information is put forth well, but if you wanted to add anything in the “human interest” vein, you could give some information on what certain things mean in the grand scheme of things, such as how acoustic phonetics relates to gender or whether or not there are differences in the production of formants from language to language. If you look into more sources you might find some neat stuff that you could add in which would make the chapter more creative. In general, more sources is a good idea, because you have both a bigger store of information to draw on as well as a multitude of research ideas and results to discuss. This would make the chapter more relevant and also more interesting. I’m not sure if that’s necessary in a chapter on a subject such as this, but it’s a suggestion. You do already cover a lot of ground on the topic of acoustic phonetics, though, so I’m not sure anything else is needed.

The flow is good, and I think all the important points are covered. It brings the reader through acoustic phonetics by building up from the most basic aspects (the characteristics of speech sounds, things like frequency) and concluding with the more complex components (transitions). The paragraph on voice onset time could be edited with regards to writing style, and perhaps a bit more information could be given. I feel that the section on transitions would be better placed with the sections on formants and F1 and F2, but that could be because that was how I learned about it in another class last year. In general, just go through the whole chapter several times and make sure the sections are in the appropriate place, as this gives the reader a greater sense of understanding the topic, and alleviates any potential confusion. Make sure that you start basic and build up from there in a way that is coherent to one who has no knowledge of this subject. Make it almost like a story, where each paragraph is placed so as to give the information needed to set up the next one. On the whole it is a good chapter, and very interesting to read.

Jennica Lounsbury 18:52, 26 February 2011 (UTC)


text:
User:Metadawson/Blog/googlerss

Google Reader −  tag:google.com,2005:reader/user/02378424286787347221/state/com.google/broadcast   Alexia's shared items in Google Reader  − Alexia 2011-02-26T18:46:16Z −  tag:google.com,2005:reader/item/2205b5e320e85f8b   Google Docs turns into a Universal File Viewer 2011-02-19T12:04:30Z 2011-02-19T12:04:30Z  −  Designers, for both web and print media, mostly use tools like Adobe Photoshop and Illustrator for doing the creatives of a project. They'll do the prototypes in PSD format but, for approval, the designs are delivered as PDFs since their clients may not have the software (Photoshop in this case) that is required to view PSD files.  Read Photoshop (PSD), Fonts (TTF) and other files in the browser. That said, if you have any Photoshop (PSD) files on your desktop that you want to view but without having to install Photoshop, here’s a tip for you – just go to your Google Docs account and upload the file. Google has recently added support for new file formats in Google Docs that are commonly used to exchange design prototypes between clients and designers. That mean you can open and quickly read Photoshop and other files in the browser itself without requiring the application. The file formats that can be natively viewed inside Google Docs, without conversion, include Photoshop (PSD), Illustrator (AI), Fonts (TTF), AutoCAD drawings (DXF) and Office 2010 documents (like DOCX, XLSX and PPTX). And if the file that you are trying to open is already on the web, you don’t even have to bother uploading it to your Google Docs account. Copy the public URL of that file and pass it to Google's online viewer at docs.google.com/viewer. Also read:  Google Docs Guide  [Do Everything with Google Docs]          This article, titled Google Docs turns into a Universal File Viewer, was originally published at Digital Inspiration under Google Docs, Photoshop, Internet.   − Amit <gr:likingUser>12841122564543815065</gr:likingUser> <gr:likingUser>06934151998487421301</gr:likingUser> <gr:likingUser>10102433257097813967</gr:likingUser> <gr:likingUser>06926033670607196672</gr:likingUser> <gr:likingUser>14487877498324325045</gr:likingUser> <gr:likingUser>02493361864459897726</gr:likingUser> <gr:likingUser>15906482859510625038</gr:likingUser> <gr:likingUser>08106817290465149326</gr:likingUser> <gr:likingUser>00772307687861580803</gr:likingUser> <gr:likingUser>07840133304195244111</gr:likingUser> <gr:likingUser>11580807580514879590</gr:likingUser> <gr:likingUser>05979608432730590670</gr:likingUser> <gr:likingUser>14299622418589165037</gr:likingUser> <gr:likingUser>02103864680157236255</gr:likingUser> <gr:likingUser>11529802629424632953</gr:likingUser> <gr:likingUser>16873108261441288004</gr:likingUser> <gr:likingUser>12239866026655063875</gr:likingUser> <gr:likingUser>09299082199232956236</gr:likingUser> <gr:likingUser>16333746150736523739</gr:likingUser> <gr:likingUser>10927778006887262847</gr:likingUser> <gr:likingUser>03639991204413291228</gr:likingUser> <gr:likingUser>10792108255023119569</gr:likingUser> <gr:likingUser>05112641280705296671</gr:likingUser> <gr:likingUser>04904576951879532792</gr:likingUser> <gr:likingUser>13124128088588551152</gr:likingUser> <gr:likingUser>13394197701698320105</gr:likingUser> <gr:likingUser>05526275985308923623</gr:likingUser> <gr:likingUser>05227952249820973149</gr:likingUser> <gr:likingUser>09150705330320801853</gr:likingUser> <gr:likingUser>03513059628154830777</gr:likingUser> <gr:likingUser>10249513362956005021</gr:likingUser> <gr:likingUser>16176304332602243626</gr:likingUser> <gr:likingUser>14376566174676461367</gr:likingUser> <gr:likingUser>09193515033934762181</gr:likingUser> <gr:likingUser>15080165358801702994</gr:likingUser> <gr:likingUser>10262891496885273077</gr:likingUser> <gr:likingUser>17108013762380366803</gr:likingUser> <gr:likingUser>06841265058484712367</gr:likingUser> <gr:likingUser>09009653324701006034</gr:likingUser> <gr:likingUser>10395238217014919761</gr:likingUser> <gr:likingUser>01800540337058238255</gr:likingUser> <gr:likingUser>07338907281496079173</gr:likingUser> <gr:likingUser>17141894104250920556</gr:likingUser> <gr:likingUser>01078909911975297443</gr:likingUser> <gr:likingUser>18123994868052572961</gr:likingUser> <gr:likingUser>01402946797549400726</gr:likingUser> <gr:likingUser>16431710832657502590</gr:likingUser> <gr:likingUser>05322424762113570375</gr:likingUser> <gr:likingUser>10542412698234125656</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298745933263"> <id gr:original-id="http://www.labnol.org/?p=18744">tag:google.com,2005:reader/item/c6dfa92dec342704</id> <category term="Internet"/> <category term="Archives"/> A Better Way to Bookmark Web Videos 2011-02-21T09:45:22Z 2011-02-21T09:45:22Z <link rel="alternate" href="http://www.labnol.org/internet/bookmark-web-videos/18744/" type="text/html"/> − <content xml:base="http://www.labnol.org/" type="html">  As you may have previously noticed, the embedded version of YouTube Player now offers a handy ‘Watch Later’ feature that lets you add the current video to a queue with a click. You can then conveniently watch all these ‘queued’ videos later when you have the time. There’s one minor problem though. YouTube is ‘the’ most popular video sharing website but it’s not the only one around. You have sites like Vimeo, TED, Break.com, Facebook, Revver, etc. that host awesome video content and wouldn’t it be nice if we could extend the same ‘watch later’ functionality of YouTube to these sites as well? Enter RadBox – a useful web app that lets you bookmark web videos from all the popular sites to a common queue. You can then watch these videos later from one central location.  You can bookmark videos in two ways. First, there’s the Instapaper-style bookmarklet that will save an embedded video to the Radbox queue without you have to leave the page. Or you can simply email the video URL to an email address, an option that will help you bookmark videos even from mobile phones. Radbox currently supports all the popular video websites include YouTube, Vimeo, College Humour, Google Videos and more. Once you are done watching a video, you can either delete it from the Radbox queue or move it to the archive. Also see:  Most Useful Websites           This article, titled A Better Way to Bookmark Web Videos, was originally published at Digital Inspiration under Youtube, Internet.   − Amit <gr:likingUser>02493361864459897726</gr:likingUser> <gr:likingUser>15986857326450811934</gr:likingUser> <gr:likingUser>07076631845260876575</gr:likingUser> <gr:likingUser>01001413734373503715</gr:likingUser> <gr:likingUser>08681750402410209699</gr:likingUser> <gr:likingUser>06127185223904495669</gr:likingUser> <gr:likingUser>10792108255023119569</gr:likingUser> <gr:likingUser>13682852993331270808</gr:likingUser> <gr:likingUser>10525450077210192424</gr:likingUser> <gr:likingUser>07498594006667626166</gr:likingUser> <gr:likingUser>10908061152530654063</gr:likingUser> <gr:likingUser>16191090610722120376</gr:likingUser> <gr:likingUser>09542154356264213481</gr:likingUser> <gr:likingUser>10262891496885273077</gr:likingUser> <gr:likingUser>12809975394631473552</gr:likingUser> <gr:likingUser>05322424762113570375</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298577170919"> <id gr:original-id="http://www.w3.org/blog/SW/2010/07/07/semantic_web_use_case_by_kisti_and_kast">tag:google.com,2005:reader/item/cad87fcc1aa83a45</id> <category term="Activity news"/> Semantic Web Use Case by KISTI and KAST 2010-07-07T12:48:57Z 2010-07-07T12:48:57Z <link rel="alternate" href="http://www.w3.org/blog/SW/2010/07/07/semantic_web_use_case_by_kisti_and_kast" type="text/html"/> − <content xml:base="http://www.w3.org/blog/SW" type="html"> KISTI (Korea Institute of Science and Technology Information) and KAST (Korean Agency for Technology and Standards) have provided a W3C Semantic Web Case Study on an integrated, connected search service for technical standards information, that also provides information on trends, on standard related research and development activities, etc. Ontologies were created to model the standardization process and relationships; SPARQL and RDF were used to integrate heterogeneous resources, and taxonomies helps users to ask questions in more natural language. − Ivan Herman − − <entry gr:crawl-timestamp-msec="1298577128315"> <id gr:original-id="http://www.w3.org/blog/SW/2010/10/27/rdfa_core_1_1_last_call_working_draft_pu">tag:google.com,2005:reader/item/bb2f67f3975cbc27</id> <category term="Activity news"/> RDFa Core 1.1 Last Call Working Draft published 2010-10-27T07:20:54Z 2010-10-27T07:20:54Z <link rel="alternate" href="http://www.w3.org/blog/SW/2010/10/27/rdfa_core_1_1_last_call_working_draft_pu" type="text/html"/> − <content xml:base="http://www.w3.org/blog/SW" type="html"> The RDFa Working Group has published a Last Call Working Draft of RDFa Core 1.1. RDFa Core is a specification for attributes to express structured data in any markup language, with an emphasis on HTML-family languages, the Scalable Vector Graphics (SVG) Format, the Open Document Format and other Web-enabled document formats. The specification enables the human-readable and machine-readable markup of people, places, events, products, recipes, social networks, and many other concepts that are frequently published on the web. RDFa 1.1 improves upon RDFa 1.0 by adding a number of features requested by people to ease authoring. The announcement as a Last Call Working Draft is an open invitation to the general public to review and provide feedback on the specification via the RDFa Working Group mailing list. The deadline for review feedback is 6 December. − Ivan Herman − − <entry gr:crawl-timestamp-msec="1298577012494"> <id gr:original-id="http://techcrunch.com/?p=278164">tag:google.com,2005:reader/item/a5971c84d2d34fa9</id> <category term="TC"/> After Twitter, LinkedIn Now Also Blocked In China 2011-02-24T15:40:30Z 2011-02-24T15:40:30Z <link rel="alternate" href="http://feedproxy.google.com/~r/Techcrunch/~3/MMxak019JqU/" type="text/html"/> − <media:group> <media:content url="http://0.gravatar.com/avatar/a5a5ed70fa7c651aa5ec9ca8de57a4b8?s=96&d=identicon&r=G"/> <media:content url="http://tctechcrunch.files.wordpress.com/2011/02/just-ping.jpg"/> <media:content url="http://tctechcrunch.files.wordpress.com/2011/02/websitepulse.jpg"/> </media:group> − <content xml:base="http://techcrunch.com/" type="html">  It appears that LinkedIn has been blocked in China, after the professional social network became a platform for organizing anti-government protests. The report was first noted by Renmedia. According to the WSJ article, protesters are moving from various social network sites, such as Twitter and LinkedIn, to organize protests as the Chinese government blocks these sites. We checked out access to LinkedIn on both WebsitePulse and JustPing and both sites indicate that LinkedIn is being blocked from cities in China. It also appears that Twitter is blocked as well. Interestingly, former LinkedIn employee Surya Yalamanchili points out that one reason behind why China could be blocking LinkedIn is because many of its status updates have been published from Twitter. We’ve contacted LinkedIn for comment on the matter. UPDATE : Here’s the response we received from LinkedIn: We are aware of the reports of a disruption to our service for our members in China. We are looking into the situation now.  CrunchBase Information   LinkedIn    Information provided by CrunchBase                 − Leena Rao <gr:likingUser>18338661790453142420</gr:likingUser> <gr:likingUser>10841889680633322580</gr:likingUser> <gr:likingUser>15680401575965071160</gr:likingUser> <gr:likingUser>10991750837707793341</gr:likingUser> <gr:likingUser>00363647479470519434</gr:likingUser> <gr:likingUser>12128080852281383372</gr:likingUser> <gr:likingUser>06383365958497463514</gr:likingUser> <gr:likingUser>02395318870018782319</gr:likingUser> <gr:likingUser>14135990311195739259</gr:likingUser> <gr:likingUser>08815111130840053178</gr:likingUser> <gr:likingUser>12292917012105263037</gr:likingUser> <gr:likingUser>06507198729172275324</gr:likingUser> <gr:likingUser>03428732989666979940</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576886961"> <id gr:original-id="http://techcrunch.com/?p=278210">tag:google.com,2005:reader/item/c218a1d5405aee9e</id> <category term="TC"/> <category term="Apple"/> <category term="Intel"/> What Is Thunderbolt And Will It Change Your Life? 2011-02-24T18:12:53Z 2011-02-24T18:12:53Z <link rel="alternate" href="http://feedproxy.google.com/~r/Techcrunch/~3/15Y5FA0wpoo/" type="text/html"/> − <media:group> <media:content url="http://0.gravatar.com/avatar/66c4d1c24c1818d8d34f8cfcc09a25e1?s=96&d=identicon&r=G"/> <media:content url="http://www.crunchgear.com/wp-content/uploads/2011/02/thunderbolt-logo.jpg"/> </media:group> − <content xml:base="http://techcrunch.com/" type="html"> Though you’re probably hearing about it for the first time now, Intel’s been working on a new interconnection technology for the last few years. “Light Peak”, as it was called up until it was rebranded “Thunderbolt” today, promises a new world of screaming-fast data transfers. The claims are spectacular: 10 gigabit per second transfers (both upload and download!), dual protocol support, and power over the cable. Light Peak… excuse me, Thunderbolt, is truly the interconnect of the future. The technology launched today on Apple’s latest MacBook Pros, but Apple is just one of a bunch of companies with plans to support Intel’s technology. Thunderbolt devices will slowly trickle out of major industry players over the coming year. It’s going to be an uphill battle for the standard — the USB horde won’t go without a fight. If you’re going to throw your support behind just one camp in this silly battle (first person to get a Thunderbolt tattoo wins!), you may want to give Thunderbolt a long look. It’s good. Read More                 − Matt Burns <gr:likingUser>01378362922825043920</gr:likingUser> <gr:likingUser>16862207362563903733</gr:likingUser> <gr:likingUser>01393931308179727322</gr:likingUser> <gr:likingUser>02677815131790246767</gr:likingUser> <gr:likingUser>03519783795934922251</gr:likingUser> <gr:likingUser>14135990311195739259</gr:likingUser> <gr:likingUser>02620463324959177103</gr:likingUser> <gr:likingUser>09889748032722224712</gr:likingUser> <gr:likingUser>12292917012105263037</gr:likingUser> <gr:likingUser>02109627893579099890</gr:likingUser> <gr:likingUser>10434923705196586092</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576234117"> <id gr:original-id="http://www.alistapart.com/articles/understanding-css3-transitions/">tag:google.com,2005:reader/item/a5f02bae0e654e42</id> <category term="Code, CSS, Culture, Industry"/> Understanding CSS3 Transitions 2010-11-16T11:00:10Z 2010-11-16T11:00:10Z <link rel="alternate" href="http://www.alistapart.com/articles/understanding-css3-transitions/" type="text/html"/> −  From advanced selectors to generated content to the triumphant return of web fonts, and from gradients, shadows, and rounded corners to full-blown animations, CSS3 is a universe of creative possibilities. No one can better guide you through these galaxies than world-renowned designer, author, and CSS superstar Dan Cederholm of SimpleBits and Dribbble fame. We are delighted to present an excerpt from his new book (and the second publication from A Book Apart), CSS3 For Web Designers. − contact.us@alistapart.com ( Dan Cederholm) <gr:likingUser>08065408371810708657</gr:likingUser> <gr:likingUser>15581407310368936308</gr:likingUser> <gr:likingUser>14462552475344527258</gr:likingUser> <gr:likingUser>07067754908477568835</gr:likingUser> <gr:likingUser>00338552099301766944</gr:likingUser> <gr:likingUser>10451461499262899777</gr:likingUser> <gr:likingUser>13784414242216580185</gr:likingUser> <gr:likingUser>13467246013936648363</gr:likingUser> <gr:likingUser>04408065054873432818</gr:likingUser> <gr:likingUser>00201515606319586739</gr:likingUser> <gr:likingUser>06238391279507534926</gr:likingUser> <gr:likingUser>02885298312319616028</gr:likingUser> <gr:likingUser>12025209085415514120</gr:likingUser> <gr:likingUser>04766117362870532830</gr:likingUser> <gr:likingUser>09717164665069851452</gr:likingUser> <gr:likingUser>07624162494916438205</gr:likingUser> <gr:likingUser>09589406619163815881</gr:likingUser> <gr:likingUser>09298711963651598807</gr:likingUser> <gr:likingUser>10782666618794195475</gr:likingUser> <gr:likingUser>01528828156335553632</gr:likingUser> <gr:likingUser>17682953454482772831</gr:likingUser> <gr:likingUser>14284557613042224508</gr:likingUser> <gr:likingUser>10515986316390041708</gr:likingUser> <gr:likingUser>06093693391433498752</gr:likingUser> <gr:likingUser>17691650828634517763</gr:likingUser> <gr:likingUser>12254612608180354277</gr:likingUser> <gr:likingUser>16028204738848317233</gr:likingUser> <gr:likingUser>04477652121804135050</gr:likingUser> <gr:likingUser>05109540065337507610</gr:likingUser> <gr:likingUser>11293540704626889668</gr:likingUser> <gr:likingUser>03874668935916540933</gr:likingUser> <gr:likingUser>00585441668486263838</gr:likingUser> <gr:likingUser>18255939271600214422</gr:likingUser> <gr:likingUser>06057134510721852548</gr:likingUser> <gr:likingUser>09483036095899914309</gr:likingUser> <gr:likingUser>06673761178884560451</gr:likingUser> <gr:likingUser>00452859292074007824</gr:likingUser> <gr:likingUser>00933692806378322485</gr:likingUser> <gr:likingUser>15665642475271360066</gr:likingUser> <gr:likingUser>06468606678564800031</gr:likingUser> <gr:likingUser>14672284775862026481</gr:likingUser> <gr:likingUser>00847499729154887773</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576229016"> <id gr:original-id="http://www.alistapart.com/articles/css-positioning-101/">tag:google.com,2005:reader/item/241bcb0bb7149f68</id> <category term="Code, CSS, HTML and XHTML, Design, Layout"/> CSS Positioning 101 2010-11-16T11:00:06Z 2010-11-16T11:00:06Z <link rel="alternate" href="http://www.alistapart.com/articles/css-positioning-101/" type="text/html"/> −  If you’re a front end developer or a designer who likes to code, CSS-based layouts are at the very core of your work. Designer slash developer Noah Stokes scrutinizes the CSS position property to show how you can use it to create standards-compliant, table-free CSS layouts. Test or refresh your knowledge of static, relative, absolute, fixed, and inherited positioning, and how they work together to create any web layout the mind can conceive. − contact.us@alistapart.com (Noah Stokes) <gr:likingUser>15581407310368936308</gr:likingUser> <gr:likingUser>07914164336944844137</gr:likingUser> <gr:likingUser>16588123341666047181</gr:likingUser> <gr:likingUser>02607140367309706919</gr:likingUser> <gr:likingUser>13383849078523795178</gr:likingUser> <gr:likingUser>01610049231822643956</gr:likingUser> <gr:likingUser>10913467270291151413</gr:likingUser> <gr:likingUser>09296228591692104974</gr:likingUser> <gr:likingUser>17652240112681925728</gr:likingUser> <gr:likingUser>10451461499262899777</gr:likingUser> <gr:likingUser>01430890622322157253</gr:likingUser> <gr:likingUser>11805292830766681231</gr:likingUser> <gr:likingUser>13784414242216580185</gr:likingUser> <gr:likingUser>15978734666614410407</gr:likingUser> <gr:likingUser>06868924404498633765</gr:likingUser> <gr:likingUser>04408065054873432818</gr:likingUser> <gr:likingUser>11762090165046421182</gr:likingUser> <gr:likingUser>17661191718786571849</gr:likingUser> <gr:likingUser>06238391279507534926</gr:likingUser> <gr:likingUser>02885298312319616028</gr:likingUser> <gr:likingUser>12025209085415514120</gr:likingUser> <gr:likingUser>03994421792666600460</gr:likingUser> <gr:likingUser>04766117362870532830</gr:likingUser> <gr:likingUser>14459238337075683497</gr:likingUser> <gr:likingUser>18385338218504819643</gr:likingUser> <gr:likingUser>08572610973098331138</gr:likingUser> <gr:likingUser>09717164665069851452</gr:likingUser> <gr:likingUser>04354252607598022283</gr:likingUser> <gr:likingUser>03026507479280961613</gr:likingUser> <gr:likingUser>17736381900446163393</gr:likingUser> <gr:likingUser>02389679653703186173</gr:likingUser> <gr:likingUser>09589406619163815881</gr:likingUser> <gr:likingUser>08415198149283401799</gr:likingUser> <gr:likingUser>09298711963651598807</gr:likingUser> <gr:likingUser>14683731247458771585</gr:likingUser> <gr:likingUser>01528828156335553632</gr:likingUser> <gr:likingUser>04676904745472272879</gr:likingUser> <gr:likingUser>16638838431582429382</gr:likingUser> <gr:likingUser>15681236543691092302</gr:likingUser> <gr:likingUser>17682953454482772831</gr:likingUser> <gr:likingUser>14284557613042224508</gr:likingUser> <gr:likingUser>02752146325808709088</gr:likingUser> <gr:likingUser>14325132739247166598</gr:likingUser> <gr:likingUser>02455206133288888494</gr:likingUser> <gr:likingUser>06093693391433498752</gr:likingUser> <gr:likingUser>07029604903792843375</gr:likingUser> <gr:likingUser>18167918608105176051</gr:likingUser> <gr:likingUser>17691650828634517763</gr:likingUser> <gr:likingUser>12254612608180354277</gr:likingUser> <gr:likingUser>03405758673328700717</gr:likingUser> <gr:likingUser>16028204738848317233</gr:likingUser> <gr:likingUser>03451745462762526551</gr:likingUser> <gr:likingUser>17134462927163215180</gr:likingUser> <gr:likingUser>11293540704626889668</gr:likingUser> <gr:likingUser>01794602804356271626</gr:likingUser> <gr:likingUser>11392787103714534434</gr:likingUser> <gr:likingUser>14843521710610947098</gr:likingUser> <gr:likingUser>10888982914163924941</gr:likingUser> <gr:likingUser>08242568560990769301</gr:likingUser> <gr:likingUser>00585441668486263838</gr:likingUser> <gr:likingUser>09483036095899914309</gr:likingUser> <gr:likingUser>00452859292074007824</gr:likingUser> <gr:likingUser>06011155466542706043</gr:likingUser> <gr:likingUser>06468606678564800031</gr:likingUser> <gr:likingUser>12118197224005415470</gr:likingUser> <gr:likingUser>00140357217166215469</gr:likingUser> <gr:likingUser>09615815947984665001</gr:likingUser> <gr:likingUser>04415417320811221831</gr:likingUser> <gr:likingUser>14672284775862026481</gr:likingUser> <gr:likingUser>15890220311097732590</gr:likingUser> <gr:likingUser>16188721340024870804</gr:likingUser> <gr:likingUser>00847499729154887773</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576215679"> <id gr:original-id="http://www.alistapart.com/articles/aria-and-progressive-enhancement/">tag:google.com,2005:reader/item/51dd82cda5528efe</id> <category term="User Science, Accessibility"/> ARIA and Progressive Enhancement 2010-11-30T10:59:02Z 2010-11-30T10:59:02Z <link rel="alternate" href="http://www.alistapart.com/articles/aria-and-progressive-enhancement/" type="text/html"/> −  For seven years, progressive enhancement has been how we build sustainable, interoperable, and accessible web solutions. Now that the release of ARIA is approaching, let’s see how ARIA fits within progressive enhancement strategy. Can we use ARIA in a way that respects progressive enhancement? Can we use ARIA in ways that ensure we have a working solution at every level? − contact.us@alistapart.com ( Derek Featherstone) <gr:likingUser>07550163010320140243</gr:likingUser> <gr:likingUser>14088178602789445689</gr:likingUser> <gr:likingUser>04349265288166419588</gr:likingUser> <gr:likingUser>11085750791850300292</gr:likingUser> <gr:likingUser>07816052605134774760</gr:likingUser> <gr:likingUser>12040591476471427374</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576198694"> <id gr:original-id="http://www.alistapart.com/articles/the-accessibility-of-wai-aria/">tag:google.com,2005:reader/item/0d26e6e009319fd4</id> <category term="User Science, Accessibility"/> The Accessibility of WAI-ARIA 2010-11-30T11:00:01Z 2010-11-30T11:00:01Z <link rel="alternate" href="http://www.alistapart.com/articles/the-accessibility-of-wai-aria/" type="text/html"/> −  Web developers interested in accessibility issues often look to WAI-ARIA to bridge the accessibility gap created by ubiquitous scripting and make web applications more accessible to blind and visually impaired users. But can we recommend WAI-ARIA without reservation? Are there times when appropriate semantic HTML elements are preferable to custom widgets? − contact.us@alistapart.com (Detlev Fischer) <gr:likingUser>16793286499388717421</gr:likingUser> <gr:likingUser>06011155466542706043</gr:likingUser> <gr:likingUser>12040591476471427374</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576183312"> <id gr:original-id="http://www.alistapart.com/articles/testing-content/">tag:google.com,2005:reader/item/03c0ff8c9d762f74</id> <category term="Content, Content Strategy"/> Testing Content 2010-12-14T11:00:43Z 2010-12-14T11:00:43Z <link rel="alternate" href="http://www.alistapart.com/articles/testing-content/" type="text/html"/> −  Whether the purpose of your site is to convince people to do something, to buy something, or simply to inform, testing only whether they can find information or complete transactions is a missed opportunity: Is the content appropriate for the audience? Can they read and understand what you’ve written? Angela Colter shows how to predict whether your content will work (without users) and test whether it does work (with users). While you can’t test every sentence on your site, you don’t need to. Focus on tasks that are critical to your users and your business. Learn how to test the content to find out if and where your site falls short. − contact.us@alistapart.com (Angela Colter) <gr:likingUser>14462552475344527258</gr:likingUser> <gr:likingUser>03823318971560805144</gr:likingUser> <gr:likingUser>13784414242216580185</gr:likingUser> <gr:likingUser>16749335699635722562</gr:likingUser> <gr:likingUser>12025209085415514120</gr:likingUser> <gr:likingUser>12676975140252447399</gr:likingUser> <gr:likingUser>17545769078256407140</gr:likingUser> <gr:likingUser>08616147564255392934</gr:likingUser> <gr:likingUser>06093693391433498752</gr:likingUser> <gr:likingUser>16028204738848317233</gr:likingUser> <gr:likingUser>03861208176120355231</gr:likingUser> <gr:likingUser>11123871699942962361</gr:likingUser> <gr:likingUser>05558635935002066931</gr:likingUser> <gr:likingUser>01794602804356271626</gr:likingUser> <gr:likingUser>00585441668486263838</gr:likingUser> <gr:likingUser>12910184453658464494</gr:likingUser> <gr:likingUser>03581024749629537747</gr:likingUser> <gr:likingUser>03083972250322964912</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576146435"> <id gr:original-id="http://www.alistapart.com/articles/a-simpler-page/">tag:google.com,2005:reader/item/b8f37556a5f80f8e</id> <category term="Content, Design, Layout, Typography"/> A Simpler Page 2011-01-11T11:00:54Z 2011-01-11T11:00:54Z <link rel="alternate" href="http://www.alistapart.com/articles/a-simpler-page/" type="text/html"/> −  Want to design a book? There are mountains of beautifully designed examples to inspire you. But what about digital books? How do you create elegantly typeset, gloriously balanced reading experiences when tablets render type differently and support different fonts, text can extend in every direction, and type can change size? Craig Mod (Flipboard, Art Space Tokyo) addresses these questions and presents the initial release of Bibliotype, an HTML baseline typography library for tablet reading. − contact.us@alistapart.com (Craig Mod) <gr:likingUser>11561026339667327186</gr:likingUser> <gr:likingUser>14462552475344527258</gr:likingUser> <gr:likingUser>09165674808404905820</gr:likingUser> <gr:likingUser>06827048095458046238</gr:likingUser> <gr:likingUser>07912759316036466526</gr:likingUser> <gr:likingUser>14396553061043622018</gr:likingUser> <gr:likingUser>03065612574672723578</gr:likingUser> <gr:likingUser>17733386082105701826</gr:likingUser> <gr:likingUser>06452917954216258833</gr:likingUser> <gr:likingUser>03855910693200571459</gr:likingUser> <gr:likingUser>10736959011566775661</gr:likingUser> <gr:likingUser>05821391742163487721</gr:likingUser> <gr:likingUser>08176637260874623023</gr:likingUser> <gr:likingUser>17365284859316475862</gr:likingUser> <gr:likingUser>11037323167329173286</gr:likingUser> <gr:likingUser>11755604240171798039</gr:likingUser> <gr:likingUser>17752293032815540357</gr:likingUser> <gr:likingUser>11762090165046421182</gr:likingUser> <gr:likingUser>02114923684902310467</gr:likingUser> <gr:likingUser>02885298312319616028</gr:likingUser> <gr:likingUser>09834499834527757865</gr:likingUser> <gr:likingUser>07288505650623970518</gr:likingUser> <gr:likingUser>14585558558047188781</gr:likingUser> <gr:likingUser>09715364231585517939</gr:likingUser> <gr:likingUser>07500132047077573956</gr:likingUser> <gr:likingUser>05517169407171116796</gr:likingUser> <gr:likingUser>17682953454482772831</gr:likingUser> <gr:likingUser>07948165406605235552</gr:likingUser> <gr:likingUser>06093693391433498752</gr:likingUser> <gr:likingUser>01324733726151787714</gr:likingUser> <gr:likingUser>17943490110978036085</gr:likingUser> <gr:likingUser>12176804104049257429</gr:likingUser> <gr:likingUser>11251326168009705974</gr:likingUser> <gr:likingUser>11078547477879651200</gr:likingUser> <gr:likingUser>01421354333380221392</gr:likingUser> <gr:likingUser>05955565065441755391</gr:likingUser> <gr:likingUser>00328411548056698806</gr:likingUser> <gr:likingUser>04647398444247921994</gr:likingUser> <gr:likingUser>09255773855851169988</gr:likingUser> <gr:likingUser>13703785731629801407</gr:likingUser> <gr:likingUser>11392787103714534434</gr:likingUser> <gr:likingUser>09784557888608232567</gr:likingUser> <gr:likingUser>09093289389151754857</gr:likingUser> <gr:likingUser>00390720019181796051</gr:likingUser> <gr:likingUser>02819789789179254860</gr:likingUser> <gr:likingUser>10990485309912116039</gr:likingUser> <gr:likingUser>11484344476406420530</gr:likingUser> <gr:likingUser>09615815947984665001</gr:likingUser> <gr:likingUser>12948032578874606618</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576096109"> <id gr:original-id="http://www.alistapart.com/articles/cross-platform-scalable-vector-graphics-with-svgweb/">tag:google.com,2005:reader/item/f7f25976bad1b89e</id> <category term="Code, Browsers, HTML and XHTML"/> − Cross Platform Scalable Vector Graphics with svgweb 2011-02-08T09:00:13Z 2011-02-08T09:00:13Z <link rel="alternate" href="http://www.alistapart.com/articles/cross-platform-scalable-vector-graphics-with-svgweb/" type="text/html"/> −  Pity Scalable Vector Graphics. It’s been an official standard since before IE6 was released yet has never found much of an audience on the web, certainly not the one it deserves. Just as SVG was starting to establish some browser support, along came the canvas tag, stealing the thunder of dynamically generated client-side images. Yet despite all the attention being paid to canvas, there’s still a place for SVG, particularly for developers looking to replace plug-ins like Flash for data visualization. Unlike canvas or other script-only approaches, SVG can be easily divided into design and code elements, with just a little code to add interactivity. It even works on devices like the iPad and iPhone. And now, thanks to svgweb and a clever use of Flash, it works on older platforms no one could have ever imagined supporting SVG. Jim Ray shows how. − contact.us@alistapart.com (Jim Ray) <gr:likingUser>17144610438192357098</gr:likingUser> <gr:likingUser>05449208192323668395</gr:likingUser> <gr:likingUser>05821391742163487721</gr:likingUser> <gr:likingUser>04696352167461080037</gr:likingUser> <gr:likingUser>04766117362870532830</gr:likingUser> <gr:likingUser>17436240768195182534</gr:likingUser> <gr:likingUser>09291401038320443750</gr:likingUser> <gr:likingUser>08793025611018921570</gr:likingUser> <gr:likingUser>07947563113615143188</gr:likingUser> <gr:likingUser>07816052605134774760</gr:likingUser> <gr:likingUser>05704371423584025311</gr:likingUser> <gr:likingUser>11513858952470293121</gr:likingUser> <gr:likingUser>05221790502551658316</gr:likingUser> <gr:likingUser>11276736984824261175</gr:likingUser> <gr:likingUser>06647563337477908591</gr:likingUser> − − <entry gr:crawl-timestamp-msec="1298576038730"> <id gr:original-id="http://dublincore.org/news/2010/#dcmi-news-20101217-01">tag:google.com,2005:reader/item/e520a071587068c1</id> − DC-2011 to be held 21-23 September 2011 at the National Library of the Netherlands in The Hague 2010-12-17T00:00:00Z 2010-12-17T00:00:00Z <link rel="alternate" href="http://dublincore.org/news/2010/#dcmi-news-20101217-01" type="text/html"/> − <content xml:base="http://dublincore.org/" type="html"> 2010-12-17, We are pleased to announce that DC-2011, the eleventh International Conference on Dublin Core and Metadata Applications, will take place at the National Library of the Netherlands in The Hague from 21 through 23 September 2011. The National Library of the Netherlands (KB) fosters the national infrastructure for scientific information and plays an important role in the permanent access to digital information at an international level. The KB has been involved in many international research projects in the field of digital libraries and hosts the offices of The European Library and Europeana. The European Library Office is coordinating the local organization of DC-2011. Further information about the conference will be made available in January 2011. − Dublin Core Metadata Initiative Limited − − <entry gr:crawl-timestamp-msec="1298575970943"> <id gr:original-id="http://dublincore.org/news/2011/#dcmi-news-20110221-01">tag:google.com,2005:reader/item/636d2e1f26bdbddc</id> − DCMI and FOAF Project to collaborate on vocabulary alignment and preservation 2011-02-21T23:59:00Z 2011-02-21T23:59:00Z <link rel="alternate" href="http://dublincore.org/news/2011/#dcmi-news-20110221-01" type="text/html"/> − <content xml:base="http://dublincore.org/" type="html"> 2011-02-21, DCMI and the FOAF Project have agreed in principle to tighten the alignment between  DCMI Metadata Terms and the FOAF (Friend of a Friend) Vocabulary -- two specifications often used together in applications, especially in the Linked Data space. The agreement will include a commitment to share preservation and long-term maintenance responsibilities for FOAF's xmlns.com domain name. − Dublin Core Metadata Initiative Limited −

title: User:Metadawson/Blog/googlerss


text:
Talk:Psycholinguistics/Writing

Word Search Answers
AKKADIAN

JIAHU

MESOPOTAMIA

FRONTAL

GYRUS

EXNER

PHONOLOGICAL

SYLLABARIE

HIEROGLYPH

CUNEIFORM

PICTOGRAM

MORPHEME

ALPHABET

FLOWER

HAYES

RHETORICAL

GOALS

COMPOSITION

ORGANIZATION

HIERARCHICAL

CREATIVE

PRESERVE

SPEECH

READING

TECHNOLOGY

PRINT

TYPEWRITTEN

Hilaryy 19:42, 15 April 2011 (UTC)

Peer Review: Writing

Headings/Organization •	Although the original headings were created, I would suggest creating sub categories, especially for the historical sections on writing. •	This can help the reader find the points of interest and focus most on what they are looking for, as you do cover a huge span of the topic, from historical to current day. •	Using the might useful as well to create some space between each of the topics.

Some suggestions for this: •	In the introduction, you menti

on another view of writing, (linear/not). Make that another section. Alternative theories and questioning theories doesn’t seem to flow well or really fit in an introduction. o	You refer to the linear theory in the historical section again, maybe combine the two and put it in a section lower down the page? •	Break up the historical contexts depending on the society, era or type of writings. This may require some formatting of your actual text. •	In writing and the brain: Make section for each person and what they contributed. •	In the writing and cognition section: Make a section for each of the three processes. Format this section a lot, as it was difficult to understand which points were connected to which theory. There were four points, but three theories and points under each. Very difficult to understand.

Sentence Format Overall, the sentences were very wordy and a lot longer then they needed to be. It was very well written and probably much better then I could do, but for an online Wikipedia page text, I would suggest keeping the sentences slightly shorter and more to the point. Writing for the web is quite different then writing a paper. To make it more user friendly, I would suggest listing some of your points with bullets and again, heading use. Possibly including some pictures of what early day writings would be could be helpful, without plagiarizing of course. By breaking up the paragraphs and longer sentences, it creates a much more efficient and ergonomic web page. Sections Personally, I found the historical sections interesting but lengthy. I know that there is a word limit that has to be reached, but I would suggest edited them to include the more relevant information.

Also, I know this sounds awful, but I would, perhaps, simplify the whole article. I think that a base knowledge too high of the reader was assumed about the topic at some points during the article. This could be as easy as defining what is being referred to more frequently. Take for example, the word syllaberies. This was mentioned in the Introduction as an example, but as the reader, I didn’t know what that was, so the point was lost.

The Flower and Hayes model was also difficult for me to understand, and I had to read it a couple of times. It could have been due to the formatting. Still, simplifying could be helpful.

Spelling error in the historical context section: writting instead of writing.

You mentioned differences between cursive and printing. I feel that it would be an important section to have in the article. It seems fairly relevant.

It was a really great article and very informative. The amount of effort you put in was definitely shown. If you have any questions about what I meant by anything, let me know! Ectoombs 19:46, 26 February 2011 (UTC)

title: Talk:Psycholinguistics/Writing


title: File:Nm1.s11.mtg24.djvu


text:
Talk:Psycholinguistics/Neural Bases of Lexical Access

The purpose of this discussion is to provide feedback for the author of this chapter to try and help them make it a better learning resource for others. In the introduction, the author clearly states the ideas that will be discussed in the chapter. Also, to grab the attention of the reader and make it interesting, they restated the thesis at the end of the paragraph giving a little more detail to give the reader a better idea of what to be expected in the chapter. In the restatement of the thesis, the author also shows a logical progression of ideas in his chapter from lexical access in the human brain to conditions and factors that affect lexical retrieval then using data to identify neural systems and brain areas related to lexical access. Overall, the author does an excellent job both at grabbing the reader`s attention and providing a rationale for the chapter. For the body of the chapter, the author also has a logical progression of ideas. The sources used in the chapter provide varied but relevant information that guides the reader through the chapter. I appreciate that the author explains the research they cite avoiding the temptation to give their own interpretation of the cited material. The reader is given enough details about the study to understand the results and not all the details of the research, which is sufficient for the purpose of the chapter. There is a smooth flow between paragraphs of the same section, but not much between the different sections themselves. It might help the reader if there was to see a more natural flow from a section the next. The writing style used by the author is professional and accurate. I did not notice any spelling or grammar mistakes. I noticed that the author does condense the ideas efficiently in short and easily understood sentences. All the sources were cited in the reference section. There seems to be a small issue of spacing in the reference section. In general, the author does an excellent job in the chapter and makes it easy for the reader to grasp the main ideas. One thing that I was concerned about is that the sections are big. It might benefit the reader if the author tried to divide the sections into subsections or different sections if relevant. Also, I would recommend having a conclusion paragraph at the end of the chapter but avoiding personal interpretations, which I do not thing will be hard for the author as they demonstrated their ability to do this in the rest of the chapter. Midas 20:14, 26 February 2011 (UTC)