Filters
total: 5754
-
Catalog
- Publications 4216 available results
- Journals 88 available results
- Conferences 1 available results
- Publishing Houses 4 available results
- People 126 available results
- Inventions 3 available results
- Projects 22 available results
- Laboratories 2 available results
- Research Teams 2 available results
- Research Equipment 1 available results
- e-Learning Courses 478 available results
- Events 39 available results
- Offers 1 available results
- Open Research Data 771 available results
displaying 1000 best results Help
Search results for: BRANCH-AND-BOUND
-
Algorytm branch-and-bound dla pewnego problemu szeregowania zadań uwarunkowanych czasowo
PublicationW artykule został przedstawiony algorytm branch-and-bound dla problemu szeregowania zadań uwarunkowanych czasowo 1 | pi = 1 + aisi | sum Ci. Przedstawiono także wyniki eksperymentów komputerowych prezentujących wydajność algorytmu. Zastosowanie przedstawionego algorytmu umożliwia powiększenie "obliczalnych" rozmiarów instancji o 6-10 zadań w stosunku do algorytmu pełnego przeszukiwania.
-
A General Scheme of a Branch-and-Bound Approach for the Sensor Selection Problem in Near-Field Broadband Beamforming
Publication -
JOURNAL OF SOUND AND VIBRATION
Journals -
Personal Branding and Brand Loyalty, Social Network Users Brand Identification: Polish-French Model
PublicationSocial network brand sites are increasingly attracting the attention of scientists and managers intrigued by their potential application for brand value creation. The aim of this research, based on a multinational sample, is to fill the gap in understanding how users choose among social networking sites as an act of brand identification. The authors of the paper point to the fact that creating a personal brand is becoming more...
-
Anab initiostudy of (H3B←NH3)−—a dipole-bound anion supported by the dative charge-transfer bond in the neutral host
Publication -
A dipole-bound dianion
Publication -
Black Devils in Normandy—Identification of an Unknown Soldier Found in the Polish War Cemetery of Urville-Langannerie (France)
Publication -
Dipole-bound and dispersion-bound anions supported by the asymmetric tautomers of aminophosphine: H3NPH and HNPH3
Publication -
Bi-dipole-bound anions
Publication -
12 [Chapter]. Bound entanglement
PublicationKwantowe splątanie jest jednym z podstawowych elementów kwantowej teorii informacji. Jak wiadomo niskowymiarowe (2otimes 2 i 2otimes 3) splątane stany kwantowe są zawsze destylowalne. W wyższych wymiarach jednak istnieją stany, które mimo, że są splątane nie pozwalają na destylację. Ten rodzaj splątania, nazywany związanym, jest często trudny do wykrycia i pozornie bezużyteczny. Jak pokazują jednak liczne badania splątanie związane...
-
Retrato da Cidade Castelo Branco/ Portret miasta Castelo Branco
Publication -
Implementing the consumer-based brand equity scale for beer brands – a Tyskie and Żywiec case study
PublicationThe concept and management of brand equity is of great importance to scholars and managers. In this article, brand equity is approached from the consumers’ point of view i.e., consumer-based brand equity (CBBE) in the context of two beer brands offered in Poland – Tyskie and Żywiec. The objective of this article is to demonstrate how managers can implement the CBBE scale as an audit and monitoring instrument to their brands. A...
-
Castelo Branco Cityscapes
Publication -
On root finding algorithms for complex functions with branch cuts
PublicationA simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain. For any complex function defined by a finite number of Riemann sheets, a pointwise product of all the surfaces can be obtained. Such single-valued function is free of discontinuity caused by branch cuts and branch points. The roots of the new function are the same as the...
-
The correlation-bound anion of p-chloroaniline
Publication -
Secure key from bound entanglement
PublicationScharakteryzowaliśmy zestaw dzielonych kwantowych stanów, który zawiera kryptograficznie prywatny klucz. Pozwala nam to przerobić teorię prywatności jako paradygmat blisko związany z tą, która jest używana w manipulacjach splątania.
-
Lower bound on the domination number of a tree.
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Adam Bolt dr hab. inż.
People -
Dipole-bound anions supported by charge-transfer interaction: valence- and dipole-bound anionic states of H3N→BF3
Publication -
Novel doubly perforated broadband microstrip branch-line couplers
PublicationTwo broadband compact doubly perforated hybrid couplers have been designed, manufactured, and measured. To improve frequency characteristics and to reduce circuit dimensions, two kinds of perforations have been introduced: the defected ground structures in the ground plane metallization and photonic bandgap cells in the strip metallization. Measurement results show essential miniaturization (~39% and ~36%) and enhancement of the...
-
Miniaturized dual‐band branch‐line coupler with enhanced bandwidth
PublicationIn this letter, a miniaturized hybrid dual-band branch-line coupler (BLC) with enhanced fractional bandwidths is proposed. Compact size and bandwidth enhancement are obtained using meandered transmission line sections with broken symmetry between cross-coupling branches. The circuit is designed at a low numerical cost using surrogate-assisted techniques. The optimized design features small size of only 0.25λg×0.19λg(28% miniaturization...
-
Systematic Management of Simulation State for Multi-Branch Simulations in Simulink
PublicationSystematic simulation is a technique related and motivated by the formal analysis of hybrid dynamic systems. It combines the exhaustive and conservative nature of traditional model checking with numerical simulation for providing efficient algorithms to manage simulations. Multi-branch simulation is the concept advancing simulation efficiency by reducing the number of state transitions. This paper introduces an approach to implement...
-
Wideband Highly-Selective Bandpass Filtering Branch-Line Coupler
PublicationThis paper presents a novel design of a wideband highly-selective bandpass filtering branch-line coupler (FBLC). By integrating a coupled microstrip line, and an open-ended stub at each port of a single-section BLC, bandpass filtering characteristics with excellent selectivity and broad operating bandwidth have been achieved. The proposed circuit has been verified through EM simulations and physical measurements of the fabricated...
-
Low-Cost Automated Design of Compact Branch-Line Couplers
PublicationBranch-line couplers (BLCs) are important components of wireless communication systems. Conventional BLCs are often characterized by large footprints which make miniaturization an important prerequisite for their application in modern devices. State-of-the-art approaches to design of compact BLCs are largely based on the use of high-permittivity substrates and multi-layer topologies. Alternative methods involve replacement of transmission-line...
-
Organised Sound
Journals -
SIGHT AND SOUND
Journals -
Round Table
Journals -
Wound Medicine
Journals -
Sound Studies
Journals -
SOUND AND VIBRATION
Journals -
India and France bilateral partnership for advancing strategic autonomy in the Indo-Pacific region: Special reference to the Indo-French strategic partnership
Publication -
On quantum cryptography with bipartite bound entangled states
PublicationOstatnio pokazano bezpośrednie zastosowanie splątania związanego w kryptografii kwantowej. W niniejszym artykule dokonano przeglądu niektórych najnowszych osiągnięć dotyczących tego zagadnienia. W szczególności przypomniano istotne pojęcia i definicje. Ponadto podano nową konstrukcję stanów o splątaniu związanym, posiadających bezpieczne korelacje, dostarczając w ten sposób niskowymiarowe (6x6) stany o splątaniu związanym z niezerowym...
-
Multipartite secret key distillation and bound entanglement
PublicationRecently it has been shown that quantum cryptography beyond pure entanglement distillation is possible and a paradigm for the associated protocols has been established. Here we systematically generalize the whole paradigm to the multipartite scenario. We provide constructions of new classes of multipartite bound entangled states, i.e., those with underlying twisted Greenberger-Horne-Zeilinger (GHZ) structure and nonzero distillable...
-
Lower bound on the paired domination number of a tree
PublicationW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Rotationally invariant bipartite states and bound entanglement
PublicationW pracy rozważano stany kwantowe niezmiennicze na działanie grupy SO(3). Pokazano, że w przypadku, gdy pierwszy podukład ma parzysty wymiar większy lub równy cztery oraz drugi podukład ma wymiar dowolny, większy niż pierwszy to pośród takich stanów zawsze istnieje splątanie związane.
-
Theoretical study of the dipole-bound anion (HPPH3)−
Publication -
Is 9-acridinamine anion a dispersion-bound anion?
Publication -
Quantum metrology: Heisenberg limit with bound entanglement
PublicationQuantum entanglement may provide a huge boost in the precision of parameter estimation. However, quantum metrology seems to be extremely sensitive to noise in the probe state. There is an important still open question: What type of entanglement is useful as a resource in quantum metrology? Here we raise this question in relation to entanglement distillation. We provide a counterintuitive example of a family of bound entangled states...
-
Bound entanglement for continuous variables is a rare phenomenon
PublicationWykazano, że splątanie związane w przypadku zmiennych ciągłych jest rzadkimfenomenem. W szczególności pokazano, że zbiór stanów niedestylowalnych jestnigdzie gęsty w zbiorze wszystkich stanów kwantowych. Poddano dyskusji splą-tanie związane w kontekście liczby Schmidta.
-
Molecular dynamics of fentanyl bound to μ-opioid receptor
Publication -
On the lower smoothing bound in identification of time-varying systems
PublicationIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate in the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Assuming that the infinite observation history is available, the paper...
-
Fate of Dipole-Bound Anion States when Hydrated
Publication -
Is the p-chloroaniline anion bound almost entirely by correlation?
Publication -
A few steps more towards NPT bound entanglement
PublicationIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
-
Lower bound on the weakly connected domination number of a tree
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
On trees attaining an upper bound on the total domination number
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Distinguishing views in symmetric networks: A tight lower bound
PublicationThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Phytotoxic Metabolites Produced by Diaporthella cryptica, the Causal Agent of Hazelnut Branch Canker
Publication -
Slow-wave resonant structures in branch-line coupler miniaturization: a case study
PublicationA case study of novel slow-wave resonant structures dedicated to efficient microstrip branch-line coupler size reduction has been presented. A compact 3-dB branch-line coupler has been designed to mimic the performance of its conventional counterpart, simultaneously demonstrating a substantial 88% surface area reduction. The vital usefulness of the approach in the process of microstrip line abbreviation has been experimentally...