Patents and ethics: Is it possible to be balanced?

In this presentation, principles of ethics are confronted with the desire of the inventor to make a profit. To this end the presentation is focused on patent protection. Patents should guarantee the return of an inventor’s investment and profit and, on the other side, ensure availability — by patent disclosure — of the invention for the society when the patent terminates. Recent patent applications made by inventors are infringing this principle and societies are paying an unexpected price for these practices. Patent claims are too broad and disclosures too poor. Extreme examples will be discussed. An earlier version of this paper was presented at an international conference, “The Ethics of Intellectual Property Rights and Patents,” held in Warsaw, Poland on 23–24 April, 2004.     

Complex effects of NMDA receptor antagonist APV in the basolateral amygdala on acquisition of two-way avoidance reaction and long-term fear memory

Although much has been learned about the role of the amygdala in Pavlovian fear conditioning, relatively little is known about an involvement of this structure in more complex aversive learning, such as acquisition of an active avoidance reaction. In the present study, rats with a pretraining injection of the N-methyl-D-aspartate (NMDA) receptor antagonist, 2-amino-5-phosphonopentanoic acid (APV), into the basolateral amygdala (BLA) were found to be impaired in two-way active avoidance learning. During multitrial training in a shuttle box, the APV-injected rats were not different from the controls in sensitivity to shock or in acquisition of freezing to contextual cues. However, APV injection led to impaired retention of contextual fear when tested 48 h later, along with an attenuation of c-Fos expression in the amygdala. These results are consistent with the role of NMDA receptors of the BLA in long-term memory of fear, previously documented in Pavlovian conditioning paradigms. The APV-induced impairment in the active avoidance learning coincided with deficits in directionality of the escape reaction and in attention to conditioned stimuli. These data indicate that normal functioning of NMDA receptors in the basolateral amygdala is required during acquisition of adaptive instrumental responses in a shuttle box but is not necessary for acquisition of short-term contextual fear in this situation.     

Defense mechanisms in alexithymia

The Polish version of the Toronto Alexithymia Scale-20 and Defense Mechanisms Questionnaire were completed by 387 university students. Scores on alexithymia correlate significantly with scores on the whole group of 12 immature defenses (Pearson r = .39, p < .001) and with scores on such individual immature defense mechanisms as Autistic Fantasy (r = .39), Somatization (r = .37), Projection (r = .32), and Displacement (r = .32). These results support other findings indicating that alexithymia is significantly associated with immature ego defenses.     

Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators.     

The impact of psychological distance on integrative internal dialogs

Negotiators more distanced from the negotiated goal more often exhibit integrative behavior, which maximizes both their individual and joint outcomes. Based on the assumption of an analogy between interpersonal negotiations and internal dialogs simulating social relationships, an experiment was carried out. It aimed to verify if psychological distance (proximal vs. distant perspective on the situation enacted in an internal dialog) affects the processes of integration and confrontation and, consequently, increases the frequency of integrative dialogs. Data from 115 participants (56 women) were analyzed. An increase in psychological distance was found to reduce the intensity of the confrontation process and to cause an increase in the number of integrative internal dialogs.     

Information retrieval with semantic memory model

Psycholinguistic theories of semantic memory form the basis of understanding of natural language concepts. These theories are used here as an inspiration for implementing a computational model of semantic memory in the form of semantic network. Combining this network with a vector-based object-relation-feature value representation of concepts that includes also weights for confidence and support, allows for recognition of concepts by referring to their features, enabling a semantic search algorithm. This algorithm has been used for word games, in particular the 20-question game in which the program tries to guess a concept that a human player thinks about. The game facilitates lexical knowledge validation and acquisition through the interaction with humans via supervised dialog templates. The elementary linguistic competencies of the proposed model have been evaluated assessing how well it can represent the meaning of linguistic concepts. To study properties of information retrieval based on this type of semantic representation in contexts derived from on-going dialogs experiments in limited domains have been performed. Several similarity measures have been used to compare the completeness of knowledge retrieved automatically and corrected through active dialogs to a “golden standard”. Comparison of semantic search with human performance has been made in a series of 20-question games. On average results achieved by human players were better than those obtained by semantic search, but not by a wide margin.     

Modulation of afterhyperpolarization evoked by doublets and increasing number of stimuli in rat motoneurons

The authors studied the influence of variable stimulation patterns on parameters of afterhyperpolarization (AHP) in rat spinal motoneurons using intracellular recording of antidromic action potentials. The action potentials analyzed were evoked by either (a) a single stimulus or pair of stimuli with gradually increasing interpulse intervals (IPI) of 5-20 ms or (b) an increasing number of stimulus pulses, from 1 to 4, at a constant IPI. It was demonstrated that modulations of AHP parameters after 2 pulses depended on the IPI, whereas the most significant changes in these parameters were found after the application of 2 or 3 stimuli in a series. The authors propose that changes in the AHP parameters have functional significance for motoneuronal firing pattern and therefore for motor unit force development during tetanic contractions.     

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse (REG ^c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG ^c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG ^c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG ^c logics is coNP-complete.