Wyszukiwarka
Filtry
wszystkich: 52
wybranych: 14
Wyniki wyszukiwania dla: computer v
-
Simulating malware with MAlSim
PublikacjaThis paper describes MAlSim - Mobile Agent Malware Simulator - a mobile agent framework developed to address one of the most important problems related to the simulation of attacks against information systems, i.e. the lack of adequate tools for reproducing behaviour of malicious software (malware). The framework can be deployed over the network of an arbitrary information system and it aims at simulating behaviour of each instance...
-
Computer simulation of current voltage response of elektrocatalytic sensor.Optoelectronic and Electronic Sensors V.
PublikacjaW pracy przedstawiono wyniki symulacji komputerowej działania czujnika elektrokatalitycznego. Do badań wykorzystano program D. Gossera opierający się na metodzie różnic skończonych.
-
Model-based testing for execution algorithms in the simulation of cyber-physical systems
PublikacjaThe understanding of simulation semantics of a hybrid system is a challenge for computational engineers as it requires expertise in computer science, engineering, numerical methods, and mathematics at once. The testing methods for the execution of a simulation are being researched but not yet applied on the industrial level. Consequently, the semantics of the simulation becomes a critical artifact in the system development process....
-
Ship weather routing featuring w-MOEA/D and uncertainty handling
PublikacjaThe paper presents a new version of evolutionary multi-objective weather routing (WR) for ships taking into account uncertainties of weather forecasts in route optimization. The method applies authors’ w-MOEA/D algorithm: MOEA/D framework incorporating Decision Maker’s (DM) preferences by means of w-dominance relation. Owing to this, DM preferences are taken into account throughout optimization, allowing the process to focus on...
-
Daylight Appraisal Classes For Achitecture Students A Survey Combined With A Practical Assessment For Educational Training Recommendations
PublikacjaThe main objectives of this article are: (i) to present the relations between architecture students' subjective assessment of daylight in classrooms and the objective evaluation of daylit conditions using daylight simulations tools, (ii) to formulate guidelines and recommendations on daylight appraisal methods and tools which may be useful in architectural training. The methodology used includes an evaluation of the results of...
-
Multiple Cues-Based Robust Visual Object Tracking Method
PublikacjaVisual object tracking is still considered a challenging task in computer vision research society. The object of interest undergoes significant appearance changes because of illumination variation, deformation, motion blur, background clutter, and occlusion. Kernelized correlation filter- (KCF) based tracking schemes have shown good performance in recent years. The accuracy and robustness of these trackers can be further enhanced...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Clearing directed subgraphs by mobile agents
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
A new open-source software developed for numerical simulations usingdiscrete modeling methods
PublikacjaThe purpose of this work is to present the development of an open-source software based on a discrete description of matter applied to study the behavior of geomaterials. This software uses Object Oriented Programming techniques, and its methodology design uses three different methods, which are the Discrete Element Method (DEM) [F. Donzé, S.A. Magnier, Formulation of a three-dimensional numerical model of brittle behavior, Geophys....
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Experience based knowledge representation for Internet of Things and Cyber Physical Systems with case studies
PublikacjaCyber Physical Systems and Internet of Things have grown significant attention from industry and academia during the past decade. The main reason behind this interest is the capabilities of such technologies to revolutionize human life since they appear as seamlessly integrating classical networks, networked objects and people to create more efficient environments. However, enhancing these technologies with intelligent skills becomes...