A DAFT DL_POLY distributed memory adaptation of the Smoothed Particle Mesh Ewald method

The Smoothed Particle Mesh Ewald method [U. Essmann, L. Perera, M.L. Berkowtz, T. Darden, H. Lee, L.G. Pedersen, J. Chem. Phys. 103 (1995) 8577] for calculating long ranged forces in molecular simulation has been adapted for the parallel molecular dynamics code DL_POLY_3 [I.T. Todorov, W. Smith, Philos. Trans. Roy. Soc. London 362 (2004) 1835], making use of a novel 3D Fast Fourier Transform (DAFT) [I.J. Bush, The Daresbury Advanced Fourier transform, Daresbury Laboratory, 1999] that perfectly matches the Domain Decomposition (DD) parallelisation strategy [W. Smith, Comput. Phys. Comm. 62 (1991) 229; M.R.S. Pinches, D. Tildesley, W. Smith, Mol. Sim. 6 (1991) 51; D. Rapaport, Comput. Phys. Comm. 62 (1991) 217] of the DL_POLY_3 code. In this article we describe software adaptations undertaken to import this functionality and provide a review of its performance.     

Comparison of computational approaches for predicting the effects of missense mutations on p53 function

We applied our recently developed kinetic computational mutagenesis (KCM) approach [L.T. Chong, W.C. Swope, J.W. Pitera, V.S. Pande, Kinetic computational alanine scanning: application to p53 oligomerization, J. Mol. Biol. 357 (3) (2006) 1039–1049] along with the MM-GBSA approach [J. Srinivasan, T.E. Cheatham 3rd, P. Cieplak, P.A. Kollman, D.A. Case, Continuum solvent studies of the stability of DNA, RNA, and phosphoramidate-DNA helices, J. Am. Chem. Soc. 120 (37) (1998) 9401–9409; P.A. Kollman, I. Massova, C.M. Reyes, B. Kuhn, S. Huo, L.T. Chong, M. Lee, T. Lee, Y. Duan, W. Wang, O. Donini, P. Cieplak, J. Srinivasan, D.A. Case, T.E. Cheatham 3rd., Calculating structures and free energies of complex molecules: combining molecular mechanics and continuum models, Acc. Chem. Res. 33 (12) (2000) 889–897] to evaluate the effects of all possible missense mutations on dimerization of the oligomerization domain (residues 326–355) of tumor suppressor p53. The true positive and true negative rates for KCM are comparable (within 5%) to those of MM-GBSA, although MM-GBSA is much less computationally intensive when it is applied to a single energy-minimized configuration per mutant dimer. The potential advantage of KCM is that it can be used to directly examine the kinetic effects of mutations.     

Comparison of computational approaches for predicting the effects of missense mutations on p53 function

We applied our recently developed kinetic computational mutagenesis (KCM) approach [L.T. Chong, W.C. Swope, J.W. Pitera, V.S. Pande, Kinetic computational alanine scanning: application to p53 oligomerization, J. Mol. Biol. 357 (3) (2006) 1039–1049] along with the MM-GBSA approach [J. Srinivasan, T.E. Cheatham 3rd, P. Cieplak, P.A. Kollman, D.A. Case, Continuum solvent studies of the stability of DNA, RNA, and phosphoramidate-DNA helices, J. Am. Chem. Soc. 120 (37) (1998) 9401–9409; P.A. Kollman, I. Massova, C.M. Reyes, B. Kuhn, S. Huo, L.T. Chong, M. Lee, T. Lee, Y. Duan, W. Wang, O. Donini, P. Cieplak, J. Srinivasan, D.A. Case, T.E. Cheatham 3rd., Calculating structures and free energies of complex molecules: combining molecular mechanics and continuum models, Acc. Chem. Res. 33 (12) (2000) 889–897] to evaluate the effects of all possible missense mutations on dimerization of the oligomerization domain (residues 326–355) of tumor suppressor p53. The true positive and true negative rates for KCM are comparable (within 5%) to those of MM-GBSA, although MM-GBSA is much less computationally intensive when it is applied to a single energy-minimized configuration per mutant dimer. The potential advantage of KCM is that it can be used to directly examine the kinetic effects of mutations.     

An extension of Harrington''''s noncupping theorem

(i) Call a c.e. degree b anti-cupping relative to x, if there is a c.e. a < b such that for any c.e. w, w x implies a ∪ w b ∪ x.(ii) Call a c.e. degree b everywhere anti-cupping (e.a.c.), if it is anti-cupping relative to x for each c.e. degree x.By a tree method, we prove that every high c.e. degree has e.a.c. property by extending Harrington's anti-cupping theorem.     

The discoveries of continuations

We give a brief account of the discoveries of continuations and related concepts by A. van Wijngaarden, A. W. Mazurkiewicz, F. L. Morris, C. P. Wadsworth, J. H. Morris, M. J. Fischer, and S. K. Abdali.     

Taylor polynomial solution of hyperbolic type partial differential equations with constant coefficients

The purpose of this study is to give a Taylor polynomial approximation for the solution of hyperbolic type partial differential equations with constant coefficients. The technique used is an improved Taylor matrix method, which has been given for solving ordinary differential, integral and integro-differential equations [M. Gülsu and M. Sezer, A method for the approximate solution of the high-order linear difference equations in terms of Taylor polynomials, Int. J. Comput. Math. 82(5) (2005), pp. 629–642; M. Gülsu and M. Sezer, On the solution of the Riccati equation by the Taylor matrix method, Appl. Math. Comput. 188 (2007), pp. 446–449; A. Karamete and M. Sezer, A Taylor collocation method for the solution of linear integro-differential equations, Int. J. Comput. Math. 79(9) (2002), pp. 987–1000; N. Kurt and M. Çevik, Polynomial solution of the single degree of freedom system by Taylor matrix method, Mech. Res. Commun. 35 (2008), pp. 530–536; N. Kurt and M. Sezer, Polynomial solution of high-order linear Fredholm integro-differential equations with constant coefficients, J. Franklin Inst. 345 (2008), pp. 839–850; ?. Nas, S. Yalçinba?, and M. Sezer, A method for approximate solution of the high-order linear Fredholm integro-differential equations, Int. J. Math. Edu. Sci. Technol. 27(6) (1996), pp. 821–834; M. Sezer, Taylor polynomial solution of Volterra integral equations, Int. J. Math. Edu. Sci. Technol. 25(5) (1994), pp. 625–633; M. Sezer, A method for approximate solution of the second order linear differential equations in terms of Taylor polynomials, Int. J. Math. Edu. Sci. Technol. 27(6) (1996), pp. 821–834; M. Sezer, M. Gülsu, and B. Tanay, A matrix method for solving high-order linear difference equations with mixed argument using hybrid Legendre and Taylor polynomials, J. Franklin Inst. 343 (2006), pp. 647–659; S. Yalçinba?, Taylor polynomial solutions of nonlinear Volterra–Fredholm integral equation, Appl. Math. Comput. 127 (2002), pp. 196–206; S. Yalçinba? and M. Sezer, The approximate solution of high-order linear Volterra–Fredholm integro-differential equations in terms of Taylor polynomials, Appl. Math. Comput. 112 (2000), pp. 291–308]. Some numerical examples, which consist of initial and boundary conditions, are given to illustrate the reliability and efficiency of the method. Also, the results obtained are compared by the known results; the error analysis is performed and the accuracy of the solution is shown.     

Monte Carlo methods for computing the capacitance of the unit cube

It is well known that there is no analytic expression for the electrical capacitance of the unit cube. However, there are several Monte Carlo methods that have been used to numerically estimate this capacitance to high accuracy. These include a Brownian dynamics algorithm [H.-X. Zhou, A. Szabo, J.F. Douglas, J.B. Hubbard, A Brownian dynamics algorithm for calculating the hydrodynamic friction and the electrostatic capacitance of an arbitrarily shaped object, J. Chem. Phys. 100 (5) (1994) 3821–3826] coupled to the “walk on spheres” (WOS) method [M.E. Müller, Some continuous Monte Carlo methods for the Dirichlet problem, Ann. Math. Stat. 27 (1956) 569–589]; the Green’s function first-passage (GFFP) algorithm [J.A. Given, J.B. Hubbard, J.F. Douglas, A first-passage algorithm for the hydrodynamic friction and diffusion-limited reaction rate of macromolecules, J. Chem. Phys. 106 (9) (1997) 3721–3771]; an error-controlling Brownian dynamics algorithm [C.-O. Hwang, M. Mascagni, Capacitance of the unit cube, J. Korean Phys. Soc. 42 (2003) L1–L4]; an extrapolation technique coupled to the WOS method [C.-O. Hwang, Extrapolation technique in the “walk on spheres” method for the capacitance of the unit cube, J. Korean Phys. Soc. 44 (2) (2004) 469–470]; the “walk on planes” (WOP) method [M.L. Mansfield, J.F. Douglas, E.J. Garboczi, Intrinsic viscosity and the electrical polarizability of arbitrarily shaped objects, Phys. Rev. E 64 (6) (2001) 061401:1–061401:16; C.-O. Hwang, M. Mascagni, Electrical capacitance of the unit cube, J. Appl. Phys. 95 (7) (2004) 3798–3802]; and the random “walk on the boundary” (WOB) method [M. Mascagni, N.A. Simonov, The random walk on the boundary method for calculating capacitance, J. Comp. Phys. 195 (2004) 465–473]. Monte Carlo methods are convenient and efficient for problems whose solution includes singularities. In the calculation of the unit cube capacitance, there are edge and corner singularities in the charge density distribution. In this paper, we review the above Monte Carlo methods for computing the electrical capacitance of a cube and compare their effectiveness. We also provide a new result. We will focus our attention particularly on two Monte Carlo methods: WOP [M.L. Mansfield, J.F. Douglas, E.J. Garboczi, Intrinsic viscosity and the electrical polarizability of arbitrarily shaped objects, Phys. Rev. E 64 (6) (2001) 061401:1–061401:16; C.-O. Hwang, M. Mascagni, Electrical capacitance of the unit cube, J. Appl. Phys. 95 (7) (2004) 3798–3802; C.-O. Hwang, T. Won, Edge charge singularity of conductors, J. Korean Phys. Soc. 45 (2004) S551–S553] and the random WOB [M. Mascagni, N.A. Simonov, The random walk on the boundary method for calculating capacitance, J. Comp. Phys. 195 (2004) 465–473] methods.     

On the convergence of Newton-type methods using recurrent functions

We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in many interesting cases [X. Chen, On the convergence of Broyden-like methods for nonlinear equations with nondifferentiable terms, Ann. Inst. Statist. Math. 42 (1990), pp. 387–401; X. Chen and T. Yamamoto, Convergence domains of certain iterative methods for solving nonlinear equations, Numer. Funct. Anal. Optim. 10 (1989), pp. 37–48; Y. Chen and D. Cai, Inexact overlapped block Broyden methods for solving nonlinear equations, Appl. Math. Comput. 136 (2003), pp. 215–228; J.E. Dennis, Toward a unified convergence theory for Newton-like methods, in Nonlinear Functional Analysis and Applications, L.B. Rall, ed., Academic Press, New York, 1971, pp. 425–472; P. Deuflhard, Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms, Springer Series in Computational Mathematics, Vol. 35, Springer-Verlag, Berlin, 2004; P. Deuflhard and G. Heindl, Affine invariant convergence theorems for Newton's method and extensions to related methods, SIAM J. Numer. Anal. 16 (1979), pp. 1–10; Z. Huang, A note of Kantorovich theorem for Newton iteration, J. Comput. Appl. Math. 47 (1993), pp. 211–217; L.V. Kantorovich and G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; D. Li and M. Fukushima, Globally Convergent Broyden-like Methods for Semismooth Equations and Applications to VIP, NCP and MCP, Optimization and Numerical Algebra (Nanjing, 1999), Ann. Oper. Res. 103 (2001), pp. 71–97; C. Ma, A smoothing Broyden-like method for the mixed complementarity problems, Math. Comput. Modelling 41 (2005), pp. 523–538; G.J. Miel, Unified error analysis for Newton-type methods, Numer. Math. 33 (1979), pp. 391–396; G.J. Miel, Majorizing sequences and error bounds for iterative methods, Math. Comp. 34 (1980), pp. 185–202; I. Moret, A note on Newton type iterative methods, Computing 33 (1984), pp. 65–73; F.A. Potra, Sharp error bounds for a class of Newton-like methods, Libertas Math. 5 (1985), pp. 71–84; W.C. Rheinboldt, A unified convergence theory for a class of iterative processes, SIAM J. Numer. Anal. 5 (1968), pp. 42–63; T. Yamamoto, A convergence theorem for Newton-like methods in Banach spaces, Numer. Math. 51 (1987), pp. 545–557; P.P. Zabrejko and D.F. Nguen, The majorant method in the theory of Newton–Kantorovich approximations and the Pták error estimates, Numer. Funct. Anal. Optim. 9 (1987), pp. 671–684; A.I. Zin[cbreve]enko, Some approximate methods of solving equations with non-differentiable operators, (Ukrainian), Dopovidi Akad. Nauk Ukraïn. RSR (1963), pp. 156–161]. Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, and a differential equation are also provided in this study.     

RFRCDB-siRNA: improved design of siRNAs by random forest regression model coupled with database searching

Although the observations concerning the factors which influence the siRNA efficacy give clues to the mechanism of RNAi, the quantitative prediction of the siRNA efficacy is still a challenge task. In this paper, we introduced a novel non-linear regression method: random forest regression (RFR), to quantitatively estimate siRNAs efficacy values. Compared with an alternative machine learning regression algorithm, support vector machine regression (SVR) and four other score-based algorithms [A. Reynolds, D. Leake, Q. Boese, S. Scaringe, W.S. Marshall, A. Khvorova, Rational siRNA design for RNA interference, Nat. Biotechnol. 22 (2004) 326-330; K. Ui-Tei, Y. Naito, F. Takahashi, T. Haraguchi, H. Ohki-Hamazaki, A. Juni, R. Ueda, K. Saigo, Guidelines for the selection of highly effective siRNA sequences for mammalian and chick RNA interference, Nucleic Acids Res. 32 (2004) 936-948; A.C. Hsieh, R. Bo, J. Manola, F. Vazquez, O. Bare, A. Khvorova, S. Scaringe, W.R. Sellers, A library of siRNA duplexes targeting the phosphoinositide 3-kinase pathway: determinants of gene silencing for use in cell-based screens, Nucleic Acids Res. 32 (2004) 893-901; M. Amarzguioui, H. Prydz, An algorithm for selection of functional siRNA sequences, Biochem. Biophys. Res. Commun. 316 (2004) 1050-1058) our RFR model achieved the best performance of all. A web-server, RFRCDB-siRNA (http://www.bioinf.seu.edu.cn/siRNA/index.htm), has been developed. RFRCDB-siRNA consists of two modules: a siRNA-centric database and a RFR prediction system. RFRCDB-siRNA works as follows: (1) Instead of directly predicting the gene silencing activity of siRNAs, the service takes these siRNAs as queries to search against the siRNA-centric database. The matched sequences with the exceeding the user defined functionality value threshold are kept. (2) The mismatched sequences are then processed into the RFR prediction system for further analysis.     

DPEMC: A Monte Carlo for double diffraction

We extend the POMWIG Monte Carlo generator developed by B. Cox and J. Forshaw, to include new models of central production through inclusive and exclusive double Pomeron exchange in proton-proton collisions. Double photon exchange processes are described as well, both in proton-proton and heavy-ion collisions. In all contexts, various models have been implemented, allowing for comparisons and uncertainty evaluation and enabling detailed experimental simulations.

Program summary

Title of the program:DPEMC, version 2.4Catalogue identifier: ADVFProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVFProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer: any computer with the FORTRAN 77 compiler under the UNIX or Linux operating systemsOperating system: UNIX; LinuxProgramming language used: FORTRAN 77High speed storage required:<25 MBNo. of lines in distributed program, including test data, etc.: 71 399No. of bytes in distributed program, including test data, etc.: 639 950Distribution format: tar.gzNature of the physical problem: Proton diffraction at hadron colliders can manifest itself in many forms, and a variety of models exist that attempt to describe it [A. Bialas, P.V. Landshoff, Phys. Lett. B 256 (1991) 540; A. Bialas, W. Szeremeta, Phys. Lett. B 296 (1992) 191; A. Bialas, R.A. Janik, Z. Phys. C 62 (1994) 487; M. Boonekamp, R. Peschanski, C. Royon, Phys. Rev. Lett. 87 (2001) 251806; Nucl. Phys. B 669 (2003) 277; R. Enberg, G. Ingelman, A. Kissavos, N. Timneanu, Phys. Rev. Lett. 89 (2002) 081801; R. Enberg, G. Ingelman, L. Motyka, Phys. Lett. B 524 (2002) 273; R. Enberg, G. Ingelman, N. Timneanu, Phys. Rev. D 67 (2003) 011301; B. Cox, J. Forshaw, Comput. Phys. Comm. 144 (2002) 104; B. Cox, J. Forshaw, B. Heinemann, Phys. Lett. B 540 (2002) 26; V. Khoze, A. Martin, M. Ryskin, Phys. Lett. B 401 (1997) 330; Eur. Phys. J. C 14 (2000) 525; Eur. Phys. J. C 19 (2001) 477; Erratum, Eur. Phys. J. C 20 (2001) 599; Eur. Phys. J. C 23 (2002) 311]. This program implements some of the more significant ones, enabling the simulation of central particle production through color singlet exchange between interacting protons or antiprotons.Method of solution: The Monte Carlo method is used to simulate all elementary 2→2 and 2→1 processes available in HERWIG. The color singlet exchanges implemented in DPEMC are implemented as functions reweighting the photon flux already present in HERWIG.Restriction on the complexity of the problem: The program relying extensively on HERWIG, the limitations are the same as in [G. Marchesini, B.R. Webber, G. Abbiendi, I.G. Knowles, M.H. Seymour, L. Stanco, Comput. Phys. Comm. 67 (1992) 465; G. Corcella, I.G. Knowles, G. Marchesini, S. Moretti, K. Odagiri, P. Richardson, M. Seymour, B. Webber, JHEP 0101 (2001) 010].Typical running time: Approximate times on a 800 MHz Pentium III: 5-20 min per 10 000 unweighted events, depending on the process under consideration.     

Book Reviews

Book reviewd in this article:
The Encyclopedia of Artificial Intelligence . (two volumes). Ed. S. C. Shapiro und D. Eckroth .
Expert Systems 1986, Volume 1: the USA and Canada . J. Hewett and R. Susson, Ovum, 1986 .
Commercial Expert Systems in Europe . J. Newett, S. Timms and G. d'Aumale, Ovum, 1986 .     

The DenK-architecture: A fundamental approach to user-interfaces

In this paper we present the basic principles underlying the DenK-system, a generic cooperative interface combining linguistic and visual interaction. The system integrates results from fundamental research in knowledge representation, communication, natural language semantics and pragmatics, and object-oriented animation. Our design incorporates a cooperative and knowledgeable electronic assistant that communicates with a user in natural language, and an application domain, which is presented visually. The assistant, that we call thecooperator, has an information state that is represented in a rich form of Type Theory, a formalism that enables us to model the inherent cognitive dynamics of a dialogue participant. Pragmatic issues in man-machine interaction, concerning the use of natural language and knowledge in cooperative communication, are central to our approach.Authors' addresses: R. M. C. Ahn and H. C. Bunt, Institute for Language Technology and Artificial Intelligence (ITK), Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands, e-mail: r.m.c.ahn@kub.nl, h.c.bunt@kub.nl; R. J. Beun, Institute for Perception Research (IPO), P.O. Box 513, 5600 MB Eindhoven, The Netherlands, e-mail: rjbeun@prl.philips.nl; T. Borghuis and C. W. A. M. van Overveld, Eindhoven University of Technology, Den Dolech 2, Eindhoven, The Netherlands, e-mail: tijn@win.tue.nl, wsinkvo@info.win.tue.nl.     

Computational aspects of Worm-Like-Chain interpolation formulas

We show that the polynomial Worm-Like-Chain (WLC) interpolation formula introduced in [C. Bouchiat, M.D. Wang, J.-F. Allemand, T. Strick, S.M. Block, V. Croquette, Estimating the persistence length of a Worm-Like Chain molecule from force–extension measurements, Biophys. J. 76 (1) (1999) 409–413] in order to improve data fitting with respect to the WLC interpolation formula in [C. Bustamante, J.F. Marko, E.D. Siggia, S. Smith, Entropic elasticity of lambda-phage DNA, Science 265 (1994) 1599. Technical comment] is not unique. Ill-conditioning of the over-determined linear system associated with interpolation of synthetic data from [C. Bouchiat, M.D. Wang, J.-F. Allemand, T. Strick, S.M. Block, V. Croquette, Estimating the persistence length of a Worm-Like Chain molecule from force–extension measurements, Biophys. J. 76 (1) (1999) 409–413] is highlighted. Moreover, if the coefficients in the associated polynomial correction are considered as free parameters in the least squares fitting procedure for actual experimental data, then more than one solution with a low residual can be identified. For these reasons we propose modification of the interpolation formula in [C. Bustamante, J.F. Marko, E.D. Siggia, S. Smith, Entropic elasticity of lambda-phage DNA, Science 265 (1994) 1599. Technical comment] so that, for moderate extensions, quadratic contributions are included and no additional parameters are required. We show that relative errors for the fit of synthetically generated data are less than 2% and for actual data they are comparable with and sometimes better than those obtained by using polynomial WLC interpolation formulas.     

Approximating common fixed points of asymptotically nonexpansive maps in uniformly convex Banach spaces

We introduce three-step iterative schemes with errors for two and three nonexpansive maps and establish weak and strong convergence theorems for these schemes. Mann-type and Ishikawa-type convergence results are included in the analysis of these new iteration schemes. The results presented in this paper substantially improve and extend the results due to [S.H. Khan, H. Fukhar-ud-din, Weak and strong convergence of a scheme with errors for two nonexpansive mappings, Nonlinear Anal. 8 (2005) 1295–1301], [N. Shahzad, Approximating fixed points of non-self nonexpansive mappings in Banach spaces, Nonlinear Anal. 61 (2005) 1031–1039], [W. Takahashi, T. Tamura, Convergence theorems for a pair of nonexpansive mappings, J. Convex Anal. 5 (1995) 45–58], [K.K. Tan, H.K. Xu, Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process, J. Math. Anal. Appl. 178 (1993) 301–308] and [H.F. Senter, W.G. Dotson, Approximating fixed points of nonexpansive mappings, Proc. Amer. Math. Soc. 44 (1974) 375–380].     

3D-Bildverarbeitung und Computer-Graphik in der Medizin

Zusammenfassung Die klassischen medizinischen Abbildungsverfahren liefern nur zweidimensionale Ausschnitte aus einer dreidimensionalen Wirklichkeit. Mit Hilfe der digitalen Bildverarbeitung und der Computer-Graphik ist es jedoch möglich, medizinische Objekte aus räumlichen Bildfolgen zu rekonstruieren und wählbare Ansichten auf einem Bildschirm darzustellen. Zu diesem Zweck muß das Datenvolumen in die darzustellenden Objekte segmentiert und in eine für die Darstellung geeignete Datenstruktur übergeführt werden. Die Verfahren hierfür werden erläutert und mit Anwendungen aus der radiologischen Diagnostik, der Chirurgie, der Orthopädie und der Anatomie illustriert. Schließlich werden die Probleme der Implmentation für Routinezwecke diskutiert.Die Möglichkeit der intensiven Beschäftigung mit Methoden der 3D-Bildverarbeitung verdanke ich einem Aufenthalt beim IBM Palo Alto Scientific Center. Mein Dank gilt Dipl.-Inform. F. Böcker, Dipl.-Inform. U.Tiede, Dipl.-Ing. M.Riemer und Dipl.-Inform. M.Bomans sowie Prof. Dr. med. W.Höltje, Dr. med. G.Witte und Dr. med. M. Heller für wertvolle Anregungen zu dieser Arbeit. Die Original-Bildsequenz zu Abb.8 wurde freundlicherweise von der Firma Siemens, Unternehmensbereich Medizinische Technik, zur Verfügung gestellt. J. und N. Höhne danke ich für die Anfertigung der Zeichnungen.     

A Review of “Wild West 2.0: How to Protect and Restore Your Online Reputation on the Untamed Social Frontier”

Abstract

THE AFRICAN AMERICAN RESOURCE GUIDE TO THE INTERNET &; ONLINE SERVICES. Battle, Stafford L. and Rey O. Harris. McGraw-Hill, 1996. 217p. ISBN: 0–07–005499–1. $19.95.

THE ABCS OF THE INTERNET. Crumlish, Christian. SYBEX, 1996. 362p. ISBN: 0–7821–1887–9. $19.99.

THE UNIX DESK REFERENCE. Dyson, Peter. SYBEX, 1996. 523p. ISBN: 0–7821–1658–2. $29.99.

THE INTERNET ROADMAP. 3rd ed. Falk, Bennett. SYBEX, 1996. 320p. ISBN: 0–7821–1890–9. $16.99.     

New Multi-d.o.f. Haptic Device Using a Parallel Mechanism with a Wide Rotational Working Area

A parallel mechanism is a multi-legged kinematic structure with actuators fixed on the base. In recent years, parallel mechanisms have been implemented in haptic devices due to their benefits, such as high rigidity, high output force, high accuracy and high backdrivability. Multi-d.o.f. haptic devices with rotational motion have become increasingly important as haptic applications have become diversified (e.g., in surgical training). However, typical multi-d.o.f. parallel mechanisms (e.g., Stewart platform and HEXA) have limitations on the working area for rotational motions. A multi-d.o.f. haptic device can be designed by stacking the translational and rotational mechanisms by decoupling these motions. However, this dedoupling can have an adverse effect on inertia because of the weight of the stacking mechanism. Eventually, the operability of the device deteriorates. Therefore, a parallel mechanism with both a translational and rotational multi-d.o.f. structure can effectively apply the full advantages of a parallel mechanism to a multi-d.o.f. haptic device. In this paper, a 6-d.o.f. (five active: three translations, two rotations and one passive rotation) parallel mechanism, called the D-8, is presented. In the D-8, a new redundant parallel mechanism is introduced to overcome the problem of operability.     

Coordination by means of Synchronous and Asynchronous Communication in Concurrent Constraint Programming

Concurrent constraint programming has been thought as providing coordination of concurrent processes on the basis of the availability and sharing of information. It classically incorporates a form of asynchronous communication via a shared store. In previous work ([1,2]), we presented a new version of the ask and tell primitives which features asynchronicity and synchronicity, our approach being based on the idea of telling new information just in the case that a concurrently running process is asking for it. In this paper we focus on a semantic study of this new framework, called Sec.The authors thank K. Apt, M. Bonsangue, A. Brogi, J.W. de Bakker, F. de Boer, E. de Vinck, M. Gabbrielli, E. Horita, J. Kok, B. Le Charlier, U. Montanari, C. Palamidessi, J. Rutten, V. Saraswat, P.-Y. Schobbens, and P. Wegner for stimulating discussions on the semantics of concurrent languages.     

Micro Law: a guardedly cheerful note-for a change [computer programcopyright]

The past and current trends in court decisions concerning computer programs and their copyrights are reviewed. The court decisions discussed are Whelan Associates Inc. vs. Jaslow Dental Laboratory Inc.; CADAM vs. Adra; CADAM vs. Adage; Lotus Development Corp. vs. Paperback Software International; Computer Associates International Inc. vs. Altai Inc.; Brown Bag Software vs. Symantec Corp.; Sega Enterprises Ltd. vs. Accolade Inc.; and Atari Games Corp. vs. Nintendo of America Inc     

类别不平衡的多任务人脸属性识别

属性的识别对物体的识别起到了比较重要的作用,例如人脸验证和场景识别。提高属性的识别率对后面基于属性特征的应用的正确率有很大的影响。近些年来,有些工作也开始关注于属性的学习,而很多的工作都是基于属性之间独立的假设,但在实际中很多的属性都是强相关的,例如没有胡子和女性,光头和头发的颜色;很多的工作忽略了类别之间的不平衡性,例如光头的样本比例可能只占样本的很小一部分。基于这2个观察,本文提出一种基于多任务的类别不平衡的人脸属性识别网络架构,该网络结构是由Densenet修改而来。该方法比以往的方法效果要好,一定程度上缓解了不平衡问题,且参数少,计算效率更高,在公开人脸属性数据集CelebA和LFWA上的实验验证了该方法的有效性。