- SIPTA News - lists.sipta.org

[SIPTA] AlCoB 2019: submission deadline extended to January 19
by IRDTA Jan. 8, 2019

Jan. 8, 2019

1 0

[SIPTA] BigDat 2019: regular registration January 4
by IRDTA Jan. 2, 2019

Jan. 2, 2019

1 0

[SIPTA] Fw: Paper submission and registration now open: IFSA - NAFIPS 2019
by Kreinovich Jan. 1, 2019

Jan. 1, 2019

FYI, papers related to imprecise probabilities -- especially fuzzy-valued -- are always welcome at this series of conferences ________________________________________ From: Ralph Baker Kearfott <rbk5287(a)louisiana.edu> Sent: Monday, December 31, 2018 4:00 PM Please distribute the following Baker -------------------------------------------------------------- Colleagues: Paper submission and registration are currently available for the 2019 International Fuzzy Systems Association World Congress, held jointly with the annual meeting of the North American Fuzzy Information Processing Society, June 18-22, 2019 in Lafayette, Louisiana. See https://interval.louisiana.edu/IFSA-NAFIPS/index.html for details, including special sessions, keynote speakers, instructions for authors, and on-line registration. The conference will take place a week before the New Orleans FUZZ-IEEE conference. Shuttles from Lafayette to New Orleans will be scheduled. The 12-th International Workshop on Constraint Programming and Decision Making will be held at the conference venue a day before the conference; a nominal registration fee will be collected on-site. There will also be a summer school, given by Ildar Batyrshin, on an Introduction to General Theory of Similarity and Association Functions, to be held during the first two days of the conference, with separate registration, dinner, and discussion. Details will appear shortly. Sincerely, Ralph Baker Kearfott, co-chair IFSA-NAFIPS 2019 --------------------------------------------------------------

1 0

[SIPTA] Vacancies at Utrecht University
by Cassio P. de Campos Dec. 30, 2018

Dec. 30, 2018

6 Assistant Professors in Information and Computing Sciences (Tenure Track 0.8 - 1.0 FTE) https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs Job description Due to our successful teaching programmes and our ambitions in research, the Department of Information and Computing Sciences is expanding. We are therefore actively searching for six motivated, ambitious Assistant Professors in Information and Computing Sciences. Please note that positions offered will vary, depending on experience and expertise. You have a background in Computing and Information Sciences, preferably in the areas of Information Science, Artificial Intelligence, Data Science, Algorithms, Software, Computer Science Education and Process Management and Analytics. Excellent candidates with other areas of expertise related to our current research groups and teaching programmes are also invited to apply. You have proven ambition and talent for research. As teaching is an important and satisfying part of our work, we are searching for people with a demonstrable motivation to teach. The Department is expanding and provides a dynamic work environment. If you are excited to actively participate in shaping the department, you are very welcome to apply. One PhD candidate will be funded for you by the Department in order to start up your research. Qualifications We are looking for 6 Assistant Professors. Ideally your eligibility is exemplified by Research: PhD in Computer Science, Information Science or another relevant discipline; international publications in leading conferences and journals; experience with or good prospects for acquiring external research funds; vision on future research directions in own area of expertise; experience with or readiness to supervise PhD projects; active role in international scientific communities. Teaching: experience with and enthusiasm for teaching and student supervision; ability to teach in departmental BSc and MSc programmes; well-developed didactic skills; excellent command of the English language; experience with or willingness to use innovative teaching methods and (e-learning) technologies; vision on teaching and your own contribution to teaching. Please note that we are also interested in candidates with a focus on teaching. Leadership: play an active and cooperative role in the department and the university; willingness to organize scientific events, such as research seminars or teaching seminars; willingness to partake in departmental committees. The department finds gender balance specifically and diversity in a broader sense very important. In recent procedures we attracted a significant number of women (five out of 10 positions). We are very keen on appointing more female scientists and therefore strongly encourage qualified women to apply. Publication track record, teaching record, and acquired research funds will be weighed against the number of years of academic experience, also taking into account parental leave or a part-time work schedule. Offer We offer a position of 0.8 - 1.0 FTE. The gross salary - depending on previous qualifications and experience - ranges between €3,255 and €5,656 (scale 10/12 according to the Collective Labour Agreement Dutch Universities) gross per month for a full-time employment. Salaries are supplemented with a holiday bonus of 8 % and a year-end bonus of 8.3 % per year. We offer a pension scheme, (partly paid) parental leave, collective insurance schemes and flexible employment conditions (multiple choice model). Facilities for sports and child care are available on our campus, which is only 15 minutes away from the historical city center of Utrecht. More information is available at: working at Utrecht University. We offer you the possibility to develop towards a Basic Teaching Qualification, supported with educational development programs offered by the University. We also offer candidates the possibility to travel to conferences. We offer you the possibility to develop towards a Basic Teaching Qualification, supported with educational development programmes offered by the University. We also offer candidates the possibility to travel to conferences. About the organization A better future for everyone. This ambition motivates our scientists in executing their leading research and inspiring teaching. At Utrecht University, colleagues from various disciplines collaborate intensively towards major societal themes. Our focus is on Dynamics of Youth, Institutions for Open Societies, Life Sciences and Sustainability. The city of Utrecht is one of the oldest cities in the Netherlands, with a charming old center and an internationally oriented culture that is strongly influenced by its century-old university. Utrecht city has been consistently ranked as one of the most livable cities in the Netherlands. The Faculty of Science consists of six Departments: Biology, Pharmaceutical Sciences, Information and Computing Sciences, Physics and Astronomy, Chemistry and Mathematics. The Faculty is home to 5,900 students and nearly 1,600 staff and is internationally renowned for the quality of its research. The Faculty's academic programmes reflect developments in today's society. The Department of Information and Computing Sciences is nationally and internationally renowned for its research in Computing Science and Information Science. Current research groups are Algorithmic Data Analysis, Algorithms and Complexity, Decision Support Systems, Intelligent Systems, Simulation of Complex Systems, Multimedia, Human-Centered Computing, Geometric Computing, Process Management and Analytics, Organization and Information, Natural Language Processing, Intelligent Systems, Software Technology and Software Technology of Learning and Teaching. Relevant areas of interdisciplinary research include Game Research, Foundations of Complex Systems, Applied Data Science, Artificial Intelligence and Integrative Bioinformatics. The Department has, among others, close collaborations with the University Medical Center, the Departments of Physics and Mathematics, and the Faculties of Humanities and Geosciences. The Department offers Bachelor programmes in Computer Science and Information Science, and four English Research Master programmes in Artificial Intelligence, Business Informatics, Computing Science, and Game and Media Technology. The Department is developing Master programmes in Data Science and Interaction Technology. High enrolment figures and good student ratings make the education very successful. The Department currently comprises 15 full-time Chairs and 105 other scientific staff, including Postdocs and PhD candidates. Additional information Would you like additional information about the vacancy? This can be obtained from Prof. van Kreveld, Research Director, via M.J.vanKreveld(a)uu.nl, or from Marloes Reichardt-Buijs, HR Officer for the Department, via M.S.Reichardt-Buijs(a)uu.nl. Apply To apply, please use the button below. Please attach a letter of motivation, curriculum vitae and the (e-mail) addresses of two references. If you prefer a part-time appointment, you are also invited to apply, preferably stating the desired part-time ratio. The application deadline is 14/02/2019

1 0

[SIPTA] AlCoB 2019: 3rd call for papers
by IRDTA Dec. 24, 2018

Dec. 24, 2018

1 0

[SIPTA] Robotic 2019: early registration December 31st
by IRDTA Dec. 18, 2018

Dec. 18, 2018

1 0

[SIPTA] publish or perish
by Marco Zaffalon Dec. 18, 2018

Dec. 18, 2018

1 0

[SIPTA] BigDat 2019: regular registration January 4
by IRDTA Dec. 11, 2018

Dec. 11, 2018

1 0

[SIPTA] AlCoB 2019: 2nd call for papers
by IRDTA Dec. 4, 2018

Dec. 4, 2018

1 0

[SIPTA] WPMSIIP 2019
by COOLEN Nov. 21, 2018

Nov. 21, 2018

1 0

[SIPTA] Fw: IFSA-NAFIPS 2019 Second Call for papers
by Kreinovich Nov. 21, 2018

Nov. 21, 2018

1 0

[SIPTA] BigDat 2019: early registration December 8
by IRDTA Nov. 20, 2018

Nov. 20, 2018

1 0

Re: [SIPTA] Fwd: Are there imprecise analogues of pseudo-random number generators?
by Marco Cattaneo Nov. 17, 2018

Nov. 17, 2018

Dear all, I can only recommend the paper by Gert and Jasper, which includes several deep results about infinite sequences of 0's and 1's. However, as far as I understand, Marshall is interested in finite sequences of 0's and 1's that are generally accepted as "random", like the ones generated by PRNGs. Unfortunately, I do not know of any non-artificial way of generating such sequences for imprecise probabilities. Since iid sequences of 0's and 1's have relative frequencies that converge due to the law of large numbers, sequences for which the relative frequencies do not converge can be artificially obtained by dropping one (or both) of the two i's in iid. For instance, a sequence with relative frequency of 1's tending to oscillate between 0.6 and 0.8 can be obtained by keeping independence but varying the probability of 1's according to the following sequence: once 0.6, two times 0.9, six times 0.5, 18 times 0.9, 54 times 0.5, 162 times 0.9, and so on (alternating between 0.5 and 0.9 with block lengths increasing by threefold each time). By adding some randomness to the sequence of probabilities, this could be made less artificial, but I do not know of any work in which this kind of ideas is explicitly developed. Best wishes, Marco -----Original Message----- From: SIPTA <sipta-bounces(a)idsia.ch> On Behalf Of Gert De Cooman Sent: Tuesday, November 13, 2018 7:04 PM To: Dr. Alessandro Antonucci <alessandro(a)idsia.ch> Cc: sipta(a)idsia.ch Subject: Re: [SIPTA] Fwd: Are there imprecise analogues of pseudo-random number generators? My reply to Alessandro, building on my previous message : Precise randomness is more than convergence of the sample mean for the sequence – which is what you use in your argument – it implies also convergence to the same limit of the sample mean for any (computably selected) subsequence. (This is the notion of computable stochasticity, which is still weaker than randomness, and therefore implied by it). It is easy to see that if the extreme points are visited in a computable fashion, we can computably select subsequences whose sample mean will converge to any of the extreme points. Or arbitrarily close to any convex mixture of them. So the sequence will then not be precisely random, contrary to what you suggest. Computable randomness (in the precise case) of a sequence is the stronger property that unless you use the exact precise probability as your model for betting on the sequence of digits, you can be made to lose an unbounded amount of money by someone who bets against you using some computable strategy. It is this (martingale-theoretic) characterisation of (computable) randomness that we generalise to the imprecise case in our paper. Every good wish, Gert Prof. Gert de Cooman Universiteit Gent (ELIS–IDLab) — Durham University (Department of Mathematical Sciences) Technologiepark - Zwijnaarde 914, 9052 Zwijnaarde, Belgium t: +3292645653 — iMessage: +32496832628 e: gert.decooman(a)UGent.be w: users.ugent.be/~gdcooma > Op 13 nov. 2018, om 16:33 heeft Alessandro Antonucci <alessandro(a)idsia.ch> het volgende geschreven: > > Dear Marshall, > > For an imprecise subjectivist “the imprecision is in the eye of the > learner”. A non-stationary RNG can jump from one sampling distribution > to another but, again, this is done according to another > (second-order) distribution. The sample will be indistinguishable from > another one sampled from the marginal of that hierarchical model. The > imprecision level is basically a parameter of your learning algorithm > (e.g., s for the IDM, alpha for likelihood-based approachs), but not > something you might learn from your data. > > These are my two cents. > > Bests, > Alessandro > _________________________________ > > Alessandro Antonucci > IDSIA > Dalle Molle Institute > for Artificial Intelligence > Via Cantonale (Galleria 2) > CH-6928, Manno-Lugano, CH > > mail: alessandro(a)idsia.ch > skype: alessandro.antonucci > tel: +41 916108515 > web: www.idsia.ch/~alessandro > _________________________________ > > > ---------- Forwarded message --------- > From: Michael Smithson <Michael.Smithson(a)anu.edu.au> > Date: mar 13 nov 2018 alle ore 14:55 > Subject: Re: [SIPTA] Are there imprecise analogues of pseudo-random > number generators? > To: <alessandro.antonucci(a)gmail.com> > > > Hi Marshall, > > It isn't clear to me what you want the long-run state to be. Do you > want p(1) to settle down to having, say, a uniform distribution on > [.6,.8]? Or for the relative frequency of 1's to end up strictly > confined between .6 and .8? Or are you thinking of having p(1) fixed > at .7 and some other random variable controlling the interval width > around .7 that eventually settles on a width of .2? Or ... ? > > Kind regards, > > --Mike > > ________________________________ > From: SIPTA <sipta-bounces(a)idsia.ch> on behalf of Abrams, Marshall > <mabrams(a)uab.edu> > Sent: Tuesday, 13 November 2018 3:18:37 PM > To: sipta(a)idsia.ch > Subject: [SIPTA] Are there imprecise analogues of pseudo-random number > generators? > > I would like to ask a theoretical and practical question. (No > conference announcement here!) > > tl;dr: Are there imprecise analogues of pseudo-random number generators? > > If that question doesn't make sense, please feel free to read on, with > my thanks for doing so. (Sorry the following is so long; I was worried > that what I was asking would be unclear otherwise.) > > I am interested in imprecise chance, that is, objective imprecise > probability; this idea has been discussed in different ways by > Terrence Fine and his colleagues, Marco Cattaneo, Luke Glynn, Alan > Hajek, Suppes and Zanotti, Stephan Hartmann, Igor Gorban, and probably > others. > > In an agent-based model, (precise) chance can be modeled using a PRNG. > Can this be generalized to base an ABM on a model of imprecise chance? > I had thought this would be impossible, but now I am not so sure. A > good PRNG such as a Mersenne Twister is of course not truly chancy, > and its output even has low Kolmogorov complexity, but it's still a > good way to model chance in many contexts. Why couldn't imprecise > chance be modeled in an ABM using a deterministic algorithm as well? > > What would the output of a pseudo imprecise random number generator > (PIRNG) look like? > > Well, suppose one wrote a function that used a normal PRNG to generate > 0's and 1's with probability 0.7 for 1. Then over most large sets of > outputs, we would find the frequency of 1 to be close to 0.7, and as > we increased the size of such a set, the frequency would usually get > closer to 0.7 > > Similarly, using a PIRNG, one ought to be able to write a function > that generates 0's and 1's with (for example) an interval probability > of [0.6, 0.8] for 1. Then over most large lets of outputs, the > frequency of 1 should lie in or near [0.6, 0.8], and as we increased > the size of such a set, the frequency would remain near [0.6, 0.8] but > would usually wander without settling down to any precise value within > that interval. > > Are there known algorithms that might have this kind of behavior? Or > could this kind of behavior be simulated using PRNGs for sequences > that are not extremely long? i.e. maybe one can write a function > using a PRNG such that over the not-too-long-run, sequences would > appear to be imprecisely chancy, but they would eventually settle down > to precise values in the very very long run. That might be good > enough for some ABMs. > > Or am I just confused? (I think this is not unlikely.) > > Any suggestions about what sort of literature I should look at or what > kinds of keywords to search on would be welcome. > > [In some parts of Fierens, Rego, and Fine's "A frequentist > understanding of sets of measures" (2009), it sounds as if such a > class of algorithms might be described, at least in a loose, general > way, but if that is so, I have not understood the article well enough > to see how what's given there does so. Their model uses sequence > specified to be of intermediate Kolmogorov complexity, which itself > seems like a difficult thing to generate.] > > > Thank you! > > Marshall > > > Marshall Abrams, Associate Professor > Department of Philosophy, University of Alabama at Birmingham > Email: mabrams(a)uab.edu; Phone: (205) 996-7483; Fax: (205) 975-6610 > Mail: HB 414A, 900 13th Street South, Birmingham, AL 35294-1260; > Office: HB 418 > Website: http://members.logical.net/~marshall > > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta _______________________________________________ SIPTA mailing list SIPTA(a)idsia.ch http://mailman2.ti-edu.ch/mailman/listinfo/sipta

3 3

Re: [SIPTA] Fwd: Are there imprecise analogues of pseudo-random number generators?
by Gert De Cooman Nov. 15, 2018

Nov. 15, 2018

My reply to Alessandro, building on my previous message : Precise randomness is more than convergence of the sample mean for the sequence – which is what you use in your argument – it implies also convergence to the same limit of the sample mean for any (computably selected) subsequence. (This is the notion of computable stochasticity, which is still weaker than randomness, and therefore implied by it). It is easy to see that if the extreme points are visited in a computable fashion, we can computably select subsequences whose sample mean will converge to any of the extreme points. Or arbitrarily close to any convex mixture of them. So the sequence will then not be precisely random, contrary to what you suggest. Computable randomness (in the precise case) of a sequence is the stronger property that unless you use the exact precise probability as your model for betting on the sequence of digits, you can be made to lose an unbounded amount of money by someone who bets against you using some computable strategy. It is this (martingale-theoretic) characterisation of (computable) randomness that we generalise to the imprecise case in our paper. Every good wish, Gert Prof. Gert de Cooman Universiteit Gent (ELIS–IDLab) — Durham University (Department of Mathematical Sciences) Technologiepark - Zwijnaarde 914, 9052 Zwijnaarde, Belgium t: +3292645653 — iMessage: +32496832628 e: gert.decooman(a)UGent.be w: users.ugent.be/~gdcooma > Op 13 nov. 2018, om 16:33 heeft Alessandro Antonucci <alessandro(a)idsia.ch> het volgende geschreven: > > Dear Marshall, > > For an imprecise subjectivist “the imprecision is in the eye of the > learner”. A non-stationary RNG can jump from one sampling distribution > to another but, again, this is done according to another > (second-order) distribution. The sample will be indistinguishable from > another one sampled from the marginal of that hierarchical model. The > imprecision level is basically a parameter of your learning algorithm > (e.g., s for the IDM, alpha for likelihood-based approachs), but not > something you might learn from your data. > > These are my two cents. > > Bests, > Alessandro > _________________________________ > > Alessandro Antonucci > IDSIA > Dalle Molle Institute > for Artificial Intelligence > Via Cantonale (Galleria 2) > CH-6928, Manno-Lugano, CH > > mail: alessandro(a)idsia.ch > skype: alessandro.antonucci > tel: +41 916108515 > web: www.idsia.ch/~alessandro > _________________________________ > > > ---------- Forwarded message --------- > From: Michael Smithson <Michael.Smithson(a)anu.edu.au> > Date: mar 13 nov 2018 alle ore 14:55 > Subject: Re: [SIPTA] Are there imprecise analogues of pseudo-random > number generators? > To: <alessandro.antonucci(a)gmail.com> > > > Hi Marshall, > > It isn't clear to me what you want the long-run state to be. Do you > want p(1) to settle down to having, say, a uniform distribution on > [.6,.8]? Or for the relative frequency of 1's to end up strictly > confined between .6 and .8? Or are you thinking of having p(1) fixed > at .7 and some other random variable controlling the interval width > around .7 that eventually settles on a width of .2? Or ... ? > > Kind regards, > > --Mike > > ________________________________ > From: SIPTA <sipta-bounces(a)idsia.ch> on behalf of Abrams, Marshall > <mabrams(a)uab.edu> > Sent: Tuesday, 13 November 2018 3:18:37 PM > To: sipta(a)idsia.ch > Subject: [SIPTA] Are there imprecise analogues of pseudo-random number > generators? > > I would like to ask a theoretical and practical question. (No > conference announcement here!) > > tl;dr: Are there imprecise analogues of pseudo-random number generators? > > If that question doesn't make sense, please feel free to read on, with > my thanks for doing so. (Sorry the following is so long; I was worried > that what I was asking would be unclear otherwise.) > > I am interested in imprecise chance, that is, objective imprecise > probability; this idea has been discussed in different ways by > Terrence Fine and his colleagues, Marco Cattaneo, Luke Glynn, Alan > Hajek, Suppes and Zanotti, Stephan Hartmann, Igor Gorban, and probably > others. > > In an agent-based model, (precise) chance can be modeled using a PRNG. > Can this be generalized to base an ABM on a model of imprecise chance? > I had thought this would be impossible, but now I am not so sure. A > good PRNG such as a Mersenne Twister is of course not truly chancy, > and its output even has low Kolmogorov complexity, but it's still a > good way to model chance in many contexts. Why couldn't imprecise > chance be modeled in an ABM using a deterministic algorithm as well? > > What would the output of a pseudo imprecise random number generator > (PIRNG) look like? > > Well, suppose one wrote a function that used a normal PRNG to generate > 0's and 1's with probability 0.7 for 1. Then over most large sets of > outputs, we would find the frequency of 1 to be close to 0.7, and as > we increased the size of such a set, the frequency would usually get > closer to 0.7 > > Similarly, using a PIRNG, one ought to be able to write a function > that generates 0's and 1's with (for example) an interval probability > of [0.6, 0.8] for 1. Then over most large lets of outputs, the > frequency of 1 should lie in or near [0.6, 0.8], and as we increased > the size of such a set, the frequency would remain near [0.6, 0.8] but > would usually wander without settling down to any precise value within > that interval. > > Are there known algorithms that might have this kind of behavior? Or > could this kind of behavior be simulated using PRNGs for sequences > that are not extremely long? i.e. maybe one can write a function > using a PRNG such that over the not-too-long-run, sequences would > appear to be imprecisely chancy, but they would eventually settle down > to precise values in the very very long run. That might be good > enough for some ABMs. > > Or am I just confused? (I think this is not unlikely.) > > Any suggestions about what sort of literature I should look at or what > kinds of keywords to search on would be welcome. > > [In some parts of Fierens, Rego, and Fine's "A frequentist > understanding of sets of measures" (2009), it sounds as if such a > class of algorithms might be described, at least in a loose, general > way, but if that is so, I have not understood the article well enough > to see how what's given there does so. Their model uses sequence > specified to be of intermediate Kolmogorov complexity, which itself > seems like a difficult thing to generate.] > > > Thank you! > > Marshall > > > Marshall Abrams, Associate Professor > Department of Philosophy, University of Alabama at Birmingham > Email: mabrams(a)uab.edu; Phone: (205) 996-7483; Fax: (205) 975-6610 > Mail: HB 414A, 900 13th Street South, Birmingham, AL 35294-1260; Office: HB 418 > Website: http://members.logical.net/~marshall > > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta

3 2

Re: [SIPTA] Fwd: Are there imprecise analogues of pseudo-random number generators?
by Gert De Cooman Nov. 13, 2018

Nov. 13, 2018

Dear Marshall I refer to our paper about imprecise randomness (Computable randomness is inherently imprecise, De Cooman and De Bock) in the latest ISIPTA proceedings: https://biblio.ugent.be/publication/8531435/file/8531437.pdf In the paper we show that non-stationarity is indeed a source of imprecise randomness. We also prove a number of convergence results. All this for sequences of 0-1, which is the simplest case. We show, for instance, that alternating between a two un-fair coins with probabilities p and q for heads (in a deterministic fashion) will produce an imprecise random sequence of 0’s and 1’s with characterising probability interval [p,q]. The meaning of this is explained in the paper, but the underlying idea is that anyone using an interval betting model that does not include [p,q] - so for instance a precise r in this interval - can be made to lose an infinite amount of money in an infinite sequence of betting events on the digits in the sequence (using a computable strategy); and anywhere who uses a betting model that includes [p,q] is immune to such computable strategies. So this suggests an algorithm in the more general case: use an algorithm that visits the externe points of a credal set deterministically (eg, cyclically) , and for each visit to an extreme point, use the corresponding random generator to generate an outcome. Whether this also works in the case of more than two possible outcomes, still remains to be investigated, however. Best wishes, Gert > Op 13 nov. 2018, om 16:33 heeft Alessandro Antonucci <alessandro(a)idsia.ch> het volgende geschreven: > > Dear Marshall, > > For an imprecise subjectivist “the imprecision is in the eye of the > learner”. A non-stationary RNG can jump from one sampling distribution > to another but, again, this is done according to another > (second-order) distribution. The sample will be indistinguishable from > another one sampled from the marginal of that hierarchical model. The > imprecision level is basically a parameter of your learning algorithm > (e.g., s for the IDM, alpha for likelihood-based approachs), but not > something you might learn from your data. > > These are my two cents. > > Bests, > Alessandro > _________________________________ > > Alessandro Antonucci > IDSIA > Dalle Molle Institute > for Artificial Intelligence > Via Cantonale (Galleria 2) > CH-6928, Manno-Lugano, CH > > mail: alessandro(a)idsia.ch > skype: alessandro.antonucci > tel: +41 916108515 > web: www.idsia.ch/~alessandro > _________________________________ > > > ---------- Forwarded message --------- > From: Michael Smithson <Michael.Smithson(a)anu.edu.au> > Date: mar 13 nov 2018 alle ore 14:55 > Subject: Re: [SIPTA] Are there imprecise analogues of pseudo-random > number generators? > To: <alessandro.antonucci(a)gmail.com> > > > Hi Marshall, > > It isn't clear to me what you want the long-run state to be. Do you > want p(1) to settle down to having, say, a uniform distribution on > [.6,.8]? Or for the relative frequency of 1's to end up strictly > confined between .6 and .8? Or are you thinking of having p(1) fixed > at .7 and some other random variable controlling the interval width > around .7 that eventually settles on a width of .2? Or ... ? > > Kind regards, > > --Mike > > ________________________________ > From: SIPTA <sipta-bounces(a)idsia.ch> on behalf of Abrams, Marshall > <mabrams(a)uab.edu> > Sent: Tuesday, 13 November 2018 3:18:37 PM > To: sipta(a)idsia.ch > Subject: [SIPTA] Are there imprecise analogues of pseudo-random number > generators? > > I would like to ask a theoretical and practical question. (No > conference announcement here!) > > tl;dr: Are there imprecise analogues of pseudo-random number generators? > > If that question doesn't make sense, please feel free to read on, with > my thanks for doing so. (Sorry the following is so long; I was worried > that what I was asking would be unclear otherwise.) > > I am interested in imprecise chance, that is, objective imprecise > probability; this idea has been discussed in different ways by > Terrence Fine and his colleagues, Marco Cattaneo, Luke Glynn, Alan > Hajek, Suppes and Zanotti, Stephan Hartmann, Igor Gorban, and probably > others. > > In an agent-based model, (precise) chance can be modeled using a PRNG. > Can this be generalized to base an ABM on a model of imprecise chance? > I had thought this would be impossible, but now I am not so sure. A > good PRNG such as a Mersenne Twister is of course not truly chancy, > and its output even has low Kolmogorov complexity, but it's still a > good way to model chance in many contexts. Why couldn't imprecise > chance be modeled in an ABM using a deterministic algorithm as well? > > What would the output of a pseudo imprecise random number generator > (PIRNG) look like? > > Well, suppose one wrote a function that used a normal PRNG to generate > 0's and 1's with probability 0.7 for 1. Then over most large sets of > outputs, we would find the frequency of 1 to be close to 0.7, and as > we increased the size of such a set, the frequency would usually get > closer to 0.7 > > Similarly, using a PIRNG, one ought to be able to write a function > that generates 0's and 1's with (for example) an interval probability > of [0.6, 0.8] for 1. Then over most large lets of outputs, the > frequency of 1 should lie in or near [0.6, 0.8], and as we increased > the size of such a set, the frequency would remain near [0.6, 0.8] but > would usually wander without settling down to any precise value within > that interval. > > Are there known algorithms that might have this kind of behavior? Or > could this kind of behavior be simulated using PRNGs for sequences > that are not extremely long? i.e. maybe one can write a function > using a PRNG such that over the not-too-long-run, sequences would > appear to be imprecisely chancy, but they would eventually settle down > to precise values in the very very long run. That might be good > enough for some ABMs. > > Or am I just confused? (I think this is not unlikely.) > > Any suggestions about what sort of literature I should look at or what > kinds of keywords to search on would be welcome. > > [In some parts of Fierens, Rego, and Fine's "A frequentist > understanding of sets of measures" (2009), it sounds as if such a > class of algorithms might be described, at least in a loose, general > way, but if that is so, I have not understood the article well enough > to see how what's given there does so. Their model uses sequence > specified to be of intermediate Kolmogorov complexity, which itself > seems like a difficult thing to generate.] > > > Thank you! > > Marshall > > > Marshall Abrams, Associate Professor > Department of Philosophy, University of Alabama at Birmingham > Email: mabrams(a)uab.edu; Phone: (205) 996-7483; Fax: (205) 975-6610 > Mail: HB 414A, 900 13th Street South, Birmingham, AL 35294-1260; Office: HB 418 > Website: http://members.logical.net/~marshall > > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta > _______________________________________________ > SIPTA mailing list > SIPTA(a)idsia.ch > http://mailman2.ti-edu.ch/mailman/listinfo/sipta

1 0

[SIPTA] Fwd: Are there imprecise analogues of pseudo-random number generators?
by Alessandro Antonucci Nov. 13, 2018

Nov. 13, 2018

Dear Marshall, For an imprecise subjectivist “the imprecision is in the eye of the learner”. A non-stationary RNG can jump from one sampling distribution to another but, again, this is done according to another (second-order) distribution. The sample will be indistinguishable from another one sampled from the marginal of that hierarchical model. The imprecision level is basically a parameter of your learning algorithm (e.g., s for the IDM, alpha for likelihood-based approachs), but not something you might learn from your data. These are my two cents. Bests, Alessandro _________________________________ Alessandro Antonucci IDSIA Dalle Molle Institute for Artificial Intelligence Via Cantonale (Galleria 2) CH-6928, Manno-Lugano, CH mail: alessandro(a)idsia.ch skype: alessandro.antonucci tel: +41 916108515 web: www.idsia.ch/~alessandro _________________________________ ---------- Forwarded message --------- From: Michael Smithson <Michael.Smithson(a)anu.edu.au> Date: mar 13 nov 2018 alle ore 14:55 Subject: Re: [SIPTA] Are there imprecise analogues of pseudo-random number generators? To: <alessandro.antonucci(a)gmail.com> Hi Marshall, It isn't clear to me what you want the long-run state to be. Do you want p(1) to settle down to having, say, a uniform distribution on [.6,.8]? Or for the relative frequency of 1's to end up strictly confined between .6 and .8? Or are you thinking of having p(1) fixed at .7 and some other random variable controlling the interval width around .7 that eventually settles on a width of .2? Or ... ? Kind regards, --Mike ________________________________ From: SIPTA <sipta-bounces(a)idsia.ch> on behalf of Abrams, Marshall <mabrams(a)uab.edu> Sent: Tuesday, 13 November 2018 3:18:37 PM To: sipta(a)idsia.ch Subject: [SIPTA] Are there imprecise analogues of pseudo-random number generators? I would like to ask a theoretical and practical question. (No conference announcement here!) tl;dr: Are there imprecise analogues of pseudo-random number generators? If that question doesn't make sense, please feel free to read on, with my thanks for doing so. (Sorry the following is so long; I was worried that what I was asking would be unclear otherwise.) I am interested in imprecise chance, that is, objective imprecise probability; this idea has been discussed in different ways by Terrence Fine and his colleagues, Marco Cattaneo, Luke Glynn, Alan Hajek, Suppes and Zanotti, Stephan Hartmann, Igor Gorban, and probably others. In an agent-based model, (precise) chance can be modeled using a PRNG. Can this be generalized to base an ABM on a model of imprecise chance? I had thought this would be impossible, but now I am not so sure. A good PRNG such as a Mersenne Twister is of course not truly chancy, and its output even has low Kolmogorov complexity, but it's still a good way to model chance in many contexts. Why couldn't imprecise chance be modeled in an ABM using a deterministic algorithm as well? What would the output of a pseudo imprecise random number generator (PIRNG) look like? Well, suppose one wrote a function that used a normal PRNG to generate 0's and 1's with probability 0.7 for 1. Then over most large sets of outputs, we would find the frequency of 1 to be close to 0.7, and as we increased the size of such a set, the frequency would usually get closer to 0.7 Similarly, using a PIRNG, one ought to be able to write a function that generates 0's and 1's with (for example) an interval probability of [0.6, 0.8] for 1. Then over most large lets of outputs, the frequency of 1 should lie in or near [0.6, 0.8], and as we increased the size of such a set, the frequency would remain near [0.6, 0.8] but would usually wander without settling down to any precise value within that interval. Are there known algorithms that might have this kind of behavior? Or could this kind of behavior be simulated using PRNGs for sequences that are not extremely long? i.e. maybe one can write a function using a PRNG such that over the not-too-long-run, sequences would appear to be imprecisely chancy, but they would eventually settle down to precise values in the very very long run. That might be good enough for some ABMs. Or am I just confused? (I think this is not unlikely.) Any suggestions about what sort of literature I should look at or what kinds of keywords to search on would be welcome. [In some parts of Fierens, Rego, and Fine's "A frequentist understanding of sets of measures" (2009), it sounds as if such a class of algorithms might be described, at least in a loose, general way, but if that is so, I have not understood the article well enough to see how what's given there does so. Their model uses sequence specified to be of intermediate Kolmogorov complexity, which itself seems like a difficult thing to generate.] Thank you! Marshall Marshall Abrams, Associate Professor Department of Philosophy, University of Alabama at Birmingham Email: mabrams(a)uab.edu; Phone: (205) 996-7483; Fax: (205) 975-6610 Mail: HB 414A, 900 13th Street South, Birmingham, AL 35294-1260; Office: HB 418 Website: http://members.logical.net/~marshall _______________________________________________ SIPTA mailing list SIPTA(a)idsia.ch http://mailman2.ti-edu.ch/mailman/listinfo/sipta

1 0

[SIPTA] Are there imprecise analogues of pseudo-random number generators?
by Abrams Nov. 13, 2018

Nov. 13, 2018

3 2

[SIPTA] AlCoB 2019: 1st call for papers
by IRDTA Nov. 13, 2018

Nov. 13, 2018

1 0

[SIPTA] FW: EUSFLAT 2019 - Call for papers
by Kreinovich Nov. 10, 2018

Nov. 10, 2018

1 0

[SIPTA] FW: open position in computational science
by Kreinovich Nov. 8, 2018

Nov. 8, 2018

1 0

[SIPTA] 2018 Lotfi A. Zadeh Pioneer Award
by Kreinovich Nov. 7, 2018

Nov. 7, 2018

Dear Friends, I have just learned that Ronald R. Yager was aearded the 2018 Lotfi A. Zadeh Pioneer Award from the IEEE Systems, Man, and Cybernetics Society. The award is given to honor a person with outstanding and pioneering contributions to academic and/or industrial research in systems science and engineering, human-machine systems, and/or cybernetics. Dr. Yager is a pioneer in many areas of fuzzy research. He also had published several pioneering seminal papers on interval-valued probabilities and other imprecise probability topics. Congratulations to Dr. Yager!

1 0

[SIPTA] [UR @ FLAIRS 32] CALL FOR PAPERS
by Alessandro Antonucci Nov. 5, 2018

Nov. 5, 2018

*** Apologies for multiple postings *** Special Track on Uncertain Reasoning at Flairs 32 - Call for Papers Special Track on Uncertain Reasoning at the 32nd Florida Artificial Intelligence Research Society Conference (FLAIRS-32) May 19-22, 2019 - Sarasota, Florida (US) Paper submission deadline: November 19, 2018 Conference website: http://www.flairs-32.info Special track website: http://w3.uqo.ca/allimo01/UR_2019/ur19.html ::: Call for Papers ::: Many problems in AI (in reasoning, planning, learning, perception and robotics) require the agent to operate with incomplete or uncertain information. The objective of this track is to present and discuss a broad and diverse range of current work on uncertain reasoning, including theoretical and applied research based on different paradigms. We hope that the variety and richness of this track will help to promote cross fertilization among the different approaches for uncertain reasoning, and in this way foster the development of new ideas and paradigms. The Special Track on Uncertain Reasoning (UR) is the oldest track in FLAIRS conferences, running annually since 1996. The UR '19 Special Track at the 32nd International Florida Artificial Intelligence Research Society Conference (FLAIRS-32) is the 24th in the series. Like the past tracks, UR'19 seeks to bring together researchers working on broad issues related to reasoning under uncertainty. Papers on all aspects of uncertain reasoning are invited. Papers of particular interest include, but are not limited to: - Uncertain reasoning formalisms, calculi and methodologies - Reasoning with probability, possibility, fuzzy logic, belief function, vagueness, granularity, rough sets, and probability logics - Modeling and reasoning using imprecise and indeterminate information, such as: Choquet capacities, comparative orderings, convex sets of measures, and interval-valued probabilities - Exact, approximate and qualitative uncertain reasoning - Inference and learning with graphical models of uncertainty (e.g., Bayesian networks) - Multi-agent uncertain reasoning and decision making - Decision-theoretic planning and Markov decision process - Temporal reasoning and uncertainty; nonmonotonic reasoning; similarity-based reasoning - Conditional logics, description logic, logic programming - Argumentation - Belief change and merging - Construction of models from elicitation, data mining and knowledge discovery - Uncertain reasoning in information retrieval, filtering, fusion, diagnosis, prediction, situation assessment - Uncertain reasoning in data management - Practical applications of uncertain reasoning (e.g., machine learning, computer vision and animation) All accepted papers will be published as FLAIRS proceedings by AAAI Press. A special issue of an international journal will be devoted to extended versions of the top papers at the track. ::: Program Committee ::: : Track Chairs : - Mohand Said Allili (University of Quebec in Outaouais, Canada) - Alessandro Antonucci (IDSIA, Switzerland) - Salem Benferhat (University of Artois, France) : PC Members : - Ofer Arieli (The Academic College of Tel-Aviv, Israel) - Nizar Bouguila (Concordia University, Canada) - Cory Butz (University of Regina, Canada) - Ameur Bensefia (Higher Colleges of Technology, UAE) - Martine Ceberio (University of Texas at El Paso, US) - Sebastien Destercke (University of Technology of Compiègne, France) - Love Ekenberg (Stockholm University, Sweden) - Lluis Godo (Spanish National Research Council, Spain) - Christophe Gonzales (LIP6, France) - Ilyes Jenhani (Prince Mohammad Bin Fahd University, Saudi Arabia) - Amanda Hicks (University of Florida, US) - Sedki Karima (University of Paris 13, France) - Gabriele Kern-Isberner (Technical University of Dortmund, Germany) - Vladik Kreinovich (University of Texas at El Paso, US) - Rafael Peñaloza (Free University of Bozen-Bolzano, Italy) - Philippe Leray (University of Nantes, France) - Lalintha G. Polpitiya (University of Miami, US) - Choh Man Teng (Institute for Human and Machine Cognition, US) - Steven Schockaert (Cardiff University, UK) - Karim Tabia (Artois University, France) - Barbara Vantaggi (Sapienza University of Rome, Italy) - Ronald Yager (Iona College, USA) ::: Other Information ::: FLAIRS 32 will be held in Sarasota, Florida. Additional information on the conference location and travel planning can be found here. Feel free to write the organizers (alessandro(a)idsia.ch or MohandSaid.allili(a)uqo.ca) for any further information about the special track. ::: Submission ::: Interested authors should format their papers according to AAAI formatting guidelines. The papers should be original work (i.e., not submitted, in submission, or submitted to another conference while in review). Papers should not exceed 6 pages (4 pages for a poster) and are due by November 19, 2018. For FLAIRS-32, the 2019 conference, the reviewing is a double blind process. Author names and affiliations must be omitted on submitted papers to provide double-blind reviewing. The papers will be reviewed by at least three reviewers. Papers must be submitted as PDF through the EasyChair conference system, which can also be accessed through the main conference web site. Authors should indicate the special track "Uncertain Reasoning" for submissions. The proceedings of FLAIRS-32 will be published by the AAAI. Authors of accepted papers will be required to sign a form transferring copyright of their contribution to AAAI. At least one author of each accepted paper is required to register, attend, and present the paper at FLAIRS-32. _________________________________ Alessandro Antonucci IDSIA Dalle Molle Institute for Artificial Intelligence Via Cantonale (Galleria 2) CH-6928, Manno-Lugano, CH mail: alessandro(a)idsia.ch web: www.idsia.ch/~alessandro _________________________________

1 0

[SIPTA] Robotic 2019: early registration November 13
by IRDTA Nov. 2, 2018

Nov. 2, 2018

1 0

[SIPTA] Postdoc position in Milan (deadline 9th November 2018)
by hykel hosni Oct. 31, 2018

Oct. 31, 2018

1 0

[SIPTA] Extended Deadline: IJAR Special Issue on Robustness in Probabilistic Graphical Models
by Denis Mauá Oct. 30, 2018

Oct. 30, 2018

1 0

[SIPTA] ISIPTA 2019: not just any other conference!
by Jasper De Bock Oct. 29, 2018

Oct. 29, 2018

1 0

[SIPTA] Fw: CoProd information
by Kreinovich Oct. 19, 2018

Oct. 19, 2018

Papers related to imprecise probabilities are welcome at this series of workshops ________________________________________ Welcome to 12th International Workshop on Constraint Programming and Decision Making CoProD'2019 June 17, 2019 -- Lafayette, Louisiana CoProD'19 is the twelfth edition of CoProD http://coprod.constraintsolving.com/. It will be held in Lafayette, Louisiana, USA on June 17, 2018 (exact location TBA), right before the 2019 IFSA World Congress and NAFIPS Annual Conference IFSA/NAFIPS'2019 (June 18-22, 2019, Lafayette, Louisiana), see https://interval.louisiana.edu/IFSA-NAFIPS/ Constraint programming techniques are important components of intelligent systems. They constitute a declarative and efficient methodology to represent and solve many practical problems. They have been applied successfully to a number of fields, such as scheduling of air traffic, software engineering, networks security, chemistry, and biology. Despite the proved usefulness of these techniques, they are still under-utilized in real-life applications. One reason is the perceived lack of effective communication between constraint programming experts and domain practitioners about constraints, in general, and their use in decision making, in particular. Registration: Registration will be collected on site and will be about $30, to cover coffee breaks and room and equipment rental Objectives of CoProD: * To present advances in constraint solving, optimization, and related topics; * To develop a network of researchers interested in constraint techniques, in particular researchers and practitioners that use numeric and symbolic approaches (or a combination of them) to solve constraint and optimization problems; * To address the gap between the great capacity of these techniques and their limited use. CoProD aims at encouraging presentation and discussion of on-going work. In particular, please note that there is room for presentation of ideas, as opposed to results only. It also aims at facilitating networking opportunities as well as cross-fertilization between the approaches used in the different attending communities. Therefore, besides active researchers in decision making and constraint programming techniques, we expect to have a wide attendance and participation of domain scientists -- whose input is highly valued in this workshop. The previous editions of CoProD featured invited talks by highly recognized experts (listed in alphabetic order): * Purushotham Bangalore, CIS department, University of Alabama at Birmingham * Martin Berz, Michigan State University, USA •Stefano Bistarelli, University of Perugia, Italy * Alessandro Dal Palu, University of Parma, Italy * Rina Dechter, Information and Computer Sciences, University of California Irvine * Scott Ferson, Applied Bioinformatics, New York, USA * Juan Carlos Figueroa, Universidad Distrital de Bogota, Colombia * Patty Hough, Sandia National Lab, Livermore CA * Luc Jaulin, Ecole Nationale Superieure des Techniques Avancees (ENSTA) Bretagne, France * Kyoko Makino, Michigan State University, USA * Tiago Oliveira, National Institute of Informatics (NII) in Tokyo, Japan. * Enrico Pontelli, New Mexico State University, Las Cruces, NM * James Raynolds, College of Nanoscale and Engineering, SUNY Albany * Sigfried Rump, Hamburg University of Technology and Waseda University, Japan * Ken Satoh, National Institute of Informatics (NII) in Tokyo, Japan. * Bart Selman, CS department, Cornell University * Yaroslav D. Sergeyev, Università della Calabria, Italy * Sergey Shary, Novosibirsk State University * Young Jun Son, The University of Arizona, Tucson * Xiaobai Sun, Duke University * Alfredo Vaccaro, University of Sannio, Department of Engineering, Benevento, Italy * Leticia Velazquez, The University of Texas at El Paso * Francois Modave, Texas Tech Health Center, El Paso Proceedings / Publication: Papers accepted for the workshop will be published in the same Springer volume as all the papers from the IFSA/NAFIPS'2019 conference. Please follow the conference instructions (template, paper size, deadlines, etc.) when submitting your papers. Submission should be sent to us by email to mceverio(a)utep.edu and vladik(a)utep.edu. Participation / Submission: Participation is encouraged from people doing research in the area of decision making as well as from domain scientists. Submissions of ideas are also encouraged. Important dates: January 5: paper submission February 5: notification of acceptance March 5: camera-ready copy of papers due June 17: workshop Organizers: Martine Ceberio, the University of Texas at El Paso, mceberio(a)utep.edu Vladik Kreinovich, the University of Texas at El Paso, vladik(a)utep.edu

1 0

Re: [SIPTA] call for papers: IFSA-NAFIPS 2019
by Kreinovich Oct. 19, 2018

Oct. 19, 2018

FYI, papers on fuzzy-valued imprecise probabilities are always welcome. This time, the conference has a strong emphasis on relation with interval techniques, so papers on interval-valued probabilities are also welcome. ________________________________________ From: Ralph Baker Kearfott <rbk5287(a)louisiana.edu> Sent: Thursday, October 18, 2018 7:46 AM IFSA-NAFIPS 2019 Call for papers 2019 INTERNATIONAL FUZZY SYSTEMS ASSOCIATION WORLD CONGRESS and the 2019 NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY ANNUAL MEETING Jun3 18-22, 2019 Lafayette, Louisiana Hosted by the North American association, this biennial event brings together participants from all national and regional fuzzy system associations. IFSA-NAFIPS 2019 will be hosted at the Wyndham Garden near Vermilion Bayou in Lafayette, Louisiana, the center of Cajun culture and cuisine. Topics will include implementation and applications of fuzzy information processing technology, associated mathematical analysis, comparison with alternative rough set, statistical, and interval techniques, and, generally, other topics related to fuzzy sets. Further information can be found at: https://interval.louisiana.edu/IFSA-NAFIPS/ This conference will be held a week before the New Orleans FUZZ-IEEE conference. New Orleans is 140 miles (225 kilometers) from Lafayette, a 2.5 hour drive, from Lafayette, and we plan to arrange post-conference charter buses from Lafayette to New Orleans. Participants will thus have leverage to double their professional and cultural experience. Deadlines (extended): Special session and workshop proposals: December 1, 2018 Paper submission: January 15, 2019 A number of special sessions have already been accepted, and keynote speakers have already agreed. Information concerning these will soon appear at https://interval.louisiana.edu/IFSA-NAFIPS/

1 0

[SIPTA] Fw: 29th European Safety and Reliability Conference (ESREL 2019), Hannover, 22 - 26 September 2019
by Kreinovich Oct. 18, 2018

Oct. 18, 2018

1 0

[SIPTA] BigDat 2019: early registration October 15
by IRDTA Oct. 15, 2018

Oct. 15, 2018

1 0

[SIPTA] IJAR- Special Issue on DM with imprecise information
by IGNACIO MONTES GUTIERREZ Oct. 5, 2018

Oct. 5, 2018

1 0

[SIPTA] PyRational
by Alessio Benavoli Sept. 26, 2018

Sept. 26, 2018

1 0

[SIPTA] BigDat 2019: early registration October 15
by IRDTA Sept. 26, 2018

Sept. 26, 2018

1 0

Re: [SIPTA] [IUKM 2019] Extended Deadline of Paper Submission
by Kreinovich Sept. 25, 2018

Sept. 25, 2018

FYI -----Original Message----- From: Masahiro Inuiguchi [mailto:inuiguti(a)sys.es.osaka-u.ac.jp] Sent: Tuesday, September 25, 2018 4:22 AM Dear Colleagues, This message informs you that the deadline of paper submission of IUKM 2019 is extended to October 25, 2018. We would like to cordially invite you to submit papers to this symposium held in Todaiji-Temple (a part of world heritage), Nara, Japan from March 27 to 29, 2019 (Sakura season: we may have cherry blossoms). ---------------------------------------------------------------------------- CALL FOR PAPERS ---------------------------------------------------------------------------- The Seventh International Symposium on INTEGRATED UNCERTAINTY in KNOWLEDGE MODELLING and DECISION MAKING http://www-inulab.sys.es.osaka-u.ac.jp/iukm2019/index.php MARCH 27 - 29, 2019, Todaiji Temple (a part of the world heritage), Nara, JAPAN Extended DEADLINE: October 25, 2018 ---------------------------------------------------------------------------- The International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making (IUKM) aims to provide a forum for exchanges of research results, ideas for and experience of application among researchers and practitioners involved with all aspects of uncertainty management and application. The origin of this conference series started in 2010 at Japan Advanced Institute of Science and Technology, Ishikawa, Japan under the title of the International Symposium on Integrated Uncertainty Management and Applications (IUM 2010). The name of the conference series was then changed to its current title at the second edition (IUKM 2011) held in October 2011 at Zhejiang University, Hangzhou, China; and the third, fourth, fifth, and sixth editions were held in Beijing, China (IUKM 2013), Nha Trang, Vietnam (IUKM 2015), Da Nang, Vietnam (IUKM 2016) and Hanoi, Vietnam (IUKM 2018) respectively. The seventh International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making (IUKM 2019) will take place in Nara, Japan, during 27 - 29 March, 2019. The Symposium Site is located in Todaiji Temple, one of Japan's most famous and historically significant temples and a landmark of Nara. It is located on the left side just behind the Nandaimon Gate, a large wooden gate watched over by two statues of Nio Guardian Kings. The time of the Symposium taking place between 27-29 March is expected to be a good time for the cherry blossoms (Sakura) in Nara, Osaka, Kyoto and Kansai region, so as the symposium participants will be able to enjoy the beauty of SAKURA with Hanami, cherry blossom viewing at many beautiful sakura parks in Nara Park including Todaiji Temple during the symposium as well as many places in Kansai region after the symposium. Hoping to welcome many of you in Nara in late March 2019 in the wonderful place with a beautiful season of cherry blossoms ! ---------------------------------------------------------------------------- Proposal for special sessions and workshops is encouraged and welcome. ---------------------------------------------------------------------------- Relevant topics for the IUKM 2019 Symposium include, but are not limited to, the following: + Theory and Methodology - Uncertainty formalisms: Bayesian probability, Dempster-Shafer theory, imprecise probability, random sets, rough sets, fuzzy sets and interval-based models - Modelling uncertainty and inconsistency in big data - Learning and reasoning with uncertainty - Information fusion and knowledge integration in uncertain environments - Decision making under various types of uncertainty - Aggregation operators - Copulas for dependence modelling - Granular and soft computing - Computational intelligence + Application - Data mining and knowledge discovery - Ontology engineering and Semantic Web - Intelligent data analysis and modelling - Agents and argumentation - Natural language processing - Medical informatics and bioinformatics - Ranking and recommendation systems - Big data and cloud computing - Social network analysis and mining - Sensor fusion - System identification and modelling - Diagnosis and reliability - Decision support systems - Kansei/affective engineering - Service computing - Engineering management - Supply chain management - Environmental management - Service computing - Economics and econometrics PUBLICATION The authors are invited to submit their full papers by September 25, 2018. The submissions will be peer-reviewed for originality and scientific quality. As done in previous editions, the proceedings of IUKM 2019 will be published by Springer-Verlag in the Lecture Notes in Artificial Intelligence series, and be available at the Symposium. Authors are requested to prepare their papers in the Springer LNAI format. Submissions should not exceed 12 pages and must be submitted electronically through the conference's Easychair submission page (https://easychair.org/conferences/?conf=iukm2019) IMPORTANT DATES Extended Deadline for paper submission: 25 October 2018 Notification of acceptance/rejection: 30 November 2018 Final camera-ready and author registration: 20 December 2018 Early registration: 20 December 2018 Symposium dates: 27 March - 29 March 2019

1 0

[SIPTA] SLSP 2018: call for participation
by IRDTA Sept. 18, 2018

Sept. 18, 2018

1 0

[SIPTA] 2008 SIPTA Summer School site moving to sipta.org; request for checks and missing materials
by Erik Quaeghebeur Sept. 13, 2018

Sept. 13, 2018

Dear colleagues, The website of the SIPTA Summer School 2008 has been available at <http://www.lirmm.fr/SIPTASchool08/school.htm>, but to ensure long-term preservation, it is moving to <http://www.sipta.org/ssipta08/>. I would kindly like to request the following: 1. Please update links to this site on webpages you or your colleagues manage. 2. Please check the site (and compare to the one at the previous location) to see if something went wrong during the move (we are aware the videos are missing at both locations). 3. Please check whether you have local copies of missing materials (specifically, the videos). In case you come up with something for points 2. and 3. or any other relevant matter, please contact Fabio (in Cc) and myself by reply email. Posterity will be in your debt. After allowing some time for your input, we will inform the maintainers of the previous location that the move has been done. Then they can install a permanent redirect at the old address and, if they choose, later on remove it from their server. Best regards, Erik -- https://ac.erikquaeghebeur.name

1 0

[SIPTA] LEaDing Fellows: 2y postdoc; call open until Oct 31st
by Erik Quaeghebeur Sept. 11, 2018

Sept. 11, 2018

Dear colleagues, There is a call open until October 31st for 2-year Postdoc positions at Leiden University, Leiden University Medical Centre, Erasmus University Rotterdam, Erasmus Medical Centre and Delft University of Technology (all in the Netherlands). More information at <http://leadingfellows.eu/>. Please disseminate to potential candidates in your network. Best regards, Erik -- https://ac.erikquaeghebeur.name

1 0

[SIPTA] Fwd: [Random] I: Avviso di seminario
by Serena Doria Sept. 7, 2018

Sept. 7, 2018

----- Messaggio inoltrato da massimo.campanino(a)unibo.it ----- Data: Thu, 6 Sep 2018 15:03:00 +0000 Da: Massimo Campanino <massimo.campanino(a)unibo.it> Oggetto: [Random] I: Avviso di seminario A: "Random(a)fields.dm.unipi.it" <Random(a)fields.dm.unipi.it> Il giorno 20 settembre alle ore 14 nell'Aula Seminario 2 del Dipartimento di Matematica dell'Università di Bologna in piazza Porta S. Donato 5 il prof. Pietro Rigo del Dipartimento di Matematica dell'Università di Pavia terrà un seminario dal titolo: CLASSICAL VERSUS COHERENT CONDITIONAL PROBABILITIES ABSTRACT: The standard (Kolmogorovian) notion of conditional probability is compared with the (de Finettian) notion based on the coherence principle. Each notion has both merits and drawbacks, and the talk aims to highlight them with special attention to the connection points. Various results, both old and new, are discussed and some open problems are mentioned. The talk is split into four parts. (i) Classical (Kolmogorovian) conditional probabilities; (ii) Disintegrability; (iii) Coherent (de Finettian) conditional probabilities; (iv) Some statistical implications. _______________________________________________ Random mailing list Per informazioni e per disiscriversi: https://fields.dm.unipi.it/listinfo/random Per contattare gli amministratori: random-admin(a)fields.dm.unipi.it Per inviare un messaggio alla mailing list: Random(a)fields.dm.unipi.it Archivio dei messaggi inviati: https://fields.dm.unipi.it/pipermail/random ----- Fine messaggio inoltrato. -----

1 0

[SIPTA] SLSP 2018: poster submission deadline September 8
by IRDTA Sept. 4, 2018

Sept. 4, 2018

1 0

[SIPTA] BigDat 2019: early registration September 18
by IRDTA Sept. 1, 2018

Sept. 1, 2018

1 0

[SIPTA] BigDat 2019: early registration August 22
by IRDTA Aug. 13, 2018

Aug. 13, 2018

1 0

[SIPTA] SLSP 2018: call for posters
by IRDTA Aug. 7, 2018

Aug. 7, 2018

1 0

[SIPTA] Save the date: ISIPTA 2019, July 3-6, Ghent, Belgium
by Jasper De Bock Aug. 2, 2018

Aug. 2, 2018

1 0

[SIPTA] SLSP 2018: call for posters
by IRDTA July 24, 2018

July 24, 2018

1 0

[SIPTA] FW: IEEE SSCI 2018 Final Submission Deadline
by Kreinovich July 22, 2018

July 22, 2018

1 0

[SIPTA] REC'2018 and REC'2020
by Kreinovich July 20, 2018

July 20, 2018

Dear Friends, The 8th International Workshop on Reliable Engineering Computing REC'2018 (Liverpool, UH, July 16-18, 2018) has just finished. Many interesting talks dealt with probabilistic, interval, fuzzy, and other types of uncertainty in relation to engineering applications, papers are available at http://www.rec2018.uk Many thanks to Scott Ferson and the whole organizing team for their excellent organization, this was -- paraphrasing the Beatles, the most famous folks from Liverpool -- a BIG help from our friends. The next biannual conference will be in Sicily, Italy, in 2020, see you all there!

1 0

[SIPTA] Fw: WCCI'2020: mark your calendars
by Kreinovich July 12, 2018

July 12, 2018

FYI, papers on fuzzy-valued probabilities are always welcome at FUZZ-IEEE conferences ****************************************** 2020 IEEE World Congress on Computational Intelligence WCCI'2020 Glasgow, UK, July 19-24, 2020 http://wcci2020.org/ 2020 IEEE WCCI will be held in Glasgow, Scotland, UK -- one of Europe's most dynamic cultural capitals and the "World's Friendliest City" [Rough Guide 2015]. Steeped in culture, rich in history and alive with an excitement you can sense as you walk through its elegant Victorian streets, squares, parks and gardens. The Conference will be held at the prestigious Scottish Event Campus (SEC), which was a key venue for the Glasgow Commonwealth Games 2014 https://www.sec.co.uk/ The World Congress combines three conferences: IJCNN 2020 The International Joint Conference on Neural Networks (IJCNN) covers a wide range of topics in the field of neural networks, from biological neural networks to artificial neural computation. IEEE CEC 2020 The IEEE Congress on Evolutionary Computation (IEEE CEC) covers all topics in evolutionary computation from theory to real-world applications. FUZZ-IEEE 2020 The IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) covers all topics in fuzzy systems from theory to real-world applications. deadline for special sessions and workshops November 15, 2019 deadline for tutorials and competitions December 15, 2019 deadline for paper submissions January 15, 2020 paper acceptance notification March 15, 2020 final paper submission and early registration April 15, 2020

1 0

[SIPTA] Fw: CFP for FUZZ-IEEE'2019
by Kreinovich July 12, 2018

July 12, 2018

1 0

[SIPTA] BigDat 2019: early registration July 26
by IRDTA July 10, 2018

July 10, 2018

1 0

Re: [SIPTA] IEEE SMC Thesis Grant Initiative 2018, deadline July 31, 2018
by Kreinovich July 9, 2018

July 9, 2018

Dear Friends, Please spread the word, students and young researchers on any topic related to systems, man, and cybernetics are eligible, deadline is July 31, see information below. Only members of IEEE Systems, Man, and Cybernetics Society are eligible, but this may be a great reason to join the society! Vladik ________________________________________ >From György EIgner <eigner.gyorgy(a)NIK.UNI-OBUDA.HU> Sent: Sunday, July 8, 2018 9:30 PM We would like to emphasize the Thesis Grant Initiative 2018 of SMC. We would like to ask your help to spread the information about this opportunity through your networks in order to advertise it and maximize to reaching people with our message. We established this program last year, it was a great success: we got many applications. I copied here the essence of the program, but it can be found here as well: http://thesisgrantinitiative.ieeesmc.hu/ **************************************** The System, Man, and Cybernetics Society happily presents the SMC Thesis Grants Initiative for 2018! The aim of this initiative is to recognize the outstanding Student, Graduated Student and Young Professional members of SMCS who, early in their career, contributed to major advancements of theory, technologies, and/or applications of systems science & engineering, human-machine systems, and/or cybernetics. Accomplishments include theoretical and technological advances, improvements in processes, or development of new products or procedures related to the fields of interest of the Systems, Man, and Cybernetics Society. Further information can be found here: http://thesisgrantinitiative.ieeesmc.hu/ Thank you for helping to make this program successful! Best regards, Gyorgy Eigner M&SA Program Coordinator

1 0