Search results for "Information Science"
showing 10 items of 3627 documents
A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […
When Is an Affordance? Outlining Four Stances
2016
Part 3: Exploring Affect and Affordance; International audience; Affordance has emerged as a core concept in information systems (IS) research during the last decade. This relational concept is applied to understand and theorize the relationship between the social and the technical. In the works of the concept originator James Gibson, the relation was mainly portrayed as an ever-existing fact between the natural environment and an animal. In contrast, IS research focuses on relationships in-the-making between artificial things and human beings. In the IS context, we have identified vagueness in temporal and relational ontology: when do affordances exist and between whom or what? In this pap…
Emotional Design: Discovering Emotions Across Cars’ Morphologies
2020
The primary focus behind the overall design involves shifting from a designer-centric concept to a user-centric one. In essence, cars are utilitarian from an engineering point of view and symbolic-emotional from a social point of view. The modern car retains a strong social position and also generates vivid emotions. The tellability of a car is the priority when communicating with a customer. As a result, this paper proposes a computational approach towards studying the relationship between car morphology and the aforementioned produced emotions. Emotions are considered self-measurable and physiologically distinct. Each car is thus self-evaluated emotionally by a panel of potential users. T…
Exploring Virtual Reality as an Integrated Development Environment for Cyber-Physical Systems
2019
Cyber Physical Systems (CPS) development approaches tend to start from the physical (hardware) perspective, and the software is the final element in the process. However, this approach is unfit for the more software-intensive world that is increasingly iterative, connected, and constantly online. Many constraints prevent the application of iterative, incremental, and agile development methodologies, which now are the norm for many other fields of software. Time-consuming system validation can only start when both hardware and software components are ready, which implies that the software delivery and quality is almost always the final bottleneck in the CPS development and integration. Also …
Types of Mimetics for the Design of Intelligent Technologies
2019
Mimetic design means using a source in the natural or artificial worlds as an inspiration for technological solutions. It is based around the abstraction of the relevant operating principles in a source domain. This means that one must be able to identify the correct level of analysis and extract the relevant patterns. How this should be done is based on the type of source. From a mimetic perspective, if the design goal is intelligent technology, an obvious source of inspiration is human information processing, which we have called cognitive mimetics. This article offers some conceptual clarification on the nature of cognitive mimetics by contrasting it with biomimetics in the context of in…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
Watermarking for ontologies
2011
In this paper, we study watermarking methods to prove the ownership of an ontology. Different from existing approaches, we propose to watermark not by altering existing statements, but by removing them. Thereby, our approach does not introduce false statements into the ontology. We show how ownership of ontologies can be established with provably tight probability bounds, even if only parts of the ontology are being re-used. We finally demonstrate the viability of our approach on real-world ontologies.