Designing content distribution networks for optimal cost and performance

One strategy for alleviating excess latency (delay) in the Internet is the caching of web content at multiple locations. This reduces the number of hops necessary to reach the desired content. This strategy is used for web content such as html pages, images, streaming video, and Internet radio. The network of servers which store this content, and the collections of objects stored on each server, is called a content distribution network (CDN). In order to optimally design a CDN, given a network topology with available server storage capacity at various points in the network, one must decide which object collections to place on each server in order to achieve performance or cost objectives. The placements must be within the storage limits of the servers and must reflect the request patterns for each collection of objects to be cached. Researchers have suggested formulations for the CDN problem which address performance by minimizing latency (the average number of hops is a commonly accepted measure of latency) from client to content, or formulations that focus on minimizing cost of storage and/or bandwidth. In this research, we develop a model which allows for the simultaneous treatment of performance and cost, present examples to illustrate the application of the model and perform a detailed designed experiment to gain insights into cost/hops tradeoff for a variety of network parameters.     

Register allocation for write activity minimization on non-volatile main memory for embedded systems

Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average.     

Ensuring reliability in B2B services: Fault tolerant inter-organizational workflows

In the age of Business-to-Business (B2B) collaboration, ensuring reliability of workflows underlying inter-organizational business processes is of significant importance. There are, however, quite a few challenges towards achieving seamless operation. Such challenges arise from heterogeneity in infrastructure and coordination mechanism at participant organizations, as well as time and cost associated with recovery from failure. Our research presents foundations for a reliable scheme for recovery from failure of workflow processes spanning through multiple business entities. First, a system model is adapted from the mobile computing literature that serves to establish the requirements to be enforced by each participating organization. In our model, we adopt the Maximal Sequence Path (MSP) approach from Yoo et al. (Lecture Notes in Artificial Intelligence 2132:222–236, 2001), as a means of decomposing workflows into mobile agent-driven processes that communicate via web services at each organization. This decomposition ensures defining logical points within the dynamics of a workflow instance for locating accurate and consistent states of the system for recovery in case of a failure. Then, a set of algorithms for various business scenarios are developed and presented as practical solutions. These algorithms are shown to create checkpoints such that the system is always in a globally consistent state. As such, these algorithms constitute a set of standards that can be incorporated in business process management suites that support reliable inter-organizational collaboration.     

A secure cookie scheme

Cookies are the primary means for web applications to authenticate HTTP requests and to maintain client states. Many web applications (such as those for electronic commerce) demand a secure cookie scheme. Such a scheme needs to provide the following four services: authentication, confidentiality, integrity, and anti-replay. Several secure cookie schemes have been proposed in previous literature; however, none of them are completely satisfactory. In this paper, we propose a secure cookie scheme that is effective, efficient, and easy to deploy. In terms of effectiveness, our scheme provides all of the above four security services. In terms of efficiency, our scheme does not involve any database lookup or public key cryptography. In terms of deployability, our scheme can be easily deployed on existing web services, and it does not require any change to the Internet cookie specification. We implemented our secure cookie scheme using PHP and conducted experiments. The experimental results show that our scheme is very efficient on both the client side and the server side.A notable adoption of our scheme in industry is that our cookie scheme has been used by Wordpress since version 2.4. Wordpress is a widely used open source content management system.     

An Engineered sgsh Mutant Zebrafish Recapitulates Molecular and Behavioural Pathobiology of Sanfilippo Syndrome A/MPS IIIA

Mucopolysaccharidosis IIIA (MPS IIIA, Sanfilippo syndrome type A), a paediatric neurological lysosomal storage disease, is caused by impaired function of the enzyme N-sulfoglucosamine sulfohydrolase (SGSH) resulting in impaired catabolism of heparan sulfate glycosaminoglycan (HS GAG) and its accumulation in tissues. MPS IIIA represents a significant proportion of childhood dementias. This condition generally leads to patient death in the teenage years, yet no effective therapy exists for MPS IIIA and a complete understanding of the mechanisms of MPS IIIA pathogenesis is lacking. Here, we employ targeted CRISPR/Cas9 mutagenesis to generate a model of MPS IIIA in the zebrafish, a model organism with strong genetic tractability and amenity for high-throughput screening. The sgsh^Δex5−6 zebrafish mutant exhibits a complete absence of Sgsh enzymatic activity, leading to progressive accumulation of HS degradation products with age. sgsh^Δex5−6 zebrafish faithfully recapitulate diverse CNS-specific features of MPS IIIA, including neuronal lysosomal overabundance, complex behavioural phenotypes, and profound, lifelong neuroinflammation. We further demonstrate that neuroinflammation in sgsh^Δex5−6 zebrafish is largely dependent on interleukin-1β and can be attenuated via the pharmacological inhibition of Caspase-1, which partially rescues behavioural abnormalities in sgsh^Δex5−6 mutant larvae in a context-dependent manner. We expect the sgsh^Δex5−6 zebrafish mutant to be a valuable resource in gaining a better understanding of MPS IIIA pathobiology towards the development of timely and effective therapeutic interventions.     

Magnetic Flux Controllers for Induction Heating Applications

Application of magnetic flux controllers/concentrators to induction heating coils can drastically improve the process efficiency and heat pattern control. Presentation includes: benefits provided by flux controllers, materials available for controllers, application techniques, computer assisted design of induction coils with concentrators, examples of applications. Depending on induction system design, magnetic flux controllers can concentrate heating in a specified area,change heat source distribution and shield a particular part zone or external area preventing unintended eddy current heating.Besides of the coil efficiency improvement and optimal power distribution, magnetic flux controllers reduce the coil current demand from a supplying circuitry thus strongly reducing losses in busswork, cables, transformers and inverter components.Improvement that can be achieved due to magnetic flux controllers is case dependable. 2D and 3D computer simulation allows the designer to predict accurately effect of controllers on the coil parameters and temperature distribution and optimize the whole electromagnetic system. Special attention in presentation is paid to new magnetodielectric materials optimized for induction heating conditions. These materials have high magnetic permeability and saturation flux density,excellent machinability, good chemical and temperature resistance. Concentrators from these materials can work in a wide range of frequencies and specific powers. Examples of magnetic flux controller application include surface hardening of shafts and gears, induction surface hardfacing and brazing.     

Decentralized observers with consensus filters for distributed discrete-time linear systems

This paper presents a decentralized observer with a consensus filter for the state observation of discrete-time linear distributed systems. Each agent in the distributed system has an observer with a model of the plant that utilizes the set of locally available measurements, which may not make the full plant state detectable. This lack of detectability is overcome by utilizing a consensus filter that blends the state estimate of each agent with its neighbors’ estimates. It is proven that the state estimates of the proposed observer exponentially converge to the actual plant states under arbitrarily changing, but connected, communication and pseudo-connected sensing graph topologies. Except these connectivity properties, full knowledge of the sensing and communication graphs is not needed at the design time. As a byproduct, we obtained a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of graphs with self-loops.     

Exploring album structure for face recognition in online social networks

In this paper, we propose an album-oriented face-recognition model that exploits the album structure for face recognition in online social networks. Albums, usually associated with pictures of a small group of people at a certain event or occasion, provide vital information that can be used to effectively reduce the possible list of candidate labels. We show how this intuition can be formalized into a model that expresses a prior on how albums tend to have many pictures of a small number of people. We also show how it can be extended to include other information available in a social network. Using two real-world datasets independently drawn from Facebook, we show that this model is broadly applicable and can significantly improve recognition rates.     

Development of high‐definition aqueous polyvinylpyrrolidone photoresists for cathode ray tubes

Aqueous photoresists that are capable of higher resolutions than are currently employed by the cathode ray tube (CRT) industry were developed by combining photoactivators, which activate at shorter UV wavelengths with polyvinylpyrrolidone (PVP). Two photoactivators were synthesized: 4,4′‐diazido‐2,2′‐biphenyl disodium disulfonate (DABP), which has a maximum absorbance at 264 nm, and 4,4′‐diazido‐2,2′‐biphenylethane disodium disulfonate (DABPE), which has a maximum absorbance at 258 nm. The PVP/DABP and PVP/DABPE photoresists successfully imaged a pattern with resolution as small as 4.4 μm with photoactivator concentrations greater than 20% of the PVP concentration. Addition of silane and emulgen greatly improved the performance of the photoresists with more uniform coatings of thicknesses of up to 1.4 μm. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 102: 1637–1644, 2006     

A stochastic controller for a scalar linear system with additive Cauchy noise

A stochastic control scheme is developed for scalar, discrete-time, and linear-dynamic systems driven by Cauchy distributed process and measurement noises. When addressing the optimal control problem for such systems, the standard quadratic cost criteria cannot be used. In this study we introduce a new objective function that is functionally similar to the Cauchy probability density function. The performance index, defined as the expectation of this objective function with respect to the Cauchy densities, exists. The dynamic programming solution to the fixed and finite horizon optimal control problem that uses this performance index appears to be intractable. Therefore, a moving horizon optimal model predictive control problem is implemented, for which the conditional expected value of the objective function and its gradients can be computed in closed   form and without assumptions such as certainty equivalence. Numerical results are shown for this m$m$-step model predictive optimal controller and compared to a similar, Linear-Exponential-Gaussian model predictive controller. An essential difference between the Cauchy and Gaussian controllers when applied to a system with Cauchy noises is that, while the Gaussian controller is linear and reacts strongly to all noise pulses, the Cauchy controller can differentiate between measurement and process noise pulses by ignoring the former while responding to the latter. This property of the Cauchy controller occurs when an impulsive measurement noise is more likely than an impulsive process noise. The Cauchy and Gaussian controllers react similarly when applied to a system with Gaussian noises, demonstrating the robustness of the proposed control scheme.