Full AC analysis of value of DER to the grid and optimal DER scheduling

This paper presents part of the work ComEd and Quanta Technology have performed to quantify the locational and temporal value of DER to avoid distribution grid upgrade investments. It focuses on the formulation of a robust and efficient algorithm for DER optimal dispatch on a distribution feeder to mitigate the violation of current and voltage limits using the allocated cost of capacity and locational marginal value of real and reactive DER injection/withdrawal.     

Reconstruction of reflectance spectra using weighted principal component analysis

The weighted principal component analysis technique is employed for reconstruction of reflectance spectra of surface colors from the related tristimulus values. A dynamic eigenvector subspace based on applying certain weights to reflectance data of Munsell color chips has been formed for each particular sample and the color difference value between the target, and Munsell dataset is chosen as a criterion for determination of weighting factors. Implementation of this method enables one to increase the influence of samples which are closer to target on extracted principal eigenvectors and subsequently diminish the effect of those samples which benefit from higher amount of color difference. The performance of the suggested method is evaluated in spectral reflectance reconstruction of three different collections of colored samples by the use of the first three Munsell bases. The resulting spectra show considerable improvements in terms of root mean square error between the actual and reconstructed reflectance curves as well as CIELAB color difference under illuminant A in comparison to those obtained from the standard PCA method. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 360–371, 2008     

A Uniform Paradigm to Succinctly Encode Various Families of Trees

We propose a uniform method to encode various types of trees succinctly. These families include ordered (ordinal), k-ary (cardinal), and unordered (free) trees. We will show the approach is intrinsically suitable for obtaining entropy-based encodings of trees (such as the degree-distribution entropy). Previously-existing succinct encodings of trees use ad hoc techniques to encode each particular family of trees. Additionally, the succinct encodings obtained using the uniform approach improve upon the existing succinct encodings of each family of trees; in the case of ordered trees, it simplifies the encoding while supporting the full set of navigational operations. It also simplifies the implementation of many supported operations. The approach applied to k-ary trees yields a succinct encoding that supports both cardinal-type operations (e.g. determining the child label i) as well as the full set of ordinal-type operations (e.g. reporting the number of siblings to the left of a node). Previous work on succinct encodings of k-ary trees does not support both types of operations simultaneously (Benoit et al. in Algorithmica 43(4):275–292, 2005; Raman et al. in ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233–242, 2002). For unordered trees, the approach achieves the first succinct encoding. The approach is based on two recursive decompositions of trees into subtrees. Recursive decomposition of a structure into substructures is a common technique in succinct encodings and has even been used to encode (ordered) trees (Geary et al. in ACM Trans. Algorithms 2(4):510–534, 2006; He et al. in ICALP, pp. 509–520, 2007) and dynamic binary trees (Munro et al. in ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 529–536, 2001; Storm in Representing dynamic binary trees succinctly, Master’s thesis, 2000). The main distinction of the approach in this paper is that a tree is decomposed into subtrees in a manner that the subtrees are maximally isolated from each other. This intermediate decomposition result is interesting in its own right and has proved useful in other applications (Farzan et al. in ICALP (1), pp. 451–462, 2009; Farzan and Munro in ICALP (1), pp. 439–450, 2009; Farzan and Kamali in ICALP, 2011).     

Bioprinting a cell-laden matrix for bone regeneration: A focused review

Although many efforts have been made to regenerate the bone lesions, existing challenges can be mitigated through the development of tissue engineering scaffolds. However, the weak control on the microstructure of constructs, limitation in preparation of patient-specific and multilayered scaffolds, restriction in the fabrication of cell-laden matrixes, and challenges in preserving the drug/growth factors' efficacy in conventional methods have led to the development of bioprinting technology for regeneration of bone defects. So in this review, conventional 3D printers are classified, then the priority of the different types of bioprinting technologies for the preparation of the cell/growth factor-laden matrixes are focused. Besides, the bio-ink compositions, including polymeric/hybrid hydrogels and cell-based bio-inks are classified according to fundamental and recent studies. Herein, different effective parameters, such as viscosity, rheological properties, cross-linking methods, biodegradation biocompatibility, are considered. Finally, different types of cells and growth factors that can encapsulate in the bio-inks to promote bone repair are discussed, and both in vitro and in vivo achievement are considered. This review provides current and future perspectives of cell-laden bioprinting technologies. The restrictions and challenges are identified, and proper strategies for the development of cell-laden matrixes and high-performance printable bio-inks are proposed.     

Encouraging user participation in a course recommender system: An impact on user behavior

User participation emerged as a critical issue for collaborative and social recommender systems as well as for a range of other systems based on the power of user community. A range of mechanisms to encourage user participation in social systems has been proposed over the last few years; however, the impact of these mechanisms on users behavior in recommender systems has not been studied sufficiently. This paper investigates the impact of encouraging user participation in the context of CourseAgent, a community-based course recommender system. The recommendation power of CourseAgent is based on course ratings provided by a community of students. To increase the number of course ratings, CourseAgent applies an incentive mechanism which turns user feedback into a self-beneficial activity. In this paper, we describe the design and implementation of our course recommendation system and its incentive mechanism. We also report a dual impact of this mechanism on user behavior discovered in two user studies.     

Controlling the initial phase of PECVD growth of vertically aligned carbon nanofibers on TiN

We explore the growth of vertically aligned carbon nanofibers by plasma enhanced chemical vapor deposition, using lithographically defined Ni catalyst seeds on TiN. TiN is selected for being an electrically conducting diffusion barrier suitable for the realization of electronic devices. We show that the rate of Ni diffusion correlates to both the level of oxygen content in the TiN film and to the film resistivity. The synthesis of the nanofibers was characterized using electron microscopy with an emphasis on three growth parameters: substrate temperature, plasma power, and chamber pressure. We propose that a catalyst surface free from carbon deposits throughout the process will induce diffusion-limited growth. The growth will shift towards a supply-limited process when the balance between acetylene, as the effective carbon bearing gas, and atomic hydrogen, as the main etching agent, is skewed in favor of acetylene. This determines whether the dominating growth mode will be vertically aligned ‘tip-type’ or disordered ‘base-type’, by affecting the competition between the formation of the first graphitic sheets on the catalyst surface and at the catalyst-substrate interface.     

Interactive smart battery storage for a PV and wind hybrid energy management control based on conservative power theory

This paper presents interactive smart battery-based storage (BBS) for wind generator (WG) and photovoltaic (PV) systems. The BBS is composed of an asymmetric cascaded H-bridge multilevel inverter (ACMI) with staircase modulation. The structure is parallel to the WG and PV systems, allowing the ACMI to have a reduction in power losses compared to the usual solution for storage connected at the DC-link of the converter for WG or PV systems. Moreover, the BBS is embedded with a decision algorithm running real-time energy costs, plus a battery state-of-charge manager and power quality capabilities, making the described system in this paper very interactive, smart and multifunctional. The paper describes how BBS interacts with the WG and PV and how its performance is improved. Experimental results are presented showing the efficacy of this BBS for renewable energy applications.     

A soft robotics nonlinear hybrid position/force control for tendon driven catheters

Minimally invasive steerable catheters, commonly implemented in cardiac ablation, are currently operated by interventionalists exposing them to X-ray radiation and requiring the dexterity for accurate steering. To conduct robot-assisted cardiac ablation, highly accurate stable control platform for precise force/position control on the moving tissue is required. This paper introduces hybrid force/position control strategy to apply a constant force to the cardiac tissue while tracking the desired trajectory. The position controller is based on a nonlinear model predictive tracking control satisfying the input constraints. Cosserat rod theory is incorporated for the distal shaft modeling of tendon-driven catheters, and the model is reformulated for controller design and stability proof. Lyapunov-based stability analysis is conducted. To apply the controller, the force-displacement mapping of the cardiac tissue is obtained through ex vivo experimental tests. The performance of the controller is evaluated, and the catheter is capable of regulating the force with the RMSE of 4.9 mN and tracking the position with the RMSE of 0.89 mm. The promising results verify the potential of the application of the introduced approach in real applications including in vitro and clinical cardiac ablation.     

Succinct representation of dynamic trees

We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]).