Minimizing conditional-value-at-risk for stochastic scheduling problems

This paper introduces the use of conditional-value-at-risk (CVaR) as a criterion for stochastic scheduling problems. This criterion has the tendency of simultaneously reducing both the expectation and variance of a performance measure, while retaining linearity whenever the expectation can be represented by a linear expression. In this regard, it offers an added advantage over traditional nonlinear expectation-variance-based approaches. We begin by formulating a scenario-based mixed-integer program formulation for minimizing CVaR for general scheduling problems. We then demonstrate its application for the single machine total weighted tardiness problem, for which we present both a specialized l-shaped algorithm and a dynamic programming-based heuristic procedure. Our numerical experimental results reveal the benefits and effectiveness of using the CVaR criterion. Likewise, we also exhibit the use and effectiveness of minimizing CVaR in the context of the parallel machine total weighted tardiness problem. We believe that minimizing CVaR is an effective approach and holds great promise for achieving risk-averse solutions for stochastic scheduling problems that arise in diverse practical applications.     

The relationship between resources and capabilities of new ventures in emerging economies

Despite the fact that the resource-based view has drawn a great deal of attention in studying new ventures, our understanding on resource management in the emerging economies is limited and there are many unsolved issues. In this paper, theoretical reasoning approach is applied to analyze the relationship between the entrepreneurial resources and the organizational capabilities (including operating and dynamic capabilities) for new ventures. An empirical study in the context of emerging economy in China is conducted to verify the theoretical reasoning. As information technology becomes a key element for new ventures, the enterprise resources relevant to the network technology and e-commerce are especially focused, as well as the impact of information acquisition on the resource combination. The results from the theoretical and empirical study have shown that resource combination mediates the relationship of entrepreneurial resources and organizational capability. It is also found that the information acquisition affects the organizational capabilities significantly; however, there is an inverted U-shape relationship between the information acquisition and the resource combination in emerging economies .     

Preparation of segmented, high molecular weight, aliphatic poly(ether-urea) copolymers in isopropanol. In-situ FTIR studies and polymer synthesis

The use of isopropanol (IPA) as the reaction solvent for the preparation of high molecular weight segmented polyether-urea copolymers based on cycloaliphatic diisocyanates was investigated. Reactivity of IPA with bis(4-isocyanatohexyl)methane (HMDI) and isophorone diisocyanate (IPDI) was studied between 0 and 40 °C using in-situ FTIR spectroscopy. HMDI, which has secondary isocyanate groups, shows a very slow reaction with a large excess of IPA at 0 and 23 °C. Analysis of the kinetic data indicates an activation energy of 51 kJ/mol for the reaction between HMDI and IPA. As expected, IPDI, which has both a primary and a secondary isocyanate (NCO) group, reacts faster with IPA compared with HMDI, which only has secondary NCO groups. However, the rate of reaction of IPDI with IPA at 0 °C is extremely slow (approximately 1% consumption of isocyanate in 60 min) thus allowing the use of IPA as the reaction solvent for polyether-urea synthesis. Preparation of high molecular weight, high-strength HMDI and IPDI based polyether-urea segmented copolymers in IPA has been demonstrated. Thermal analysis and stress-strain analyses were used to characterize the products.     

Self-assembled patterned CoFe2O4-SrRuO3 electrodes: Enhanced functional properties by polar nano-regions reorientation

Epitaxial CoFe₂O₄ (CFO) and SrRuO₃ (SRO) nanopillar heterostructures were deposited on Pb(Mg_1/3Nb_2/3)_0.70Ti_0.30O₃ (PMN-30PT) single crystal substrates by switch pulsed laser deposition (SPLD). Since the CFO nanopillars are insulating, and the SRO matrix conductive, this self-assembled nanopillar heterostructure served as a patterned electrode on PMN-PT, which then enhances the dielectric and piezoelectric constant of the substrate. Cross-sectional electron microscopy images revealed the formation of a nanopillar heterostructure layer with CFO nanopillars within a SRO matrix. AFM and XRD revealed good topography and epitaxy, indicating a high quality SRO-CFO self-assembled nanopillar structure. Using a SRO-CFO thin film patterned electrode, PMN-PT was found to have a notably higher (30%) dielectric constant with increasing electric field and enhanced transverse broadening in reciprocal spacing mapping (RSM) scans.     

Breaking Bad in Cyberspace: Understanding why and how Black Hat Hackers Manage their Nerves to Commit their Virtual Crimes

Information Systems Frontiers - What is happening in hacker’s minds when they are committing criminal activities? How black hat hackers manage nerves, which is about managing fear and...     

Sequencing of multi‑robot behaviors using reinforcement learning

Given a collection of parameterized multi-robot controllers associated with individual behaviors designed for particular tasks, this paper considers the problem of how to sequence and instantiate the behaviors for the purpose of completing a more complex, overarching mission. In addition, uncertainties about the environment or even the mission specifications may require the robots to learn, in a cooperative manner, how best to sequence the behaviors. In this paper, we approach this problem by using reinforcement learning to approximate the solution to the computationally intractable sequencing problem, combined with an online gradient descent approach to selecting the individual behavior parameters, while the transitions among behaviors are triggered automatically when the behaviors have reached a desired performance level relative to a task performance cost. To illustrate the effectiveness of the proposed method, it is implemented on a team of differential-drive robots for solving two different missions, namely, convoy protection and object manipulation.     

Confined batch foaming of semi-crystalline rubbery elastomers with carbon dioxide using a mold

Confined foaming of poly(ethylene-co-vinyl acetate-co-carbon monoxide) using carbon dioxide as a physical blowing agent in a mold with either permeable or impermeable boundaries has been explored as a strategy to control final foam dimensions and morphology. The results are discussed in terms of comparisons to free-foaming experiments conducted at the same pressure and temperature conditions following the same pressurization and depressurization paths. Foaming experiments were carried out at 30 and 40°C and 100, 200, and 300 bar followed by rapid depressurization of the foaming cell. Confined foaming led to smaller pores with more uniform distributions across the polymer cross-section. However, bulk foam densities of the foams generated under confinement were higher than those generated under the free-foaming mode. Surface characteristics and skin layer formation were altered by expansion against both the permeable and impermeable boundaries. Confined foaming promotes uniform pore distribution and overall dimensional uniformity and may impart surface texture but the trade-off is in the degree to which the bulk foam density can be lowered.     

Secure three-party computational protocols for triangle area

In this work, we have put forth two different protocols to address a concrete secure multi-party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties wish to collaboratively compute the area of this triangle while preserving their own coordinate privacy. As one of the merits, our protocols employ weaker assumptions of the existence of pseudorandom generators. In particular, unlike massive secure MPC protocols that rely a lot on oblivious transfer, ours utilize a new computing idea called “pseudorandom-then-rounding” method to avoid this burdensome obstacle. The two protocols are based on different theorems, while they both make use of the same underlying idea. At last, we provide a detailed proof for the first protocol by a series of security reductions of our newly defined games, which seems somewhat stronger than the previous simulation-based proofs and a proof sketch for the second one. Analysis and discussion about the reasons are provided as well to round off our work.