Mathematical framework for Bz-based MREIT model in electrical impedance imaging

Magnetic resonance electrical impedance tomography (MREIT) is a new medical imaging modality visualizing static conductivity images of a subject by injecting electrical currents (Neumann data) and measuring the induced internal magnetic flux density B using an MRI scanner. Taking advantage of the internal information B, MREIT can deal with the ill-posed characteristics of the inverse problem in electrical impedance tomography (EIT However, the MREIT model at its early stage has technical difficulties in clinical applications mainly due to the requirement of subject rotations for acquiring all of the three components of B = (B_z, B_y, B_z). Lately, a new model so called the B_z-based MREIT model has been proposed to eliminate the subject rotation procedure. In this new MREIT model, we need to measure only one component B_z when the z-axis is the direction of the main magnetic field of the MRI scanner. There have been significant advances in reconstruction algorithms based on the B_z-based MREIT model and experimental studies showed that an excellent contrast resolution can be achievable. Although these advance in B_z-based MREIT, we have not dealt with its rigorous mathematical theory yet.The primary purpose of this work is to provide the rigorous mathematical framework for the B_z-based MREIT model. With this mathematical framework, we obtain the uniqueness in a two-dimensional setting of the B_z-based MREIT model. After introducing an example of the B_z-based MREIT algorithm, we present typical numerical and also experimental results.     

一类Feistel密码的线性分析

该文提出一种新的求取分组密码线性偏差上界的方法，特别适用于密钥线性作用的Feistel密码．该分析方法的思路是，首先对密码体制线性偏差进行严格的数学描述，分别给出密码线性偏差与轮函数F及S盒的线性偏差的数学关系；然后通过求取线性方程组最小重量解，确定密码线性偏差的上界．     

Improved resolution of the multiple inverse method by eliminating erroneous solutions

The multiple inverse method is a numerical technique designed to separate stresses from heterogeneous fault–slip data. The method is one of the resampling methods based on the pattern recognition. Plotting solutions determined from k-fault subset into the parameter space, we have clusters representing significant stresses for the dataset. This paper presents a technique to improve the resolution of stress for the method. The regularity/singularity test of the subsets taken from the fault–slip data is the key for this purpose. The resolution and accuracy of the method are improved by eliminating erroneous stresses or artifacts that were yielded by the method. The performances of the method are demonstrated with a variety of artificial datasets.     

用增量的累积量方法测量大气风场

为了在非平稳、非线性条件下能得到真实风场的良好估计,提出了一种用空间分布天线（SA）雷达信号的增量累积量测量大气风场参数的方法。该方法基于结构函数方法,利用高阶累计量在信息处理中的特性,用零延迟的增量累计量求解平均水平风速等具体参量，并在大气散射模型基础上对增量累积量方法进行了数值模拟,得出了同理论分析一致的结果.分析和计算表明,该方法完全适用于局地平稳条件，可以减小风场参量估计对天线间距的敏感度；阶数k≥3时,对高斯噪声有很强抑制;同时可以得到风场参量的高阶估计，这是普通的二阶方法（如全相关分析、全谱分析）不具备的。     

Effect of Fog and Clouds on the Image Quality in Millimeter Communications

The effect of fog and clouds in millimeter communication is discussed, and the attenuation caused by fog and clouds is reviewed. Signal-to-noise ratio (SNR) of image is derived using relating models of fog and clouds attenuation. According to the relation of image quality and its signal-to-noise ratio, the system behavior is forecasted theoretically. It is shown that the signal-to-noise ratio of receiver at certain transmitter power is inverse with radio wave frequency, from about 70dB at 10GHz to 48dB for fog and 49dB for clouds. The image quality of received signal at certain transmitter power is inverse with radio wave frequency, from about 7 grade at 10GHz to 5.27 grade for fog and 5.37 grade for clouds. The above calculated results are consistent with experimental results.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

Information systems and uncertainty: a conspiracy of misplaced confidence

Abstract. Information technology is becoming an increasingly important factor in contemporary management. Information systems are being set up in business explicitly to accommodate the new opportunities of this technology, and these are having a lasting effect on managerial practice. The full implications of this technology-driven development have not been appreciated by organizations, which in absorbing technological systems, are tolerating a great drain on their resources.
The efficacy of computers is predicated on the acceptance of some very specific perspectives. A growing discontent and disappointment with their limited achievements is our reason for advocating a different point of view. We will discuss how a shift in perspective, particularly in respect to the perception of uncertainty, will affect thinking and practice in the field of management support systems. We will render our view of the application of computerized decision support systems (DSS), and especially, we will focus on the beliefs and assumptions that have shaped this technology thus far. To this end we will discuss the concept of uncertainty, by juxtaposing current thinking and practice with our understanding of the context of its application. Finally, we will place our understanding of uncertainty in a managerial context and explain the implications this would have for strategists.     

Ranking Pages by Topology and Popularity within Web Sites

We compare two link analysis ranking methods of web pages in a site. The first, called Site Rank, is an adaptation of PageRank to the granularity of a web site and the second, called Popularity Rank, is based on the frequencies of user clicks on the outlinks in a page that are captured by navigation sessions of users through the web site. We ran experiments on artificially created web sites of different sizes and on two real data sets, employing the relative entropy to compare the distributions of the two ranking methods. For the real data sets we also employ a nonparametric measure, called Spearman's footrule, which we use to compare the top-ten web pages ranked by the two methods. Our main result is that the distributions of the Popularity Rank and Site Rank are surprisingly close to each other, implying that the topology of a web site is very instrumental in guiding users through the site. Thus, in practice, the Site Rank provides a reasonable first order approximation of the aggregate behaviour of users within a web site given by the Popularity Rank.     

A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm

As genetic algorithm parameters vary depending on different problem types when applying genetic algorithm to reach global optimum, appropriate design value selection has significant impact on the efficiency of genetic algorithm. However, most users adjust parameters manually based on the reference values of previous literature. Such trial-and-error method is time-consuming, ineffective, and often it could not locate the optimal combination. Therefore, in flowshop scheduling problems, this research anticipates to complete optimal parameter combination design in genetic algorithm using Taguchi experimental design. According to the research results, different ways of producing initial solution have significant influence on this research topic. Consequently, confirmation experiment is conducted using the optimal parameter combination obtained from the research results. It is found that the predicted value of signal-to-noise ratio (S/N ratio) and its actual value exists deviation of 0.238%, indicating repetitiveness and robustness of the obtained parameter combination. Hence, this research method can effectively reduce time spent on parameter design using genetic algorithm and increase efficiency of algorithm.     

Spare parts inventory management with demand lead times and rationing

We study an inventory system that consists of two demand classes. The orders in the first class need to be satisfied immediately, whereas the orders in the second class are to be filled in a given demand lead time. The two classes are also of different criticality. For this system, we propose a policy that rations the non-critical orders. Under a one-for-one replenishment policy with backordering and for Poisson demand arrivals for both classes, we first derive expressions for the service levels of both classes. The service level for the critical class is an approximation, whereas the service level for the non-critical class is exact. We then conduct a computational study to show that our approximation works reasonably, the benefits of rationing can be substantial, and the incorporation of demand lead time provides more value when the demand class with demand lead time is the critical class. The research is motivated by the spare parts service system of a major capital equipment manufacturer that faces two types of demand. For this company, the critical down orders need to be satisfied immediately, while the less critical maintenance orders can be satisfied after a fixed demand lead time. We conduct a case study with 64 representative parts and show that significant savings (as much as 14% on inventory on hand) are possible through incorporation of demand lead times and rationing.