julilili42/papers huggingface dataset:
A rigorous analysis of Linsker's Hebbian learning network
2002-12-17

We propose a novel approach for a rigorous analysis of the nonlinear asymmetric dynamics of Linsker's (1986) unsupervised Hebbian learning network. The results provide for the first time comprehensive explanations of the origin of the various structured connection patterns and of the roles of the different system parameters of the model. Our theoretical predictions are corroborated by numerical simulations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
An application of disjunctive logic programming with incomplete information
2002-12-17

Despite their different perspectives, probabilistic reasoning and disjunctive logic programming strive for similar goals. Both address the problem of representing incomplete information and providing conclusions under reasonable assumptions such as independencies or closed world assumptions. This paper investigates the evaluation of independence assumptions which can be characterized by graphs (MARKOV and BAYESIAN networks). The underlying independence axioms are well-known/spl minus/they correspond to a set of disjunctive clauses. Based on a compact representation of disjunctive clauses, called clause trees, we provide an efficient /spl Delta/-iteration technique with subsumption, which allows us to compute the least fixpoint of the program or alternatively the verification of particular independences. Experimental results revealed that our approach is much more efficient than the conventional evaluation techniques.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
Coprocessors for special neural networks: KOKOS and KOBOLD
2002-12-17

In this paper we present a system for accelerating special kinds of neural networks. It is a hardware supported system consisting of different parts. A special-purpose neural coprocessor is connected to a personal computer (PC) by a special, asynchronous interface. Two different neural coprocessors are available, KOKOS, a coprocessor for Kohonen's selforganizing map, and KOBOLD, accelerating backpropagation with online learning.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
Selective intracellular retention of virally induced NKG2D ligands by the human cytomegalovirus UL16 glycoprotein
2002-12-20

Abstract Human cytomegalovirus (HCMV) has evolved a multitude of molecular mechanisms to evade the antiviral immune defense of the host. Recently, using soluble recombinant molecules, the HCMV UL16 glycoprotein was shown to interact with some ligands of the activating immunoreceptor NKG2D and, therefore, may also function as a viral immunomodulator. However, the role of UL16 during the course of HCMV infection remained unclear. Here, we demonstrate that HCMV infection of fibroblasts induces expression of all known NKG2D ligands (NKG2DL). However, solely MICA and ULBP3 reach the cellular surface to engage NKG2D, whereas MICB, ULBP1 and ULBP2 are selectively retained in the endoplasmic reticulum by UL16. UL16‐mediated reduction of NKG2DL cell surface density diminished NK cytotoxicity. Thus, UL16 functions by capturing activating ligands for cytotoxic lymphocytes that are synthesized in response to HCMV infection.
MprF-Mediated Lysinylation of Phospholipids in Staphylococcus aureus Leads to Protection against Oxygen-Independent Neutrophil Killing
2002-12-20

ABSTRACT Staphylococcus aureus achieves resistance to defensins and similar cationic antimicrobial peptides (CAMPs) by modifying anionic membrane lipids via MprF with l -lysine, which leads to repulsion of these host defense molecules. S. aureus Δ mprF , which lacks the modification, was very efficiently killed by neutrophil defensins and CAMP-producing leukocytes, even when oxygen-dependent killing was disrupted, but was as susceptible as wild-type bacteria to inactivation by myeloperoxidase or human monocytes lacking defensins. These results demonstrate the impact and specificity of MprF-mediated CAMP resistance and underscore the role of defensin-like peptides in innate host defense.
Mesh reduction with error control
2002-12-23

In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate such objects. Algorithms that measure the deviation between the approximated object and the original object are only available for special cases. We use the Hausdorff distance between the original and the simplified mesh as a geometrically meaningful error value which can be applied to arbitrary triangle meshes. We present a new algorithm to reduce the number of triangles of a mesh without exceeding a user defined Hausdorff distance between the original and simplified mesh. As this distance is parameterization independent, its use as error measure is superior to the use of the L/sup /spl infin//-Norm between parameterized surfaces. Furthermore the Hausdorff distance is always less than the distance induced by the L/sup /spl infin//-Norm. This results in higher reduction rates. Excellent results were achieved by the new decimation algorithm for triangle meshes that has been used in different application areas such as volume rendering, terrain modeling and the approximations of parameterized surfaces. The key advantages of the new algorithm are: it guarantees a user defined position dependent approximation error; it allows one to generate a hierarchical geometric representation in a canonical way; it automatically preserves sharp edges.
A methodology for rapid analysis and optimization of embedded systems
2002-12-23

The paper describes an environment for the rapid analysis, synthesis and optimization of embedded systems. Since the implementation of these systems is rather complicated, we propose a methodology which automates the entire design flow. Flexibility is achieved by allowing manual intervention which is realized via a modular implementation of algorithms which are being provided. The applicability of the proposed approach is shown in terms of an example (UNIX command grep).
Varying cooperation in SOM for improved function approximation
2002-12-23

This paper presents a data-driven principle for the adaptation of the neighbourhood range in self-organizing maps (SOM). The objective is a reduction of the approximation error in a counterpropagation-like architecture. Therefore the neighbourhood cooperation range of neurons in different regions of the training data space is adapted. In this framework a neuron specific approximation error serves as a criterion. Different examples show the influence of this modification onto the training of the map and on the function approximation quality of the output layer. This principle may also be used for other methods such as the interpolated self-organizing map, the local linear maps and as input quantizer for the radial basis function nets.
A hardware supported system for a special online application of self-organizing map
2002-12-23

In this paper we present a hardware supported system which enables the parallel computing of Euclidean distance with Kohonen's self-organizing map (SOM) for a special online application. The hardware is implemented as neural coprocessors connected to a Sun workstation via a parallel interface. For the aim of the computing time requirement, a four step pipeline and parallelism are used. The algorithmic description of the hardware and a simulation environment have been written in VHDL. Field programmable gate arrays are used to implement these neural coprocessors. The system can be used in various applications of neural networks.
Speed-up estimation for HW/SW-systems
2002-12-23

HW/SW-codesign has been applied to a wide range of applications. Several partitioning methods have been suggested. Thus the designer selects modules for HW or SW-implementation for the best possible performance within a set of performance and design constraints. This paper describes an estimation method to approximate a priori the entire system performance. The estimation method has been integrated into the codesign tool COD and first results could be generated. The estimated speed-up has been determined for a ciphering algorithm and has been compared to the speed-up of the entire HW/SW-system. The estimation speed-up matches the final speedup.
Verification of the Sparrow processor
2002-12-23

We present a new gate-level hardware verification method based on term rewriting systems. As an application, we formally verify the Sparrow microprocessor with the term rewriting theorem prover ReDuX. Our designs are given as net-lists in BLIF format. We mechanically compile the net-lists into the formal axiomatization of Sparrow as a term rewriting system. ReDuX can then emulate Sparrow symbolically. We manually produce verification conditions from the user-level processor specification and verify each one of them. Our axiomatization corresponds directly to net-lists, and thus is intuitive and close to the hardware. Except for simple equations no higher concept of logic is involved.
Breakpoints and breakpoint detection in source level emulation
2002-12-23

In this paper we discuss, what breakpoints in source level emulation are, how we can work with them and how we have to change in the circuit generated by high level synthesis to do so. We show the details of breakpoint encoding and detection in our approach. The presented approach allows for breakpoint detection by hardware means without seriously slowing down the circuit or dramatically increasing its size.
Error detection in fault secure controllers using state encoding
2002-12-23

In applications where safety is of utmost importance, defective functions must frequently be detected very early in order to restore the system to a safe operating condition. At the same time the availability may not be restricted by measures implemented to detect errors. The efficiency of error detection state encodings for a control unit is investigated based on the example of the Motorola microprocessor core M68HC11. The terms "dependent encoding" and "independent encoding" are introduced. The designed circuits are compared with regard to error detection of stuck-at errors and chip area. The degree of error detection is shown with the help of a fault simulation.
Automatic generation of interprocess communication in the PARAGON system
2002-12-23

PARAGON provides a platform for hardware-software partitioning for systems specified in the C++ language. In this paper, we are going to introduce PARAGON emphasizing how the synchronization and communication among the used processors are built during and after the partitioning. The partitioned specification consists of multiprocessors communicating with abstract methods. It is a C++ specification with the processors encapsulated in processor classes. Built-in communication is modelled by predefined communication class objects. It can be compiled directly and thus makes it easy to execute a simulation. Finally, it is well-suited in further processing by standard processors and hardware synthesis systems.
Studies on contact activation after heparin application on patients undergoing end-prosthetic hip implantation and hip replacement
2002-12-23

Within the context of the present study an investigation on the physiology of clotting was conducted in three groups each consisting of 12 patients, who had to undergo a total end-prosthetic hip implantation (TEPH) for the first time. For all three patient groups an activation of both systems was to be observed with the TEPH-implantation, but there were no statistically striking differences between the three groups. Thus in the case of the kallikrein-like activity an intraoperative rise of over 37% was registered, while at the same point in time there was only a 4% reduction in the prekallikrein activity. Postoperatively a 10% rise in the prekallikrein activity was observed.
Influence of heparin, heparin plus aprotinin and hirudin on contact activation in a cardiopulmonary bypass model
2002-12-23

In the present study the authors used an in vitro cardiopulmonary bypass model to compare activation of the FXII-plasma kallikrein systems, coagulation pathway and blood cell changes, with heparin (3 U/ml), heparin plus aprotinin (3 U/ml and 250 KIU/ml) and recombinant hirudin (6 /spl mu/g/ml). After 90 minutes circulation the results showed that with heparin plus aprotinin and with hirudin the activation of these cascade reactions was markedly lower. In particular kallikrein-like activities and PMN-Elastase-/spl alpha//sub 1/-PI levels were significantly lower in the latter two groups. The least activation was detected with hirudin. The authors' results confirm that the contact systems of blood are activated during CPB with heparin as anticoagulant that aprotinin reduces this activation and that recombinant hirudin would be preferred to heparin as an anticoagulant in cardiac surgery.
Effect of aprotinin on blood loss and myocardial damage in patients undergoing aortocoronary bypass surgery
2002-12-23

High dose aprotinin therapy showed certain benefits in protecting against perioperative myocardial ischemic injury during aortic cross clamping time in patients undergoing cardiopulmonary bypass surgery. Compared with the control group significantly lower levels of the highly specific marker of cardiac injury, troponin T, could be detected.
Library based technology mapping using multiple domain representations
2002-12-23

The use of signatures as efficient filters in Boolean matching is a crucial step in technology mapping and/or formal verification. In this work we combine well known representations of Boolean functions, the binary decision diagrams with those in the spectral domain, the functional decision diagrams and the equivalence decision diagrams. We obtain signatures of Boolean functions and their variables, which are easy to compute but can reduce the problem of aliases though.
Ciliary neurotrophic factor overexpression in neural progenitor cells (ST14A) increases proliferation, metabolic activity, and resistance to stress during differentiation
2002-12-24

Abstract An Erratum has been published for this article in Journal of Neuroscience Research 75: 861, 2004 . Neurotrophic factors exert considerable neuroprotective and neurorestorative effects in neurodegenerative diseases. Because neuronal progenitor cells have, at least in part, the potency to restore degenerated neuronal networks, transgenic high‐dosage expression of neurotrophins by these cells in neurotransplantation may be advantageous. In the present study, a retroviral vector containing the gene of rat ciliary neurotrophic factor (rCNTF) was permanently transfected into a striatal neuronal progenitor cell line. Qualitative and quantitative analyses demonstrated a sustained expression of the transgene; i.e., rCNTF was present at the mRNA level and protein level. Moreover, cocultivation in separate chambers of transgenic CNTF‐ST14A cells and CNTF‐dependent TF1 cells exerted typical biological effects, such as increased proliferation and differentiation of the TF1 cells, indicating the functional integrity of the secreted recombinant neurotrophin. The CNTF‐ST14A cells displayed improved stress response compared with native ST14A cells under differentiation conditions, i.e., at the nonpermissive temperature of 39°C and after staurosporine exposure, respectively. This effect coincided with a relatively reduced apoptosis rate and a raised metabolic activity of CNTF‐ST14A cells at 39°C. Neurotransplantation of CNTF‐ST14A cells in the rat quinolinic acid model of Huntington's disease showed a significant and sustained decline in pathological apomorphine‐induced rotations compared with parental ST14A cells. We conclude that sustained functional transgene CNTF production improves stress response as well as metabolic activity, making CNTF‐ST14A cells a promising tool for neurotransplantation in the quinolinic acid model of Huntington's disease. © 2002 Wiley‐Liss, Inc.
Regularized SOM-training: a solution to the topology-approximation dilemma?
2002-12-24

The self-organizing map (SOM) is a tool which combines the task of vector quantisation with a topologically ordered representation of the training vectors. The topological order is obtained by an adaptation of the winner and its neighbours towards the input vector and leads to several effects, which reduce the approximation quality. Topology and approximation seem to be contradictory. This is linked to the training properties and not to the data set. It may be reduced by a modification of the training towards a better regularity of the generated map. This new principle is proposed in this paper and may replace the neighbourhood adaptation in the final phase of the training. This paper presents examples of the standard SOM-training and regularized training and visualizes the topology-approximation dilemma graphically with two different data sets.
A parallel algorithm for scientific visualization
2002-12-24

Scientific visualization aims to reveal relevant information from multi-dimensional datasets, e.g., scalar or vector fields, by carving out interesting structures and displaying them on the screen. Due to the algorithmic complexity and the large size of typical datasets (up to 512/sup -3/ samples), interactive visualization requires either a workstation network, supercomputers or special purpose hardware. We describe a parallel implementation of a visualization tool for scalar fields on a workstation network. Challenges are to overcome the limited transfer bandwidth of the network, to establish an even workload and to avoid stall conditions in a multiuser environment, in which any machine might temporarily be allocated to other tasks. We alleviate the first problem by the use of BTC (block truncation coding), an image compression method which allows image fragments computed by the different workstations to be compressed and decompressed very quickly. Extended to 3D and applied to the dataset itself, it also speeds lip the sequential part of the visualization process. A modified self-scheduling scheme, which assigns work packages redundantly, eliminates delays caused by temporarily deallocated machines. All communication, synchronization and scheduling is done using basic constructs of PVM (Parallel Virtual Machine). Image quality and processing speed are illustrated by an example from medical imaging.
Automatic structuring and optimization of hierarchical designs
2002-12-24

In this paper an approach for the optimization of digital synchronous designs is described. The optimization is done for smaller components which are the result of a partitioning process. The actual optimization is done on a graph which reflects the communication structure between the modules. Sequential don't care conditions are extracted and used for sequential optimization. As experimental results show, the robustness of the subsequent logic synthesis methods can be increased while achieving a significant gain in cost and power consumption. This is shown by applying the described methods to a set of benchmarks obtained from high-level synthesis.
A reconfigurable processing system for DSP applications
2002-12-24

We present a small-scale, reconfigurable processing system. It contains four FPGAs (9 K to 13 K gate equivalents), 2 MByte Flash Memory, 256 KByte fast SRAM and a 16-bit MAC unit. The system has a PCI-bus interface and was designed to speed up DSP, image processing and computer-graphics algorithms. Examples from medical imaging are shown.
Transient suppression of tinnitus by transcranial magnetic stimulation
2002-12-30

Abstract It has been proposed that tinnitus is associated with an irregular activation of the temporoparietal cortex. If this activity is a functionally relevant component of the tinnitus‐related network, a virtual temporary lesion of this area should result in transient reduction of tinnitus. To test this hypothesis, we applied 10Hz repetitive transcranial magnetic stimulation to eight scalp and four control positions in 14 patients with chronic tinnitus. Stimulation of left temporoparietal cortex significantly reduced tinnitus (Friedman analysis of variance, p &lt; 0.05; compared with control), indicating that secondary auditory areas can be critical for tinnitus perception, perhaps as a consequence of maladaptive cortical reorganization. Ann Neurol 2003
Efficient graph-based computation and manipulation of functional decision diagrams
2002-12-30

An efficient canonical representation for arbitrary Boolean functions, the functional decision diagrams (FDDs), are presented. FDDs are a graphical representation of the Reed-Muller coefficients as BDDs are a representation of the function table. Some algorithms to manipulate FDDs and generate a functional decision diagram from a BDD are presented. The results are very encouraging and show that FDDs are applicable for new approaches to Reed-Muller logic synthesis.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
Semimicroscopical description of the simplest photonuclear reactions accompanied by excitation of the giant dipole resonance in medium-heavy mass nuclei
2002-12-30

A semimicroscopical approach is applied to describe photoabsorption and partial photonucleon reactions accompanied by the excitation of the giant dipole resonance (GDR). The approach is based on the continuum-RPA (CRPA) with a phenomenological description for the spreading effect. The phenomenological isoscalar part of the nuclear mean field, momentum-independent Landau-Migdal particle-hole interaction, and separable momentum-dependent forces are used as input quantities for the CRPA calculations. The experimental photoabsorption and partial -reaction cross sections in the vicinity of the GDR are satisfactorily described for Y, Ce and Pb target nuclei. The total direct-neutron-decay branching ratio for the GDR in Ca and Pb is also evaluated.
The vision camera: An interactive tool for volume data exploration and navigation
2002-12-30

In this work we focus on one of the key problems of scientific visualization, the object recognition dilemma. The necessity to pre-interpret application data in order to classify object surface voxels prior to rendering has prevented many visualization methods from becoming practical. We propose the concept of vision by visualization which integrates computer vision methods into the visualization process. Based on this, we present the vision camera, a new tool allowing for interactive object recognition during volume data walkthroughs. This camera model is characterized by a flexible front-plane which, under the control of user-specified parameters and image features elastically matches to object surfaces, while shifted through a data volume. Thus, objects are interactively carved out and can be visualized by standard volume visualization methods. Implementation and application of the model are described. Our results suggest that by the integration of human and machine vision new perspectives for data exploration are opened up.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
Interface specification and synthesis for VHDL processes
2002-12-30

A method is presented to separate the algorithmic specification from the specification of the protocol level allowing a hierarchical design. A VHDL subset and a methodology for the specification is defined. The authors show the target architecture to merge the different levels into one synchronous data path. They present the algorithm especially dealing with the interface part of the specification. Finally, some results are given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>