Refik Anadol (born November 7, 1985) is a Turkish American media artist and the co-founder of Refik Anadol Studio and Dataland. Recognized as a pioneer in the aesthetics of data visualization and AI arts, his work merges art, technology, science, and architecture. Through media embedded into existing architecture, live audio-visual performances, immersive rooms, exhibitions, AI data paintings and sculptures, and digital collections, Anadol explores collective memories, humanity's relationship to nature, the perception of space and time, and human-machine collaborations. His work has been exhibited in more than seventy cities on six continents. == Early life and education == Anadol was born and raised in Istanbul and grew up in a family of teachers. He taught himself basic programming on a Commodore 64 when he was eight. His connection to machines began with coding and video games. Anadol saw Blade Runner for the first time when he was eight; his mother said the way he perceived his surroundings shifted the day after he saw the film. He was fascinated with its futuristic depiction of downtown Los Angeles, and transfixed by as a scene during which a replicant discovers that her memories are an implanted component of her machine mind, In a 2024 interview with the Financial Times, he said: "Since that moment, one of my inspirations has been that question: 'What can a machine do with someone else's memories?" Anadol attended Istanbul Bilgi University, where he received a BA in photography and video in 2009 and an MFA in visual communication in 2011. In 2014 he earned an MFA in design media arts at UCLA. He was mentored by Casey Reas, Jennifer Steinkamp, and Christian Moeller. == Career and selected works == === 2008–2012: Data painting, Quadrature and Quadrangle, Istanbul Biennial === As an undergraduate, Anadol read a paper by Lev Manovich on augmented space. Manovich's assertion that collaborations between architects and artists could make the "invisible flow of data visible" triggered Anadol's imagination, and in 2008, he altered built space for the first time. Bringing a projector outside, he projected large-scale images onto a concrete to create the illusion of movement. Coining the term "data painting," the piece inspired Anadol to use light as material and data as pigment. In 2010 he created Quadrature with Alican Aktürk, a fellow graduate student, at the SantralIstanbul Art and Culture Center's main gallery building. A live audio-visual performance that examined the relationship between architecture and media, Quadrature used video projection techniques to manipulate footage of quadrilaterals. He followed Quadrature with Quadrangle at SANAA School of Design in Essen, Germany, using the entire 360 degrees of the building as a canvas. In 2011, he was invited to create a media installation at the Istanbul Biennial on the heavily trafficked İstiklal Avenue. He created a site-specific large-scale interpretation of sounds he recorded during different times of day, and used nine projectors to project reinterpreted images. The work was titled Augmented Structures v1.0. Anadol's first solo exhibition, Sceptical Interventions, was held at the Piveneli Gallery in Istanbul in early 2012. Later that year he moved to Los Angeles to attend UCLA's Design Media Arts program. The first place he went after his arrival was downtown Los Angeles. [6] === 2013–2016: Visions of America: Amériques, Infinity Room, Google AMI === In 2013, at Microsoft Research's annual Design Expo, Anadol presented his idea to use the external walls of Walt Disney Concert Hall as a canvas. His presentation brought him to the attention of Gehry Technologies, and with the support of Gehry and his team, Anadol was offered the use of the original 3D model of the concert hall. For his 2014 thesis project, with assistance from architects and UCLA researchers, he created a site-specific architectural video installation inside the concert hall that accompanied a Los Angeles Philharmonic performance of Edgard Varèse's Amérique. Titled Visions of America: Amériques, Anadol used algorithmic sound analysis to listen and respond to the music in real-time. He tracked conductor Esa-Pekka Salonen's heartbeat with a sensor and used a 3-D camera system to integrate Salonen's movements. He created Infinity Room at the Zorlu PSM for the 2015 Istanbul Biennial. Rather than creating an illusion only with mirrors, Anadol used pixel and 3D projection mapping to transform every surface of the room into an abstract infinite moving space. A temporary immersive environment, Infinity Room was also exhibited at events including South by Southwest in Austin, Texas, the New Zealand Festival in Wellington, New Zealand, and Jeffrey Deitch in Los Angeles. In 2016, Anadol was awarded the first Google Artists and Machine Intelligence Artist Residency; it was just after a team at Google opened up the algorithm for DeepDream, a computer vision program that prompted Anadol's realization that if a machine could learn, it could remember, dream, and hallucinate. === 2017–2018: Winds of Boston, Archive Dreaming, Melting Memories, WDCH Dreams === In 2017, he created the data painting Winds of Boston, a 6' x 13' foot video installation in the lobby of a Boston office building, using software he created to read, analyze and visualize wind speed, direction, and gust patterns along with time and temperature at 20-second intervals recorded over a one-year period at Logan International Airport. Later in the year, he used AI to generate infinite new outputs based on a massive dataset for Archive Dreaming, an immersive installation at Salt Research, a contemporary gallery and library in Istanbul. Inspired by his idea of consciousness and its context within AI, as well as Jorge Luis Borges' The Library of Babel, Anadol used AI and machine learning to look at and discover interactions and correlations between 1.7 million items culled from 40,000 publications covering Turkish contemporary and modern art, architecture, and economics from 1997 to 2010. Archive Dreaming, which could be controlled by users with a joystick, dreamed of unexpected correlations among documents when idle. In 2018, after his uncle was diagnosed with Alzheimer's, Anadol created Melting Memories. Working with scientists from the neuroscape laboratory at the University of California, San Francisco, he used academic data from the neuroscience archives and EEG scans of an anonymous Alzheimer's disease dataset to create AI-generated visuals related to memory, health, degeneration, and decay.Melting Memories was projected on the walls of Pilevneli Gallery; visitors to the exhibition could watch as millions of pixels reconstructed people's memories. Anadol won the Lumen Prize Gold Award for Melting Memories. Anadol was commissioned by the Los Angeles Philharmonic to create an installation to celebrate the orchestra's centennial anniversary in 2018. He worked with Google's Kenric MacDowell to create WDCH Dreams, using algorithmic visualizations of data to mimic the process of human dreaming. Projected across the exterior walls of Walt Disney Concert Hall using 42 large-scale projectors with 50K visual resolution, 8-channel sound, and 1.2M luminance, Anadol painted with data points culled from the orchestra's archives, including 587,763 images, 1,880 videos, 1,483 metadata files, and 17,773 audio files. Because Gehry gave him access to the 3D architectural files of Walt Disney Concert Hall, Anadol knew the exact contours of the building. WDCH Dreams debuted in September 2018. A 12-minute performance in three parts staged every 30 minutes over ten nights, "Centennial Memories,” the first piece, used 44.5 terabytes of historical data from the Phil's archives. It was followed by "Consciousness", which processed every note the orchestra has ever recorded, using billions of data points to generate connections; and "Dream," which merged "Centennial Memories" and "Consciousness" to create hallucinations that were described in the New York Times as "a sort of combinatorial Fantasia. === 2019–2021: Machine Hallucinations: NYC, Machine Hallucinations: Nature Dreams, Machine Memories: Space, Quantum Memories === In 2019, Refik Anadol presented Latent History at Fotografiska Stockholm. The site specific installation transformed photographic archives of Stockholm into a large scale, machine generated visual projection displayed in the museum’s main exhibition hall. Drawing on thousands of archival images spanning approximately 150 years, the work used artificial intelligence to reinterpret the city’s historical imagery as a continuously evolving visual narrative.. Anadol began thinking about the work that would become the Machine Hallucinations series while in residence at Google. In 2019, he completed the first work in the series, Machine Hallucinations: NYC, which used 300 million photos of New York City and 113 million additional data points, including subway sounds, ra
List of chatbots
A chatbot is a software application or web interface that is designed to mimic human conversation through text or voice interactions. Modern chatbots are typically online and use generative artificial intelligence systems that are capable of maintaining a conversation with a user in natural language and simulating the way a human would behave as a conversational partner. Such chatbots often use large language models (LLMs) and natural language processing, but simpler chatbots have existed for decades. == LLM chatbots == == General chatbots == == Historical chatbots ==
List of video games using NFC
This is a list of video games that use near field communication (NFC) technology. Currently, games have leveraged NFC in unlocking additional features through payment. This takes the form of a direct transaction over NFC or by purchasing a physical item, which signals to the platform that a certain set of features has been purchased (e.g. Skylanders). This list catalogues gaming NFC platforms by device. == Mobile == === Android === Gun Bros. Near Field Ninja NFC Cards Skylanders, with an NFC base. The Haunted House: Soul Fighters, with an NFC base. === iOS === ==== As item-triggered game enhancement ==== Skylanders, with an NFC base. ==== As payment ==== In-App Purchases Here, games that leverage Apple's In-App Purchase framework use information stored in the NFC Secure Element to process the purchase through Apple Pay. While an NFC radio is not used here, the NFC protocol is used nonetheless. == Console == === Nintendo Wii, Wii U, Switch, Switch 2, 3DS and 2DS === ==== As item-triggered game enhancement ==== Pokémon Rumble U NFC Figure Amiibo, built into Nintendo consoles since 2014. Works with Wii U, New Nintendo 3DS/3DS XL, New Nintendo 2DS XL, Nintendo Switch, Nintendo Switch 2 and older Nintendo 3DS/Nintendo 2DS systems via a peripheral device. Disney Infinity, with an NFC base. Works with Wii, Nintendo 3DS, Nintendo 2DS and Wii U. Lego Dimensions, with an NFC base. Works with Wii U. Skylanders, with an NFC base. Works with Wii, Nintendo 3DS, Nintendo 2DS and Wii U. The Nintendo Switch version of Skylanders: Imaginators uses the NFC built into the game controller, it is also has full backward compatibility with Nintendo Switch 2. Some functionalities are missing compared to the other versions. ==== As payment ==== The Wii U GamePad controller, Joy-Con R, Joy-Con 2 R, Nintendo Switch Pro Controller and Nintendo Switch 2 Pro Controller can read information from an NFC data source. === PlayStation === Disney Infinity, with an NFC base. Works with PlayStation 3, PlayStation Vita, PlayStation 4 and PlayStation 5. Lego Dimensions, with an NFC base. Works with PlayStation 3, PlayStation 4 and PlayStation 5. Skylanders, with an NFC base. Works with PlayStation 3, PlayStation 4 and PlayStation 5. === Xbox === While NFC bases are normally interoperable between all platforms, the Xbox 360, Xbox One and Xbox Series X require specific bases that are compatible only with the respective platform. Disney Infinity, with an NFC base. Lego Dimensions, with an NFC base. Skylanders, with an NFC base.
Temporal resolution
Temporal resolution (TR) refers to the discrete resolution of a measurement with respect to time. It is defined as the amount of time needed to revisit and acquire data for the same location. When applied to remote sensing, this amount of time is influenced by the sensor platform's orbital characteristics and the features of the sensor itself. The temporal resolution is low when the revisiting delay is high and vice versa. Temporal resolution is typically expressed in days. == Physics == Often there is a trade-off between the temporal resolution of a measurement and its spatial resolution, due to Heisenberg's uncertainty principle. In some contexts, such as particle physics, this trade-off can be attributed to the finite speed of light and the fact that it takes a certain period of time for the photons carrying information to reach the observer. In this time, the system might have undergone changes itself. Thus, the longer the light has to travel, the lower the temporal resolution. == Technology == === Computing === In another context, there is often a tradeoff between temporal resolution and computer storage. A transducer may be able to record data every millisecond, but available storage may not allow this, and in the case of 4D PET imaging the resolution may be limited to several minutes. === Electronic displays === In some applications, temporal resolution may instead be equated to the sampling period, or its inverse, the refresh rate, or update frequency in Hertz, of a TV, for example. The temporal resolution is distinct from temporal uncertainty. This would be analogous to conflating image resolution with optical resolution. One is discrete, the other, continuous. The temporal resolution is a resolution somewhat the 'time' dual to the 'space' resolution of an image. In a similar way, the sample rate is equivalent to the pixel pitch on a display screen, whereas the optical resolution of a display screen is equivalent to temporal uncertainty. Note that both this form of image space and time resolutions are orthogonal to measurement resolution, even though space and time are also orthogonal to each other. Both an image or an oscilloscope capture can have a signal-to-noise ratio, since both also have measurement resolution. === Oscilloscopy === An oscilloscope is the temporal equivalent of a microscope, and it is limited by temporal uncertainty the same way a microscope is limited by optical resolution. A digital sampling oscilloscope has also a limitation analogous to image resolution, which is the sample rate. A non-digital non-sampling oscilloscope is still limited by temporal uncertainty. The temporal uncertainty can be related to the maximum frequency of continuous signal the oscilloscope could respond to, called the bandwidth and given in Hertz. But for oscilloscopes, this figure is not the temporal resolution. To reduce confusion, oscilloscope manufacturers use 'Sa/s' instead of 'Hz' to specify the temporal resolution. Two cases for oscilloscopes exist: either the probe settling time is much shorter than the real time sampling rate, or it is much larger. The case where the settling time is the same as the sampling time is usually undesirable in an oscilloscope. It is more typical to prefer a larger ratio either way, or if not, to be somewhat longer than two sample periods. In the case where it is much longer, the most typical case, it dominates the temporal resolution. The shape of the response during the settling time also has as strong effect on the temporal resolution. For this reason probe leads usually offer an arrangement to 'compensate' the leads to alter the trade off between minimal settling time, and minimal overshoot. If it is much shorter, the oscilloscope may be prone to aliasing from radio frequency interference, but this can be removed by repeatedly sampling a repetitive signal and averaging the results together. If the relationship between the 'trigger' time and the sample clock can be controlled with greater accuracy than the sampling time, then it is possible to make a measurement of a repetitive waveform with much higher temporal resolution than the sample period by upsampling each record before averaging. In this case the temporal uncertainty may be limited by clock jitter.
Gnowit
Gnowit (pronounced "know it") is a Canadian software company that provides automated, near-real-time monitoring of legislative, regulatory, and political activity across Canada. Its platform aggregates and analyzes information from government publications, parliamentary debates, committee, and proceedings to provide searchable alerts and reports for organizations monitoring public policy and regulatory developments. The system uses natural-language processing and machine learning techniques to organize and filter large volumes of public information.; the company reports that new publication documents are captured and millions of items are added to its repository daily. == History, Founders and Leadership == Gnowit was co-founded in Ottawa in 2010 by Shahzad Khan and Mohammad Al-Azzouni; Khan serves as chief executive officer. Khan holds a PhD in Computer Science from the University of Cambridge, has more than two decades of experience in AI/ML and computational linguistics, and has authored or co-authored 37 peer-reviewed publications and five patents. Traditionally, companies performed this analysis manually; Gnowit has delivered efficiencies achieved through AI innovations. The company has participated in several Canadian startup and accelerator programs, including Carleton University's Lead To Win initiative, the University of Ottawa's Startup Garage, the Invest Ottawa incubator, and the League of Innovators' BOOST program. === Kubernetes validation (2019–2020) === As part of a Canada's Centre of Excellence in Next Generation Networks (CENGN) project, Gnowit validated a containerized version of its web-intelligence software on Kubernetes. Between 2019 and 2020, Gnowit participated in a project with Canada’s Centre of Excellence in Next Generation Networks (CENGN) to test and scale its platform using containerized infrastructure based on Kubernetes. The initiative focused on improving scalability and supporting the company’s transition from a monolithic software architecture to a cloud-native deployment model. == Products and services == Gnowit markets several modules for public-affairs, compliance, and market-intelligence teams. Legislative & Regulatory Monitoring (vAnalyst). vAnalyst is a monitoring platform that tracks legislative and regulatory activity across Canadian federal, provincial, and territorial jurisdictions. The system aggregates parliamentary debates, bills, committee proceedings, and regulatory publications and provides searchable alerts and reporting tools. The product monitors more than two million web sources to surface relevant items quickly. Parliamentary Live (vAnalyst). Monitors live video feeds from parliamentary sessions and committees with same-day transcripts, AI-generated summaries, witness summaries, and motion detection; municipal coverage is offered as an option. Gnowit can avail transcripts up to two weeks before official releases. These transcripts enable users to navigate and review lengthy parliamentary sittings and committee discussions through searchable text. Municipal Monitoring (vAnalyst). The platform also tracks council meetings, agendas, bylaws, and other municipal government publications from hundreds of Canadian municipalities. The platform aggregates these sources into a single searchable interface for reviewing local government decisions. Curation Edge (analyst service). Curation Edge is an add-on service in which expert analysts work and collaborate with clients to develop a tailored curation guide and deliver daily newsletters or briefs on legislation and media. These reports provide concise summaries, relevant links, and optional metadata, prioritizing key updates with additional context and analysis. The service is customizable, including branding and formatting for executive audiences, and is intended to reduce information overload, support decision-making, and streamline the synthesis and distribution of information. === Coverage and sources === Gnowit monitors sources span Canadian government materials across federal, provincial, and territorial jurisdictions Hansard transcripts (All Jurisdictions, including committees), order papers, committee transcripts, gazettes, bills, acts and regulations, consultations, regulatory-agency publications, and global news media as well as press releases and council-meeting materials from hundreds of municipalities. == Partnerships and support == Gnowit reports collaborations with Canadian academic and ecosystem partners, including: Algonquin College Carleton University McGill University University of Ottawa Université du Québec en Outaouais (UQO) Queen's University The company also participated in the accelerator program at Invest Ottawa and has received support from Canadian research and innovation programs, including: NRC Industrial Research Assistance Program (NRC-IRAP) Mitacs Ontario Centre of Innovation (OCI) (formerly OCE) Gnowit has also referenced membership in the Southern Ontario Smart Computing Innovation Platform (Government of Canada profile: FedDev Ontario – SOSCIP overview). == Technology == Gnowit develops technology intended to support timely decision-making by delivering updates from monitored web sources as they are published. The platform applies artificial intelligence (AI) and machine learning (ML) techniques to monitor, capture, clean, analyze, filter, and organize text, and to generate concise briefs. Its technical approach combines Boolean queries, shallow language processing techniques, and machine learning classifiers within a self-service interface. The company has described its longer-term development framework in relation to a belief–desire–intention (BDI) model of intelligent agents on the web. Gnowit and its founder are listed as inventors/assignees on patents concerning multi-document clustering, salient-content extraction, and sentiment analysis methods that are consistent with these features: US 9,600,470 – Method and system relating to re-labelling multi-document clusters (assignee: Whyz Technologies Ltd.). US 9,336,202 – Method and system relating to salient content extraction for information retrieval (assignee: Whyz Technologies Ltd.). CA 2,865,184 C – Method and system relating to re-labelling multi-document clusters. CA 2,865,186 C – Procédé et système concernant l'analyse de sentiment d'un contenu (sentiment analysis; French record). CA 2,865,187 C – Method and system relating to salient content extraction for information retrieval. == Research and community == In January 2025, Gnowit personnel contributed to regulatory NLP by co-authoring a peer-reviewed paper at the 1st Regulatory NLP Workshop (RegNLP 2025), co-located with COLING in Abu Dhabi. Titled Unifying Large Language Models and Knowledge Graphs for Efficient Regulatory Information Retrieval and Answer Generation, the work introduces PolicyInsight, a framework that joins a dynamic policy data model and knowledge graph with LLMs to monitor policy texts, detect changes, and support retrieval and answer generation; the author list includes Shahzad Khan (CEO, Gnowit Inc.). (ACL Anthology, aclweb.org). Similar information-retrieval technologies are widely used for competitive intelligence, policy monitoring, and media analysis. == White paper == Gnowit has published a practical guide, Automated Government Information Monitoring, which outlines how GR and regulatory teams can design a monitoring and briefing workflow and describes Gnowit's automation features and export options (PDF, email, dashboards, CSV/JSON/XML/API).
Argumentation framework
In artificial intelligence and related fields, an argumentation framework is a way to deal with contentious information and draw conclusions from it using formalized arguments. In an abstract argumentation framework, entry-level information is a set of abstract arguments that, for instance, represent data or a proposition. Conflicts between arguments are represented by a binary relation on the set of arguments. In concrete terms, an argumentation framework is represented with a directed graph such that the nodes are the arguments, and the arrows represent the attack relation. There exist some extensions of the Dung's framework, like the logic-based argumentation frameworks or the value-based argumentation frameworks. == Abstract argumentation frameworks == === Formal framework === Abstract argumentation frameworks, also called argumentation frameworks à la Dung, are defined formally as a pair: A set of abstract elements called arguments, denoted A {\displaystyle A} A binary relation on A {\displaystyle A} , called attack relation, denoted R {\displaystyle R} For instance, the argumentation system S = ⟨ A , R ⟩ {\displaystyle S=\langle A,R\rangle } with A = { a , b , c , d } {\displaystyle A=\{a,b,c,d\}} and R = { ( a , b ) , ( b , c ) , ( d , c ) } {\displaystyle R=\{(a,b),(b,c),(d,c)\}} contains four arguments ( a , b , c {\displaystyle a,b,c} and d {\displaystyle d} ) and three attacks ( a {\displaystyle a} attacks b {\displaystyle b} , b {\displaystyle b} attacks c {\displaystyle c} and d {\displaystyle d} attacks c {\displaystyle c} ). Dung defines some notions : an argument a ∈ A {\displaystyle a\in A} is acceptable with respect to E ⊆ A {\displaystyle E\subseteq A} if and only if E {\displaystyle E} defends a {\displaystyle a} , that is ∀ b ∈ A {\displaystyle \forall b\in A} such that ( b , a ) ∈ R , ∃ c ∈ E {\displaystyle (b,a)\in R,\exists c\in E} such that ( c , b ) ∈ R {\displaystyle (c,b)\in R} , a set of arguments E {\displaystyle E} is conflict-free if there is no attack between its arguments, formally : ∀ a , b ∈ E , ( a , b ) ∉ R {\displaystyle \forall a,b\in E,(a,b)\not \in R} , a set of arguments E {\displaystyle E} is admissible if and only if it is conflict-free and all its arguments are acceptable with respect to E {\displaystyle E} . === Different semantics of acceptance === ==== Extensions ==== To decide if an argument can be accepted or not, or if several arguments can be accepted together, Dung defines several semantics of acceptance that allows, given an argumentation system, sets of arguments (called extensions) to be computed. For instance, given S = ⟨ A , R ⟩ {\displaystyle S=\langle A,R\rangle } , E {\displaystyle E} is a complete extension of S {\displaystyle S} only if it is an admissible set and every acceptable argument with respect to E {\displaystyle E} belongs to E {\displaystyle E} , E {\displaystyle E} is a preferred extension of S {\displaystyle S} only if it is a maximal element (with respect to the set-theoretical inclusion) among the admissible sets with respect to S {\displaystyle S} , E {\displaystyle E} is a stable extension of S {\displaystyle S} only if it is a conflict-free set that attacks every argument that does not belong in E {\displaystyle E} (formally, ∀ a ∈ A ∖ E , ∃ b ∈ E {\displaystyle \forall a\in A\backslash E,\exists b\in E} such that ( b , a ) ∈ R {\displaystyle (b,a)\in R} , E {\displaystyle E} is the (unique) grounded extension of S {\displaystyle S} only if it is the smallest element (with respect to set inclusion) among the complete extensions of S {\displaystyle S} . There exists some inclusions between the sets of extensions built with these semantics : Every stable extension is preferred, Every preferred extension is complete, The grounded extension is complete, If the system is well-founded (there exists no infinite sequence a 0 , a 1 , … , a n , … {\displaystyle a_{0},a_{1},\dots ,a_{n},\dots } such that ∀ i > 0 , ( a i + 1 , a i ) ∈ R {\displaystyle \forall i>0,(a_{i+1},a_{i})\in R} ), all these semantics coincide—only one extension is grounded, stable, preferred, and complete. Some other semantics have been defined. One introduce the notation E x t σ ( S ) {\displaystyle Ext_{\sigma }(S)} to note the set of σ {\displaystyle \sigma } -extensions of the system S {\displaystyle S} . In the case of the system S {\displaystyle S} in the figure above, E x t σ ( S ) = { { a , d } } {\displaystyle Ext_{\sigma }(S)=\{\{a,d\}\}} for every Dung's semantic—the system is well-founded. That explains why the semantics coincide, and the accepted arguments are: a {\displaystyle a} and d {\displaystyle d} . ==== Labellings ==== Labellings are a more expressive way than extensions to express the acceptance of the arguments. Concretely, a labelling is a mapping that associates every argument with a label in (the argument is accepted), out (the argument is rejected), or undec (the argument is undefined—not accepted or refused). One can also note a labelling as a set of pairs ( a r g u m e n t , l a b e l ) {\displaystyle ({\mathit {argument}},{\mathit {label}})} . Such a mapping does not make sense without additional constraint. The notion of reinstatement labelling guarantees the sense of the mapping. L {\displaystyle L} is a reinstatement labelling on the system S = ⟨ A , R ⟩ {\displaystyle S=\langle A,R\rangle } if and only if : ∀ a ∈ A , L ( a ) = i n {\displaystyle \forall a\in A,L(a)={\mathit {in}}} if and only if ∀ b ∈ A {\displaystyle \forall b\in A} such that ( b , a ) ∈ R , L ( b ) = o u t {\displaystyle (b,a)\in R,L(b)={\mathit {out}}} ∀ a ∈ A , L ( a ) = o u t {\displaystyle \forall a\in A,L(a)={\mathit {out}}} if and only if ∃ b ∈ A {\displaystyle \exists b\in A} such that ( b , a ) ∈ R {\displaystyle (b,a)\in R} and L ( b ) = i n {\displaystyle L(b)={\mathit {in}}} ∀ a ∈ A , L ( a ) = u n d e c {\displaystyle \forall a\in A,L(a)={\mathit {undec}}} if and only if L ( a ) ≠ i n {\displaystyle L(a)\neq {\mathit {in}}} and L ( a ) ≠ o u t {\displaystyle L(a)\neq {\mathit {out}}} One can convert every extension into a reinstatement labelling: the arguments of the extension are in, those attacked by an argument of the extension are out, and the others are undec. Conversely, one can build an extension from a reinstatement labelling just by keeping the arguments in. Indeed, Caminada proved that the reinstatement labellings and the complete extensions can be mapped in a bijective way. Moreover, the other Datung's semantics can be associated to some particular sets of reinstatement labellings. Reinstatement labellings distinguish arguments not accepted because they are attacked by accepted arguments from undefined arguments—that is, those that are not defended cannot defend themselves. An argument is undec if it is attacked by at least another undec. If it is attacked only by arguments out, it must be in, and if it is attacked some argument in, then it is out. The unique reinstatement labelling that corresponds to the system S {\displaystyle S} above is L = { ( a , i n ) , ( b , o u t ) , ( c , o u t ) , ( d , i n ) } {\displaystyle L=\{(a,{\mathit {in}}),(b,{\mathit {out}}),(c,{\mathit {out}}),(d,{\mathit {in}})\}} . === Inference from an argumentation system === In the general case when several extensions are computed for a given semantic σ {\displaystyle \sigma } , the agent that reasons from the system can use several mechanisms to infer information: Credulous inference: the agent accepts an argument if it belongs to at least one of the σ {\displaystyle \sigma } -extensions—in which case, the agent risks accepting some arguments that are not acceptable together ( a {\displaystyle a} attacks b {\displaystyle b} , and a {\displaystyle a} and b {\displaystyle b} each belongs to an extension) Skeptical inference: the agent accepts an argument only if it belongs to every σ {\displaystyle \sigma } -extension. In this case, the agent risks deducing too little information (if the intersection of the extensions is empty or has a very small cardinal). For these two methods to infer information, one can identify the set of accepted arguments, respectively C r σ ( S ) {\displaystyle Cr_{\sigma }(S)} the set of the arguments credulously accepted under the semantic σ {\displaystyle \sigma } , and S c σ ( S ) {\displaystyle Sc_{\sigma }(S)} the set of arguments accepted skeptically under the semantic σ {\displaystyle \sigma } (the σ {\displaystyle \sigma } can be missed if there is no possible ambiguity about the semantic). Of course, when there is only one extension (for instance, when the system is well-founded), this problem is very simple: the agent accepts arguments of the unique extension and rejects others. The same reasoning can be done with labellings that correspond to the chosen semantic : an argument can be accepted if it is in for each labelling and refused if it is out for each labelling, the others being in an undecided state (the status of the arguments can remind the
Electronics (journal)
Electronics is a peer-reviewed, scientific journal that covers the study of electronics, including the design, development, and application of electronic devices, systems, and circuits. The journal is published by MDPI and was established in 2012. The editor-in-chief is Flavio Canavero 'Politecnico di Torino). The journal covers a wide range of topics related to electronics, including: electronic devices, electronic materials, electronic circuits, electronic systems, communication electronics, power electronics, and biomedical electronics. The journal also includes articles on the application of electronics in various fields, such as consumer electronics, industrial electronics, automotive electronics, and military electronics. The journal publishes original research articles, review articles, and short communications. == Abstracting and indexing == EBSCO databases ProQuest databases Scopus According to the Journal Citation Reports, the journal has a 2021 impact factor of 2.690.