The Necessity and Importance of Incorporating Media and Information Literacy into Holistic Metaliteracy

Digitalization and the emergence of the Internet have resulted in escalating access to information and communication. Given the circumstances that soaring access to information amounts to the intensification of misinformation and disinformation, a set of critical skills to navigate and critically assess the information is necessary. This paper outlines the significance of these skills, and provides a perspective on metaliteracy as a supplement to media and information literacy, and argues that the ability to conceptualize, access, comprehend, analyze, and use information is crucial in achieving inclusive, pluralistic, and participatory knowledge societies

The necessity and importance of incorporating media and information literacy into holistic metaliteracy

Digitalization and the emergence of the Internet have resulted in escalating access to information and communication. Given the circumstances that soaring access to information amounts to the intensification of misinformation and disinformation, a set of critical skills to navigate and critically assess the information is necessary. This paper outlines the significance of these skills, and provides a perspective on metaliteracy as a supplement to media and information literacy, and argues that the ability to conceptualize, access, comprehend, analyze, and use information is crucial in achieving inclusive, pluralistic, and participatory knowledge societies. (DIPF/Orig.

Hardness Amplification of Optimization Problems

In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem ? is direct product feasible if it is possible to efficiently aggregate any k instances of ? and form one large instance of ? such that given an optimal feasible solution to the larger instance, we can efficiently find optimal feasible solutions to all the k smaller instances. Given a direct product feasible optimization problem ?, our hardness amplification theorem may be informally stated as follows: If there is a distribution D over instances of ? of size n such that every randomized algorithm running in time t(n) fails to solve ? on 1/?(n) fraction of inputs sampled from D, then, assuming some relationships on ?(n) and t(n), there is a distribution D\u27 over instances of ? of size O(n??(n)) such that every randomized algorithm running in time t(n)/poly(?(n)) fails to solve ? on 99/100 fraction of inputs sampled from D\u27. As a consequence of the above theorem, we show hardness amplification of problems in various classes such as NP-hard problems like Max-Clique, Knapsack, and Max-SAT, problems in P such as Longest Common Subsequence, Edit Distance, Matrix Multiplication, and even problems in TFNP such as Factoring and computing Nash equilibrium

Computing a Nonnegative Matrix Factorization -- Provably

In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \times r$ and $r \times m$ respectively. In some applications, it makes sense to ask instead for the product $AW$ to approximate $M$ -- i.e. (approximately) minimize \norm{M - AW}_F where \norm{}_F denotes the Frobenius norm; we refer to this as Approximate NMF. This problem has a rich history spanning quantum mechanics, probability theory, data analysis, polyhedral combinatorics, communication complexity, demography, chemometrics, etc. In the past decade NMF has become enormously popular in machine learning, where $A$ and $W$ are computed using a variety of local search heuristics. Vavasis proved that this problem is NP-complete. We initiate a study of when this problem is solvable in polynomial time: 1. We give a polynomial-time algorithm for exact and approximate NMF for every constant $r$. Indeed NMF is most interesting in applications precisely when $r$ is small. 2. We complement this with a hardness result, that if exact NMF can be solved in time $(nm)^{o(r)}$, 3-SAT has a sub-exponential time algorithm. This rules out substantial improvements to the above algorithm. 3. We give an algorithm that runs in time polynomial in $n$, $m$ and $r$ under the separablity condition identified by Donoho and Stodden in 2003. The algorithm may be practical since it is simple and noise tolerant (under benign assumptions). Separability is believed to hold in many practical settings. To the best of our knowledge, this last result is the first example of a polynomial-time algorithm that provably works under a non-trivial condition on the input and we believe that this will be an interesting and important direction for future work.Comment: 29 pages, 3 figure

Iranian Celebrities on the Internet

Celebrities have gained considerable influence in the last one hundred years or so, but the advent of so-called Web 2.0 technologies has given celebrity culture a new momentum. We are living in a world in which celebrities are striving to curve their place in every niche and hence we have to become more media literate in order to avoid being exploited by celebrity media and culture. We have to be aware that celebrities promote commodities that they will never use, that they are carefully working on their image to become pleasant to us, and that if they do humanitarian work, they are mainly doing it for their reputation, and not for a real and authentic cause

How about another joke from the Covid-19 Pandemic in Iran

The outbreak of Coronavirus disease, 2019 (COVID-19), started in late 2019 and developed into a pandemic by March 2020 and has become a global problem. Following the global outbreak and coronavirus spreading around the world, the WHO reported a statement on January 11, 2020, announcing the new Coronavirus outbreak as the sixth significant public health emergency in the world. In the stressful situation caused by the coronavirus epidemic, many jokes and Humor about this disease were distributed on social networks. In these circumstances, the question arises: Why do some people continue to make jokes about it, despite the mass perception of the coronavirus epidemic? The present research method was qualitative and Strauss and Corbin's version of the grounded theory was used. Participants were included the Telegram Social Network Comic Channel "https://t.me/s/jokcom" Members, which had more than 2879 members and those on Instagram and Twitter members who liked the corona content to the jokes about the covid-19 pandemic inside Iran. Based on the result, we found the effects and consequences of corona jokes. There was several factors involved in shaping the phenomenon of covids jokes. Joke and Humor are like a double-edged sword; in some situation, can be both harmful and helpful

Reliability-based design optimization of shells with uncertain geometry using adaptive Kriging metamodels

Optimal design under uncertainty has gained much attention in the past ten years due to the ever increasing need for manufacturers to build robust systems at the lowest cost. Reliability-based design optimization (RBDO) allows the analyst to minimize some cost function while ensuring some minimal performances cast as admissible failure probabilities for a set of performance functions. In order to address real-world engineering problems in which the performance is assessed through computational models (e.g., finite element models in structural mechanics) metamodeling techniques have been developed in the past decade. This paper introduces adaptive Kriging surrogate models to solve the RBDO problem. The latter is cast in an augmented space that "sums up" the range of the design space and the aleatory uncertainty in the design parameters and the environmental conditions. The surrogate model is used (i) for evaluating robust estimates of the failure probabilities (and for enhancing the computational experimental design by adaptive sampling) in order to achieve the requested accuracy and (ii) for applying a gradient-based optimization algorithm to get optimal values of the design parameters. The approach is applied to the optimal design of ring-stiffened cylindrical shells used in submarine engineering under uncertain geometric imperfections. For this application the performance of the structure is related to buckling which is addressed here by means of a finite element solution based on the asymptotic numerical method