FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

Dielectric relaxation of polystyrene with side-chain- and chain-end-labels

Polystyrenes with different concentrations of side groups with cyano groups were prepared and complex dielectric constants were measured in the range of the glass transition temperature and the frequency range of 10^–2–10⁷ Hz.The GPC and DSC measurements showed that the molecular weight of these polystyrenes was about 10500 g/mole and the glass transition temperatures were 89.5°C for all samples.The dielectric relaxation spectra obtained for the side group polystyrene labels and also the chain-end polystyrene labels prepared before [9] were analyzed to find out the degree of coupling of the chain-end and side-group labels with the cooperative reorientation of the polymeric matrix. The analysis of the spectra was carried out using the analysis method developed by Mansour and Stoll [6].The results obtained showed that both end- and side-group labels are strongly coupled with the segmental reorientation and relax with relaxation times longer than that of the segments.The value of logf _m = (logf _m(label)) – logf _m(matrix)) was obtained from the recently designed comparison diagram suggested by Mansour and Stoll [6, 14]. The value of logf _m depends on the label length in the case of chain-end labels.It was surprising to find that the side groups relax slower than the segments by only 0.9 decades. These results obtained implied that the label relaxes through a multistep relaxation mechanism of the side and end groups and not through a diffusion mechanism of the whole chain. In addition, the effective lengths of the relaxing units were determined using the empirical equation obtained before in the case of rodlike molecules in polyisoprene [7].     

Arsenidostannate mit Arsen-analogen [SnAs]-Schichten: Darstellung und Struktur von Na[Sn2As2], Na0,3Ca0,7[Sn2As2], Na0,6Sr0,6[Sn2As2], Na0,6Ba0,4[Sn2As2] und K0,3Sr0,7[Sn2As2]

Arsenidostannates with [SnAs] Nets Isostructural to Grey Arsenic: Synthesis and Crystal Structure of Na[Sn₂As₂], Na_0.3Ca_0.7[Sn₂As₂], Na_0.4Sr_0.6[Sn₂As₂], Na_0.6Ba_0.4[Sn₂As₂], and K_0.3Sr_0.7[Sn₂As₂] The metallic lustrous compounds Na[Sn₂As₂], Na_0.3Ca_0.7[Sn₂As₂], Na_0.4Sr_0.6[Sn₂As₂], Na_0.6Ba_0.4[Sn₂As₂] and K_0.3Sr_0.7[Sn₂As₂] were prepared from melts of mixtures of the elements. The compounds crystallize in the trigonal system (space group R3 m, No. 166, Z = 3) with lattice constants see in “Inhaltsübersicht”. The structures are isotypic to Sr[Sn₂As₂] containing puckered [SnAs] nets which are stacked with a sequence of six layers. The E(I)/E(II) atoms are located between each second [SnAs] layer in trigonal antiprismatic interstices formed by As atoms. In the resulting [Sn₂As₂] double layers the _∞²[SnAs] nets are stacked in such a way that additional Sn—Sn contacts arise.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Allostatic load as a complex clinical construct: A case‐based computational modeling approach

Allostatic load (AL) is a complex clinical construct, providing a unique window into the cumulative impact of stress. However, due to its inherent complexity, AL presents two major measurement challenges to conventional statistical modeling (the field's dominant methodology): it is comprised of a complex causal network of bioallostatic systems, represented by an even larger set of dynamic biomarkers; and, it is situated within a web of antecedent socioecological systems, linking AL to differences in health outcomes and disparities. To address these challenges, we employed case‐based computational modeling (CBM), which allowed us to make four advances: (1) we developed a multisystem, 7‐factor (20 biomarker) model of AL's network of allostatic systems; (2) used it to create a catalog of nine different clinical AL profiles (causal pathways); (3) linked each clinical profile to a typology of 23 health outcomes; and (4) explored our results (post hoc) as a function of gender, a key socioecological factor. In terms of highlights, (a) the Healthy clinical profile had few health risks; (b) the pro‐inflammatory profile linked to high blood pressure and diabetes; (c) Low Stress Hormones linked to heart disease, TIA/Stroke, diabetes, and circulation problems; and (d) high stress hormones linked to heart disease and high blood pressure. Post hoc analyses also found that males were overrepresented on the High Blood Pressure (61.2%), Metabolic Syndrome (63.2%), High Stress Hormones (66.4%), and High Blood Sugar (57.1%); while females were overrepresented on the Healthy (81.9%), Low Stress Hormones (66.3%), and Low Stress Antagonists (stress buffers) (95.4%) profiles. © 2015 Wiley Periodicals, Inc. Complexity 21: 291–306, 2016     

EIGHT-POINT STRAIGHT-LINE-NET-DIAGRAMS OF BINARY SIX-PHASE (n+4) MULTISYSTEMS (Ⅱ)——DERIVATION FROM THEORY OF PHYSICALLY REAL NETS

Based on the theory of physically real nets, the 8- point straight-line nets of bi-nary 6- phase (n + 4) multisystems (31 in toto) have been derived directly from the l-point straight-line nets. This result is in complete agreement with that derived fromthe theory of closed nets, indicating the incorrectness of the previous conclusion thatthere is only one 8-point straight-line net which corresponds to only one 8- pointstraight-line-net-diagram for binary 6- phase multisystems.     

一种嵌入式关系模型的形式化描述

在 Ｎ Ｒ／ Ｔ 网的基础上,对基于嵌入式关系模型的数据库信息系统的行为,给出了一种形式化的描述方法,并设计了一个变迁点火执行算法     

Design and synthesis of an aminobenzo-15-crown-5-labeled estradiol tethered with disulfide linkage

A novel measuring method (electroimmunoassay) of 17β-estradiol (E₂) in urine or blood was proposed on the basis of a competition between E₂ and a labeled E₂ against an immobilizing antibody. To evaluate the principle, 3-{4-[17β-hydroxy-1,3,5(10)-estratrien-3-yloxy]butyldisulfanyl}-N-(6,7,9,10,12,13,15,16-octahydro-5,8,11,14,17-pentaoxabenzocyclopentadecen-2-yl) succinamic acid (1) was designed and synthesized as a novel aminobenzo-15-crown-5-containing E₂ tethered with disulfide linkage. Two thiol-intermediates 5b and 19c were efficiently synthesized from mercaptosuccinic acid 7 and 4,4′-dithiodibutyric acid 12, respectively. Formations of disulfide linkages from less reactive thiols were examined and 4-phenyl-1,2,4-triazoline-3,5-dione (PTAD) could be employed for the formation of an unsymmetrical disulfide 20c from 5b and 19c. Then, removal of TMS- and allyl-protecting groups in 20c successfully afforded the crown ether-containing E₂1.     

The statistics of random directed graphs

The analysis of random graphs developed by the author, principally as a model for polymerization processes, is extended to the case of directed random graphs, with models of neural nets in mind. The principal novelty of the directed case is the representation of the partition function by a complex rather than a real integral, and the replacement of simple maxima in asymptotic evaluations by an interesting form of saddle point.