Advanced numerical characterization of mono-crystalline copper with defects

Based on the embedded atom method (EAM) and molecular dynamics (MD) method, the mono-crystalline copper with different defects is investigated through tension and nanoindentation simulation. The single-crystal copper nanowire with surface defects is firstly studied through tension. For validation, the tension simulations for nanowire without defect are carried out under different temperatures and strain rates. The defects on nanowires are then systematically studied in considering different defects orientation distribution. It is found that the Young’s modulus is insensitive of surface defects and centro-plane defects. However, the yield strength and yield point show a significant decrease due to the different defects. Specially, the 〖45〗^° defect in surface and in (200) plane exerts the biggest influence to the yield strength, about 34.20% and 51.45% decrease are observed, respectively. Different defects are observed to serve as a dislocation source and different necking positions of the nanowires during tension are found. During nanoindentation simulation, dislocation is found nucleating below the contact area, but no obvious dislocation is generated around the nano-cavity. Comparing with the perfect substrate during nanoindentation, the substrate with nano-cavities emerged less dislocations, it is supposed that the nano-cavity absorbed part of the indent energy, and less plastic deformation happened in the defected substrate.

Optimal allocation strategies for the dark pool problem

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial scenarios, while also improving on their results in the iid setup. The resulting algorithms are efficient, and perform well in simulations under stochastic and adversarial inputs.

Cloning and characterization of a novel human gene related to vascular endothelial growth factor

This paper describes the cloning and characterization of a new member of the vascular endothelial growth factor (VEGF) gene family, which we have designated VRF for VEGF-related-factor. Sequencing of cDNAs from a human fetal brain library and RT-PCR products from normal and tumor tissue cDNA pools indicate two alternatively spliced messages with open reading frames of 621 and 564 bp, respectively. The predicted proteins differ at their carboxyl ends resulting from a shift in the open reading frame. Both isoforms show strong homology to VEGF at their amino termini, but only the shorter isoform maintains homology to VEGF at its carboxyl terminus and conserves all 16 cysteine residues of VEGF165. Similarity comparisons of this isoform revealed overall protein identity of 48% and conservative substitution of 69% with VEGF189. VRF is predicted to contain a signal peptide, suggesting that it may be a secreted factor. The VRF gene maps to the D11S750 locus at chromosome band 11q13, and the protein coding region, spanning approximately 5 kb, is comprised of 8 exons that range in size from 36 to 431 bp. Exons 6 and 7 are contiguous and the two isoforms of VRF arise through alternate splicing of exon 6. VRF appears to be ubiquitously expressed as two transcripts of 2.0 and 5.5 kb; the level of expression is similar among normal and malignant tissues.

Stochastic regularization method for backward Cauchy problem in Banach spaces

We consider a stochastic regularization method for solving the backward Cauchy problem in Banach spaces. An order of convergence is obtained on sourcewise representative elements.

The undirected feedback vertex set problem has a Poly(k) Kernel

Resolving a noted open problem, we show that the Undirected Feedback Vertex Set problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.

On a Syntactic Characterization of Classification with a Mind Change Bound

Most learning paradigms impose a particular syntax on the class of concepts to be learned; the chosen syntax can dramatically affect whether the class is learnable or not. For classification paradigms, where the task is to determine whether the underlying world does or does not have a particular property, how that property is represented has no implication on the power of a classifier that just outputs 1’s or 0’s. But is it possible to give a canonical syntactic representation of the class of concepts that are classifiable according to the particular criteria of a given paradigm? We provide a positive answer to this question for classification in the limit paradigms in a logical setting, with ordinal mind change bounds as a measure of complexity. The syntactic characterization that emerges enables to derive that if a possibly noncomputable classifier can perform the task assigned to it by the paradigm, then a computable classifier can also perform the same task. The syntactic characterization is strongly related to the difference hierarchy over the class of open sets of some topological space; this space is naturally defined from the class of possible worlds and possible data of the learning paradigm.

Bispectral and trispectral characterization of transition to chaos in the Duffing oscillator

Higher-order spectral (bispectral and trispectral) analyses of numerical solutions of the Duffing equation with a cubic stiffness are used to isolate the coupling between the triads and quartets, respectively, of nonlinearly interacting Fourier components of the system. The Duffing oscillator follows a period-doubling intermittency catastrophic route to chaos. For period-doubled limit cycles, higher-order spectra indicate that both quadratic and cubic nonlinear interactions are important to the dynamics. However, when the Duffing oscillator becomes chaotic, global behavior of the cubic nonlinearity becomes dominant and quadratic nonlinear interactions are weak, while cubic interactions remain strong. As the nonlinearity of the system is increased, the number of excited Fourier components increases, eventually leading to broad-band power spectra for chaos. The corresponding higher-order spectra indicate that although some individual nonlinear interactions weaken as nonlinearity increases, the number of nonlinearly interacting Fourier modes increases. Trispectra indicate that the cubic interactions gradually evolve from encompassing a few quartets of Fourier components for period-1 motion to encompassing many quartets for chaos. For chaos, all the components within the energetic part of the power spectrum are cubically (but not quadratically) coupled to each other.

Corneal markers of diabetic neuropathy

Diabetic neuropathy is a significant clinical problem that currently has no effective therapy, and in advanced cases, leads to foot ulceration and lower limb amputation. The accurate detection, characterization and quantification of this condition are important in order to define at-risk patients, anticipate deterioration, monitor progression, and assess new therapies This review evaluates novel corneal methods of assessing diabetic neuropathy. Two new non-invasive corneal markers have emerged, and in cross-sectional studies have demonstrated their ability to stratify the severity of this disease. Corneal confocal microscopy allows quantification of corneal nerve parameters and non-contact corneal esthesiometry, the functional correlate of corneal structure, assesses the sensitivity of the cornea. Both these techniques are quick to perform, produce little or no discomfort for the patient, and are suitable for clinical settings. Each has advantages and disadvantages over traditional techniques for assessing diabetic neuropathy. Application of these new corneal markers for longitudinal evaluation of diabetic neuropathy has the potential to reduce dependence on more invasive, costly, and time-consuming assessments, such as skin biopsy.

Ensuring Correctness During Process Configuration via Partner Synthesis

Variants of the same process can be encountered within one organization or across different organizations. For example, different municipalities, courts, and rental agencies all need to support highly similar processes. In fact, procurement and sales processes can be found in almost any organization. However, despite these similarities, there is also the need to allow for local variations in a controlled manner. Therefore, many academics and practitioners have advocated the use of configurable process models (sometimes referred to as reference models). A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is subsequently used to handle individual cases, for instance, to process customer orders. Process configuration is notoriously difficult as there may be all kinds of interdependencies between configuration decisions. In fact, an incorrect configuration may lead to behavioral issues such as deadlocks and livelocks. To address this problem, we present a novel verification approach inspired by the “operating guidelines” used for partner synthesis. We view the configuration process as an external service, and compute a characterization of all such services which meet particular requirements via the notion of configuration guideline. As a result, we can characterize all feasible configurations (i. e., configurations without behavioral problems) at design time, instead of repeatedly checking each individual configuration while configuring a process model.

LEGO robotics : an authentic problem solving tool?

With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the students were able to effectively relate their problem solving strategies to real-world contexts. The qualitative study involved 23 Grade 6 students participating in robotics activities at a Brisbane primary school. The study included data collected from researcher observations of student problem solving discussions, collected software programs, and data from a student completed questionnaire. Results from the study indicated that the robotic activities assisted students to reflect on the problem solving decisions they made. The study also highlighted that the students were able to relate their problem solving strategies to real-world contexts. The study demonstrated that while LEGO robotics can be considered useful problem solving tools in the classroom, careful teacher scaffolding needs to be implemented in regards to correlating LEGO with authentic problem solving. Further research in regards to how teachers can best embed realworld contexts into effective robotics lessons is recommended.

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.