Observational constraints on a hyperbolic potential in brane-world inflation

We focus on the large field of a hyperbolic potential form, which is characterized by a parameter f, in the framework of the brane-world inflation in Randall-Sundrum-II model. From the observed form of the power spectrum P _R (k), the parameter f should be of order 0.1m _p to 0.001m _p , the brane tension must be in the range λ ~ (1?10)×10⁵⁷ GeV⁴, and the energy scale is around V₀ ^1/4 ~ 10¹⁵ GeV. We find that the inflationary parameters (n _s , r, and dn _s /d(ln k) depend only on the number of e-folds N. The compatibility of these parameters with the last Planck measurements is realized with large values of N.     

Guaranteed strategies for escaping encirclement

This paper considers a conflict situation on the plane as follows. A fast evader E has to break out the encirclement of slow pursuers P _{j1,...,j n} = {P _j1,..., P _jn }, n ≥ 3, with a miss distance not smaller than r ≥ 0. First, we estimate the minimum guaranteed miss distance from E to a pursuer P _a , a ∈ {j ₁,..., j _n }, when the former moves along a given straight line. Then the obtained results are used to calculate the guaranteed estimates to a group of two pursuers P _b,c = {P _b , P _c }, b, c ∈ {j ₁,..., j _n }, b ≠ c, when E maneuvers by crossing the rectilinear segment P _b P _c , and the state passes to the domain of the game space where E applies a strategy under which the miss distance to any of the pursuers is not decreased. In addition, we describe an approach to the games with a group of pursuers P _{j1,... jn} , n ≥ 3, in which E seeks to break out the encirclement by passing between two pursuers P _b and P _c , entering the domain of the game space where E can increase the miss distance to all pursuers by straight motion. By comparing the guaranteed miss distances with r for all alternatives b, c ∈ {j ₁,..., j _n }, b ≠ c, and a ? {b, c}, it is possible to choose the best alternative and also to extract the histories of the game in which the designed evasion strategies guarantee a safe break out from the encirclement.     

Least common container of tree pattern queries and its applications

Tree patterns represent important fragments of XPath. In this paper, we show that some classes \({\mathcal{C}}\) of tree patterns exhibit such a property that, given a finite number of compatible tree patterns \({P_1, \ldots, P_n\in \mathcal{C}}\), there exists another pattern P such that P ₁, . . . , P _n are all contained in P, and for any tree pattern \({Q\in \mathcal{C}}\), P ₁, . . . , P _n are all contained in Q if and only if P is contained in Q. We experimentally demonstrate that the pattern P is usually much smaller than P ₁, . . . , P _n combined together. Using the existence of P above, we show that testing whether a tree pattern, P, is contained in another, \({Q\in \mathcal{C}}\), under an acyclic schema graph G, can be reduced to testing whether P _G , a transformed version of P, is contained in Q without any schema graph, provided that the distinguished node of P is not labeled *. We then show that, under G, the maximal contained rewriting (MCR) of a tree pattern Q using a view V can be found by finding the MCR of Q using V _G without G, when there are no *-nodes on the distinguished path of V and no *-nodes in Q.     

Resource allocation in cooperative cognitive radio networks towards secure communications for maritime big data systems

In this paper, an innovative framework labeled as cooperative cognitive maritime big data systems (CCMBDSs) on the sea is developed to provide opportunistic channel access and secure communication. A two-phase frame structure is applied to let Secondary users (SUs) entirely utilize the transmission opportunities for a portion of time as the reward by cooperation with Primary users (PUs). Amplify-and-forward (AF) relaying mode is exploited in SU nodes, and Backward induction method based Stackelberg game is employed to achieve optimal determination of SU, power consumption and time portion of cooperation both for non-secure communication scenario and secure communication. Specifically, a jammer-based secure communications scheme is developed to maximize the secure utility of PU, to confront of the situation that the eavesdropper could overheard the signals from SU _i and the jammer. Close-form solutions for the best access time portion as well as the power for SU _i and jammer are derived to realize the Nash Equilibrium. Simulation results validate the effectiveness of our proposed strategy.     

On Some Optimization Problems for the Rényi Divergence

We consider the problem of determining the maximum and minimum of the Rényi divergence D_λ(P||Q) and D_λ(Q||P) for two probability distribution P and Q of discrete random variables X and Y provided that the probability distribution P and the parameter α of α-coupling between X and Y are fixed, i.e., provided that Pr{X = Y } = α.     

(<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-Distance Antimagic Labeling of Some Types of Graphs

We analyze the necessary existence conditions for (a, d)-distance antimagic labeling of a graph G = (V, E) of order n. We obtain theorems that expand the family of not (a, d) -distance antimagic graphs. In particular, we prove that the crown P _n ○ P ₁ does not admit an (a, 1)-distance antimagic labeling for n ≥ 2 if a ≥ 2. We determine the values of a at which path P _n can be an (a, 1)-distance antimagic graph. Among regular graphs, we investigate the case of a circulant graph.     

On (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis> )-Distance Anti-Magic and 1-Vertex Bimagic Vertex Labelings of Certain Types of Graphs

The results for the corona P _n ?°?P₁ are generalized, which make it possible to state that P _n ?°?P₁ is not an ( a, d)-distance antimagic graph for arbitrary values of a and d. A condition for the existence of an ( a, d)-distance antimagic labeling of a hypercube Q _n is obtained. Functional dependencies are found that generate this type of labeling for Q _n . It is proved by the method of mathematical induction that Q _n is a (2 ⁿ ?+?n???1,?n???2) -distance antimagic graph. Three types of graphs are defined that do not allow a 1-vertex bimagic vertex labeling. A relation between a distance magic labeling of a regular graph G and a 1-vertex bimagic vertex labeling of G?∪?G is established.     

Reverse Furthest Neighbors Query in Road Networks

Given a road network G = (V,E), where V (E) denotes the set of vertices(edges) in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors (Rfn _R ) query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in P ∪ {q}. This is the monochromatic Rfn _R (Mrfn _R ) query. Another interesting version of Rfn _R query is the bichromatic reverse furthest neighbor (Brfn _R ) query. Given two sets of points P and Q, and a query point q ∈ Q, a Brfn _R query fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in Q. This paper presents efficient algorithms for both Mrfn _R and Brfn _R queries, which utilize landmarks and partitioning-based techniques. Experiments on real datasets confirm the efficiency and scalability of proposed algorithms.     

<Emphasis Type="Italic">I</Emphasis><Subscript>DDT</Subscript>: Fundamentals and test generation

It is the time to explore the fundamentals ofI _DDT testing when extensive work has been done forI _DDT testing since it was proposed. This paper precisely defines the concept of average transient current (I _DDT) of CMOS digital ICs, and experimentally analyzes the feasibility ofI _DDT test generation at gate level. Based on the SPICE simulation results, the paper suggests a formula to calculateI _DDT by means of counting only logical up-transitions, which enablesI _DDT test generation at logic level. The Bayesian optimization algorithm is utilized forI _DDT test generation. Experimental results show that about 25% stuck-open faults are withI _DDT test generation. 2.5, and likely to beI _DDT testable. It is also found that mostI _DDT testable faults are located near the primary inputs of a circuit under test.I _DDT test generation does not require fault sensitization procedure compared with stuck-at fault test generation. Furthermore, some redundant stuck-at faults can be detected by usingI _DDT testing.     

An orthogonal analysis method for decoupling the nozzle geometrical parameters of microthrusters

This paper proposes an orthogonal analysis method for decoupling the multiple nozzle geometrical parameters of microthrusters, thus an reconfigured design can be implemented to generate a proper thrust. In this method, the effects of various nozzle geometrical parameters, including throat width W _t , half convergence angle θ _in , half divergence angle θ _out , exit-to-throat section ratio W _e /W _t and throat radius of the curvature R _t /W _t , on the performance of microthrusters are sorted by range analysis. Analysis results show that throat width seriously affects thrust because range value of 67.53 mN is extremely larger than the range value of other geometry parameters. For average specific impulse (ASI), the range value of exit-to-throat section ratio W _e /W _t and half divergence angle θ _out are 4.82 s and 3.72 s, respectively. Half convergence angle with the range value of 0.39 s and throat radius with 0.32 s have less influence on ASI compared with exit-to-throat section ratio and half divergence angle. When increasing the half convergence angle from 10° to 40° and throat radius of the curvature from 3 to 9, average specific impulse initially decreases and then increases. A MEMS solid propellant thruster (MSPT) with the reconfigured geometrical parameters of nozzle is fabricated to verify the feasibility of the proposed method. The thrust of the microthruster can reach 25 mN. Power is estimated to be 0.84 W. This work provides design guideline to reasonably configure geometry parameters of microthruster.     

Minimization of the maximal lateness for a single machine

Consideration was given to the classical NP-hard problem 1|r_j|L_max of the scheduling theory. An algorithm to determine the optimal schedule of processing n jobs where the job parameters satisfy a system of linear constraints was presented. The polynomially solvable area of the problem 1|r_j|L_max was expanded. An algorithm was described to construct a Pareto-optimal set of schedules by the criteria L_max and C_max for complexity of O(n³logn) operations.     

Research on axial bearing capacity of rectangular concrete-filled steel tubular columns based on artificial neural networks

Design of rectangular concrete-filled steel tubular (CFT) columns has been a big concern owing to their complex constraint mechanism. Generally, most existing methods are based on simplified mechanical model with limited experimental data, which is not reliable under many conditions, e.g., columns using high strength materials. Artificial neural network (ANN) models have shown the effectiveness to solve complex problems in many areas of civil engineering in recent years. In this paper, ANN models were employed to predict the axial bearing capacity of rectangular CFT columns based on the experimental data. 305 experimental data from articles were collected, and 275 experimental samples were chosen to train the ANN models while 30 experimental samples were used for testing. Based on the comparison among different models, artificial neural network model1 (ANN1) and artificial neural network model2 (ANN2) with a 20-neuron hidden layer were chosen as the fit prediction models. ANN1 has five inputs: the length (D) and width (B) of cross section, the thickness of steel (t), the yield strength of steel (f _y), the cylinder strength of concrete (f′_c). ANN2 has ten inputs: D, B, t, f _y, f′_c, the length to width ratio (D/B), the length to thickness ratio (D/t), the width to thickness ratio (B/t), restraint coefficient (ξ), the steel ratio (α). The axial bearing capacity is the output data for both models.The outputs from ANN1 and ANN2 were verified and compared with those from EC4, ACI, GJB4142 and AISC360-10. The results show that the implemented models have good prediction and generalization capacity. Parametric study was conducted using ANN1 and ANN2 which indicates that effect law of basic parameters of columns on the axial bearing capacity of rectangular CFT columns differs from design codes.The results also provide convincing design reference to rectangular CFT columns.     

A Priori knowledge based secure payload estimation

Many contemporary steganographic schemes aim to embed fixed-length secret message in the cover while minimizing the stego distortion. However, in some cases, the secret message sender requires to embed a variable-length secret payload within his expected stego security. This kind of problem is named as secure payload estimation (SPE). In this paper, we propose a practical SPE approach for individual cover. The stego security metric we adopt here is the detection error rate of steganalyzer (P _E ). Our method is based on a priori knowledge functions, which are two kinds of functions to be determined before the estimation. The first function is the relation function of detection error rate and stego distortion (P _E ? D function). The second function reflects the relationship between stego distortion and payload rate (D ? α) of the chosen cover. The P _E ? D is the general knowledge, which is calculated from image library. On the other hand, D ? α is for specific cover, which is needed to be determined on site. The estimating procedure is as follows: firstly, the sender solves the distortion D under his expected P _E via P _E ? D, and then calculates the corresponding secure payload α via D ? α of the cover. For on-site operations, the most time-consuming part is calculating D ? α function for cover image, which costs 1 time of STC coding. Besides this, the rest on-site operations are solving single-variable formulas, which can be easily tackled. Our approach is an efficient and practical solution for SPE problem.     

Guaranteed approach with the farthest of the runaways

Games of the family {Λ _N } _N?2 are formulated and studied with the application of generalized Isaacs’s approach. The game Λ _N is a simplest model of the counteraction of one persecutor P and coalition N of E ^N runaways for the case when the payoff is the distance up to the coalition of E ^N equal to the Euclidean distance between P and the farthest from the runaways; P is in command of the termination moment. Moreover, an approach within the limits of which in games with a smooth terminal payoff are generated strategies prescribing players’ motions in the directions of local gradients of the payoff is described. The approach is used for constructing pursuit strategies in games in which smooth approximations of the maximum of Euclidean distances up to the runaways are in place of payoffs. Pursuit strategies prescribing the motion in the direction of the farthest of the runaways are studied. A numerical simulation of the development of the games Λ₂ and Λ₃ is conducted in using different strategies by the players.     

Droplet generation in a microchannel with a controllable deformable wall

We report the droplet generation behavior of a microfluidic droplet generator with a controllable deformable membrane wall using experiments and analytical model. The confinement at the droplet generation junction is controlled by using external pressure, which acts on the membrane, to generate droplets smaller than junction size (with other parameters fixed) and stable and monodispersed droplets even at higher capillary numbers. A non-dimensional parameter, i.e., controlling parameter K _p, is used to represent the membrane deformation characteristics due to the external pressure. We investigate the effect of the controlled membrane deformation (in terms of K _p), viscosity ratio λ and flow rate ratio r on the droplet size and mobility. A correlation is developed to predict droplet size in the controllable deformable microchannel in terms of the controlling parameter K _p, viscosity ratio λ and flow rate ratio r. Due to the deflection of the membrane wall, we demonstrate that the transition from the stable dripping regime to the unstable jetting regime is delayed to a higher capillary number Ca (as compared to rigid droplet generators), thus pushing the high throughput limit. The droplet generator also enables generation of droplets of sizes smaller than the junction size by adjusting the controlling parameter.     

Determining Steady-State Characteristics of Some Queuing Systems with Erlangian Distributions

This article proposes a method to study M / E _s / 1 / m, E _r E _s /1 / m, and E _r / M / n / m queuing systems including the case when m = ∞. Recurrence relations are obtained to compute the stationary distribution of the number of customers in a system and its steady-state characteristics. The developed algorithms are tested on examples using simulation models constructed with the help of the GPSS World tools.     

On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections

We study the quantity p(n, k, t₁, t₂) equal to the maximum number of edges in a k-uniform hypergraph having the property that all cardinalities of pairwise intersections of edges lie in the interval [t₁, t₂]. We present previously known upper and lower bounds on this quantity and analyze their interrelations. We obtain new bounds on p(n, k, t₁, t₂) and consider their possible applications in combinatorial geometry problems. For some values of the parameters we explicitly evaluate the quantity in question. We also give a new bound on the size of a constant-weight error-correcting code.     

The formula of the solution for some classes of initial boundary value problems for the hyperbolic equation with two independent variables

A new representation is proved of the solutions of initial boundary value problems for the equation of the form u _xx (x, t) + r(x)u _x (x, t) ? q(x)u(x, t) = u _tt (x, t) + μ(x)u _t (x, t) in the section (under boundary conditions of the 1st, 2nd, or 3rd type in any combination). This representation has the form of the Riemann integral dependent on the x and t over the given section.     

A new strategy for generating shortest addition sequences

An addition sequence problem is given a set of numbers X = {n ₁, n ₂, . . . , n _m }, what is the minimal number of additions needed to compute all m numbers starting from 1? This problem is NP-complete. In this paper, we present a branch and bound algorithm to generate an addition sequence with a minimal number of elements for a set X by using a new strategy. Then we improve the generation by generalizing some results on addition chains (m = 1) to addition sequences and finding what we will call a presumed upper bound for each n _j , 1 ≤ j ≤ m, in the search tree.     

Interactive Restless Multi-armed Bandit Game and Swarm Intelligence Effect

We obtain the conditions for the emergence of the swarm intelligence effect in an interactive game of restless multi-armed bandit (rMAB). A player competes with multiple agents. Each bandit has a payoff that changes with a probability p _c per round. The agents and player choose one of three options: (1) Exploit (a good bandit), (2) Innovate (asocial learning for a good bandit among n _I randomly chosen bandits), and (3) Observe (social learning for a good bandit). Each agent has two parameters (c, p _obs ) to specify the decision: (i) c, the threshold value for Exploit, and (ii) p _obs , the probability for Observe in learning. The parameters (c, p _obs ) are uniformly distributed. We determine the optimal strategies for the player using complete knowledge about the rMAB. We show whether or not social or asocial learning is more optimal in the (p _c , n _I ) space and define the swarm intelligence effect. We conduct a laboratory experiment (67 subjects) and observe the swarm intelligence effect only if (p _c , n _I ) are chosen so that social learning is far more optimal than asocial learning.