Search
Filters
total: 94
filtered: 93
Chosen catalog filters
Search results for: PERFORMANCE BOUNDS
-
Structural optimization of microjet array cooling system
PublicationThe single phase heat transfer from an upward facing, horizontal copper surface to arrays of impinging water jets was experimentally investigated. Experimental configuration allows for a free-surface unconfined jets flow. Square nozzles 50 × 100 μm arranged in four different geometries were used. Additionally, for the set of two jets array geometry was varied by adjusting the nozzle to nozzle distance. The area averaged heat transfer...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
A Canonical Switched Capacitor DC-DC Converter. A look at how the historical SC synthesis problem is getting solved
PublicationWe reconsider a solution to the historical problem in switched capacitor (SC) DC-DC converter synthesis. Specifically, we retackle the problem of constructing an SC twophase network realizing arbitrary voltage conversion ratio within rational bounds defined. Theoretical foundations are available in our earlier research [3] where a nonconstructive proof of existence was given. We briefly review and comment on known circuit solutions...
-
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
A more colorful hat problem
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
-
The searchlight problem for road networks
PublicationWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Elemental and tight monogamy relations in nonsignaling theories
PublicationPhysical principles constrain the way nonlocal correlations can be distributed among distant parties. These constraints are usually expressed by monogamy relations that bound the amount of Bell inequality violation observed among a set of parties by the violation observed by a different set of parties. We prove here that much stronger monogamy relations are possible for nonsignaling correlations by showing how nonlocal correlations...
-
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Structure of the Resource Theory of Quantum Coherence
PublicationQuantum coherence is an essential feature of quantum mechanics which is responsible for the departure between the classical and quantum world. The recently established resource theory of quantum coherence studies possible quantum technological applications of quantum coherence, and limitations that arise if one is lacking the ability to establish superpositions. An important open problem in this context is a simple characterization...
-
Open Innovation Competence for a Future-Proof Workforce: A Comparative Study from Four European Universities
PublicationDigital transformation is a key driving force of open innovation to capture and transfer knowledge inside and outside of a company’s bounds. New challenges in organizing multiple knowledge flows imply the need for increased competences related to this paradigm of future employees. In this article, we organize and aggregate the competencies required for open innovation collaboration and develop a competence profile that organizes...
-
Striving for spatial energy efficiency in dwelling complexes. Kształtowanie przestrzennej efektywności energetycznej w zespołach zabudowy mieszkaniowej.
PublicationThe main aim of this article was to discover the key characteristics in shaping most rewarded eco- district complexes built respectively in temperate climate zone in respect to spatial energy efficiency and resilience principles. It was done through careful case studies, comparative analysis and juxtaposition of critical parameters related to spatial energy efficiency and resilience in chosen representative dwelling complexes....
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublicationWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
On-line Ramsey Numbers of Paths and Cycles
PublicationConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Method for universal detection of two-photon polarization entanglement
PublicationDetecting and quantifying quantum entanglement of a given unknown state poses problems that are fundamentally important for quantum information processing. Surprisingly, no direct (i.e., without quantum tomography) universal experimental implementation of a necessary and sufficient test of entanglement has been designed even for a general two-qubit state. Here we propose an experimental method for detecting a collective universal...
-
Application of deep eutectic solvents for separation and determination of bioactive compounds in medicinal plants
PublicationThe medicinal plants industry, particularly in regard to products rich in biologically active substances for maintaining health, has grown by leaps and bounds in the last decade, with sales of over-the-counter drugs containing these substances growing by billions of dollars. Attention has thus also been paid to the safety and effectiveness of these medicines. We are currently witnessing a rapid increase in the number of publications...
-
Design-Oriented Constrained Modeling of Antenna Structures
PublicationFast surrogate models are crucially important to reduce the cost of design process of antenna structures. Due to curse of dimensionality, standard (data-driven) modeling methods exhibit serious limitations concerning the number of independent geometry parameters that can be handled but also (and even more importantly) their parameter ranges. In this work, a design-oriented modeling framework is proposed in which the surrogate is...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Using Statistical Methods to Estimate The Worst Case Response Time of Network Software Running on Indeterministic Hardware Platforms
PublicationIn this paper we investigate whether the statistical Worst Case Execution Time (WCET) estimation methods devised for embedded platforms can be successfully applied to find the Worst Case Response Time (WCRT) of a network application running on a complex hardware platform such as a contemporary commercial off-the-shelf (COTS) system. Establishing easy-to-use timing validation techniques is crucial for real-time applications and...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Non-Perfect Propagation of Information to a Noisy Environment with Self-Evolution
PublicationWe study the non-perfect propagation of information for evolving a low-dimensional environment that includes self-evolution as well as noisy initial states and analyse the interrelations between the degree of objectivization and environment parameters. In particular, we consider an analytical model of three interacting qubits and derive its objectivity parameters. The numerical analysis shows that the quality of the spectrum broadcast...
-
Computationally Efficient Multi-Objective Optimization of and Experimental Validation of Yagi-Uda Antenna
PublicationIn this paper, computationally efficient multi-objective optimization of antenna structures is discussed. As a design case, we consider a multi-parameter planar Yagi-Uda antenna structure, featuring a driven element, three directors, and a feeding structure. Direct optimization of the high-fidelity electromagnetic (EM) antenna model is prohibitive in computational terms. Instead, our design methodology exploits response surface...
-
THIRD-ORDER EXPONENTIAL INTEGRATOR FOR LINEAR KLEIN–GORDON EQUATIONS WITH TIME AND SPACE-DEPENDANT MASS
PublicationAllowing for space- and time-dependance of mass in Klein–Gordon equations re- solves the problem of negative probability density and of violation of Lorenz covariance of interaction in quantum mechanics. Moreover it extends their applicability to the domain of quantum cosmology, where the variation in mass may be accompanied by high oscillations....
-
THIRD-ORDER EXPONENTIAL INTEGRATOR FOR LINEAR KLEIN–GORDON EQUATIONS WITH TIME AND SPACE-DEPENDANT MASS
PublicationAllowing for space- and time-dependance of mass in Klein–Gordon equations re- solves the problem of negative probability density and of violation of Lorenz covariance of interaction in quantum mechanics. Moreover it extends their applicability to the domain of quantum cosmology, where the variation in mass may be accompanied by high oscillations....
-
Progress towards a unified approach to entanglement distribution
PublicationEntanglement distribution is key to the success of secure communication schemes based on quantum mechanics, and there is a strong need for an ultimate architecture able to overcome the limitations of recent proposals such as those based on entanglement percolation or quantum repeaters. In this work we provide a broad theoretical background for the development of such technologies. In particular, we investigate the question of whether...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
PublicationOne of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Mapping the Transglycosylation Relevant Sites of Cold-Adapted β-D-Galactosidase from Arthrobacter sp. 32cB
PublicationB-Galactosidase from Arthrobacter sp. 32cB (ArthbetaDG) is a cold-adapted enzyme able to catalyze hydrolysis of beta-D-galactosides and transglycosylation reaction, where galactosyl moiety is being transferred onto an acceptor larger than a water molecule. Mutants of ArthbetaDG D207A and E517Q were designed to determine the significance of specific residues and to enable formation of complexes with lactulose and sucrose and to...
-
Rigorous numerics for critical orbits in the quadratic family
PublicationWe develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...
-
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Updating a hospital building. A task for innovation design
PublicationRefurbishment of a hospital, especially located in a historical building, is a task that goes far beyond a standard framework of architectural practice. A concept of modularity in the architecture of the late nineteenth and early twentieth century was only just to happen, building system installations and technical equipment appeared as the simplest solutions. Inscribing complex functional solutions into such a space is an interesting...
-
On symmetric extendibility of quantum states and its applications
PublicationThis dissertation is focused on analysis of the symmetric extendibility of quantum states and its applications in the quantum information theory, with special attention paid to the area of quantum entanglement distillation, quantum channels theory, quantum security, and monogamy of quantum entanglement in time. We analyze geometry of the set of symmetric extendible states, i.e. such states that possess symmetric extensions and...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublicationIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Artificial Neural Networks as an architectural design tool- generating new detail forms based on the Roman Corinthian order capital
PublicationThe following paper presents the results of the research in the field of the machine learning, investigating the scope of application of the artificial neural networks algorithms as a tool in architectural design. The computational experiment was held using the backward propagation of errors method of training the artificial neural network, which was trained based on the geometry of the details of the Roman Corinthian order capital....
-
The effective elastic properties of human trabecular bone may be approximated using micro-finite element analyses of embedded volume elements.
PublicationBoundary conditions (BCs) and sample size affect the measured elastic properties of cancellous bone. Samples too small to be representative appear stiffer under kinematic uniform BCs (KUBCs) than under periodicity-compatible mixed uniform BCs (PMUBCs). To avoid those effects, we propose to determine the effective properties of trabecular bone using an embedded configuration. Cubic samples of various sizes (2.63, 5.29, 7.96, 10.58...
-
Influence of Soft Soil Samples Quality on the Compressibility and Undrained Shear Strength – Seven Lessons Learned From the Vistula Marshlands
PublicationThis technical article presents the influence of sample quality on the compressibility parameters and undrained shear strength ( c u ) of soft soils from the Vistula Marshlands. The analysis covers: (1) quality of soft soil according to three criteria: void ratio (Δ e / e 0 index), volumetric strain (Δ ɛ v ) and C r / C c ratio; (2) influence of storage time on quality; (3) influence of sample quality on undrained shear strength...
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Radar time budget optimization subject to angle accuracy constraint via cognitive approach
PublicationThe problem of minimizing dwell time in multifunction phased array radar is considered. Target of interest is assumed to fluctuate according to a generalization of Swerling family and the parameters of fluctuation model are assumed to be known. The a'priori position of the target is uncertain. Optimization, whose variables include pulse count and array transmit beampattern, is carried out subject to achieving a desired accuracy...
-
Experimental evaluation of estimator mean square error curve for cognitive tracking radar
PublicationTo make decisions, cognitive radar must rely on predictions of its own performance. In the literature, these predictions are usually based on some form of Cram\'er-Rao lower bound. This approach is scientifically sound, but it also brings a possibility of the cognitive controller overestimating radar performance. It therefore makes sense to back theoretical predictions with careful experiments which will verify their applicability....