A numerical investigation of energy dissipation with a shallow depth sloshing absorber

A liquid sloshing absorber consists of a container, partially filled with liquid. The absorber is attached to the structure to be controlled, and relies on the structure’s motion to excite the liquid. Consequently, a sloshing wave is produced at the liquid free surface within the absorber, possessing energy dissipative qualities. The behaviour of liquid sloshing absorbers has been well documented, although their use in structural control applications has attracted considerably less attention.     

On the maximum number of diagonals of a circuit in a graph

For a graph G, let ?(G) denote the maximum number k such that G contains a circuit with k diagonals.Theorem. For any graph G with minimum valency$\text{n? 3, ?(G) ?}\text{1}\text{2}\text{(n+1)(n-2)}$.If the equality holds and G is connected, then either G is isomorphic to K_n+1 or G is separable and each of its terminal blocks is isomorphic to K_n+1, or K_n+1 with one edge subdivided.     

Jacobson radical of skew polynomial rings and skew group rings

LetR be a ring and σ an automorphism ofR. We prove the following results: (i)J(R _σ[x])={Σ_ir_i x ⁱ:r₀∈I∩J(R]), r _i∈I for alliε 1} whereI↪ {r∈R:rx ∈J(R _Σ[x])|s= (ii)J(R _σ<x>)=(J(R _σ<x>)∩R)_σ<x>. As an application of the second result we prove that ifG is a solvable group such thatG andR, + have disjoint torsions thenJ(R)=0 impliesJ(R(G))=0.     

The convex hull of two core capacitated network design problems

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost.This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.Research of this author was supported in part by a Faculty Grant from the Katz Graduate School of Business, University of Pittsburgh.     

A new heuristic for learning Bayesian networks from limited datasets: a real-time recommendation system application with RFID systems in grocery stores

Bayesian networks (BNs) are a useful tool for applications where dynamic decision-making is involved. However, it is not easy to learn the structure and conditional probability tables of BNs from small datasets. There are many algorithms and heuristics for learning BNs from sparse datasets, but most of these are not concerned with the quality of the learned network in the context of a specific application. In this research, we develop a new heuristic on how to build BNs from sparse datasets in the context of its performance in a real-time recommendation system. This new heuristic is demonstrated using a market basket dataset and a real-time recommendation model where all items in the grocery store are RFID tagged and the carts are equipped with an RFID scanner. With this recommendation model, retailers are able to do real-time recommendations to customers based on the products placed in cart during a shopping event.     

Stability and Hopf bifurcation analysis of novel hyperchaotic system with delayed feedback control

In this article, a novel four dimensional autonomous nonlinear systezm called hyperchaotic Rikitake system is proposed. Basic properties of the new system are investigated and the complex dynamical behaviors, such as time series, bifurcation diagram, and Lyapunov exponents are analyzed by dynamic analysis approaches. To control the new hyperchaotic system, the delayed feedback control is introduced. Regarding the time delay as a bifurcation parameter, stability and bifurcations with respect to time delay are investigated. Conditions assuring the existence of Hopf bifurcation and the distribution of roots to the associated characteristic equation are investigated by utilizing the polynomial theorem. Besides, the Hopf bifurcation is proved to occur when the bifurcation parameter (time delay) crosses through derived critical value. Finally, numerical simulations are provided to prove the consistence with the derived theoretical results. © 2015 Wiley Periodicals, Inc. Complexity 21: 180–193, 2016     

Bond Prices Under Information Asymmetry and a Short Rate with Instantaneous Feedback

Methodology and Computing in Applied Probability - We study an information asymmetry problem in a bond market. Especially we derive bond price dynamics of traders with different levels of...     

The Cancer Genetics Network: recruitment results and pilot studies

OBJECTIVE: The National Cancer Institute established the Cancer Genetics Network (CGN) to support collaborative investigations into the genetic basis of cancer susceptibility, explore mechanisms to integrate this new knowledge into medical practice, and identify ways of addressing the associated psychosocial, ethical, legal, and public health issues. SUBJECTS AND METHODS: The CGN has developed the complex infrastructure required to support the projects, including the establishment of guidelines and policies, uniform methods, standard questionnaires to be used by all of the centers, and a standard format for submission of data to the Informatics Center. Cancer patients and their family members have been invited to enroll and be included in a pool of potential study participants. The Information Technology Group is responsible for support of the design, implementation, and maintenance of the multicenter Network-wide research protocols. RESULTS: As of January 2004, the CGN contained data on 23,995 probands (participants) and 425,798 family members. As a resource for cancer genetic studies, the CGN has a large number of probands and first-degree relatives with and without cancer and with multiple ethnicities. Different study designs can be used including case-control, case-case, and family studies. CONCLUSIONS: The unique resources of the CGN are available for studies on cancer genetic susceptibility, translational research, and behavioral research. The CGN is now at a point where approved collaborators may have access to enrolled patients and their families for special studies, as well as to the clinical, environmental and family cancer history data banked in the Informatics Center.     

On an additive representation function

Let A be an infinite subset of natural numbers, and X a positive real number. Let r(n) denotes the number of solution of the equation n=a₁+a₂ where a₁?a₂ and a₁, a₂∈A. Also let |A(X)| denotes the number of natural numbers which are less than or equal to X and belong to A. For those A which satisfy the condition that for all sufficiently large natural numbers n we have r(n)≠1, we improve the lower bound of |A(X)| given by Nicolas et. al. [NRS98]. The bound which we obtain is essentially best possible.     

The strange duality conjecture for generic curves

Let be a smooth connected projective algebraic curve of genus . The strange duality conjecture connects non-abelian theta functions of rank and level and those of rank and level on (for and , respectively). In this paper we prove this conjecture for generic in the moduli space of curves of genus .