Spatio-temporal evolution of the deformation around the Rio-Patras fault (Greece) observed by synthetic aperture radar interferometry from 1993 to 2017

We analysed the ground deformation across two blocks defined by the Rio-Patras fault from 1993 to 2017 using multi-temporal Synthetic Aperture Radar Interferometry (InSAR) techniques. Our main objective was to contribute to the assessment of seismic hazard near the large city of Patras. Multiple data-sets were used, each one covering different temporal periods. Descending and ascending acquisitions, providing different viewing geometries contribute to fully determine the ground displacement in 3D. The data-sets used are from the European Space Agency’s (ESA) European Remote Sensing (ERS), Environmental Satellite (ENVISAT) and SENTINEL-1 as well as German Aerospace Center (DLR) ’s TERRASAR-X missions. Considering ESA’s missions covering both acquisition geometries and long periods, the southern block, showing lack of a sufficient number of scatterers does not allow the displacement characterization. In contrary, the northern block is characterized by a high number of scatterers having values of maximum likehood ranging from ?3.5 to ?4.3 mm year^?1 for ascending geometry and from ?1.6 to ?2.7 mm year^?1 for the descending one. The fact that both geometries show negative values of displacements are consistent with downlift movement and at the same time the quantitative differentiation probably indicates an horizontal component as well.     

Statistical synchronization among participants in real-time multimedia conferencing

In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the expected packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. An enhancement to improve synchronization which deals with the estimation of the time offsets between the individual periods of the sources and the period of the receiver is also presented. The error of the proposed algorithm is enumerated by the Chernoff bound and demonstrated by simulation and is shown to be acceptable in practical application. The algorithm can also be employed when traffic sources operate with different periods.     

The Solution kinetics of zirconium in liquid steel

Zirconium cylinders were immersed into liquid steel and their mass-transfer rates were measured under static and dynamic conditions. The cylinders were suspended from a load cell, and the apparent weight of the dissolving specimen as well as temperatures at various locations in the samples were measured continuously during immersion and recorded with a data acquisition System. From the weight measurements, the mass-transfer rate was deduced. In the assimilation of zirconium in liquid steel two periods were identified, i.e. the steel shell period and the free dissolution period. Immediately upon immersion the steel shell period Starts and when this period ends the free dissolution period commences. During the steel shell period, a shell of frozen steel wraps around the cylinder following its initial immersion. When zirconium cylinders were immersed into liquid steel, a reaction was detected at the steel shell/zirconium interface. This reaction took place almost immediately after immersion. The intermetallic Compounds Fe₂Zr and FeZr₂ were identified as reaction products. The experimentally measured mass transfer rates during the free dissolution, under quiescent and inductively stirred steel baths, were very similar. Under the experimental conditions used, the rate Controlling step of zirconium dissolution in liquid steel is reaction controlled.     

Line balancing in a just-in-time production environment: balancing multiple U-lines

The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.     

Efficient Management of Persistent Knowledge

Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memory is vital. Dealing with large quantities of clauses implies the use of persistent knowledge and thus, indexing methods are essential to access efficiently the subset of clauses relevant to answering a query. We introduce PerKMan, a storage manager that uses G-trees, and aims at efficient manipulation of large amounts of persistent knowledge. PerKMan may be connected to Prolog systems that offer an external C language interface. As well as the fact that the storage manager allows different arguments of a predicate to share a common index dimension in a novel manner, it indexes rules and facts in the same manner. PerKMan handles compound terms efficiently and its data structures adapt their shape to large dynamic volumes of clauses, no matter what the distribution. The storage manager achieves fast clause retrieval and reasonable use of disk space.     

Analysis and optimization of weakly coupled thermoelastoplastic systems with applications to weldment design

A systematic approach for the design of weakly coupled thermoelastoplastic systems is presented. The Newton–Raphson iteration method is used in the solution process so that analytic design sensitivity formulations may be efficiently derived via the direct differentiation technique. The derived formulations are suitable for finite element implementations. Analysis and sensitivity analysis capabilities are combined with numerical optimization to form an optimum design algorithm. To demonstrate the algorithm, we optimally design a weldment with respect to manufacturing and service life aspects.     

Time‐dependent heat transfer coefficient of a wall

A time‐dependent coefficient of heat transfer is proposed for the computation of thermal power required, so that a room temperature reaches a desired value within a given time. A mathematical formulation of the room heating transient phenomenon is constructed in a dimensionless form. Using an integral approximate solution an analytical expression for this coefficient is provided and it is verified by diagrams adopted by DIN 4701. Copyright © 2003 John Wiley & Sons, Ltd.     

Enhancing cognitive radio systems with robust reasoning

Cognitive radio systems dynamically reconfigure the algorithms and parameters they use, in order to adapt to the changing environment conditions. However, reaching proper reconfiguration decisions presupposes a way of knowing, with high enough assurance, the capabilities of the alternate configurations, especially in terms of achievable transmission capacity and coverage. The present paper addresses this problem, firstly, by specifying a complete process for extracting estimations of the capabilities of candidate configurations, in terms of transmission capacity and coverage, and, secondly, by enhancing these estimations with the employment of a machine learning technique. The technique is based on the use of Bayesian Networks, in conjunction with an effective learning and adaptation strategy, and aims at extracting and exploiting knowledge and experience, in order to reach robust (i.e. stable and reliable) estimations of the configurations' capabilities. Comprehensive results of the proposed method are presented, in order to validate its functionality. Copyright © 2007 John Wiley & Sons, Ltd.     

An optimal algorithm for the boundary of a cell in a union of rays

In this paper we study a cell of the subdivision induced by a union ofn half-lines (or rays) in the plane. We present two results. The first one is a novel proof of theO(n) bound on the number of edges of the boundary of such a cell, which is essentially of methodological interest. The second is an algorithm for constructing the boundary of any cell, which runs in optimal (n logn) time. A by-product of our results are the notions of skeleton and of skeletal order, which may be of interest in their own right.This work was partly supported by CEE ESPRIT Project P-940, by the Ecole Normale Supérieure, Paris, and by NSF Grant ECS-84-10902.This work was done in part while this author was visiting the Ecole Normale Supérieure, Paris, France.     

Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Distributed and Parallel Databases - Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum...