Formation and characterization of oxynitride glasses in the Si-Ca-Al-O-N and Si-Ca-Al,B-O-N systems

Oxynitride compositions in the Si-Ca-Al-O-N and Si-Ca-Al, B-O-N systems were melted and furnace-cooled in BN crucibles at temperatures from 1650 to 1850° C under dry nitrogen atmosphereS. Glass formation, phase stability and crystallization were studied by characterizing the cooled melts by X-ray diffraction, DTA, and electron microscopy. Oxynitride batches with nitrogen content up to 11 at % formed glasses in the Si-Ca-Al-O-N system. Glasses in the Si-Ca-Al, B-O-N system could be formed only when the B₂O₃ content of the batch was less than 3 wt %. Oxynitride glasses in these boron-containing systems were characteristically inhomogeneous, difficult to process, and prone to crystallization. In both the systems, glasses exhibited glass transitions beginning at 1000° C and crystallization at 1300 to 1500° C. Nitrogen-containing crystalline phases were identified in devitrified glasses via microstructural and micro-mechanical analyses.     

Microchemistry and microstructure of a multiphase aluminosilicate ceramic

The microstructure and microchemistry of a sintered (≈ 1700° C) aluminosilicate ceramic (60 wt % Al₂O₃-40 wt% SiO₂) was investigated by optical, scanning (SEM and EDAX), and analytical electron microscopy (TEM and STEM). The microstructural features of the fired ceramic consisted of unreacted Al₂O₃, glass, porosity, and equilibrium and metastable mullite phases. Residual Al₂O₃ agglomerates (≈ 15 to 30 μm in size) were surrounded by a ≈ 6 μm layer of equilibrium mullite (≈ 71.3 to 73.5 wt% Al₂O₃). The unreacted Al₂O₃-equilibrium mullite assembly formed islands embedded in a silica rich glass (≈ 4.5 to 14wt% Al₂O₃) which also contained 2 to 3 μm thick metastable mullite needles (≈ 70 to 77 wt% Al₂O₃). Phase separation and alumina rich glass compositions (≈ 57 to 59 wt% Al₂O₃) were also observed in some areas of the microstructure.     

双超越离合器式电磁馈能阻尼器原型机试验测试与分析

在对双超越离合器式电磁馈能阻尼器的前期研究基础上,试制了该阻尼器的原型机,并对谐波激励下原型机的频谱响应特性和阻尼响应特性进行了分析。通过对原型机的测试,证明了该结构方案的可行性,同时还证实了利用转动惯量分力,在被动模式下实现"high-low"半主动阻尼方法的正确性,并为展开对双超越离合器结构的进一步研究奠定了基础。     

A precedence-constrained asymmetric traveling salesman model for disassembly optimization

In this paper, we address a product-disassembly optimization problem, which aims at minimizing the costs associated with the disassembly process (namely, the cost of breaking the joints and the sequence-dependent set-up cost associated with the disassembly operations), while maximizing the benefits resulting from the recovery of components and subassemblies that constitute the product. A method able to capture the mating relationships among the parts and joints of the product through a network representation scheme is developed. The disassembly optimization problem is formulated as a precedence-constrained asymmetric traveling salesman problem. A three-stage iterative procedure is designed to obtain optimal or near-optimal solutions to the problem. The results demonstrate that our procedure generates solutions that are within 2% of optimality for all test cases, while only requiring a reasonable computational effort.     

Compressing Two-Dimensional Routing Tables

We consider an algorithmic problem that arises in the context of routing tables used by Internet routers. The Internet addressing scheme is hierarchical, where a group of hosts are identified by a prefix that is common to all the hosts in that group. Each host machine has a unique 32-bit address. Thus, all traffic between a source group s and a destination group d can be routed along a particular route c by maintaining a routing entry (s, d, c) at all intermediate routers, where s and d are binary bit strings. Many different routing tables can achieve the same routing behavior. In this paper we show how to compute the most compact routing table. In particular, we consider the following optimization problem: given a routing table D with N entries of the form (s, d, c) , determine a conflict-free routing table with fewest entries that has the same routing behavior as D. If the source and destination fields have up to w bits, and there are at most K different route values, then our algorithm runs in worst-case time O( NK w2) .     

Augmenting a conceptual model with geospatiotemporal annotations

While many real-world applications need to organize data based on space (e.g., geology, geomarketing, environmental modeling) and/or time (e.g., accounting, inventory management, personnel management), existing conventional conceptual models do not provide a straightforward mechanism to explicitly capture the associated spatial and temporal semantics. As a result, it is left to database designers to discover, design, and implement - on an ad hoc basis - the temporal and spatial concepts that they need. We propose an annotation-based approach that allows a database designer to focus first on nontemporal and nongeospatial aspects (i.e., "what") of the application and, subsequently, augment the conceptual schema with geospatiotemporal annotations (i.e., "when" and "where"). Via annotations, we enable a supplementary level of abstraction that succinctly encapsulates the geospatiotemporal data semantics and naturally extends the semantics of a conventional conceptual model. An overarching assumption in conceptual modeling has always been that expressiveness and formality need to be balanced with simplicity. We posit that our formally defined annotation-based approach is net only expressive, but also straightforward to understand and implement.     

A cyclic policy for the loading of multiple products on a vehicle with different compartment sizes

In this paper, we address a multi-product loading problem in which a vehicle (a truck or a ship) is used to transfer multiple products. The product demands are different but stationary over time. The vehicle consists of compartments of different sizes and each compartment can contain only one product type during each shipment. No shortages are permitted, and we assume that the inventory holding cost is significantly lower than the delivery cost. The objective is to minimize the setup rate, that is, the number of deliveries per time unit. A cyclic policy is shown to be optimal, and a heuristic algorithm is developed to determine the cycle length as well as the assignments of products to the compartments during each of the requisite number of shipments made during that cycle. A comparison of the solutions obtained by the proposed algorithm with the optimal solutions (or a bound) indicate that the algorithm provides solutions with optimal setup rates in most of the problem instances considered and, when not optimal, the setup rates of these solutions are close to optimal values.