On a new class of dynamic Hardy-type inequalities and some related generalizations

Aequationes mathematicae - In this paper, we establish a new class of dynamic inequalities of Hardy’s type which generalize and improve some recent results given in the literature. More...     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

Ishihara's proof technique in constructive analysis

Two surprising constructive lemmas of Ishihara, with extremely useful proof techniques, are placed in a general setting. This both clarifies the ideas underlying those lemmas and raises the possibility that some other applications of their proof techniques in constructive analysis are, in fact, corollaries of our general results.     

Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.     

The effect of nanoparticle shape on polymer‐nanocomposite rheology and tensile strength

Nanoparticles can influence the properties of polymer materials by a variety of mechanisms. With fullerene, carbon nanotube, and clay or graphene sheet nanocomposites in mind, we investigate how particle shape influences the melt shear viscosity η and the tensile strength τ, which we determine via molecular dynamics simulations. Our simulations of compact (icosahedral), tube or rod‐like, and sheet‐like model nanoparticles, all at a volume fraction ? ≈ 0.05, indicate an order of magnitude increase in the viscosity η relative to the pure melt. This finding evidently can not be explained by continuum hydrodynamics and we provide evidence that the η increase in our model nanocomposites has its origin in chain bridging between the nanoparticles. We find that this increase is the largest for the rod‐like nanoparticles and least for the sheet‐like nanoparticles. Curiously, the enhancements of η and τ exhibit opposite trends with increasing chain length N and with particle shape anisotropy. Evidently, the concept of bridging chains alone cannot account for the increase in τ and we suggest that the deformability or flexibility of the sheet nanoparticles contributes to nanocomposite strength and toughness by reducing the relative value of the Poisson ratio of the composite. The molecular dynamics simulations in the present work focus on the reference case where the modification of the melt structure associated with glass‐formation and entanglement interactions should not be an issue. Since many applications require good particle dispersion, we also focus on the case where the polymer‐particle interactions favor nanoparticle dispersion. Our simulations point to a substantial contribution of nanoparticle shape to both mechanical and processing properties of polymer nanocomposites. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1882–1897, 2007     

A 24-GHz Patch Array with a Power Amplifier/Low-Noise Amplifier MMIC

This paper presents an active patch array designed at 24 GHz. It can be used as a front-end component for a phased array. A series resonant array structure is chosen which is compact and easy excite. With 5 elements, the array proved a 12-dB antenna gain. A power amplifier and a low noise amplifier are designed on a single GaAs chip (PALNA). Bias switch is used in the PALNA, which greatly reduces the switch loss in a transceiver and increases the efficiency. 20-dB small signal gain is achieved in both power amplifier and low noise amplifier. The active patch array is built by the combination of the patch array and PALNA. The measured active gain of this antenna is 35-dB for the PA mode and 31-dB for the LNA mode. This active patch array can obtain an EIRP of 34 dBm with a total radiated power of 22dBm and a maximum PAE of 32%. To check the noise performance, we applied sources at both normal temperature and 77K (liquid nitrogen) and extracted the noise figure (3.5 dB) of the active antenna by the Y factor method. The results proved that the active antenna is working efficiently as both a transmitting and receiving antenna.     

Size,chromatic number,and connectivity

We consider the minimum number of edges in ak-edge-connected graph of ordern with chromatic number at leastc, obtaining the optimal bounds in most cases.     

The entropies of renewal systems

Renewal systems are symbolic dynamical systems originally introduced by Adler. IfW is a finite set of words over a finite alphabetA, then the renewal system generated byW is the subshiftX _W ⊂A ^Z formed by bi-infinite concatenations of words fromW. Motivated by Adler’s question of whether every irreducible shift of finite type is conjugate to a renewal system, we prove that for every shift of finite type there is a renewal system having the same entropy. We also show that every shift of finite type can be approximated from above by renewal systems, and that by placing finite-type constraints on possible concatenations, we obtain all sofic systems. The authors were supported in part by NFS grants DMS-8706284, DMS-8814159 and DMS-8820716.