# User talk:Edward Z. Yang

After encountering some users who opt to reply on their own talk pages (and for some very good reasons), I have come to a conclusion: a compromise. If you initiate a discussion on my talk page, I will reply on my talk page, but, I will notify you on your talk page via a short statement (ex. ==RE: Subject== See reply on my talk page) and will do this every time a post a reply. This way, not only are conversations not fragmented, but you will know if I've acknowledged your comment. This will not be done if the conversation will probably only consist of a question and a reply. Promote good etiquette on talk pages! (Archives: 2004, 2005, 2008)

I reserve the right to remove images/templates/unnecessarily complex markup from this page. Automated notices may not be moved to archive pages.

## Notification: changes to "Mark my edits as minor by default" preference

Hello there. This is an automated message to tell you about the gradual phasing out of the preference entitled "Mark all edits minor by default", which you currently have (or very recently had) enabled.

On 13 March 2011, this preference was hidden from the user preferences screen as part of efforts to prevent its accidental misuse (consensus discussion). This had the effect of locking users in to their existing preference, which, in your case, was true. To complete the process, your preference will automatically be changed to false in the next few days. This does not require any intervention on your part and you will still be able to manually mark your edits as being minor in the usual way.

For power users such as yourself there is a workaround available involving custom JavaScript. With the script in place, you can continue with this functionality indefinitely (its use is governed by WP:MINOR). If you have any problems, feel free to drop me a note.

Thank you for your understanding and happy editing :) Editing on behalf of User:Jarry1250, LivingBot (talk) 18:04, 15 March 2011 (UTC)

## Annotations Extension

Hi! I am the developer of a WikiPraise UserScript. May I have a look into the sources of your extension? It may be very interesting for further research. What is the format of the data your extension provides? -- NetAction (talk) 13:38, 19 September 2011 (UTC)

See the attachments to https://bugzilla.wikimedia.org/show_bug.cgi?id=639 . Though it probably makes more sense to take advantage of existing annotation engines like those seen in Git. — Edward Z. Yang(Talk) 01:18, 20 September 2011 (UTC)

## MSU Interview

Dear Edward Z. Yang,

My name is Jonathan Obar user:Jaobar, I'm a professor in the College of Communication Arts and Sciences at Michigan State University and a Teaching Fellow with the Wikimedia Foundation's Education Program. This semester I've been running a little experiment at MSU, a class where we teach students about becoming Wikipedia administrators. Not a lot is known about your community, and our students (who are fascinated by wiki-culture by the way!) want to learn how you do what you do, and why you do it. A while back I proposed this idea (the class) to the communityHERE, where it was met mainly with positive feedback. Anyhow, I'd like my students to speak with a few administrators to get a sense of admin experiences, training, motivations, likes, dislikes, etc. We were wondering if you'd be interested in speaking with one of our students.

So a few things about the interviews:

• Interviews will last between 15 and 30 minutes.
• Interviews can be conducted over skype (preferred), IRC or email. (You choose the form of communication based upon your comfort level, time, etc.)
• All interviews will be completely anonymous, meaning that you (real name and/or pseudonym) will never be identified in any of our materials, unless you give the interviewer permission to do so.
• All interviews will be completely voluntary. You are under no obligation to say yes to an interview, and can say no and stop or leave the interview at any time.
• The entire interview process is being overseen by MSU's institutional review board (ethics review). This means that all questions have been approved by the university and all students have been trained how to conduct interviews ethically and properly.

Bottom line is that we really need your help, and would really appreciate the opportunity to speak with you. If interested, please send me an email at obar@msu.edu (to maintain anonymity) and I will add your name to my offline contact list. If you feel comfortable doing so, you can post your nameHERE instead.

If you have questions or concerns at any time, feel free to email me at obar@msu.edu. I will be more than happy to speak with you.

Thanks in advance for your help. We have a lot to learn from you.

Sincerely,

Jonathan Obar --Jaobar (talk) — Preceding unsigned comment added by Chlopeck (talkcontribs) 23:16, 14 February 2012 (UTC)

## Examples of convolution

I saw the wiki page, but I couldn't find any examples using actual numbers evaluating the formula. Could you give some examples of convolution, please? Mathijs Krijzer (talk) 22:14, 9 March 2013 (UTC)

#### Definition

The convolution of f and g is written fg, using an asterisk or star. It is defined as the integral of the product of the two functions after one is reversed and shifted. As such, it is a particular kind of integral transform:

 ${\displaystyle (f*g)(t)\ \ \,}$ ${\displaystyle {\stackrel {\mathrm {def} }{=}}\ \int _{-\infty }^{\infty }f(\tau )\,g(t-\tau )\,d\tau }$ ${\displaystyle =\int _{-\infty }^{\infty }f(t-\tau )\,g(\tau )\,d\tau .}$       (commutativity)

#### Domain of definition

The convolution of two complex-valued functions on Rd

${\displaystyle (f*g)(x)=\int _{\mathbf {R} ^{d}}f(y)g(x-y)\,dy}$

is well-defined only if f and g decay sufficiently rapidly at infinity in order for the integral to exist. Conditions for the existence of the convolution may be tricky, since a blow-up in g at infinity can be easily offset by sufficiently rapid decay in f. The question of existence thus may involve different conditions on f and g.

#### Circular discrete convolution

When a function gN is periodic, with period N, then for functions, f, such that fgN exists, the convolution is also periodic and identical to:

${\displaystyle (f*g_{N})[n]\equiv \sum _{m=0}^{N-1}\left(\sum _{k=-\infty }^{\infty }{f}[m+kN]\right)g_{N}[n-m].\,}$

#### Circular convolution

Main article: Circular convolution

When a function gT is periodic, with period T, then for functions, f, such that fgT exists, the convolution is also periodic and identical to:

${\displaystyle (f*g_{T})(t)\equiv \int _{t_{0}}^{t_{0}+T}\left[\sum _{k=-\infty }^{\infty }f(\tau +kT)\right]g_{T}(t-\tau )\,d\tau ,}$

where to is an arbitrary choice. The summation is called a periodic summation of the function f.

#### Discrete convolution

For complex-valued functions f, g defined on the set Z of integers, the discrete convolution of f and g is given by:

${\displaystyle (f*g)[n]\ {\stackrel {\mathrm {def} }{=}}\ \sum _{m=-\infty }^{\infty }f[m]\,g[n-m]}$
${\displaystyle =\sum _{m=-\infty }^{\infty }f[n-m]\,g[m].}$       (commutativity)

When multiplying two polynomials, the coefficients of the product are given by the convolution of the original coefficient sequences, extended with zeros where necessary to avoid undefined terms; this is known as the Cauchy product of the coefficients of the two polynomials.

## An RfC that you may be interested in...

As one of the previous contributors to {{Infobox film}} or as one of the commenters on it's talk page, I would like to inform you that there has been a RfC started on the talk page as to implementation of previously deprecated parameters. Your comments and thoughts on the matter would be welcomed. Happy editing!

This message was sent by MediaWiki message delivery (talk) on behalf of {{U|Technical 13}} (tec) 18:27, 8 March 2014 (UTC)