Refine
Year of publication
Document Type
- Article (391) (remove)
Has Fulltext
- yes (391)
Is part of the Bibliography
- no (391)
Keywords
- Heavy Ion Experiments (19)
- Hadron-Hadron scattering (experiments) (10)
- Hadron-Hadron Scattering (9)
- LHC (8)
- Heavy-ion collision (7)
- Quark-Gluon Plasma (4)
- ALICE (3)
- ALICE experiment (3)
- Collective Flow (3)
- Jets and Jet Substructure (3)
- Petri net (3)
- (surface) partial differential equations (2)
- BioCreative V.5 (2)
- BioNLP (2)
- Charm physics (2)
- Computer science (2)
- Electroencephalography (2)
- F.4.1 (2)
- Finite Volumes (2)
- Heavy Ions (2)
- Heavy Quark Production (2)
- Kinect (2)
- Kongress (2)
- Lepton-Nucleon Scattering (experiments) (2)
- Logic in computer science (2)
- Multimodal Learning Analytics (2)
- Named entity recognition (2)
- Particle Correlations and Fluctuations (2)
- Particle and resonance production (2)
- Pb–Pb collisions (2)
- QCD (2)
- Textanalyse ; Linguistische Datenverarbeitung; Computerlinguistik (2)
- amyloid precursor protein (2)
- computational virology (2)
- economics (2)
- hepatitis C virus (HCV) (2)
- hippocampus (2)
- massively parallel multigrid solvers (2)
- morphology (2)
- parameter estimation (2)
- population dynamics (2)
- pp collisions (2)
- presynaptic active zone (2)
- realistic geometries (2)
- septic shock (2)
- viral dynamics (2)
- 3D spatio-temporal resolved mathematical models (1)
- 3D spatiotemporal resolved mathematical models (1)
- 900 GeV (1)
- ALICE detector (1)
- ATPG (1)
- Active learning (1)
- Adaptive control (1)
- Adaptive process control (1)
- Agroecology (1)
- Alternate hydrophobicity (1)
- Amino acid pattern (1)
- Analog Circuits (1)
- Angiography (1)
- Anti-nuclei (1)
- Arabidopsis thaliana metabolism (1)
- Artificial neural networks (1)
- Atrial fibrillation classification (1)
- Attention mechanism (1)
- Automatic (1)
- Automatic prediction (1)
- BESIII (1)
- BFS (1)
- Beauty production (1)
- Behavioural ecology (1)
- Behavioural methods (1)
- Berufswahl (1)
- Beta-sheet (1)
- Big Data (1)
- BigBench (1)
- Biodiversity (1)
- Biomedical named entity recognition (1)
- Boosted Jets (1)
- Branching fractions (1)
- Breaking knapsack cryptosystems (1)
- C-reactive protein (1)
- CABG (1)
- CBM detector (1)
- CEMP (1)
- CHEMDNER (1)
- CRF (1)
- CT (1)
- CTL (1)
- Cell staining (1)
- Cellular neural network (1)
- Centrality Class (1)
- Centrality Selection (1)
- Clustering (1)
- Comparison with QCD (1)
- Complexity (1)
- Computational Humanities (1)
- Computational geometry (1)
- Computational models (1)
- Computational neuroscience (1)
- Computational science (1)
- Computer Science (1)
- Continual deep learning (1)
- Convolutional Neural Networks (1)
- Cuneiform (1)
- Deep learning (1)
- Deictic and iconic gestures (1)
- Developmental biology (1)
- Digital Humanities (1)
- Dirichlet bound (1)
- Dynamic Graph Algorithms (1)
- Dynamical systems (1)
- Effective Field Theories (1)
- Electron-pion identification (1)
- Electroweak interaction (1)
- Elliptic flow (1)
- Energy-efficiency (1)
- Equation of State (1)
- Event-related potential (1)
- Experimental Methods (1)
- External Memory (1)
- F.1.3 (1)
- Feasibility (1)
- Femtoscopy (1)
- Fibre/foam sandwich radiator (1)
- Fourier-Motzkin algorithm (1)
- GPRO (1)
- GPU algorithms (1)
- Gene expression (1)
- Generalized procrustes analysis (1)
- Geodesics (1)
- Gestural writing (1)
- Graph theory (1)
- H.2.3 (1)
- HBT (1)
- Hadron production (1)
- Hadron-Hadron Scattering Heavy (1)
- Hadronic decays (1)
- Hard Scattering (1)
- Heavy Ion Experiment (1)
- Heavy flavor production (1)
- Heavy flavour production (1)
- Heavy ions (1)
- Heavy-flavour decay muons (1)
- Heavy-ion collisions (1)
- Hematoxylin staining (1)
- Higher education (1)
- Histology (1)
- Hive (1)
- Hodgkin lymphoma (1)
- Hydrophobicity scale (1)
- Hypertext (1)
- I/O Model (1)
- Iconography (1)
- Image processing (1)
- Image schemata (1)
- In-TIPS thrombosis (1)
- Inclusive spectra (1)
- Inflammation (1)
- Informatik (1)
- Intensity interferometry (1)
- Intensivpatient (1)
- Invariant Mass Distribution (1)
- Ionisation energy loss (1)
- Jet Physics (1)
- Jet Substructure (1)
- Jets (1)
- Kinetic hypertext authoring (1)
- Klebsiella pneumoniae (1)
- Knapsack problem (1)
- Kohonen map (1)
- Kohonen mapping (1)
- Kolmogorov complexity (1)
- Kompetenz (1)
- Kryptosystem (1)
- LSTM (1)
- LTP (1)
- Lateral inhibited network (1)
- Lattice QCD (1)
- Lattice Quantum Field Theory (1)
- Lattice basis reduction (1)
- Learner goals (1)
- Learning analytics dashboard (1)
- Lifelong machine learning (1)
- Line reconstruction (1)
- Local field potential (1)
- Lymph nodes (1)
- Lymphocytes (1)
- Machine learning (1)
- Manatee invariant (1)
- MapReduce (1)
- Mathematical model (1)
- Microarray (1)
- Mid-rapidity (1)
- Minimum Bias (1)
- Mitochondria (1)
- Model Checking (1)
- Monte Carlo (1)
- Multi-Parton Interactions (1)
- Multi-strange baryons (1)
- Multi-wire proportional drift chamber (1)
- Multiset independent component analysis (1)
- Museum information system (1)
- NF-κB pathway (1)
- NP-complete problems (1)
- NP-hardness (1)
- Natural Language Processing (1)
- Network models (1)
- Neural encoding models (1)
- Neural network (1)
- Neural networks (1)
- Neurofuzzy medical systems (1)
- Neuronales Netzwerk (1)
- Noisy point clouds (1)
- Nuclear Physics (1)
- Nuclear modification factor (1)
- Numismatics (1)
- ORC (1)
- Object vision (1)
- Online self-assessment (1)
- Online-Publikation (1)
- Online-Self-Assessment (1)
- Ontologies (1)
- Ontology (1)
- Open set recognition (1)
- Open world learning (1)
- Open-access data resource (1)
- PDE (1)
- PDEs (1)
- PYTHIA (1)
- Parameter estimation (1)
- Parquet (1)
- Particle and Resonance Production (1)
- Particle correlations and fluctuations (1)
- Pathologists (1)
- Pb–Pb (1)
- Phase Diagram of QCD (1)
- Phase-reset (1)
- Phosphate (1)
- PointNet (1)
- Positive fluid balance (1)
- Postoperative atrial fibrillation (1)
- Preßburg <2003> (1)
- Principal component analysis (1)
- Production Cross Section (1)
- Prognose (1)
- Prognostische Validität (1)
- Properties of Hadrons (1)
- Proteins (1)
- Proton–proton (1)
- Psychometrische Güte (1)
- Q-modularity (1)
- Quantitative Imaging (1)
- Quark Deconfinement (1)
- Quark Gluon Plasma (1)
- Quark Production (1)
- Quark gluon plasma (1)
- Quarkonium (1)
- RBF-nets (1)
- RDF (1)
- Randomization (1)
- Rapidity Range (1)
- Relativistic heavy ion physics (1)
- Resolution Parameter (1)
- Resonances (1)
- Rubber extrusion (1)
- SMASH (1)
- SPARQL (1)
- SQL-on-Hadoop (1)
- Saward (1)
- Self-Assessment (1)
- Self-organized eigenvector jets (1)
- Self-regulated learning (1)
- Sense-making (1)
- Sequence analysis (1)
- Shortest lattice vector problem (1)
- Signaling pathway (1)
- Single electrons (1)
- Single muons (1)
- Social behaviour (1)
- SparkSQL (1)
- Specialized Information Service (1)
- Statistical classification (1)
- Student-facing learning analytics (1)
- Studienberatung (1)
- Studienleistungen (1)
- Studienwahl (1)
- Subset sum problem (1)
- Sumerian (1)
- Systematic Uncertainty (1)
- TIPS (1)
- TR (1)
- Technology-Enhanced Learning (1)
- Text mining (1)
- Theoretische Informatik (1)
- Time Constraints (1)
- Time Projection Chamber (1)
- Tracking (1)
- Transform coding (1)
- Transition invariant (1)
- Transition radiation detector (1)
- Transjugular Intrahepatic Portosystemic Shunt (1)
- Translation (1)
- Transmembrane helix (1)
- Transmembrane sheets (1)
- Transverse momentum (1)
- Trigger (1)
- Valve surgery (1)
- Vector Boson Production (1)
- Visual object recognition (1)
- Xenon-based gas mixture (1)
- Z-inspection (1)
- acute infection (1)
- adaption (1)
- agent-based modeling (1)
- aging (1)
- alignment in communication structural coupling (1)
- anaplastic large cell lymphoma (1)
- approximation networks (1)
- artificial intelligence (1)
- big data (1)
- big data benchmarking (1)
- biochemical pathways (1)
- boutons (1)
- built-in self-test (1)
- calcium dynamics (1)
- cancer (1)
- cell motility (1)
- cellular neural nets (1)
- centrality (1)
- chemokine receptors (1)
- chosen ciphertext attack (1)
- chronic infection (1)
- classical Hodgkin lymphoma (1)
- clinical presentation (1)
- clique problem (1)
- codon usage preferences (1)
- colorabdity (1)
- columnar file formats (1)
- common transition pairs (1)
- community (1)
- competence (1)
- complementary information (1)
- compression (1)
- computer vision (1)
- continued fraction algorithm (1)
- corpus study (1)
- coupled differential equations (1)
- coupon collector problem (1)
- course achievement (1)
- critically ill patients (1)
- dE/dx (1)
- dancing (1)
- data orthonormalization network (1)
- data structures (1)
- deep learning (1)
- detailed modeling (1)
- differential equations (1)
- digital pathology (1)
- dissemination (1)
- e-Entropy (1)
- eHumanities (1)
- early warning signs (1)
- electrical stimulation (1)
- elementary mode (1)
- emergence (1)
- epistemic network analysis (1)
- ethical co-design (1)
- ethics (1)
- evolutionary associative learning (1)
- eye-tracking (1)
- feedforward network layers (1)
- finite model theory (1)
- firing pattern (1)
- first-order logic (1)
- floating point arithmetic (1)
- functional module (1)
- gene expression (1)
- generic algorithm (1)
- generic group model (1)
- genetic algorithm (1)
- genotype–phenotype (1)
- graph algorithms (1)
- graph isomorphism (1)
- graph understanding (1)
- hashing (1)
- hawkes processes (1)
- healthcare (1)
- heavy ion collisions (1)
- heavy ion experiments (1)
- higher education (1)
- human lymph node (1)
- human viruses (1)
- hybrid (1)
- image analysis (1)
- image encoding (1)
- immune system (1)
- impact parameter (1)
- information conservation (1)
- information decomposition (1)
- information distribution (1)
- information landscape (1)
- integer relation (1)
- intertextual similarity (1)
- intratextual similarity (1)
- invariant transition pairs (1)
- kinetic fingerprint (1)
- knapsack cryptosystems (1)
- knowledge graphs (1)
- lattice basis reduction (1)
- lattices (1)
- linguistic linked open data (1)
- linguistic networks graph distance measures (1)
- linguistic relativity (1)
- linked open data (1)
- logic synthesis (1)
- logical networks (1)
- low-resource languages (1)
- malignant melanoma (1)
- matching (1)
- mathematical modeling (1)
- mathematical models of viral RNA cycle (1)
- matroids, online algorithm (1)
- maximal common transition set (1)
- maximal information gain (1)
- meson (1)
- metabolic networks (1)
- minimal cut set (1)
- minimum description length (1)
- mitochondria (1)
- model parameter adaption (1)
- model verification (1)
- modeling and simulation (1)
- models of computation (1)
- morphological filtering (1)
- multiple correspondence analysis (1)
- multiple texts (1)
- mutation (1)
- mutual information (1)
- mutual information of graphs (1)
- network model (1)
- network reduction (1)
- network similarity measurement (1)
- neural network (1)
- neuromuscular junction (1)
- neuron (1)
- neuronal network (1)
- newspaper (1)
- noise suppression (1)
- nondetermmistlc Turing machines (1)
- ntracellular signaling (1)
- one-more decryption attack (1)
- optimization (1)
- overfitting (1)
- packing problem (1)
- parallel (1)
- parliamentary debate (1)
- parsing (1)
- phage (1)
- phage therapy (1)
- predictive validity (1)
- psychometric properties (1)
- public speaking (1)
- quark gluon plasma (1)
- quicksort (1)
- random oracle model (1)
- rate-distortion theory (1)
- reception (1)
- redundancy (1)
- redundant information (1)
- representation (1)
- representative claims (1)
- resistance (1)
- restricted Hebbian learning (1)
- rosetting T cells (1)
- salsa (1)
- satlsfiablhty (1)
- secretary problem (1)
- segmentation (1)
- sensor-based learning support (1)
- shock filter (1)
- signed ElGamal encryption (1)
- simultaneous diophantine approximations (1)
- social media (1)
- sorting (1)
- specialized vocabulary (1)
- spectra (1)
- structure-function relationships (1)
- subset sum problems (1)
- succinct data structures (1)
- succinctness (1)
- synapse (1)
- synergistic interaction (1)
- synergy (1)
- syntax (1)
- systems biology (1)
- t-cluster (1)
- t-invariant (1)
- testability (1)
- text search (1)
- textbooks (1)
- three-level topic model (1)
- threshold concepts (1)
- trajectories (1)
- transition invariant (1)
- translational selection (1)
- trustworthy AI (1)
- trustworthy AI Co-design (1)
- unique information (1)
- volatility clustering (1)
- warts (1)
- weight resolutions (1)
- whitening filter (1)
- whole slide image (1)
- wikipedia (1)
- within-host viral modeling (1)
- within-host viral modelling (1)
- women’s quota (1)
- √sN N = 2.76 TeV (1)
Institute
- Informatik (391) (remove)
Considered are the classes QL (quasilinear) and NQL (nondet quasllmear) of all those problems that can be solved by deterministic (nondetermlnlsttc, respectively) Turmg machines in time O(n(log n) ~) for some k Effloent algorithms have time bounds of th~s type, it is argued. Many of the "exhausUve search" type problems such as satlsflablhty and colorabdlty are complete in NQL with respect to reductions that take O(n(log n) k) steps This lmphes that QL = NQL iff satisfiabdlty is m QL CR CATEGORIES: 5.25
We present a hierarchy of polynomial time lattice basis reduction algorithms that stretch from Lenstra, Lenstra, Lovász reduction to Korkine–Zolotareff reduction. Let λ(L) be the length of a shortest nonzero element of a lattice L. We present an algorithm which for k∈N finds a nonzero lattice vector b so that |b|2⩽(6k2)nkλ(L)2. This algorithm uses O(n2(kk+o(k))+n2)log B) arithmetic operations on O(n log B)-bit integers. This holds provided that the given basis vectors b1,…,bn∈Zn are integral and have the length bound B. This algorithm successively applies Korkine–Zolotareff reduction to blocks of length k of the lattice basis. We also improve Kannan's algorithm for Korkine-Zolotareff reduction.
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on basis reduction algorithms to find short nonzero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum problems of density < 0.6463 . . . in polynomial time if it could invoke a polynomial-time algorithm for finding the shortest non-zero vector in a lattice. This paper presents two modifications of that algorithm, either one of which would solve almost all problems of density < 0.9408 . . . if it could find shortest non-zero vectors in lattices. These modifications also yield dramatic improvements in practice when they are combined with known lattice basis reduction algorithms.
It is well known that artificial neural nets can be used as approximators of any continuous functions to any desired degree and therefore be used e.g. in high - speed, real-time process control. Nevertheless, for a given application and a given network architecture the non-trivial task remains to determine the necessary number of neurons and the necessary accuracy (number of bits) per weight for a satisfactory operation which are critical issues in VLSI and computer implementations of nontrivial tasks. In this paper the accuracy of the weights and the number of neurons are seen as general system parameters which determine the maximal approximation error by the absolute amount and the relative distribution of information contained in the network. We define as the error-bounded network descriptional complexity the minimal number of bits for a class of approximation networks which show a certain approximation error and achieve the conditions for this goal by the new principle of optimal information distribution. For two examples, a simple linear approximation of a non-linear, quadratic function and a non-linear approximation of the inverse kinematic transformation used in robot manipulator control, the principle of optimal information distribution gives the the optimal number of neurons and the resolutions of the variables, i.e. the minimal amount of storage for the neural net. Keywords: Kolmogorov complexity, e-Entropy, rate-distortion theory, approximation networks, information distribution, weight resolutions, Kohonen mapping, robot control.
Let b1, . . . , bm 2 IRn be an arbitrary basis of lattice L that is a block Korkin Zolotarev basis with block size ¯ and let ¸i(L) denote the successive minima of lattice L. We prove that for i = 1, . . . ,m 4 i + 3 ° 2 i 1 ¯ 1 ¯ · kbik2/¸i(L)2 · ° 2m i ¯ 1 ¯ i + 3 4 where °¯ is the Hermite constant. For ¯ = 3 we establish the optimal upper bound kb1k2/¸1(L)2 · µ3 2¶m 1 2 1 and we present block Korkin Zolotarev lattice bases for which this bound is tight. We improve the Nearest Plane Algorithm of Babai (1986) using block Korkin Zolotarev bases. Given a block Korkin Zolotarev basis b1, . . . , bm with block size ¯ and x 2 L(b1, . . . , bm) a lattice point v can be found in time ¯O(¯) satisfying kx vk2 · m° 2m ¯ 1 ¯ minu2L kx uk2.
Parallel FFT-hashing
(1994)
We propose two families of scalable hash functions for collision resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT hash functions iterate a compression function. For the faster FFT hash functions all rounds are alike with the same number of message words entering each round.
We present a framework for the self-organized formation of high level learning by a statistical preprocessing of features. The paper focuses first on the formation of the features in the context of layers of feature processing units as a kind of resource-restricted associative multiresolution learning We clame that such an architecture must reach maturity by basic statistical proportions, optimizing the information processing capabilities of each layer. The final symbolic output is learned by pure association of features of different levels and kind of sensorial input. Finally, we also show that common error-correction learning for motor skills can be accomplished also by non-specific associative learning. Keywords: feedforward network layers, maximal information gain, restricted Hebbian learning, cellular neural nets, evolutionary associative learning
After a short introduction into traditional image transform coding, multirate systems and multiscale signal coding the paper focuses on the subject of image encoding by a neural network. Taking also noise into account a network model is proposed which not only learns the optimal localized basis functions for the transform but also learns to implement a whitening filter by multi-resolution encoding. A simulation showing the multi-resolution capabilitys concludes the contribution.