Когнитивни процеси, емоции и интелигентни интерфејси

Студијата презентира истражувања од повеќе научни дисциплини, како вештачка интелигенција, невронауки, психологија, лингвистика и филозофија, кои имаат потенцијал за креирање на интелигентни антропоморфни агенти и интерактивни технологии. Се разгледуваат системите од симболичка и конекционистичка вештачка интелигенција за моделирање на човековите когнитивни процеси, мислење, донесување одлуки, меморија и учење. Се анализираат моделите во вештачка интелигенција и роботика кои користат емоции како механизам за контрола на остварување на целите на роботот, како реакција на одредени ситуации, за одржување на процесот на социјална интеракција и за создавање на поуверливи антропормфни агенти. Презентираните интердисциплинарни методологии и концепти се мотивација за создавање на анимирани агенти кои користат говор, гестови, интонација и други невербални модалитети при конверзација со корисниците во интелигентните интерфејси

Patterns of Design

In a straightforward meta-level shift of focus, we use design patterns as a medium and process for capturing insight about the process of design. We survey mainstream design genres, and draw conclusions about how they can help inform the design of intelligent systems

Working Notes from the 1992 AAAI Workshop on Automating Software Design. Theme: Domain Specific Software Design

The goal of this workshop is to identify different architectural approaches to building domain-specific software design systems and to explore issues unique to domain-specific (vs. general-purpose) software design. Some general issues that cut across the particular software design domain include: (1) knowledge representation, acquisition, and maintenance; (2) specialized software design techniques; and (3) user interaction and user interface

Computational Sociolinguistics: A Survey

Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present a survey of the emerging field of "Computational Sociolinguistics" that reflects this increased interest. We aim to provide a comprehensive overview of CL research on sociolinguistic themes, featuring topics such as the relation between language and social identity, language use in social interaction and multilingual communication. Moreover, we demonstrate the potential for synergy between the research communities involved, by showing how the large-scale data-driven methods that are widely used in CL can complement existing sociolinguistic studies, and how sociolinguistics can inform and challenge the methods and assumptions employed in CL studies. We hope to convey the possible benefits of a closer collaboration between the two communities and conclude with a discussion of open challenges.Comment: To appear in Computational Linguistics. Accepted for publication: 18th February, 201

Reweighted belief propagation and quiet planting for random K-SAT

We study the random K-satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause. We apply belief propagation and the related cavity method to the reweighted partition function. This allows us to obtain several new results on the properties of random K-satisfiability problem. In particular the reweighting allows to introduce a planted ensemble that generates instances that are, in some region of parameters, equivalent to random instances. We are hence able to generate at the same time a typical random SAT instance and one of its solutions. We study the relation between clustering and belief propagation fixed points and we give a direct evidence for the existence of purely entropic (rather than energetic) barriers between clusters in some region of parameters in the random K-satisfiability problem. We exhibit, in some large planted instances, solutions with a non-trivial whitening core; such solutions were known to exist but were so far never found on very large instances. Finally, we discuss algorithmic hardness of such planted instances and we determine a region of parameters in which planting leads to satisfiable benchmarks that, up to our knowledge, are the hardest known.Comment: 23 pages, 4 figures, revised for readability, stability expression correcte

Participatory design in the development of the wheelchair convoy system

<p>Abstract</p> <p>Background</p> <p>In long-term care environments, residents who have severe mobility deficits are typically transported by having another person push the individual in a manual wheelchair. This practice is inefficient and encourages staff to hurry to complete the process, thereby setting the stage for unsafe practices. Furthermore, the time involved in assembling multiple individuals with disabilities often deters their participation in group activities.</p> <p>Methods</p> <p>The Wheelchair Convoy System (WCS) is being developed to allow a single caregiver to move multiple individuals without removing them from their wheelchairs. The WCS will consist of a processor, and a flexible cord linking each wheelchair to the wheelchair in front of it. A Participatory Design approach – in which several iterations of design, fabrication and evaluation are used to elicit feedback from users – was used.</p> <p>Results</p> <p>An iterative cycle of development and evaluation was followed through five prototypes of the device. The third and fourth prototypes were evaluated in unmanned field trials at J. Iverson Riddle Development Center. The prototypes were used to form a convoy of three wheelchairs that successfully completed a series of navigation tasks.</p> <p>Conclusion</p> <p>A Participatory Design approach to the project allowed the design of the WCS to quickly evolve towards a viable solution. The design that emerged by the end of the fifth development cycle bore little resemblance to the initial design, but successfully met the project's design criteria. Additional development and testing is planned to further refine the system.</p

Hypergraph Learning with Line Expansion

Previous hypergraph expansions are solely carried out on either vertex level or hyperedge level, thereby missing the symmetric nature of data co-occurrence, and resulting in information loss. To address the problem, this paper treats vertices and hyperedges equally and proposes a new hypergraph formulation named the \emph{line expansion (LE)} for hypergraphs learning. The new expansion bijectively induces a homogeneous structure from the hypergraph by treating vertex-hyperedge pairs as "line nodes". By reducing the hypergraph to a simple graph, the proposed \emph{line expansion} makes existing graph learning algorithms compatible with the higher-order structure and has been proven as a unifying framework for various hypergraph expansions. We evaluate the proposed line expansion on five hypergraph datasets, the results show that our method beats SOTA baselines by a significant margin