text:
# User talk:Bdamokos

## Welcome to Meta!

Hello Bdamokos, and welcome to the Wikimedia Meta-Wiki! This website is for coordinating and discussing all Wikimedia projects. You may find it useful to read our policy page. If you are interested in doing translations, visit Meta:Babylon. You can also leave a note on Meta:Babel (please read the instructions at the top of the page before posting there). If you would like, feel free to ask me questions on my talk page. Happy editing!

Bonjour Bdamokos, et bienvenue sur le Meta-Wiki de Wikimédia ! Ce site a pour but de coordonner et discuter de l’ensemble des projets Wikimédia. Il vous sera utile de consulter notre page sur les règles de Wikimédia. Si vous êtes intéressé par des projets de traduction, visitez Meta:Babylon. Vous pouvez aussi laisser un message sur Meta:Babel (mais veuillez d’abord lire les instructions en haut de cette page avant d’y poster votre message). Si vous le voulez, vous pouvez me poser vos questions sur ma page de discussion. À bientôt !

Olá Bdamokos! Seja bem-vindo ao Meta! Este site/sítio é dedicado à discussão e à coordenação de todos os demais projetos da Fundação Wikimedia. Talvez lhe seja útil ler a página contendo a nossa política (em inglês) antes de começar a editar. Se tiver dúvidas, sinta-se à vontade para me fazer perguntas em minha página de discussão, ou deixe uma mensagem para toda a comunidade na Babel, a versão do Meta da Esplanada. Boa sorte!

Hola Bdamokos! Bienvenido a la Meta-Wiki de la Fundación Wikimedia! Este sitio es para coordinar y discutir todos los proyectos de la Fundación Wikimedia. Tal vez le sea útil leer nuestra página de políticas (en inglés). Si le interesan las traducciones, visite Meta:Babylon. También puede dejar un mensaje en Meta:Babel (pero antes de hacerlo, por favor lea las instrucciones situadas en lo alto de la página). No dude en preguntar si tiene cualquiera duda, o pregunte en mi página de discusión. Buena suerte!

Ciao Bdamokos! Benvenuto sulla Meta-Wiki della Wikimedia Foundation! Questo sito serve a coordinare e discutere di tutti i progetti della Wikimedia Foundation. Potrebbe esserti utile leggere le nostre policy (in inglese). Se sei interessato a fare traduzioni, visita Meta:Babylon. Puoi anche lasciare un messaggio su Meta:Babel (ma per favore, leggi le istruzioni che si trovano all'inizio della pagina prima di scrivere). Se vuoi, puoi lasciarmi un messagio nella mia pagina di discussione. Buona fortuna!

Здравствуйте, Bdamokos, и добро пожаловать на Meta-Wiki Фонда Викимедиа! Этот сайт предназначен для координации и обсуждения вопросов, связанных со всеми проектами фонда. Для начала Вы можете ознакомиться с нашими правилами. Если Вы заинтересованы в работе над переводами, посетите Meta:Babylon. Вы также можете обсудить различные вопросы на странице Meta:Babel (пожалуйста, ознакомьтесь с инструкцией сверху, прежде чем писать). Если возникнут вопросы, не бойтесь задавать их мне на моей странице обсуждения. Удачи!

Hola {{PAGENAME}}! Benvingut a la Meta-Wiki de la Fundació Wikimedia! Aquest lloc està fet per a coordinar i discutir tots els projectes de la Fundació Wikimedia. Potser us serà útil llegir la nostra pàgina de polítiques (en anglès). Si us interessen les traduccions, visiteu Meta:Babylon. També podeu deixar un missatge a Meta:Babel (però abans de fer-ho, llegiu les instruccions situades al principi de la pàgina). No dubteu en preguntar si teniu qualsevol dubte. Si cal ho podeu fer en la meva pàgina de discussió. Bona sort!

Bdamokos, 你好！歡迎光臨維基媒體元維基！這個網站是為協調和討論所有維基媒體項目而設。我們的政策頁可能對您有用。如果您有興趣協助翻譯工作, 請參觀Meta:Babylon。你可在 Meta:Babel 留下口訊 (張貼之前請先讀該頁上指示)。若有問題, 請在我的討論頁問我 。祝

வணக்கம் Bdamokos, விக்கிமீடியா மேல்விக்கி! இற்கு நல்வரவு. இவ்விணையத்தளமானது கூட்டாகச் சேர்ந்து விடயங்களை விவாதிப்பதற்கென உருவாக்கப் பட்டது. விக்கித்திட்டங்கள். நீங்கள் எங்களின் பாலிசிகளையும் பாலிசி பக்கம் படித்தறியலாம். நீங்கள் மொழிபெயர்பில் ஆர்வமுடையவராகின், Meta:Babylon ஐப் பார்வையிடவும். நீங்கள் Meta:Babel இல் குறிப்பொன்றையும் விட்டுச் செல்லலாம். (பக்கத்தின் மேலேயிருக்கும் அறிவுறுத்தல்களை வாசித்தபின்னரே அங்கே செய்திகளை இடவும்). நீங்கள் விரும்பினால் எனது பக்கத்தில் செய்தியொன்றை விடவும் talk page. உங்கள் ஆக்கங்களை வரவேற்கின்றோம்!

--Aphaia 15:38, 17 December 2006 (UTC)

## File name

Hi Bdamokos, thank you for your translation. Would you let me make a silly question, if you are too much bothered with that; what means "add a" in Hungarian? I found it in the Hungarian title you have remaned, and now I'm curious about that because it sounds alike English, but those two lanuages have no similarity linguistically... --Aphaia 16:28, 17 December 2006 (UTC)

## Look and feel

Would you give a look to Wikimedia:Wikimedia:Fundraising translations/hu? (not published, just for check now) There is no Hungarian list of project as footer, as interim remedy, I put an English one instead. You are also invited to create a new one at Template:OurProjects2006. --Aphaia 18:05, 17 December 2006 (UTC)

## Foundation wiki

Bdamokos, would you join the editors' team there? Then give me/us your address and preferred account (same here?), if not, please forget. --Aphaia 21:23, 17 December 2006 (UTC)

## Visszavonás

Ezt a szerkesztésemet (pontosabban az ez előtti kettőt) direkt vontad vissza, vagy csak szerkesztési ütközés miatt véletlenül? Samat 00:46, 11 January 2009 (UTC)

## Thank you for translating

Hi Bence. I see that you are not only translating at translatewiki.net, but also here. I want to thank you for that. Cheers! Siebrand 12:42, 30 October 2009 (UTC)

Szia! Szerintem a javított mondat szebb lenne, ha úgy fogalmaznánk meg, ahogy tavaly volt, azaz „számíthatsz rá”, nem pedig „ott van”. Ehhez persze ragozni kell, de azt hiszem, ez a része működött az üzenetnek. Samat 23:13, 12 December 2009 (UTC)

## wmhu interwiki

Hi, Bence, the wmhu: interwiki prefix has just been activated on all Wikimedia projects. I hope you'll find it useful. --Nemo 14:50, 13 November 2010 (UTC)

Hi Nemo. Thanks for doing this, I don't think that many people link to our wiki, but anyway :). A minor note: just recently we have changed our domain from wiki.media.hu to wikimedia.hu (without a dot in the middle), the interwiki prefix still points to the old address. --Dami 20:54, 13 November 2010 (UTC)

## Translation Update

I want to thank you for your help translating throughout this year's fundraiser. The fundraiser has greatly benefited from all your contributions. Currently, the Kartika, Liliaroja, Abbas and Joan Gomà appeals need to be translated, as we are running appeals from editors. You can find all translation requests at the translation hub on meta and you can follow the progress of the fundraiser in real time by tracking the fundraiser statistics. It is important to check the Core Messages as many languages still need updating. Also if you haven't already, you can subscribe to the translators-l mailing list for all new requests and major changes. Many thanks for your help in truly making this a global fundraiser that you can edit.Klyman 19:33, 7 December 2010 (UTC)

## Wikimedia Conference

Hi Bence

I see the chapters meeting is no longer called Chapters meeting but Wikimedia Conference. I wonder if this means it is a bit more open to proposed chapters than in previous years. It happens that movement roles are planning a meeting just before the conference and we are interested in following it. Apart of that we are facing the same problems and opportunities as chapters and we feel we need to learn from others so we are also interested in attending the whole conference in general. So I would like If you could extend to us the invitation to attend. --Gomà 17:57, 31 January 2011 (UTC)

Hi Goma,

Sorry, I thought I had replied earlier, but apparently I forgot to hit the save button...

The Wikimedia Conference has been called this way for the past three years, mainly because it combines the Chapters', Developers' and Board meetings. Unfortunately, the Chapters meeting is still only open to chapters and those chapters in formation that were very well advanced in their recognition process at the time the final invitations were sent out.

As for the movement roles meeting, we sure welcome more active participation in the discussions and the work, but I am not in charge of invitations to that meeting. Please contact Austin or Jon Huggett to see how you can help out the process.

Best regards, --Dami 12:53, 4 February 2011 (UTC)

Hi Bence, wanted to give you a heads up that we have moved our bylaw official page on to the Wiki Canada web site. You are all welcome to register accounts on the Wiki and we look forward to your participation. Here is the interwiki link wmca:Bylaws Alan.ca 05:51, 4 February 2011 (UTC)

## Thank You

Bence :) On behalf of WMF I would like to thank you for your cooperation during the last fundraiser and we look forward for more fruitful and successful fundraisers over the next years. Thanks again :)--Melamrawy (WMF) 12:27, 9 February 2011 (UTC)

## Need help in discussion for an article nominated for Afd

Hello Bdamokos,

This is regarding a post of "Janos Boros" the Ex-Vice Mayor of Kolozsvar. You might not remember me, I am Kiran, an Indian by Szarmazas. My Magyar is a bit rusty, so I have to write in English. In 2009 there was nominated under Afd by some Romanian users. It was finally decided as "keep". It seems some RO Users have decided to nominate it again. I got the decision reviewed and the Admin was gracious enough to open it for discussion again. If you have the time, please do participate.

Warm regards Hangakiran 11:25, 23 March 2011 (UTC)

## Translator, We need you!

Dear Bdamokos,

You have helped us in previous years with translations and for that we are most grateful. Now we turn towards the 2011/12 fundraiser. It may seem forever away, but work has already begun getting everything ready to go. This year we want to have landing pages covering as many countries in as many languages as possible.

Right now, we want to figure out who is interested in translating for the fundraiser. This year we're hoping to have more of a solidified "core" group of translators that we can count on to have work done by a few key dates, but we'd also welcome help from people who are willing to just help out when they can.

If you would be interested please take a look at this little sign-up survey and fill it out http://survey.wikimedia.org/index.php?sid=13638&newtest=Y&lang=en. With that we can start building a list of people and filling any gaps in the languages we serve.

Many Thanks

Joseph Seddon (User:Jseddon (WMF))

Production Coordinator
Wikimedia Foundation
Jseddon (WMF) 01:00, 9 July 2011 (UTC)

Bence,

Thanks for this link. Dedalus 14:06, 29 August 2011 (UTC)

Your welcome, I put in a very short summary in English in our June report (http://meta.wikimedia.org/wiki/Wikimedia_chapters/Reports/Wikim%C3%A9dia_Magyarorsz%C3%A1g/June_2011); let me know if your have any questions in connection with the report. (I know that Google Translate is doing an awful job with Hungarian.) --Dami 14:10, 29 August 2011 (UTC)

## CentralNotice

Hi Bence, according to CentralNotice/Calendar the hu.wikipedia thank you notice was only intended for that project. Adding English as a language makes it show on en.wikipedia as well, which doesn't seem wise and would need more discussion. I removed en for now, we can discuss further there if you want. (Note that hu.wikipedia users with their UI language set to English will see the translation, that only depends adding the translation to the banner). Pcoombe (WMF) 12:57, 10 September 2011 (UTC)

Ok, that is fine with me. Thanks for catching that! --Dami 12:58, 10 September 2011 (UTC)

## Wikimedia Venezuela

Hello,

I am writing to ask you a question regarding the status of our still pending request of Wikimedia Venezuela to become a local Wikimedia Chapter. We have started gathering people and ideas since October 2010, organised a series of lectures for Wikipedia TEN. Our proposed bylaws have been reviewed by members of the ChapCom as early as May 2011. We were informed that in June-July 2011, our proposal was scheduled to be submitted to voting and, as of October 2, 2011, we are yet to receive a notification, either approval, rejection, suggestions...we have received only silence. What is going on? What has delayed the ChapCom to close the voting on our case? Working groups in other countries have submitted their proposals/requests to form a local WikimediaChapter more or less at the same time that we did, and they have been approved already. Why not Wikimedia Venezuela? What is wrong with us? If we were told what is wrong with us, we could work it out and fix whatever is needed...but with no input, we are left sitting in the waiting room for months..

Could you please tell us what is delaying our approval? What do we have to do?

Our people (37) is anxious and wondering what is going on. We were more people, but we feel dissapointed and discouraged, and this doesn't help us at all. Could you please give us an update?

Many, many thanks in advance from Venezuela.

--Jewbask 01:32, 3 October 2011 (UTC)

## Hungarian translation

I am working on this, Fundraising_2011/FAQ/hu and let me know the deadline / other-more importances. --Aranymalinko 13:00, 26 October 2011 (UTC)

## Wikimedia Kazakhstan

Hello Bdamokos, I am writing this message to get any update relating our application to be recognize as Wikimedia chapter. Is there any news? we have answered to all questions over month ago. Could you please give an update to us regarding this point? If we need any further action please contact me. Kind regards, --Ashina 05:44, 10 November 2011 (UTC)

Hi Ashina,

Thank you for the reminder, I will look into this and get back to you soon.

Sorry for the delay, --Dami 10:57, 10 November 2011 (UTC)

## email sent

Thank you for your prompt reply to my message! I sent an email to the chapcom email address.Thelmadatter 00:52, 10 January 2012 (UTC)

## Finance Meeting

Hey Bence, a more complete form is coming in the coming days :) Schiste 13:12, 22 January 2012 (UTC)

## A barnstar for you!

Hi! I just want to thank you and give you this barnstar for your help with the translation of the 2011 fundraiser! The fundraiser was the best we ever had, both in terms of the amount we collected and in terms of number of translations. We couldn't have done either one without the help we got from you and other translators. If you are interested, we made a report, which has some statistics about the translations.

And: I have one more request, and that is that you take this survey. You may have got an e-mail about it, and if you did, please ignore this. But if you didn't it would be great if you would take this survey too, so we can learn to improve the translation experience.

Again, thanks for your help with translations – you're awesome! Jon Harald Søby (WMF) 13:26, 24 January 2012 (UTC)

## Question for you

Hello, Bdamokos. You have new messages at Talk:Fundraising and Funds Dissemination/Recommendations.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

Hi. :) While I've not summarized the section in which you responded on the 27th quite yet, I have made a start at making sure I understand your position. That's always an important step in summarizing. :D If you have a chance, can you please stop by and let me know if I've got it right? Currently it's the last note in this section. --Maggie Dennis (WMF) 16:10, 30 January 2012 (UTC)

## Need help to finish translation of Template:Main Page/hu

Dear colleague! Please help us for transfer Magyar Main Page (Kezdőlap) to new unified design! Translation of Template:Main Page/hu was started by User:Tgr, but he does not have enough time to complete this work. Maybe you do finish this work? It would be perfect!

Just click to "edit-link" in every section and translate all values after "=". After complete translation need replace text in Kezdőlap to transcluding of {{Main Page/hu}} (as in Russian). Thanks in advance ;) --Kaganer (talk) 17:12, 3 April 2012 (UTC)

Maybe you now have time for this small task? --Kaganer (talk) 13:54, 2 September 2012 (UTC)
Hi Kaganer! Sorry, I know, I am terrible, but I don't think I have time for this :(. --Bence (talk) 11:20, 30 September 2012 (UTC)

## WMHU/TOU balance note

Hey Bence,

Just a note to let you know I adjusted the WMHU campaign (as well as the TOU campaign) to balance it out to the % that Philippe told me you guys had agreed upon (It was at 60% ToU and 40% WM-HU but is now reversed at 60% WM-HU and 40% ToU ). If you adjust your campaign or add/remove banners (before May 25th, it probably doesn't matter after that) could you drop me a line either on my talk page or by email? That'll let me know to go in and make sure the %s stay the same.

Thanks! Jalexander (talk) 03:28, 7 May 2012 (UTC)

Thank you, James. --Bence (talk) 08:54, 7 May 2012 (UTC)

## Liability for harm caused by incorrect medical information

Hi Bence

In this thread, veteran editor and former en.WP arbitrator en:User:Iridescent says:

If the WMF gets the balance wrong on coverage of Gibraltar, the worst that happens is complaints that Wikipedia is painting too rosy a picture of one side in a long-running territorial dispute; if the WMF gets the balance wrong on medicine, people die. (No, I don't think that's too apocalyptic. People believe Wikipedia more than they should; all it takes is one person to believe it when they read that watercress cures cancer—I can even provide a source for that one—and you're on very shaky legal ground, if someone manages to persuade a judge that the Medical Project is a de facto governing body and thus liable for the content of the medical articles.)

Could you possibly ask the foundation's legal team whether they can see Wikimedia Medicine heightening the foundation's liability for any harm caused by incorrect medical information on Wikimedia projects? If you have access to legal advice regarding Wikimedia Medicine's liability in that regard, it would be very welcome at this point, too. --Anthonyhcole (talk) 01:14, 30 September 2012 (UTC)

Hi Anthonyhcole,
These are interesting questions. I will see if the legal team at the WMF has anything to add, at least informally, but they cannot advise the community (and it is not entirely settled whether they can advise Affcom), so you will likely have to act on your own.
In general, chapters (and by extension WM Medicine) do not edit the content of the projects, nor do they influence editorial policy (at most, they might raise awareness over issues, and provide a venue for the community to have a debate) and they are legally independent from the WMF, to ensure that they are not liable for anything the WMF does or vica-versa. This fact is usually communicated quite often (see e.g. [1]), but it doesn't necessarily stop people from suing chapters (and while the cases are usually thrown out, it still costs money and time).
So even if the WMF cannot provide you with legal advice, this is an issue that has to be clear and discussed by you, to make sure you do not end up acting in a way that might be legally unwise.
(P.S. I am not a lawyer, so in all things legal, you should make sure to get proper advice.) --Bence (talk) 11:38, 30 September 2012 (UTC)
Bence has summed up the issue nicely. Doc James (talk · contribs · email) 17:03, 4 October 2012 (UTC)

## Imminent incorporation of Wikimedia Medicine

We are about to apply for incorporation. If you or any other AffCom members have any comments on the proposed bylaws, they would be very welcome at Talk:Wikimedia Medicine/Bylaws. --Anthonyhcole (talk) 05:48, 10 October 2012 (UTC)

Thanks Anthony for keeping me up to date, it is appreciated. As I said in my e-mail, the review will have to wait a bit, until there are a few more participants and some of the open questions on membership, structure, goals get fleshed out in a bit more detail. I don't expect that the bylaw review would require any big changes as a pre-condition for recognition, but given the time it takes to change the bylaws of an incorporated entity, pre-mature incorporation will certainly cause delays of possibly months in the time it takes to recognize WM Medicine. Best regards, --Bence (talk) 14:04, 14 October 2012 (UTC)

## re: Narrowing focus

I don't want to distract from the core of your comments by replying there, but in regards to "(it seems the editor experiments programme is currently costing more than the perhaps #1 visual editor..." That is very much untrue. With seven engineers, the VisualEditor, which includes work on the parser (aka Parsoid) under its umbrella, has the most resources of any single engineering project at the Foundation. Editor engagement experiments currently has only two engineers, and a total of seven people working on entire the team (and many non-technical staff currently split their time between it and other projects, like Dario, Maryana, etc.). Steven Walling (WMF) • talk 20:33, 15 October 2012 (UTC)

Ok, thanks for the clarification. (For the record, I simply compared the $.7k for VE I saw in the annual plan and the ~$1M requested in the FDC for the E3). --Bence (talk) 20:41, 15 October 2012 (UTC)
On a related note: [2] Steven Walling (WMF) • talk 22:30, 16 October 2012 (UTC)

## Wikivoyage

Hi Bence.

Sorry. I use your talk page because I dont have your email address with me. I am on the road. Just working with the WMF to migrate our Wikivoyage. Will be back home next week. Thanks for your comments and questions on our associations talk page. I am going to work through it. -- DerFussi 01:55, 24 October 2012 (UTC)

Thanks Stefan, have a safe trip! --Bence (talk) 12:44, 29 October 2012 (UTC)

## Re:Affiliations Committee is looking for members

Thanks! I have just sent you guys an e-mail :-) --Maor X (talk) 16:05, 12 December 2012 (UTC)

## Re: Affiliations Committee is looking for members

Hi Bence, thanks for the reminder. I believe Latinamerica is well represented in the AffCom (and actually, one of the members in the AffCom is from my local chapter). For that reason I'll pospone my application this time. Maybe in the future :-)

Cheers, Mahadeva (talk) 16:18, 13 December 2012 (UTC)

## Nudge

Hi Bence, I thought you might have useful perspective on this: Talk:Special Interest Groups -Pete F (talk) 20:26, 28 January 2013 (UTC)

## Membership criteria for WikiProject Med

Hi Bence. Any thoughts you or other committee members may have on the above would be very welcome at Talk:WikiProject Med#Membership fees (continued). --Anthonyhcole (talk) 07:03, 27 February 2013 (UTC)

Thanks, I've alerted AffCom and will take a look myself over the weekend. Thanks for the notice. –Bence (talk) 22:15, 28 February 2013 (UTC)
Cheers. Will you be attending the Milan conference? --Anthonyhcole (talk) 17:15, 1 March 2013 (UTC)
We are still debating internally who should go, but there will definitely be people from AffCom - there is a chance I will be one of them. Is anyone going from WikiPMEd? --Bence (talk) 17:24, 1 March 2013 (UTC)
Ocaasi and Daniel. I think the three of you meeting up, if you haven't yet, would be a really good thing, so I hope you do get to attend. :) --Anthonyhcole (talk) 14:39, 2 March 2013 (UTC)
Now it is confirmed, I will be going. I am really looking forward to meeting Ocassi and Daniel in person. Best, --Bence (talk) 21:22, 7 March 2013 (UTC)
Excellent. --Anthonyhcole (talk) 03:13, 8 March 2013 (UTC)

Ocaasi has had to withdraw because of schedule conflicts and has been replaced by Biosthmors, a very active medical editor/education outreach-er, who is also very active off-wiki in medical information dissemination. --Anthonyhcole (talk) 03:07, 14 March 2013 (UTC)

## Thank you

Thanks for your improvements / corrections to the Submit request template. Best, Winifred Olliff (Grants Administrator) talk 22:37, 21 March 2013 (UTC)

## Talk:Affiliations Committee/Resolutions/Budget request for 2013 annual meeting – April 2013

Just making sure that you notice the questions asked. odder (talk) 17:28, 6 May 2013 (UTC)

## Eyes, thoughts?

Hi Bence. We're close to finalising our membership criteria. Any thoughts you - or other AffCom members - may have would be appreciated. Talk:Wiki_Project_Med#Summing_up --Anthonyhcole (talk) 20:58, 10 May 2013 (UTC)

Thank you for the note – I've alerted AffCom to see if they have anything to add and will comment soon myself. Thanks again, –Bence (talk) 14:12, 11 May 2013 (UTC)
Thanks Bence. Don't feel obliged to comment, unless you want to. I'd just prefer that you noticed this, in case we start making some error you've seen before. --Anthonyhcole (talk) 11:24, 12 May 2013 (UTC)

Thanks for your insight there. The COI policy discussion is active now at Talk:Wiki Project Med Foundation/Conflicts of Interest. I've asked a question about whether the WMF expects us to seek funding outside the WMF. I vaguely remember having read that somewhere, do you know the answer? --Anthonyhcole (talk) 06:59, 23 May 2013 (UTC)


text:
To create a top-level heading, you use the hash (#) symbol. One hash represents an h1, two an h2, and so on. This works through to a level 6 heading. Always put a space between the hash symbol and the name of the heading.

Example:

# This is a (h1) tag
## This is a (h2) tag
###### This is a (h6) tag

Paragraphs

To create paragraphs, use a blank line to separate the text. You don't need to add tabs or spaces between two paragraphs.

Line Breaks

To create a line break (br), end a line with two spaces, and press the Enter key.

Emphasis

You can add emphasis by making the text bold or italic or both.

Bold

To bold text, add two asterisks before and after a word or phrase.

Example: Today, **I** need you.

Italic

To italicize text, add one asterisk before and after a word or phrase.

Example: Today, *I* need you.

Bold and Italic

To emphasize text with bold and italics simultaneously, add three asterisks before and after a word or phrase.

Example: Today, ***I*** need you.

Horizontal Line

To create a horizontal line, use three hyphens (---) on a line by themselves.

format: plain


text:
# The velocity of light

1. May 13, 2004

### David

Einstein said in his 1916 book:

”If an observer sitting in the position M1 in the train did not possess this velocity, then he would remain permanently at M, and the light rays emitted by the flashes of lightning A and B would reach him simultaneously, i.e. they would meet just where he is situated. Now in reality (considered with reference to the railway embankment) he is hastening towards the beam of light coming from B, whilst he is riding on ahead of the beam of light coming from A. Hence the observer will see the beam of light emitted from B earlier than he will see that emitted from A.”

What Einstein means by “he is hastening towards the beam of light coming from B” is that the light beam from the flash at B is converging on the observer that is moving toward B at the relative velocity of c + v, with v being the velocity of the observer toward B. What he means by “he is riding on ahead of the beam of light coming from A” means the light from the A flash is converging on the observer at the velocity of c – v.

This is very simple. The observer-relative speed of the light, relative to the moving observer is NOT “c”, it is NOT constant. It is c + v in one direction and c – v in the other direction.

This is why the earth sees a blueshift in the light of the star the earth is moving toward in its revolution around the sun and this is why the earth sees a redshift in the light of a star the earth is moving away from during its revolution around the sun. This is caused by the Second Cause of the Doppler effects that I told you about earlier. This is a Doppler Law of Physics. It can not be revoked.

2. May 14, 2004

### yogi

David - I do not think your conclusions about what Einstein was saying are consistent with SR - it is true that signals sent from sources you are approaching and those sent from sources from which you are receding will arrive at different times if they are sent when you are midway between them, you would nonetheless in SR measure both signals to have the same relative velocity c with respect to you according to SR.

That you may doubt whether SR is correct in making that postulate is another question - these were Einstein's conventions - but this particular "one way isotrophy" convention does not get tested in most experiments - what we test is over and back effects - the transformation that leads to one way isotrophy (the vx/c^2 term) doesn't appear in the interval - and it is the constancy of the interval that we commonly use to calculate time dilation, length contraction, mass increase etc. The interval can be arrived at without the one-way isotrophy postulate (for example the light clock which we have just rambled through on another thread gives you the (1-v^2/c^2)^1/2 directly, so therefore it is not inconsistent to believe in all the the successes of SR and still have doubts about the necessity and correctness of the second postulate.

Regards. Yogi (One of the cranks)

3. May 14, 2004

### David

No need to play around with word games or tricky thought experiments with me. That type of stuff doesn’t work on me. I’m talking about “physics”, not “science fiction stories”. And this is a “physics” board, not a “Si-Fi” board.

The reason the guy on the moving train will see the B flash first is because he is moving toward B and thus he and the light beam from B are converging on each other at the additive light-speed velocity of c + v. That’s a basic law of physics and of nature, and it’s a basic Doppler Law. That’s why the guy on the train will see the light as blueshifted, even though the waves of light are not “compressed” in the space between B and the moving observer.

4. May 14, 2004

Staff Emeritus
I’m talking about “physics”, not “science fiction stories”.

Good for you.

The reason the guy on the moving train will see the B flash first is because he is moving toward B and thus he and the light beam from B are converging on each other at the additive light-speed velocity of c + v. That’s a basic law of physics and of nature, and it’s a basic Doppler Law.

Oops, you just slid into sci-fi. Your "basic law of physics" is only an approximation, valid at low speeds.

5. May 14, 2004

### David

Max Born, Nobel Prize winner, writing in “Einstein’s Theory of Relativity”, 1962 edition:

“The fact that the observed frequency of a wave depends on the
motion both of the source of light and of the observer, each with
respect to the intervening medium, was discovered by Christian
Doppler (1842), The phenomenon may easily be observed in the
case of sound waves. The whistle of a locomotive seems higher when
it is approaching the observer and becomes deeper at the moment of
passing. The rapidly approaching source of sound carries the
individual phases of the waves forward so that the crests and hollows
succeed each other more rapidly. The motion of an observer to-
wards the source has a similar effect; he then receives the waves in
more rapid succession
.

Now the same phenomenon must hold in the case of light
.”

(snip)

Born continues:

"This relation between the frequencies f and f’ shows how the frequency is diminished when the observer has a velocity v in the direction of the light. From (40) and (41) one obtains the obvious result

c’ = c – v"

Born knew this and I know this. All the scientists of the 19th Century and during the first 60 years of the 20th Century knew this.

This is why the earth observes a redshift in the light coming from a star that is fixed relative to the sun, when the earth is moving away from the star as the earth revolves around the sun.

This is a completely different reason than the reason why the earth observes a redshift when the star itself is moving away from the earth. The first reason I gave is due to the c – v effect, as explained by Max Born, the Nobel Prize winner. The second reason is due to the starlight wavelength being physically stretched out in space. Unfortunately, only one reason or cause for the Doppler effects is taught in school today, while the other reason is ignored.

6. May 14, 2004

### ahrkron

Staff Emeritus
Some things have happened since then, one would expect.

7. May 14, 2004

### Staff: Mentor

Read the relativity section! - LOL

How convenient that you stopped quoting at this point! :rofl:

Just two sentences later, Born goes on to say (emphasis mine):
"But we have chosen a method using the invariance of the number of waves becaused they can be used later in the theory of relativity. There we will see that the relations c' = c - v and λ' = λ are not at all self-evident but are actually replaced by others."

Stop playing games. The section you are quoting is Born's treatment of the classical pre-relativity Doppler effect. Why not read the section where he treats it relativistically?

8. May 14, 2004

### David

If you choose a method of “using the invariance of the number of waves”, then you are being misleading, because the number of waves per second (ie the “frequency” shifts) are caused by two different reasons, as I’ve explained. Of course, you can ignore the reasons if you wish.

9. May 14, 2004

### David

Doc,

So, if you ignore the two different reasons, and if the standard model of a redshift caused by a star that is moving away from the earth is due to a "physical lengthening" of the wavelengths of the light coming from the star, then how would you use SR theory to explain the redshift observed at the earth and caused by the earth moving away from a star that is fixed relative to the sun?

10. May 15, 2004

### Staff: Mentor

David, you are the one quoting Nobel-prize winner Max Born. If you disagree with what he's saying, why quote him?

It is quite sad that you repeatedly attempt an argument from authority by quoting Einstein and Born--as if those guys didn't understand relativity and would agree with your misconceptions.

11. May 15, 2004

### David

Doc, et al,

How would you use SR theory to explain the redshift of starlight observed at the earth as the earth revolves around the sun, and caused by the earth moving away from a star that is fixed relative to the sun?

12. May 15, 2004

### Staff: Mentor

relativistic Doppler formula

Here's the relativistic Doppler formula:
$$\nu_{observed} = \nu_{source}\sqrt{\frac{1 + \frac{v}{c}}{1 - \frac{v}{c}}}$$
Where v is the relative speed of the source and observer: v is positive when the source is approaching the observer. In the case you mention, v is negative, thus a "red shift" is observed.

For a derivation, check Born's book.

13. May 15, 2004

### David

My question was, “How would you use SR theory to explain the redshift of starlight observed at the earth as the earth revolves around the sun, and caused by the earth moving away from a star that is fixed relative to the sun?”

I didn’t ask you for the amount of redshift.

Your equation gives the amount of shift, but where in the equation does it reveal if the shift is caused by a wavelength change or an observer-relative light velocity change?

You will recall that there are two separate causes of Doppler shifts: 1) wavelength change (moving emitter), 2) observer-relative wave speed change (moving observer).

Since the star is fixed relative to the sun, that leaves out a wavelength change. Where in your equation does it say that Doppler Cause #2 is the one that causes the shift when the earth is moving relative to the star?

Doppler Law provides a definite answer to this question.

14. May 16, 2004

### David

You make this stuff up faster than anyone can refute it.

From the light’s point of view, there is always distance. That’s why it takes light time to get from one place to another. Light doesn’t have a personal opinion, it just moves, and it moves over a great distance to get from star to star. Light and radio waves wouldn’t have “wavelengths” if there was “no distance” from the light’s point of view.

15. May 16, 2004

### David

Oh, come on! Many distant galaxies exhibit redshifts that indicate they are moving away from the earth at 2, 3, 4, and 5 c.

The Davis-Lineweaver paper tells how their light reaches us from the superluminal galaxies.

You are living in the past. This is not 1905, this is the 21st Century. You are just posting 100 year old rumors, superstitions, and urban legends.

16. May 17, 2004

### Staff: Mentor

Yes, interesting stuff! Note that the authors claim no contradiction with SR, since those galaxies are outside our inertial frame. I am not qualified to provide a detailed analysis of that paper, since I am no expert on general relativity. (Perhaps an expert can comment?) But I believe it is commonly understood that the cosmological redshift can only be understood via general relativity: special relativity cannot be applied on a cosmological scale. You cannot interpret the cosmological redshift as a relativistic doppler shift --- or any kind of doppler shift.
Well, I don't know about that. It seems that you're the one who hasn't yet caught up to special relativity. You still cling to the quaint pre-relativistic "Doppler Law".

17. May 17, 2004

### jcsd

This is due to general relativity which hasn't been mentioned so far, you have to realize that special relatvity is the special case of general relatvity. The reason why it hasn't been mentioned so far is the fact that in all the examples given there's been no reason to assume any significant deviation from the Minowski metric, so only the special case needs to be considered.

It is wrong to call these galaxies superluminal as it implies something that's not happening as their local coordinate velocity is still less than c in all (local, obviously) inertial rference frames. The red shift isn't due to relative motion between the two objects but the expansion of space.

Last edited: May 17, 2004
18. May 17, 2004

### David

Look, when you run away from me at 5 mph, you are “moving” away from me.

If you get in a car and move away from me at 60 mph, you are still “moving” away from me, even though you can say you are being “carried along” by the car.

The fact is, Lorentz invented the “speed limit” in 1895, and it was his limit for the speed of “ponderable bodies” through the “universal ether”. Einstein adapted it in 1905 to be the “speed limit” for “space”.

All the astronomy books, going back to the early 1930s, said the galaxies were “moving through space”, right up until the 1980s or ‘90s, when the first astronomer found the first superluminal galaxy, then all of a sudden the “expanding space” idea was invented. Now none of the galaxies are “moving” but are being “carried along” by “expanding space.”

Look, I’m an older guy. I’ve learned in life why some people in some fields tell one story for 50-60 years, then all of a sudden they change the story. This galaxy-motion story was changed in the 1990s in an attempt to try to salvage the 1905 “constancy” postulate, after superluminal galaxies were finally discovered.

And let me tell you something else. When I studied astronomy in 1956, when I was in junior high school, and when I built a 6 inch telescope, and when I saw Mars during its close approach that year, all the astronomy books and school science textbooks I could find said there were “green plants” growing all over the surface of Mars. This story had been told for more than a hundred years, until we finally sent a rocket to Mars and saw no “green plants” growing on it. Turns out the “green” was just an optical illusion, with green being the negative of red (reddish orange) and so the dark areas of the reddish Martian desert looked a little greenish through earth-based telescopes. So I feel I have the right to challenge any unreasonable theory, such as the “expansion of space” theory that is supposed to "carry along" the "unmoving galaxies", which is new and is just used as a device to salvage the “constancy” postulate, since superluminal galaxies were finally discovered.

Now, if you apply this information to the basic Lorentz theory, what do you have? How can you relate what we observe to the original Lorentz concept of a “speed limit”. Think of what he originally said, think of the limit to how fast we can push particles here on earth, and how fast the distant galaxies are moving, and what do you have? The implication is very important, but no one has written any science papers about it yet.

19. May 17, 2004

### David

LOL, yes, D&L were very diplomatic! They basically disproved the SR “constancy” postulate, but they said they didn’t contradict SR. Very clever. Maybe I should take that approach.

Did you like the part of their paper where they said that newly-emitted photons in superluminal galaxies are traveling backwards, away from the earth, for thousands of years, then the photons finally slow down their backward movement and gradually start traveling toward the earth? I just loved that part.

Nope, it's a Doppler shift.

SR originally was supposed to apply to a cosmological scale, but Einstein later realized it didn’t.

I think it would help you if you read some of his other papers, other than the few that were published in “The Principle of Relativity”. His earliest papers are the most interesting, but some of them contained stuff that he later changed and amended. Like any scientist, he learned more the older he became, and the older he became the more he learned.

There are certain things about the Doppler Law that can not be changed. The TWO fundamental reasons for the shifts, for example.

What Lorentz did was ADD some quantum electrodynamics stuff to the Doppler Laws, regarding oscillating atoms moving through fields. Lorentz was the one who invented the “relativistic” Doppler shift, which includes the two Doppler Laws, plus the electrodynamic effects on oscillating atoms moving through fields. At first, in 1905, Einstein mistook the electrodynamical effect for a “kinematical” effect, but he later realized his error and made changes accordingly, such as in his 1911 and 1916 papers. Those papers do consider the Lorentzian electrodynamical effects on moving atoms. In fact, the “Electrodynamic” part of the 1905 paper considers those effects, but the “Kinematical” part does not. I can explain the difference in the two parts if you would like for me to.

20. May 17, 2004

### DrChinese

What you are saying is reasonable on the surface, but...

If science is doing its job, then we will converge on a progressively better set of theories to describe nature. This appears to be happening - we are moving forward, not backward. Lineweaver and Davis, as strange as it is (and it certainly is strange to me), is not actually violating anything we had set in stone for decades anyway. After all, the expansion of space (Guth's inflation) was postulated a long time ago, so evidence confirming it shouldn't be a total surprise. (Even if it is weird. Not any weirder than QM, think?)

So it is not really a strong argument to point out past errors in scientific history and try to extrapolate from those. The CMBR was discovered around 1965, QM in 1927 and GR in 1915. There is a lot explained by these big 3.

Clearly the special relativistic formulas have been tested many times, including frequency shift due to relative motion. Not sure how you can argue that point. If two objects were each approaching a common midpoint at a substantial percentage of the speed of light, they will in fact approach each other faster than the speed of light measured by some observers. But light they emit cannot be measured to have a speed of any other value than c by any observer. Do you dispute that?


text:
# DifferentialEquations.jl 4.5: ABC, Adaptive Multistep, Maximum A Posteriori

Once again we stayed true to form and didn’t solve the problems in the development list but adding a ton of new features anyways. Now that Google Summer of Code (GSoC) is in full force, a lot of these updates are due to our very awesome and productive students. Here’s what we got.

## Approximate Bayesian Computation (ABC)

Marc Williams (@marcjwilliams1) contributed the abc_inference function to DiffEqBayes.jl which utilizes approximate Bayesian computation (also known as ABC) from ApproxBayes.jl to perform the estimation of parameter posteriors. Compared to standard Bayesian methods, ABC is computationally cheaper and faster at the cost of making some approximations (the name is quite appropriate). For models with lots of parameters where you have a good prior guess for the posterior parameter point estimates, ABC can be a great way to get posterior distributions.

## Maximum A Posteriori Estimation

GSoC student Vaibhav Dixit (@Vaibhavdixit02) added maximum a posteriori estimation to our existing parameter estimation routines in DiffEqParamEstim.jl. Now these optimization-based methods can take into account prior distributions which can help global optimizers stay in the right parameter ranges and improve fitting. All it takes is passing an optional prior distribution to any of the existing methods, so it’s very easy to add it your current work!

## Multiple shooting objective

In other parameter estimation news, Vaibhav Dixit (@Vaibhavdixit02) added the multiple_shooting_objective which, like the build_loss_objective method, allows for fitting ODE results to any loss function. However, multiple shooting methods are naturally more robust by solving simultaneously from many different time points.

## DynamicSS Solver

For SteadyStateProblem types, a new solver DynamicSS has been added that utilizes the ODE solvers to find steady states. It builds in a callback that will halt when the derivative is sufficiently small, allowing it to be a robust automated steady-state finding machine.

## Unified retcode handling

Takafumi Arakaki (@tkf) performed an awesome refactoring in the DiffEq core which allows all of the DiffEq solvers to utilize the same retcode handling code. This means that we have unified exit warning messages and the resulting retcodes. Each package should act the same for the common retcodes.

## Fixed order variable time step Adams methods

Shubham Maddhashiya (@sipah00) contributed a variety of new adaptive Adams-Bashforth and Adams-Bashforth-Moulton methods. These methods are fixed order 3-5 which minimize function evaluations and are designed for large non-stiff ODE discretizations. They utilize Runge-Kutta methods to hotstart the Adams methods, making them more efficient than variable order versions when only lower orders are required or when there are a lot of events.

## ABDF2

Yingbo Ma (@YingboMa) contributed ABDF2, an adaptive implementation of the Backwards Differentiation Formula (BDF) order 2 method. BDF schemes are the go-to choice for PDE discretizations since they only have one step (one nonlinear equation to solve) for each time step, minimizing the number of function calculations. Unlike adaptive order BDF discretizations, this adaptive BDF2 is A-B-L-stable, meaning that it should be stable for any stiff ODE that is thrown at it. This makes it a nice testing or anchor method: one that can always be relied on to do well-enough.

# In development

A lot of the next developments will come from our GSoC students. Here’s a list of things we are aiming for:

• SABDF2, which is a strong order 0.5 adaptive BDF2 implementation for stochastic differential equations which is order 2 for small noise SDEs. This will be the first implicit adaptive integrator for small noise SDEs and will be a great choice for SPDEs.

• Adaptive order Adams-Bashforth-Moulton. This will be JuliaDiffEq’s native Julia implementation of an AOAT Adams method. It will utilize variable coefficient formulas like Shampine’s ddeabm which has been shown in sources like Hairer’s Solving Ordinary Differential Equations to be more efficient than the more standard CVODE_Adams since it’s more easily able to utilize higher order steps.

• Adaptive order Nordsieck methods. Nordsieck methods are the special implementation multistep methods which Sundials’ CVODE uses. This implementation utilizes a fixed leading coefficient which makes it more optimized for solving large PDE discretizations since it can re-use the Jacobian between steps while adapting time steps. Other problem solving environments such as MATLAB and SciPy utilize quasi-fixed timesteps to get a similar benefit, but this has the added cost of fixing time steps for many steps which reduces stepping efficiency. The reason this is done is simple: Nordsieck implementations are hard which is why the only existing ones (that I know of) are EPISODE and VODE/CVODE (and VODE is an adaption of EPISODE, so it’s really one code!). However, our GSoC student has been hammering away at this for months and we’ve made great progress, with the fixed order Adams Nordsieck method having already merged. The last step is to figure out order adaptivity and then the translation to BDF coefficients is trivial. While this methodology isn’t as optimized for non-stiff ODEs in its Adams form, this BDF form will likely be the new goto method in DiffEq for large stiff PDE discretizations.

• Until exponential integrators! Xingjian Guo (@MSeeker1340) has been doing an extensive study of the numerical implementations of expmv and phimv for building efficient exponential integrators. If you’re curious, you can read up on some of the discussions and here. He is quite close to having both efficient and numerically stable methods for lazy adaptive Krylov expmv and phimv which will allow for fast c alculations of exponential integrators without computing full matrix exponentials. This will then be used in the current exponential integrator implementations, along with the adaptive high order EPIRK methods. This class of integrators will be one to keep aware of if you’re interested in time-dependent PDEs. It will be great to compare and contrast between these methods and BDF integrators in these problems.

• Yiannis Simillides (@ysimillides) keeps making improvements to FEniCS.jl. At this part a large portion (a majority?) of the tutorial works from Julia.

• Vaibhav Dixit (@Vaibhavdixit02) finished most of the parameter estimation methods on our wish list, so he’s onto implementing global sensitivity analysis methods, starting with the Morris method and then going on to the eFAST and Sobol method.

• Mikhail Vaganov (@Mikhail-Vaganov) is making good progress on his N-body modeling language. This will make it easy to utilize DiffEq as a backend for molecular dynamics simulation. Follow the progress in DiffEqPhysics.jl

And here’s a quick view of the rest of our “in development” list:

• Preconditioner choices for Sundials methods
• Adaptivity in the MIRK BVP solvers
• More general Banded and sparse Jacobian support outside of Sundials
• IMEX methods
• Function input for initial conditions and time span (u0(p,t0))
• LSODA integrator interface

# Projects

Are you a student who is interested in working on differential equations software and modeling? If so, please get in touch with us since we may have some funding after August for some student developers to contribute towards some related goals. It’s not guaranteed yet, but getting in touch never hurts!


text:
Thursday, October 23, 2014

 Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía

## Recursos de colección

Project Euclid (Hosted at Cornell University Library) (177,355 recursos)

Mostrando recursos 1 - 20 de 32

1. Change-point estimation from indirect observations. 2. Adaptation - Goldenshluger, A.; Juditsky, A.; Tsybakov, A.; Zeevi, A.
We focus on the problem of adaptive estimation of signal singularities from indirect and noisy observations. A typical example of such a singularity is a discontinuity (change-point) of the signal or of its derivative. We develop a change-point estimator which adapts to the unknown smoothness of a nuisance deterministic component and to an unknown jump amplitude. We show that the proposed estimator attains optimal adaptive rates of convergence. A simulation study demonstrates reasonable practical behavior of the proposed adaptive estimates.

2. Change-point estimation from indirect observations. 1. Minimax complexity - Goldenshluger, A.; Juditsky, A.; Tsybakov, A. B.; Zeevi, A.
We consider the problem of nonparametric estimation of signal singularities from indirect and noisy observations. Here by singularity, we mean a discontinuity (change-point) of the signal or of its derivative. The model of indirect observations we consider is that of a linear transform of the signal, observed in white noise. The estimation problem is analyzed in a minimax framework. We provide lower bounds for minimax risks and propose rate-optimal estimation procedures.

3. On suprema of Lévy processes and application in risk theory - Song, Renming; Vondraček, Zoran
Let X̂=C−Y where Y is a general one-dimensional Lévy process and C an independent subordinator. Consider the times when a new supremum of X̂ is reached by a jump of the subordinator C. We give a necessary and sufficient condition in order for such times to be discrete. When this is the case and X̂ drifts to −∞, we decompose the absolute supremum of X̂ at these times, and derive a Pollaczek–Hinchin-type formula for the distribution function of the supremum.

4. Near-minimal spanning trees: A scaling exponent in probability models - Aldous, David J.; Bordenave, Charles; Lelarge, Marc
We study the relation between the minimal spanning tree (MST) on many random points and the “near-minimal” tree which is optimal subject to the constraint that a proportion δ of its edges must be different from those of the MST. Heuristics suggest that, regardless of details of the probability model, the ratio of lengths should scale as 1+Θ(δ2). We prove this scaling result in the model of the lattice with random edge-lengths and in the Euclidean model.

5. Hitting time of a corner for a reflected diffusion in the square - Delarue, F.
We discuss the long time behavior of a two-dimensional reflected diffusion in the unit square and investigate more specifically the hitting time of a neighborhood of the origin. ¶ We distinguish three different regimes depending on the sign of the correlation coefficient of the diffusion matrix at the point 0. For a positive correlation coefficient, the expectation of the hitting time is uniformly bounded as the neighborhood shrinks. For a negative one, the expectation explodes in a polynomial way as the diameter of the neighborhood vanishes. In the null case, the expectation explodes at a logarithmic rate. As a by-product, we establish...

6. Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case - Erlihson, Michael M.; Granovsky, Boris L.
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, ak∼Ckp−1, k→∞, p>0, where C is a positive constant. The measures considered are associated with the generalized Maxwell–Boltzmann models in statistical mechanics, reversible coagulation–fragmentation processes and combinatorial structures, known as assemblies. We prove a central limit theorem for fluctuations of a properly scaled partition chosen randomly according to the above measure, from its limit shape. We demonstrate that when the component size passes beyond the threshold value, the independence of numbers of components transforms into their conditional...

7. A lattice gas model for the incompressible Navier–Stokes equation - Beltrán, J.; Landim, C.
We recover the Navier–Stokes equation as the incompressible limit of a stochastic lattice gas in which particles are allowed to jump over a mesoscopic scale. The result holds in any dimension assuming the existence of a smooth solution of the Navier–Stokes equation in a fixed time interval. The proof does not use nongradient methods or the multi-scale analysis due to the long range jumps.

8. Random permutations and unique fully supported ergodicity for the Euler adic transformation - Frick, Sarah Bailey; Petersen, Karl
There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the Eulerian numbers. This result may partially justify a frequent assumption about the equidistribution of random permutations.

9. Asymptotic Feynman–Kac formulae for large symmetrised systems of random walks - Adams, Stefan; Dorlas, Tony
We study large deviations principles for N random processes on the lattice ℤd with finite time horizon [0, β] under a symmetrised measure where all initial and terminal points are uniformly averaged over random permutations. That is, given a permutation σ of N elements and a vector (x1, …, xN) of N initial points we let the random processes terminate in the points (xσ(1), …, xσ(N)) and then sum over all possible permutations and initial points, weighted with an initial distribution. We prove level-two large deviations principles for the mean of empirical path measures, for the mean of paths and...

10. Uniform deterministic equivalent of additive functionals and non-parametric drift estimation for one-dimensional recurrent diffusions - Loukianova, D.; Loukianov, O.
Usually the problem of drift estimation for a diffusion process is considered under the hypothesis of ergodicity. It is less often considered under the hypothesis of null-recurrence, simply because there are fewer limit theorems and existing ones do not apply to the whole null-recurrent class. ¶ The aim of this paper is to provide some limit theorems for additive functionals and martingales of a general (ergodic or null) recurrent diffusion which would allow us to have a somewhat unified approach to the problem of non-parametric kernel drift estimation in the one-dimensional recurrent case. As a particular example we obtain the rate of...

11. A local limit theorem with speed of convergence for Euclidean algorithms and diophantine costs - Baladi, Viviane; Hachemi, Aïcha
For large N, we consider the ordinary continued fraction of x=p/q with 1≤p≤q≤N, or, equivalently, Euclid’s gcd algorithm for two integers 1≤p≤q≤N, putting the uniform distribution on the set of p and qs. We study the distribution of the total cost of execution of the algorithm for an additive cost function c on the set ℤ+* of possible digits, asymptotically for N→∞. If c is nonlattice and satisfies mild growth conditions, the local limit theorem was proved previously by the second named author. Introducing diophantine conditions on the cost, we are able to control the speed of convergence in the...

12. Joint continuity of the local times of fractional Brownian sheets - Ayache, Antoine; Wu, Dongsheng; Xiao, Yimin
Let BH={BH(t), t∈ℝ+N} be an (N, d)-fractional Brownian sheet with index H=(H1, …, HN)∈(0, 1)N defined by BH(t)=(BH1(t), …, BHd(t)) (t∈ℝ+N), where BH1, …, BHd are independent copies of a real-valued fractional Brownian sheet B0H. We prove that if d<∑ℓ=1NH−1, then the local times of BH are jointly continuous. This verifies a conjecture of Xiao and Zhang (Probab. Theory Related Fields 124 (2002)). ¶ We also establish sharp local and global Hölder conditions for the local times of BH. These results are applied to study analytic and geometric properties of the sample paths of BH.

13. On mean central limit theorems for stationary sequences - Dedecker, Jérôme; Rio, Emmanuel
In this paper, we give estimates of the minimal ${\mathbb{L}}^{1}$ distance between the distribution of the normalized partial sum and the limiting Gaussian distribution for stationary sequences satisfying projective criteria in the style of Gordin or weak dependence conditions.

14. On homogenization of space-time dependent and degenerate random flows II - Rhodes, Rémi
We study the long time behavior (homogenization) of a diffusion in random medium with time and space dependent coefficients. The diffusion coefficient may degenerate. In Stochastic Process. Appl. (2007) (to appear), an invariance principle is proved for the critical rescaling of the diffusion. Here, we generalize this approach to diffusions whose space-time scaling differs from the critical one.

15. Limit laws for the energy of a charged polymer - Chen, Xia
In this paper we obtain the central limit theorems, moderate deviations and the laws of the iterated logarithm for the energy ¶ Hn=∑1≤jωjωk1{Sj=Sk} ¶ of the polymer {S1, …, Sn} equipped with random electrical charges {ω1, …, ωn}. Our approach is based on comparison of the moments between Hn and the self-intersection local time ¶ Qn=∑1≤j1{Sj=Sk} ¶ run by the d-dimensional random walk {Sk}. As partially needed for our main objective and partially motivated by their independent interest, the central limit theorems and exponential integrability for Qn are also investigated in the case d≥3.

16. Identification of periodic and cyclic fractional stable motions - Pipiras, Vladas; Taqqu, Murad S.
We consider an important subclass of self-similar, non-Gaussian stable processes with stationary increments known as self-similar stable mixed moving averages. As previously shown by the authors, following the seminal approach of Jan Rosiński, these processes can be related to nonsingular flows through their minimal representations. Different types of flows give rise to different classes of self-similar mixed moving averages, and to corresponding general decompositions of these processes. Self-similar stable mixed moving averages related to dissipative flows have already been studied, as well as processes associated with identity flows which are the simplest type of conservative flows. The focus here is...

17. Skew-product representations of multidimensional Dunkl Markov processes - Chybiryakov, Oleksandr
In this paper we obtain skew-product representations of the multidimensional Dunkl processes which generalize the skew-product decomposition in dimension 1 obtained in L. Gallardo and M. Yor. Some remarkable properties of the Dunkl martingales. Séminaire de Probabilités XXXIX, 2006. We also study the radial part of the Dunkl process, i.e. the projection of the Dunkl process on a Weyl chamber.

18. Invariance principles for random walks conditioned to stay positive - Caravenna, Francesco; Chaumont, Loïc
Let {Sn} be a random walk in the domain of attraction of a stable law $\mathcal{Y}$ , i.e. there exists a sequence of positive real numbers (an) such that Sn/an converges in law to $\mathcal{Y}$ . Our main result is that the rescaled process (S⌊nt⌋/an, t≥0), when conditioned to stay positive, converges in law (in the functional sense) towards the corresponding stable Lévy process conditioned to stay positive. Under some additional assumptions, we also prove a related invariance principle for the random walk killed at its first entrance in the negative half-line and conditioned to die at zero.

19. Stabilité du comportement des marches aléatoires sur un groupe localement compact - Gretete, Driss
Dans cet article nous démontrons un théorème de stabilité des probabilités de retour sur un groupe localement compact unimodulaire, séparable et compactement engendré. Nous démontrons que le comportement asymptotique de F*(2n)(e) ne dépend pas de la densité F sous des hypothèses naturelles. A titre d’exemple nous établissons que la probabilité de retour sur une large classe de groupes résolubles se comporte comme exp(−n1/3).

20. LAMN property for hidden processes: The case of integrated diffusions - Gloter, Arnaud; Gobet, Emmanuel
In this paper we prove the Local Asymptotic Mixed Normality (LAMN) property for the statistical model given by the observation of local means of a diffusion process X. Our data are given by ∫01X(s+i)/n dμ(s) for i=0, …, n−1 and the unknown parameter appears in the diffusion coefficient of the process X only. Although the data are neither Markovian nor Gaussian we can write down, with help of Malliavin calculus, an explicit expression for the log-likelihood of the model, and then study the asymptotic expansion. We actually find that the asymptotic information of this model is the same one as for...


text:
# Custom Configuration File Reference

This is the reference for config file definitions. It is useful for developing applications that has configurable components for the Vespa Container, where configuration for individual components may be provided by defining <config> elements within the component's scope in services.xml.

## Config definition files

Config definition files are part of the source code of your application and have a .def suffix. Each file defines and documents the content and semantics of one configuration type. Vespa's builtin .def files are found in \$VESPA_HOME/share/vespa/configdefinitions/.

### Package

Package is a mandatory statement that is used to define the package for the java class generated to represent the file. For container component developers, it is recommended to use a separate package for each bundle that needs to export config classes, to avoid conflicts between bundles that contain configurable components. Package must be the first non-comment line, and can only contain lower-case characters and dots:

package=com.mydomain.mypackage

### Parameter names

Config definition files contain lines on the form:

parameterName type [default=value] [range=[min,max]]

camelCase in parameter names is recommended for readability.

### Parameter types

Supported types for variables in the .def file:

int 32 bit signed integer value 64 bit signed integer value 64 bit IEEE float value Enumerated types. A set of strings representing the valid values for the parameter, e.g: foo enum {BAR, BAZ, QUUX} default=BAR  A boolean (true/false) value A String value. Default values must be enclosed in quotation marks (" "), and any internal quotation marks must be escaped by backslash. Likewise, newlines must be escaped to \n A path to a physical file in the application package. This makes it possible to access files from the application package in container components. Path parameters cannot have default values, so the path must be given in services.xml. The path to the file is relative to the root of the application package. The content will be available as a java.nio.file.Path instance when the component accessing this config is constructed. Similar to path, an arbitrary URL of a file that should be downloaded and made available to container components. The file content will be available as a java.io.File instance when the component accessing this config is constructed. Note that if the file takes a long time to download, it will also take a long time for the container to come up with the configuration referencing it. A config-id to another configuration (only for internal vespa usage)

### Structs

Structs are used to group a number of parameters that naturally belong together. A struct is declared by adding a '.' between the struct name and each member's name:

basicStruct.foo string
basicStruct.bar int

### Arrays

Arrays are declared by appending square brackets to the parameter name. Arrays can either contain simple values, or have children. Children can be simple parameters and/or structs and/or other arrays. Arbitrarily complex structures can be built to any depth. Examples:

intArr[] int                        # Integer value array
row[].column[] int                  # Array of integer value arrays
complexArr[].foo string             # Complex array that contains
complexArr[].bar double             # … two simple parameters
complexArr[].coord.x int            # … and a struct called 'coord'
complexArr[].coord.y int
complexArr[].coord.depths[] double  # … that contains a double array

Note that arrays cannot have default values, even for simple value arrays. An array that has children cannot contain simple values, and vice versa. In the example above, intArr and row.column could not have children, while row and complexArr are not allowed to contain values.

### Maps

Maps are declared by appending curly brackets to the parameter name. Arbitrarily complex structures are supported also here. Examples:

myMap{} int
complexMap{}.nestedMap{}.id int
complexMap{}.nestedMap{}.name string

## Generic configuration in services.xml

services.xmlhas four types of elements:

individual service elements (e.g. searcher, handler, searchnode) - creates a service, but has no child elements that create services (e.g. content, container, document-processing - creates a group of services and can have all types of child elements (e.g. accesslog) - configures a service or a group of services and can only have other dedicated config elements as children always named config
Generic config elements can be added to most elements that lead to one or more services being created - i.e. service group elements and individual service elements. The config is then applied to all services created by that element and all descendant elements.

For example, by adding config for container, the config will be applied to all container components in that cluster. Config at a deeper level has priority, so this config can be overridden for individual components by setting the same config values in e.g. handler or server elements.

Given the following config definition, let's say its name is example.def:

package=com.mydomain.example

stringVal string
myArray[].name string
myArray[].type enum {T1, T2, T3} default=T1
myArray[].intArr[] int
myMap{} string
basicStruct.foo string
basicStruct.bar int default=0 range=[-100,100]
boolVal bool
myFile path
myUrl url

To set all the values for this config in services.xml, add the following xml at the desired element:
<config name="com.mydomain.example">
<stringVal>val</stringVal>
<myArray>
<item>
<name>elem_0</name>
<type>T2</type>
<intArr>
<item>0</item>
<item>1</item>
</intArr>
</item>
<item>
<name>elem_1</name>
<type>T3</type>
<intArr>
<item>0</item>
<item>1</item>
</intArr>
</item>
</myArray>
<myMap>
<item key="key1">val1</item>
<item key="key2">val2</item>
</myMap>
<basicStruct>
<foo>str</foo>
<bar>3</bar>
</basicStruct>
<boolVal>true</boolVal>
<myFile>components/file1.txt</myFile>
<myUrl>https://docs.vespa.ai/en/reference/query-api-reference.html</myUrl>
</config>

Note that each '.' in the parameter's definition corresponds to a child element in the xml. It is not necessary to set values that already have a default in the .def file, if you want to keep the default value. Hence, in the example above, basicStruct.bar and myArray[].type could have been ommited in the xml without generating any errors when deploying the application.

### Configuring arrays

Assigning values to arrays is done by using the <item> element. This ensures that the given config values do not overwrite any existing array elements from higher-level xml elements in services, or from Vespa itself.


text:
## A dragster starts from rest and accelerates down a track. Each tire has a radius of 0.320 m and rolls without slipping. At a distance of 389 m, the angular speed of the wheels is 286 rad/s. Determine (a) the linear speed of the dragster and (b) the magnit

A dragster starts from rest and accelerates down a track. Each tire has a radius of 0.320 m and rolls without slipping. At a distance of 389 m, the angular speed of the wheels is 286 rad/s. Determine (a) the linear speed of the dragster and (b) the magnitude of the angular acceleration of its wheels.


text:
# What is the probability that one random selected pair of batteries will have a test life between 20 and 24 hours?  Standard normal distribution question: A popular flashlight that uses two D-size batteries was selected, and several of the same models were purchased to test the "continous use-life" of D batteries. To determine the flashlight, the flashlight was turned on and the time noted. When the flashlight no longer produced light, the time was again noted. The resulting "life" data from the batteries had a mean of 22.5 hours. Assume these values have a normal distribution with a standard deviation of 1.58 hours. A. What is the probability that one random selected pair of batteries will have a test life between 20 and 24 hours? B. What is the probability that a randomly selected sample of 20 pairs of batteries will have a mean test life between 21 and 22 hours?

We are given that the population mean for the battery life is `mu=22.5` with a population standard deviation of `sigma=1.58`, and that the population is approximately normal .

(1) Find the probability that a pair of batteries lasts between 20 and 24 hours, or `P(20<X<24)` :

To find the probability...

Start your 48-hour free trial to unlock this answer and thousands more. Enjoy eNotes ad-free and cancel anytime.

We are given that the population mean for the battery life is `mu=22.5` with a population standard deviation of `sigma=1.58`, and that the population is approximately normal .

(1) Find the probability that a pair of batteries lasts between 20 and 24 hours, or `P(20<X<24)` :

To find the probability that a single data point lies on an interval, we convert to a standard score and solve the resulting probability question. Since we know the population standard deviation, we use the `z` table (standard normal table).

To normalize a data point we use `z=(X-mu)/sigma` so:

`z_(20)=(20-22.5)/1.58~~-1.58` and `z_(24)=(24-22.5)/1.58~~0.95`

-- the `z` score is the number of standard deviations that a given datum is above (positive) or below (negative) the mean; thus a `z` score of -1.58 indicates that 20 is about 1.58 standard deviations below the mean of 22.5

So `P(20<X<24)=P(-1.58<z<0.95)`

Consulting the standard normal table, we find that the area under the curve to the left of `z=-1.58` is .0571 while the area under the curve to the left of 0.95 is .8289. Thus the probability that a z-score is between these values is .8289-.0571=.7718 (a graphing calculator gives .7719)

-------------------------------------------------------------------

The probability that a pair of batteries lasts between 20 and 24 hours is approximately .7719

-----------------------------------------------------------------

(2) Find the probability that a randomly selected sample of 20 pairs has a mean life between 21 and 22 hours.

Note that this is a fundamentally different question. For individuals there is great variability; while for samples (at least random samples of sufficient size) there is much less variability. However, we approach the problem in a similar manner.

To convert to a standard score, we use `z=(bar(x)-mu)/(sigma/sqrt(n))` . Note the correction factor in the denominator.

So `z_21=(21-22.5)/(1.58/sqrt(20))~~-4.25` and `z_22=(22-22.5)/(1.58/sqrt(20))~~-1.42`

So `P(21<bar(x)<22)=P(-4.24<z<-1.42)`

Consulting the standard normal table, we see that for `z` below -3.5 we use .0001, while the area beneath the curve to the left of -1.42 is .0778. Thus the area between them is .0778-.0001=.0777 (A graphing calculator gives me .0778 using the approximations for `z` )

----------------------------------------------------------------

The probability that the mean of 20 randomly selected samples has a mean between 21 and 22 is .0777

------------------------------------------------------------------

Approved by eNotes Editorial Team


text:
# 2.5 Constrained approximation and mixed criteria  (Page 3/10)

 Page 3 / 10
$\mathcal{L}\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\frac{1}{\pi }{\int }_{0}^{\pi }W\left(\omega \right)\phantom{\rule{0.166667em}{0ex}}{\left(A\left(\omega \right)-{A}_{d}\left(\omega \right)\right)}^{2}\phantom{\rule{0.166667em}{0ex}}d\omega +\sum _{i}{\mu }_{i}\phantom{\rule{0.166667em}{0ex}}\left(A,\left({\omega }_{i}\right),-,{A}_{d},\left({\omega }_{i}\right),±,T,\left({\omega }_{i}\right)\right)$

with a corresponding derivative of

$\frac{d\mathcal{L}}{d\phantom{\rule{0.166667em}{0ex}}a\left(n\right)}\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\frac{2}{\pi }\int \left(W,\left(\omega \right),\phantom{\rule{0.166667em}{0ex}},\left(,A,\left(\omega \right),-,{A}_{d},\left(\omega \right)\right)\frac{dA}{da}\phantom{\rule{0.166667em}{0ex}}d\omega +{\left(\sum _{i},{\mu }_{i},\frac{dA}{da}|}_{{\omega }_{i}}$

The integral cannot be carried out analytically for a general weighting function, but if the weight function is constant over each subband, Equation 47 from Least Squared Error Design of FIR Filters can be written

$\frac{d\mathcal{L}}{d\phantom{\rule{0.166667em}{0ex}}a\left(n\right)}\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\frac{2}{\pi }\sum _{k}{\int }_{{\omega }_{k}}^{{\omega }_{k+1}}\left({W}_{k},\phantom{\rule{0.166667em}{0ex}},\left(\sum _{m=1}^{M}a\left(m\right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega m\right)+K\phantom{\rule{0.166667em}{0ex}}a\left(0\right)-{A}_{d}\left(\omega \right)\right)\right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega n\right)\phantom{\rule{0.166667em}{0ex}}d\omega +{\left(\sum _{i},{\mu }_{i},\frac{dA}{da}|}_{{\omega }_{i}}$

which after rearranging is

$=\sum _{m=1}^{M}\left[\frac{2}{\pi },\sum _{k},{W}_{k},{\int }_{{\omega }_{k}}^{{\omega }_{k+1}},\left(cos\left(\omega m\right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega n\right)\right),\phantom{\rule{0.166667em}{0ex}},d,\omega \right]\phantom{\rule{0.166667em}{0ex}}a\left(m\right)$
$-\frac{2}{\pi }\sum _{k}{W}_{k}{\int }_{{\omega }_{k}}^{{\omega }_{k+1}}{A}_{d}\left(\omega \right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega n\right)\phantom{\rule{0.166667em}{0ex}}d\omega +\sum _{i}{\mu }_{i}cos\left({\omega }_{i}n\right)\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}0$

where the integral in the first term can now be done analytically. In matrix notation Equation 49 from Least Squared Error Design of FIR Filters is

$\mathbf{R}\phantom{\rule{0.166667em}{0ex}}\mathbf{a}-{\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}+\mathbf{H}\phantom{\rule{0.166667em}{0ex}}\mu \phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\mathbf{0}$

This is a similar form to that in the multiband paper where the matrix $\mathbf{R}$ gives the effects of weighting with elements

$r\left(n,m\right)\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\frac{2}{\pi }\sum _{k}{W}_{k}{\int }_{{\omega }_{k}}^{{\omega }_{k+1}}\left(cos\left(\omega m\right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega n\right)\right)\phantom{\rule{0.166667em}{0ex}}d\omega$

except for the first row which should be divided by $2\phantom{\rule{0.166667em}{0ex}}K$ because of the normalizing of the $a\left(0\right)$ term in Equation 49 from FIR Digital Filters and [link] and the first column which should be multiplied by $K$ because of Equation 51 from FIR Digital Filters and [link] . The matrix $\mathbf{R}$ is a sum of a Toeplitz matrix and a Hankel matrix and this fact might be used to advantage and ${\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}$ is the vector of modified filter parameters with elements

${a}_{{d}_{w}}\left(n\right)\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\frac{2}{\pi }\sum {W}_{k}{\int }_{{\omega }_{k}}^{{\omega }_{k+1}}{A}_{d}\left(\omega \right)\phantom{\rule{0.166667em}{0ex}}cos\left(\omega n\right)\phantom{\rule{0.166667em}{0ex}}d\omega$

and the matrix $\mathbf{H}$ is the same as used in [link] and defined in [link] . Equations Equation 50 from Least Squared Error Design of FIR Filters and [link] can be written together as a matrix equation

$\left[\begin{array}{cc}\mathbf{R}& \mathbf{H}\\ \mathbf{G}& \mathbf{0}\end{array}\right]\left[\begin{array}{c}\mathbf{a}\\ \mu \end{array}\right]\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}\left[\begin{array}{c}{\mathbf{a}}_{{d}_{w}}\\ {\mathbf{A}}_{c}\end{array}\right]$

The solutions to Equation 50 from Least Squared Error Design of FIR Filters and [link] or to [link] are

$\begin{array}{ccc}\hfill \mu & =& {\left(\mathbf{G}{\mathbf{R}}^{-1}\mathbf{H}\right)}^{-1}\left({\mathbf{GR}}^{-1}{\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}-{\mathbf{A}}_{\mathbf{c}}\right)\hfill \end{array}$
$\begin{array}{ccc}\hfill \mathbf{a}& =& {\mathbf{R}}^{-1}\left({\mathbf{a}}_{{d}_{w}}-\mathbf{H}\phantom{\rule{0.166667em}{0ex}}\mu \right)\hfill \end{array}$

which are ideally suited to a language like Matlab and are implemented in the programs at the end of this book.

Since the solution of $\mathbf{R}\phantom{\rule{0.166667em}{0ex}}{\mathbf{a}}_{\mathbf{u}}={\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}$ is the optimal unconstrained weighted least squares filter, we can write [link] and [link] in the form

$\begin{array}{ccc}\hfill \mu & \phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}& {\left(\mathbf{G}{\mathbf{R}}^{-1}\mathbf{H}\right)}^{-1}\left(\mathbf{G}\phantom{\rule{0.166667em}{0ex}}{\mathbf{a}}_{\mathbf{u}}-{\mathbf{A}}_{\mathbf{c}}\right)\phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}{\left(\mathbf{G}{\mathbf{R}}^{-1}\mathbf{H}\right)}^{-1}\left({\mathbf{A}}_{\mathbf{u}}-{\mathbf{A}}_{\mathbf{c}}\right)\hfill \end{array}$
$\begin{array}{ccc}\hfill \mathbf{a}& \phantom{\rule{0.166667em}{0ex}}=\phantom{\rule{0.166667em}{0ex}}& {\mathbf{a}}_{u}-{\mathbf{R}}^{-1}\mathbf{H}\phantom{\rule{0.166667em}{0ex}}\mu \hfill \end{array}$

## The exchange algorithms

This Lagrange multiplier formulation together with applying the Kuhn-Tucker conditions are used in an iterative multiple exchange algorithm similar tothe Remez exchange algorithm to give the complete design method.

One version of this exchange algorithm applies to the problem posed by Adams with specified pass and stopband edges and with zero error weightingin the transition band. This problem has the structure of a quadratic programming problem and could be solved using general QP methods but themultiple exchange algorithm suggested here is probably faster.

The second version of this exchange algorithm applies to the problem where there is no explicitly specified transition band. This problem is notstrictly a quadratic programming problem and our exchange algorithm has no proof of convergence (the HOS algorithm also has no proof of convergence).However, in practice, this program has proven to be robust and converges for a wide variety of lengths, constraints, weights, andband edges. The performance is completely independent of the normalizing parameter $K$ . Notice that the inversion of the $\mathbf{R}$ matrix is done once and does not have to be done each iteration. The details of theprogram are included in the filter design paper and in the Matlab program at the end of this book.

what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
Tarell
what is the actual application of fullerenes nowadays?
Damian
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
Got questions? Join the online conversation and get instant answers!


text:
ABSTRACT
<p> The authors give an online algorithm for computing a canonical signed digit representation of minimal Hamming weight for any integer n. Using combinatorial techniques, the probability distributions Pr(K/sub r/=h), where K/sub r/ is taken to be a random variable on the uniform probability space of k-digit integers is computed. Also, using a Markov chain analysis, it is shown that E(K/sub r/) approximately (r-1)k/(r+1) as k to infinity.</p>
INDEX TERMS
signed digit representations; minimal Hamming weight; online algorithm; combinatorial techniques; probability distributions; random variable; uniform probability space; k-digit integers; Markov chain analysis; digital arithmetic.
CITATION
S. Arno, F.S. Wheeler, "Signed Digit Representations of Minimal Hamming Weight", IEEE Transactions on Computers, vol. 42, no. , pp. 1007-1010, August 1993, doi:10.1109/12.238495
CITATIONS
SHARE
102 ms
(Ver 3.3 (11022016))