Search results for "NETWORKS"

Toward a Theory of Information Systems Security Behaviors of Organizational Employees: A Dialectical Process Perspective

2019

Practice-/policy-oriented abstract: Understanding why employees do or do not comply with information systems security (ISS) procedures is an imperative in today’s organizations whose futures often depend on how well they protect and harness information assets. We use a predominantly inductive approach to develop a theoretical understanding of how employees’ reasons for engaging to ISS behaviors (ISSBs) change over time, using ideas from dialectics as our scaffolding. Our dialectical view of this process suggests that explanations for engaging in different ISSBs change over time as individuals seek to balance contradictory demands. Furthermore, our view suggests that new experiences and ext…

Per-flow signalling extension across DiffServ domains

2003

This paper describes a framework devised to extend per-flow admission control operation across Differentiated Services domains. Although the specific case of interoperability with RSVP is under discussion, our proposal can be easily adapted to other hop-by-hop signalling protocols. In our framework, DiffSery border routers accomplish three tasks. First, during the set-up phase, flows are mapped onto PHB groups on the basis of their QoS and traffic specifications. Second, signalling packets are tunnelled into IP packets marked as “probes”, where the “probe” marking is a DCSP value associated to the considered PHB Group. Third, when the flow set-up is complete, flow data packets are marked as…

A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

2013

[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.

Three‐Component Self‐Assembly Changes its Course: A Leap from Simple Polymers to 3D Networks of Spherical Host–Guest Assemblies

2021

Angewandte Chemie / International edition 60(21), 12132 - 12142 (2021). doi:10.1002/anie.202103178

Impact of the community structure on the dynamics of complex networks

2023

Networks are everywhere. We encounter them daily in our lives, through our social interactions, how we come up with decisions in our brain, to having phone calls, conducting financial transactions, and traveling from one place to another. Individual actions are influenced by their environment, which is, in turn, influenced by the network's topology. Notably, individuals may change their actions, ideas, or opinions to conform to the aspirations of a particular social group. In the same vein, the spread of a virus can take a certain course if the network's structure induces specific pathways for expansion. In such scenarios, communities substantially impact the evolution of the dynamics. They…

Traitement d'images avec un système non linéaire

2017

National audience; Cette communication porte sur la présentation d’un outil de traitement d’images s’inspirant des processus de réaction-diffusion.Cet outil s’appuie sur des ́equations différentielles non linéaires et tire plus particulièrement profit des propriétéde multistabilité liées à la non linéarité de ces processus de diffusion. Certaines caractéristiques d’une image peuvent ainsi être extraites.

2021

Abstract The use of the internet and social media have changed consumer behavior and the ways in which companies conduct their business. Social and digital marketing offers significant opportunities to organizations through lower costs, improved brand awareness and increased sales. However, significant challenges exist from negative electronic word-of-mouth as well as intrusive and irritating online brand presence. This article brings together the collective insight from several leading experts on issues relating to digital and social media marketing. The experts’ perspectives offer a detailed narrative on key aspects of this important topic as well as perspectives on more specific issues i…

Capabilities of Ultrametric Automata with One, Two, and Three States

2016

Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.

On the Hierarchy Classes of Finite Ultrametric Automata

2015

This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…

NP-completeness of the hamming salesman problem

1985

It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.