Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Applied issues in investigative interviewing, eyewitness memory, and credibility assessment / / Barry S. Cooper, Dorothee Griesel, Marguerite Ternes, editors
| Applied issues in investigative interviewing, eyewitness memory, and credibility assessment / / Barry S. Cooper, Dorothee Griesel, Marguerite Ternes, editors |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, : Springer, c2013 |
| Descrizione fisica | 1 online resource (359 p.) |
| Disciplina | 347.066019 |
| Altri autori (Persone) |
CooperBarry S
GrieselDorothee TernestMarguerite |
| Soggetto topico |
Investigative reporting
Eyewitness identification |
| ISBN |
1461455462
1-299-33704-X 1-4614-5547-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The challenge for forensic memory research: Methodolotry -- Credibility assessment, common law trials, and fuzzy logic -- The investigation and investigative interviewing of benefit fraud suspects in the UK: Historical and contemporary perspectives -- The sins of interviewing: Errors made by investigative interviewers and suggestions for redress -- Biopsychosocial perspectives on memory variability in eyewitnesses -- Children’s memory in “scientific case studies” of child sexual abuse: A review -- Does testimonial inconsistency indicate memory inaccuracy and deception? Beliefs, empirical research, and theory -- Repeated interviews about repeated trauma from the distant past: A study of report consistency -- Discovering deceit: Applying laboratory and field research in the search for truthful and deceptive behaviour -- Is le mot juste? The contexualization of words by expert lie detectors -- Assessment criteria indicative of deception (ACID): An example of the new paradigm of differential recall enhancement -- The ABC’s of CBCA: Verbal credibility assessment in practice -- An “eye” for an “I”: The challenges and opportunities for spotting credibility in a digital world. |
| Record Nr. | UNINA-9910437968203321 |
| New York, : Springer, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe
| How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVIII, 756 p. 42 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
| ISBN | 3-642-30870-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465321303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
New Computational Paradigms [[electronic resource] ] : First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe
| New Computational Paradigms [[electronic resource] ] : First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVIII, 578 p.) |
| Disciplina | 511.3/52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It -- Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees -- The Fan Theorem and Uniform Continuity -- Continuous Semantics for Strong Normalization -- A Thread Algebra with Multi-level Strategic Interleaving -- Membrane Computing — Current Results and Future Problems -- How to Compare the Power of Computational Models -- Recombinant DNA ,Gene Splicing as Generative Devices of Formal Languages -- Quantum Computing -- Symbol Grounding in Connectionist and Adaptive Agent Models -- The Complexity of Inductive Definability -- A Logical Approach to Abstract Algebra -- Schnorr Dimension -- Abstract Geometrical Computation: Turing-Computing Ability and Undecidability -- Computability in Computational Geometry -- Shrad: A Language for Sequential Real Number Computation -- Borel Ranks and Wadge Degrees of Context Free ?-Languages -- Fewer Epistemological Challenges for Connectionism -- An Algebraic View on Exact Learning from Queries -- The Church-Turing Thesis: Breaking the Myth -- Robust Simulations of Turing Machines with Analytic Maps and Flows -- Infinitary Computability with Infinite Time Turing Machines -- Combinatorial Models of Gene Assembly -- Symmetric Enumeration Reducibility -- Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory -- Finite Trees as Ordinals -- On the Problems of Definability in the Enumeration Degrees -- Computing a Model of Set Theory -- Proof Mining in Functional Analysis -- Towards Computability of Higher Type Continuous Data -- The Power of Mobility: Four Membranes Suffice -- The Small Grzegorczyk Classes and the Typed ?-Calculus -- The Flow of Data and the Complexity of Algorithms -- On a Question of Sacks — A Partial Solution on the Positive Side -- The Low Splitting Theorem in the Difference Hierarchy -- Geometric Software: Robustness Issues and Model of Computation -- The Dimension of a Point: Computability Meets Fractal Geometry -- Accepting Networks of Splicing Processors -- Hilbert’s Tenth Problem and Paradigms of Computation -- On Some Relations Between Approximation Problems and PCPs over the Real Numbers -- Correlation Dimension and the Quality of Forecasts Given by a Neural Network -- The Computational Complexity of One-Dimensional Sandpiles -- Categoricity in Restricted Classes -- Recursion and Complexity -- FM-Representability and Beyond -- Formalising Exact Arithmetic in Type Theory -- Complexity in Predicative Arithmetic -- Domain-Theoretic Formulation of Linear Boundary Value Problems -- Membrane Computing: Power, Efficiency, Applications -- The Analogue of Büchi’s Problem for Polynomials -- On the Turing Degrees of Divergence Bounded Computable Reals -- New Algorithmic Paradigms in Exponential Time Algorithms -- Some Reducibilities on Regular Sets -- Computability and Discrete Dynamical Systems -- Uniform Operators -- Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures -- Presentations of K-Trivial Reals and Kolmogorov Complexity -- Presentations of Structures in Admissible Sets -- An Environment Aware P-System Model of Quorum Sensing -- Kripke Models, Distributive Lattices, and Medvedev Degrees -- Arthur-Merlin Games and the Problem of Isomorphism Testing -- Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality -- A Network Model of Analogue Computation over Metric Algebras -- Computable Analysis -- The Transfinite Action of 1 Tape Turing Machines -- Complexity of Continuous Space Machine Operations -- Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation -- Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. |
| Record Nr. | UNISA-996466072303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 622 p. 91 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-642-29952-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465776103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings / / edited by Jianer Chen, Barry S. Cooper
| Theory and Applications of Models of Computation [[electronic resource] ] : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings / / edited by Jianer Chen, Barry S. Cooper |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIV, 482 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Machine theory Discrete mathematics Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science |
| ISBN | 3-642-02017-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Talks -- Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks -- Constraints, Graphs, Algebra, Logic, and Complexity -- Distributed Systems and Their Environments -- Invited Special Session: Models of Computation -- Co-evolution and Information Signals in Biological Sequences -- The Extended Turing Model as Contextual Tool -- Strong Positive Reducibilities -- Invited Special Session: Algorithms and Complexity -- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering -- On Spanners of Geometric Graphs -- Searching Trees: An Essay -- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems -- Contributed Papers -- A Quadratic Kernel for 3-Set Packing -- Quantitative Aspects of Speed-Up and Gap Phenomena -- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG -- On the Connection between Interval Size Functions and Path Counting -- On the Red/Blue Spanning Tree Problem -- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata -- A Computational Proof of Complexity of Some Restricted Counting Problems -- Block-Graph Width -- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs -- On Parameterized Exponential Time Complexity -- Best-Order Streaming Model -- Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces -- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data -- Improved Deterministic Algorithms for Weighted Matching and Packing Problems -- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover -- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability -- A Complete Characterisation of the Linear Clique-Width of Path Powers -- Preserving Privacy versus Data Retention -- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity -- An Almost Totally Universal Tile Set -- Linear Kernel for Planar Connected Dominating Set -- A Simple Greedy Algorithm for the k-Disjoint Flow Problem -- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions -- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code -- Terminal Coalgebras for Measure-Polynomial Functors -- High Minimal Pairs in the Enumeration Degrees -- Searching a Circular Corridor with Two Flashlights -- On the Complexity of the Multiple Stack TSP, kSTSP -- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments -- An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues -- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem -- On the Tractability of Maximal Strip Recovery -- Greedy Local Search and Vertex Cover in Sparse Random Graphs -- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms -- Feasibility of Motion Planning on Directed Graphs -- Polynomial-Time Algorithm for Sorting by Generalized Translocations -- The Two-Guard Polygon Walk Problem -- Approximation and Hardness Results for Label Cut and Related Problems -- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge. |
| Record Nr. | UNISA-996466248303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVI, 800 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
| ISBN | 3-540-34022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant’s Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of Critical Function for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel’s T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?. |
| Record Nr. | UNISA-996465935403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||