ppxscal/embedding_network huggingface dataset:
Multimedia interfaces for users with high functioning autism: An empirical investigation
Authors: Ouriel Grynszpan, Jean-Claude Martin, Jacqueline Nadel
Venue: International Journal of Human-Computer Studies (2008)

This article focuses on issues relevant to human-computer interaction in the case of autism. We designed training software that target specific communicative disorders attributed to autism and defined an empirical protocol to test this software. The experimental software platform that we developed manages each game's interface modalities and logs users' actions, for the purpose of exploring the impact of various human-computer interfaces, which involve text, speech and images. Ten adolescents diagnosed with autism used this software during 13 sessions, at the rate of one session per week. The first and last sessions were dedicated for evaluating participants' skills. The experiment was also performed by a group of 10 typically developing children matched on developmental age and academic level. Results show that participants with autism had poorer performances on the richer multimedia interfaces. They seemed to lack the initiative of organizing the available multimodal sources of information. In this article, we specifically discuss the impact of executive disorders on the use of multimodal interfaces with an emphasis on Animated Conversational Agents.
fficient and Provably Secure Generic Construction of Client-to-Client Password-Based Key Exchange Protocol
Authors: Zhoujun Li, Hua Guo, Xiyong Zhang
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Client-to-client password authenticated key exchange (C2C-PAKE) protocol enables two clients who only share their passwords with their own servers to establish a shared key for their secure communications. Recently, Byun et al. and Yin-Li respectively proposed first provably secure C2C-PAKE protocols. However, both protocols are found to be vulnerable to undetectable online dictionary attacks and other attacks. In this paper, we present an efficient generic construction for cross-realm C2C-PAKE protocols and prove its security in the Random-or-Real model due to Abdalla et al., without making use of the Random Oracle model.
On one method for determining of the coefficients of specific heat in the multilayered areas
Authors: Sharif E. Guseinov
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

In various fields of science and technology it is often necessary to solve inverse problems, where from measurements of state of the system or process it is required to determine a certain typesetting of the causal characteristics. It is known that infringement of the natural causal relationships can entail incorrectness of the mathematical stating of inverse problems. Therefore the development of efficient methods for solving such problems allows one to considerably simplify experimental research and to increase the accuracy and reliability of the obtained results due to certain complication of algorithms for processing the experimental data. The problem of determination of specific heat (or thermal diffusivity) coefficients considering other known characteristics of heat transport process is among incorrect inverse problems. These inverse problems for coefficients are quite difficult even in the case of homogenous media. In this paper it is supposed that the heat transport equation is non-homogeneous and an algorithm for determination of the specific heat coefficients for both the media is proposed. In this work it is considered the two-dimensional coefficient inverse problem in the layered area. In order to determine the characteristics of area, at first the method of conservative averaging is applied to the initial problem. The obtained one-dimensional inverse problem is system of two differential equations and consists of the determination of some entering in it parameters. After solving this problem, we will find the pseudo-characteristics of the considered layered area. Further in the work it is proposed the method of obtaining the true characteristics of the layered area with any accuracy on basis of available pseudocharacteristic data. In the work also it is proved the stability of the proposed method for determining of all coefficients of specific heat of multilayered areas.
T-shape homogenous block patterns for the two-dimensional cutting problem
Authors: Yaodong Cui, Zhiyong Liu
Venue: Journal of Global Optimization (2008)

This paper presents an algorithm for unconstrained T-shape homogenous block cutting patterns of rectangular pieces. A vertical cut divides the stock sheet into two segments. Each segment consists of sections that have the same length and direction. A section contains a row of homogenous blocks. A homogenous block consists of homogenous strips of the same piece type. Each cut on the block produces just one strip. The directions of two strips cut successively from a block are either parallel or orthogonal. The algorithm uses a dynamic programming recursion to generate optimal blocks, solves knapsack problems to obtain the block layouts on the sections and the section layout on segments of various lengths, and optimally selects two segments to compose the cutting pattern. The computational results indicate that the algorithm is efficient in improving material usage, and the computation time is reasonable.
Hubert L. Dreyfus's Critique of Classical AI and its Rationalist Assumptions
Authors: Setargew Kenaw
Venue: Minds and Machines (2008)

This paper deals with the rationalist assumptions behind researches of artificial intelligence (AI) on the basis of Hubert Dreyfus's critique. Dreyfus is a leading American philosopher known for his rigorous critique on the underlying assumptions of the field of artificial intelligence. Artificial intelligence specialists, especially those whose view is commonly dubbed as "classical AI," assume that creating a thinking machine like the human brain is not a too far away project because they believe that human intelligence works on the basis of formalized rules of logic. In contradistinction to classical AI specialists, Dreyfus contends that it is impossible to create intelligent computer programs analogous to the human brain because the workings of human intelligence is entirely different from that of computing machines. For Dreyfus, the human mind functions intuitively and not formally. Following Dreyfus, this paper aims to pinpointing the major flaws classical AI suffers from. The author of this paper believes that pinpointing these flaws would inform inquiries on and about artificial intelligence. Over and beyond this, this paper contributes something indisputably original. It strongly argues that classical AI research programs have, though inadvertently, falsified an entire epistemological enterprise of the rationalists not in theory as philosophers do but in practice. When AI workers were trying hard in order to produce a machine that can think like human minds, they have in a way been testing--and testing it up to the last point--the rationalist assumption that the workings of the human mind depend on logical rules. Result: No computers actually function like the human mind. Reason: the human mind does not depend on the formal or logical rules ascribed to computers. Thus, symbolic AI research has falsified the rationalist assumption that `the human mind reaches certainty by functioning formally' by virtue of its failure to create a thinking machine.
A hierarchical clustering algorithm based on the Hungarian method
Authors: Jacob Goldberger, Tamir Tassa
Venue: Pattern Recognition Letters (2008)

We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient algorithm for solving the problem of minimal-weight cycle cover. We utilize the Hungarian method as the basic building block of our clustering algorithm. The disjoint cycles, produced by the Hungarian method, are viewed as a partition of the data-set. The clustering algorithm is formed by hierarchical merging. The proposed algorithm can handle data that is arranged in non-convex sets. The number of the clusters is automatically found as part of the clustering process. We report an improved performance of our algorithm in a variety of examples and compare it to the spectral clustering algorithm.
A Context-Aware Statistical Ontology Approach for Adaptive Face Recognition
Authors: Md. Rezaul Bashar, Sung Kwan Kang, Pankaj Raj Dawadi, Phill Kyu Rhee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper proposes a statistical ontology approach for adaptive face recognition in a situation variant environment. In this paper, we have introduced a new concept statistical ontology for context sensitivity, as we found many developed systems work on context invariant environment. Due to the effects of illumination makes a supreme obstinate designing context sensitive recognition system; we have given more emphasis to design such a context variant system using statistical ontology. Ontology can be defined as an explicit specification of conceptualization of a domain typically captured in an abstract model of how people think about things in the domain. Human produces ontologies to understand and explain underlying principle and environment. In this research, we have proposed context ontology, context modeling, context adaptation, and context categorization to design ontology based on illumination criteria. After selecting proper domain of ontology, we have benefited to select a set of action that produces better performance on that domain. We have carried out extensive experiments on these concepts in the region of object recognition in dynamic changing environment and we have achieved an enormous success to proceed for our basic concepts.
A Reliable DICOM Transfer Grid Service Based on Petri Net Workflows
Authors: Michal Vossberg, Andreas Hoheisel, Thomas Tolxdorff, Dagmar Krefting
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Medical grid networks typically deal with extremely sensitive information and therefore require a special diligence in terms of security and reliability. This holds especially true in Medical Imaging, which is why the medical community long established DICOM (Digital Imaging and Communicationin Medicine), a world-wide imaging and communication standard for secure and reliable data interchange. Most healthgrid projects today use DICOM witha combination of GridFTP and the Reliable-File-Transfer(RFT) web service. Due to the multiple protocols and services involved, this solution is not ideally suited in termsof reliability or fault-tolerance. The proposed solution in this paper replaces the GridFTP combination by an end-to-end Grid-enhanced DICOM implementation and models the GridDICOM transfers as complex, Petri-Nets-based workflows. Based on these workflows, a respective workflow engine can autonomously and reliably control transfers including complex fault recovery and optimized routing strategies. A first prototype of the service, the components,and the respective workflows have been developed and successfully tested in MediGRID, the German grid network forlife-sciences.
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
Authors: Subhas Kumar Ghosh
Venue: Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering (2008)

In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowledge, this is the first work looking into the aspects of designing a distributed approximation algorithm for the MECBS. Given input graph G = (V,E) with |V| = n, our algorithm has approximation ratio of $2 H_{n-1}$ with time complexity ${\mathcal O}(n \cdot \Lambda(G))$, where $H_{n}$ is the $n$th Harmonic Number, and $\Lambda(G)$ denotes the diameter of the graph $G$. Second, we present an improved sequential approximation algorithm for the MECBS problem with arbitrary asymmetric power requirement having performance ratio $1.5\left(\ln{\left(n-1\right)} + 1\right)$, hence improving all known results for MECBS problem in most general case. Our improvement in MECBS problem also implies that there is a $1.5\ln{\left(n-1\right)} + 2.5$ -- approximation algorithm for strong connectivity with asymmetric power requirements.
COOPERATIVE QUERY REWRITING FOR DECISION MAKING SUPPORT AND RECOMMENDER SYSTEMS
Authors: Nader Mirzadeh, Francesco Ricci
Venue: Applied Artificial Intelligence (2007)

This article presents a new technology called interactive query management (IQM), designed for supporting flexible query management in decision support systems and recommender systems. IQM aims at guiding a user to refine a query to a structured repository of items when it fails to return a manageable set of products. Two failure conditions are considered here, when a query returns either too many products or no product at all. In the former case, IQM uses feature selection methods to suggest some features that, if used to further constrain the current query, would greatly reduce the result set size. In the latter case, the culprits of the failure are determined by a relaxation algorithm and explained to the user, enumerating the constraints that, if relaxed, would solve the "no results" problem. As a consequence, the user can understand the causes of the failure and decide what is the best query relaxation. After having presented IQM, we illustrate its empirical evaluation. We have conducted two types of experiments, with real users and offline simulations. Both validation procedures show that IQM can repair a large percentage of user queries and keep alive the human computer interaction until the user information goals are satisfied.
A framework to support automated classification and labeling of brain electromagnetic patterns
Authors: Gwen A. Frishkoff, Robert M. Frank, Jiawei Rong, Dejing Dou, Joseph Dien, Laura K. Halderman
Venue: Computational Intelligence and Neuroscience (2007)

This paper describes a framework for automated classification and labeling of patterns in electroencephalographic (EEG) and magnetoencephalographic (MEG) data. We describe recent progress on four goals: 1) specification of rules and concepts that capture expert knowledge of event-related potentials (ERP) patterns in visual word recognition; 2) implementation of rules in an automated data processing and labeling stream; 3) data mining techniques that lead to refinement of rules; and 4) iterative steps towards system evaluation and optimization. This process combines top-down, or knowledge-driven, methods with bottom-up, or data-driven, methods. As illustrated here, these methods are complementary and can lead to development of tools for pattern classification and labeling that are robust and conceptually transparent to researchers. The present application focuses on patterns in averaged EEG (ERP) data. We also describe efforts to extend our methods to represent patterns inMEG data, as well as EM patterns in source (anatomical) space. The broader aim of this work is to design an ontology-based system to support cross-laboratory, cross-paradigm, and cross-modal integration of brain functional data. Tools developed for this project are implemented in MATLAB and are freely available on request.
Task results processing for the needs of task-oriented design environments
Authors: Irina Zheliazkova, R. Kolev
Venue: Computers Education (2008)

This paper presents learners' task results gathered by means of an example task-oriented environment for knowledge testing and processed by EXCEL. The processing is domain- and task-independent and includes automatic calculation of several important task and session's parameters, drawing specific graphics, generating tables, and analyzing the correlation coefficient. The intention is to design and implement a specialized tool called postprocessor for support of a common task base, learner's model and decision making of the author and teacher by means of an environment for individually planned teaching courseware.
Thoughts on the Nature of the Virtual
Authors: Charalambos Tsekeris
Venue: Ubiquity (2008)

This article seeks to formulate some brief sociological and philosophical thoughts on the radically problematic nature and character of the virtual. These ultimately aim to critically challenge and reinvent the complex interrelations of contemporary virtuality to the real and the political. In such a context, new media studies acquire a normative impetus.
UniProtJAPI
Authors: Samuel Patient, Daniela Wieser, Michael Kleen, Ernst Kretschmann, Maria Jesus Martin, Rolf Apweiler
Venue: Bioinformatics (2008)

Summary: Programmatic access to the UniProt Knowledgebase (UniProtKB) is essential for many bioinformatics applications dealing with protein data. We have created a Java library named UniProtJAPI, which facilitates the integration of UniProt data into Java-based software applications. The library supports queries and similarity searches that return UniProtKB entries in the form of Java objects. These objects contain functional annotations or sequence information associated with a UniProt entry. Here, we briefly describe the UniProtJAPI and demonstrate its usage. Availability: http://www.ebi.ac.uk/uniprot/remotingAPI Contact: spatient@ebi.ac.uk
Enforcing security properties in task-based systems
Authors: Keith Irwin, Ting Yu, William H. Winsborough
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Though a user's privileges are often granted based on the tasks that the user is expected to fulfill, the concept of tasks is usually not explicitly modeled in access control. We propose a system where tasks are the central concept that associates users to privileges. Ideally a user should be able to utilize these privileges and fulfill his tasks, but not to take harmful actions. To ensure this, a system often specifies a high-level security property to restrict the sequence of actions that a user can perform. In this paper, we propose a general model of access control in task-based system. This model considers the permissions a user as well as their temporal availability. Based on this model, we investigate the problem of enforcing security properties both statically (i.e., when tasks are assigned) and dynamically (i.e., when actions are performed). We study the complexity of static enforcement, and design efficient dynamic enforcement algorithms that avoiding unnecessary history tracking.
Computational photography and video: interacting and creating with videos and images
Authors: Irfan Essa
Venue: Proceedings of the working conference on Advanced visual interfaces (2008)

Digital image capture, processing, and sharing has become pervasive in our society. This has had significant impact on how we create novel scenes, how we share our experiences, and how we interact with images and videos. In this talk, I will present an overview of series of ongoing efforts in the analysis of images and videos for rendering novel scenes. First I will discuss (in brief) our work on Video Textures, where repeating information is extracted to generate extended sequences of videos. I will then describe some our extensions to this approach that allows for controlled generation of animations of video sprites. We have developed various learning and optimization techniques that allow for video-based animations of photorealistic characters. Using these sets of approaches as a foundation, then I will show how new images and videos can be generated. I will show examples of Photorealistic and Non-photorealistic Renderings of Scenes (Videos and Images) and how these methods support the media reuse culture, so common these days with user generated content. Time permitting, I will also share some of our efforts on video annotation and how we have taken some of these new concepts of video analysis to undergraduate classrooms.
One-way functions are essential for complexity based cryptography
Authors: R. Impagliazzo
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is shown that many of the standard cryptographic tasks are equivalent to the usual definition of a one-way function. In particular, it is shown that for some of the standard cryptographic tasks any secure protocol for the task can be converted into a one-way function in the usual sense, and thus the security of any proposed protocol for these tasks is implicitly based on a function being 'one-way.' Thus, the usual definition of a one-way function is robust; any one-way function with respect to another definition on which a secure cryptographic protocol can be based can be used to construct a one-way function in the usual sense. The authors focus on private-key encryption, identification/authentication, bit commitment, and coin flipping by telephone. However, the proof techniques presented here can be easily adopted to prove analogous results for other cryptographic tasks.
Technologies and Strategies for Integrating Object-Oriented Analysis and Design Education with Programming
Authors: Justin C. W. Debuse, Tony Stiller
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

A range of technologies and teaching strategies may be used to improve the quality of teaching object-oriented (OO) concepts where there is a close relationship between OO analysis and design (OOAD) combined with OO programming (OOP). This study investigates the application of a number of these technologies and teaching strategies across university courses in OOAD and OOP, using an empirical approach based upon attitudinal and student performance data. The systems used include: development environments that provide two-way linkage between UML diagrams and OO program code; interactive whiteboards to allow educational demonstrations that more closely represent actual practice; and an online delivery tool for course content, messages and discussions. Close integration between the processes of OOAD and OOP courses is also investigated. The approaches significantly improved student grades, perceived levels of understanding and productivity. The integration of course concepts and assignments, and the electronic discussion boards, are key benefit drivers.
Optimising video summaries for mobile devices using visual attention modelling
Authors: Janko Calic, Neill Campbell
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

In order to represent large video collections in the form of key-frame summary on small screen devices, this paper exploits methodology of the visual attention modelling and rapid serial visual presentation. This approach results in an intuitive layout of efficiently generated video summaries. A robust real-time algorithm for key-frame extraction is presented. The system ranks importance of key-frame regions in the final layout by exploiting visual attention modelling. A final layout is created using an optimisation algorithm based on dynamic programming. Algorithm efficiency and robustness are demonstrated by comparing the results with the manually labelled ground truth.