Wyniki wyszukiwania - BazTech

1

Steganography in Audio Files: COTS Software Analysis

Marszałek Piotr, Bilski Piotr

International Journal of Electronics and Telecommunications

|

2023

|

Vol. 69, No. 1

121--126

EN

The paper presents the analysis of the Commercial Off-The-Shelf (COTS) software regarding the ability to be used in audio steganography techniques. Such methods are a relatively new tool for hiding and transmitting crucial information, also being used by hackers. In the following work, the publicly available software dedicated to audio steganography is examined. The aim was to provide the general operating model of the information processing in the steganographic effort. The embedding method was analyzed for each application, providing interesting insights and allowing classifying the methods. The results prove that it is possible to detect the hidden message within the specific audio file and identify the technique that was used to create it. This may be exploited further during the hacking attack detection and prevention.

2

Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees

Rajeshwari S., Rajesh M.

Fundamenta Informaticae

|

2022

|

Vol. 188, nr 4

269--284

EN

Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex set of the guest graph to the vertex set of the host graph. In multiprocessing systems, the interconnection networks enhance the efficient communication between the components in the system. Obtaining minimum wirelength in embedding problems is significant in the designing of networks and simulating one architecture by another. In this paper, we determine the wirelength of embedding 3-ary n-cubes into cylinders and certain trees.

3

Decision making support system for managing advertisers by ad fraud detection

Gabryel Marcin, Scherer Magdalena M., Sułkowski Łukasz, Damaševičius Robertas

Journal of Artificial Intelligence and Soft Computing Research

|

2021

|

Vol. 11, No. 4

331--339

EN

Efficient lead management allows substantially enhancing online channel marketing programs. In the paper, we classify website traffic into human- and bot-origin ones. We use feedforward neural networks with embedding layers. Moreover, we use one-hot encoding for categorical data. The data of mouse clicks come from seven large retail stores and the data of lead classification from three financial institutions. The data are collected by a JavaScript code embedded into HTML pages. The three proposed models achieved relatively high accuracy in detecting artificially generated traffic.

4

Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees

Arockiaraj Micheal, Delaila J. Nancy, Abraham Jessie

Fundamenta Informaticae

|

2021

|

Vol. 178, nr 3

187--202

EN

In any interconnection network, task allocation plays a major role in the processor speed as fair distribution leads to enhanced performance. Complete multipartite networks serve well for this purpose as the task can be split into different partites which improves the degree of reliability of the network. Such an allocation process in the network can be done by means of graph embedding. The optimal wirelength of a graph embedding helps in the distribution of deterministic algorithms from the guest graph to other host graphs in order to incorporate its unique deterministic properties on that chosen graph. In this paper, we propose an algorithm to compute the optimal wirelength of balanced complete multipartite graphs onto the Cartesian product of trees with path and cycle. Moreover, we derive the closed formulae for wirelengths in specific trees like (1-rooted) complete binary tree and sibling graphs.

5

A strong and efficient baseline for vehicle re-identification using deep triplet embedding

Kumar Ratnesh, Weill Edwin, Aghdasi Farzin, Sriram Parthasarathy

Journal of Artificial Intelligence and Soft Computing Research

|

2020

|

Vol. 10, No. 1

27--45

EN

In this paper we tackle the problem of vehicle re-identification in a camera network utilizing triplet embeddings. Re-identification is the problem of matching appearances of objects across different cameras. With the proliferation of surveillance cameras enabling smart and safer cities, there is an ever-increasing need to re-identify vehicles across cameras. Typical challenges arising in smart city scenarios include variations of viewpoints, illumination and self occlusions. Most successful approaches for re-identification involve (deep) learning an embedding space such that the vehicles of same identities are projected closer to one another, compared to the vehicles representing different identities. Popular loss functions for learning an embedding (space) include contrastive or triplet loss. In this paper we provide an extensive evaluation of triplet loss applied to vehicle re-identification and demonstrate that using the recently proposed sampling approaches for mining informative data points outperform most of the existing state-of-the-art approaches for vehicle re-identification. Compared to most existing state-of-the-art approaches, our approach is simpler and more straightforward for training utilizing only identity-level annotations, along with one of the smallest published embedding dimensions for efficient inference. Furthermore in this work we introduce a formal evaluation of a triplet sampling variant (batch sample) into the re-identification literature. In addition to the conference version [24], this submission adds extensive experiments on new released datasets, cross domain evaluations and ablation studies.

6

Universes and simulations: Civilizational development in nested embedding

Komosinski M.

Foundations of Computing and Decision Sciences

|

2018

|

Vol. 43, No. 3

181--205

EN

The rapid development of technology has allowed computer simulations to become routinely used in an increasing number of fields of science. These simulations become more and more realistic, and their energetic efficiency grows due to progress in computer hardware and software. As humans merge with machines via implants, brain-computer interfaces and increased activity involving information instead of material objects, philosophical concepts and theoretical considerations on the nature of reality are beginning to concern practical, working models and testable virtual environments. This article discusses how simulation is understood and employed in computer science today, how software, hardware and the physical universe unify, how simulated realities are embedded one in another, how complicated it can get in application, practical scenarios, and the possible consequences of these situations. A number of basic properties of universes and simulations in such multiply nested structures are reviewed, and the relationship of these properties with a level of civilizational development is explored.

7

M-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence

Ehrig H., Golas U., Habel A., Lambers L., Orejas F.

Fundamenta Informaticae

|

2012

|

Vol. 118, nr 1-2

35-63

EN

Graph transformation systems have been studied extensively and applied to several areas of computer science like formal language theory, the modeling of databases, concurrent or distributed systems, and visual, logical, and functional programming. In most kinds of applications it is necessary to have the possibility of restricting the applicability of rules. This is usually done by means of application conditions. In this paper, we continue the work of extending the fundamental theory of graph transformation to the case where rules may use arbitrary (nested) application conditions. More precisely, we generalize the Embedding theorem, and we study how local confluence can be checked in this context. In particular, we define a new notion of critical pair which allows us to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. All our results are presented, not for a specific class of graphs, but for any arbitraryM-adhesive category, which means that our results apply to most kinds of graphical structures. We demonstrate our theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.

8

Infinite Asymptotic Games and (∗)-Embeddings of Banach Spaces

Karadakis G. N. I.

Bulletin of the Polish Academy of Sciences. Mathematics

|

2012

|

Vol. 60, no 2

133-154

EN

We use methods of infinite asymptotic games to characterize subspaces of Banach spaces with a finite-dimensional decomposition (FDD) and prove new theorems on operators. We consider a separable Banach space X, a set S of sequences of finite subsets of X and the S-game. We prove that if S satisfies some specific stability conditions, then Player I has a winning strategy in the S-game if and only if X has a skipped-blocking decomposition each of whose skipped-blockings belongs to S. This result implies that if T is a (∗)-embedding of X (a 1-1 operator which maps the balls of subspaces with an FDD to weakly Gδ sets), then, for every n≥4, there exist n subspaces of X with an FDD that generate X and the restriction of T to each of them is a semi-embedding under an equivalent norm. We also prove that X does not contain isomorphic copies of dual spaces if and only if every (∗)-embedding defined on X is an isomorphic embedding. We also deal with the case where X is non-separable, reaching similar results.

9

Extending Maps in Hilbert Manifolds

Niemiec P.

Bulletin of the Polish Academy of Sciences. Mathematics

|

2012

|

Vol. 60, no 3

295--306

EN

Certain results on extending maps taking values in Hilbert manifolds by maps which are close to being embeddings are presented. Sufficient conditions on a map under which it is extendable by an embedding are given. In particular, it is shown that if X is a completely metrizable space of topological weight not greater than α≥ℵ0, A is a closed set in X and f:X→M is a map into a manifold M modelled on a Hilbert space of dimension α such that f(X∖A)∩f(∂A)=∅, then for every open cover U of M there is a map g:X→M which is U-close to f (on X), coincides with f on A and is an embedding of X∖A into M. If, in addition, X∖A is a connected manifold modelled on the same Hilbert space as M, and f(∂A) is a Z-set in M, then the above map g may be chosen so that g|X∖A be an open embedding.

10

A Paraconsistent Linear-time Temporal Logic

Kamide N., Wansing H.

Fundamenta Informaticae

|

2011

|

Vol. 106, nr 1

1-23

EN

Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time temporal logic (PLTL), is obtained semantically from the linear-time temporal logic LTL by adding a paraconsistent negation. Some theorems for embedding PLTL into LTL are proved, and PLTL is shown to be decidable. A Gentzentype sequent calculus PLT! for PLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. In addition, a display calculus äPLT! for PLTL is defined.

11

On monoids of injective partial selfmaps almost everywhere the identity

Chuchman I., Gutik O.

Demonstratio Mathematica

|

2011

|

Vol. 44, nr 4

699-722

EN

In this paper we study the semigroup (…) of injective partial selfmaps almost everywhere the identity of a set of infinite cardinality (…). We describe the Green relations on (…), all (two-sided) ideals and all congruences of the semigroup (…). We prove that every Hausdorff hereditary Baire topology (…) such that (…) is a semitopological semigroup is discrete and describe the closure of the discrete semigroup (…) in a topological semigroup. Also we show that for an infinite cardinal (…) the discrete semigroup (…) does not embed into a compact topological semigroup and construct two non-discrete Hausdorff topologies turning (…) into a topological inverse semigroup.

12

Adaptive vibration control through a SMA embedded panel

Diodati G., Ameduri S., Concilio A.

Journal of Theoretical and Applied Mechanics

|

2007

|

Vol. 45 nr 4

919-930

EN

Dynamic behavior of structural elements and their performance in terms of noise and vibration control may be remarkably affected by several parameters, like geometry, material properties, stress field, etc. Ability of adaptively controlling one or more of these parameters leads to a structure fitting different requirements in several working conditions. Research activities presented in this work are focused on the design of a fiberglass laminate structural element with SMA wires embedded along the widest dimension. SMA contraction by the Joule effect heat adduction leads, if suitably constrained on the edges, to an internal stress field with a consequent over-all stiffness increase. The finite element code MSC.NASTRAN is used to simulate the whole system made of a plate and SMA wires controlling elements. The behavior of the SMA is modeled through the NASTRAN card CELAS that allows one to consider the additional SMA activation stiffness with a suitable "spring" constant, depending on the wire temperature and a suitable discretization parameter. The finite difference model of the SMA is achieved and integrated in the FEM solver.

PL

Właściwości dynamiczne elementów konstrukcyjnych oraz ich cechy rozważane pod kątem sterowalności drganiami i hałasem mogą być znacząco zmieniane takim parametrami jak geometria, właściwości materiałowe, pole naprężeń, itp. Zdolność do modyfikacji jednego lub więcej z wyżej wymienionych parametrów tworzy konstrukcję adaptowalną do różnych warunków pracy. Badania opisane w artykule dotyczą panelu wykonanego z laminatu wzmacnianego włóknem szklanym i dodatkowo zawierającego druty ze stopu z pamięcią kształtu (SMA) umieszczone wzdłuż największego wymiaru panelu. Kurczenie się stopu wywołane efektem Joule'a przy obecności źródła ciepła wytwarza wewnętrzne pole naprężeń, które prowadzi wprost do zwiększenia sztywności panelu. Do analizy całego układu laminowanej płyty i zatopionych drutów SMA użyto pakietu MSC.NASTRAN. Zachowanie SMA symulowano w pakiecie za pomocą karty CELAS, która pozwoliła na uwzględnienie dodatkowej sztywności od aktywacji SMA poprzez wprowadzenie nowej "sprężyny" o sztywności zależnej od temperatury oraz zadeklarowanego parametru dyskretyzacji. Model SMA wygenerowany metodą elementów skończonych poddano całkowaniu wewnątrz zastosowanego pakietu MES.

13

2-biplacement without fixed points of (p, q)-bipartite graphs

Orchel B.

Opuscula Mathematica

|

2005

|

Vol. 25, no. 2

269-274

EN

In this paper we consider 2-biplacement without fixed points of paths and (p, q)--bipartite graphs of small size. We give all (p, q)-bipartite graphs G of size q for which the set S*(G) of all 2-biplacements of G without fixed points is empty.