Query: Conditional proxy re-encryption secure against chosen-ciphertext attack

Relevant passages:
Divertible Protocols and Atomic Proxy Cryptography <=SEP=> First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a definition of protocol divertibility that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta’s definition in the case of interactive zero-knowledge proofs. Other important examples falling under the new definition are blind signature protocols. We propose a sufficiency criterion for divertibility that is satisfied by many existing protocols and which, surprisingly, generalizes to cover several protocols not normally associated with divertibility (e.g., Diffie-Hellman key exchange). Next, we introduce atomic proxy cryptography, in which an atomic proxy function, in conjunction with a public proxy key, converts ciphertexts (messages or signatures) for one key into ciphertexts for another. Proxy keys, once generated, may be made public and proxy functions applied in untrusted environments. We present atomic proxy functions for discrete-log-based encryption, identification, and signature schemes. It is not clear whether atomic proxy functions exist in general for all public-key cryptosystems. Finally, we discuss the relationship between divertibility and proxy cryptography.

Proxy Cryptography Revisited <=SEP=> In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “proxy”) to duplicate the functionality available to t he third party U (the “user”), without being able to perform this functionality on their own (without cooperation). The concept is closely related to the notion of threshold cryptography, except we deal with only two parties P andF , and place very strict restrictions on the way the operations are performed (which is done for the sake of efficiency, usability and scalability). For example, for decryption (res p. signature)P (F ) sends a single message to F (P ), after which the latter can decrypt (sign) the message. Our formal modeling of proxy cryptography significantly generalizes, simplifies and simultaneously clarifies the model of “atomic proxy” suggested by Blaze and Strauss [4]. In particular, we define bidirectional and unidirectional var iants of our model 1, and show extremely simple generic solutions for proxy signature and encryption in these models. We also give more efficient solutions for several specific schemes. We conclude that proxy cryptography is a relatively simple concept to satisfy when looked from the correct and formal standpoint.

A Hard-Core Predicate for all One-Way Functions <=SEP=> A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates <italic>b</italic> of functions (permutations) ƒ, discovered in [Blum Micali 82]. Such <italic>b</italic>(<italic>x</italic>) cannot be efficiently guessed (substantially better than 50-50) given only ƒ(<italic>x</italic>). Both <italic>b</italic>, ƒ are computable in polynomial time.
[Yao 82] transforms any one-way function ƒ into a more complicated one, ƒ<supscrpt>*</supscrpt>, which has a hard-core predicate. The construction applies the original ƒ to many small pieces of the input to ƒ<supscrpt>*</supscrpt> just to get one “hard-core” bit. The security of this bit may be smaller than any constant positive power of the security of ƒ. In fact, for inputs (to ƒ<supscrpt>*</supscrpt>) of practical size, the pieces effected by ƒ are so small that ƒ can be inverted (and the “hard-core” bit computed) by exhaustive search.
In this paper we show that every one-way function, padded to the form ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)), ‖‖<italic>p</italic>‖‖ = ‖<italic>x</italic>‖, has by itself a hard-core predicate of the same (within a polynomial) security. Namely, we prove a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors <italic>p</italic>, <italic>x</italic> is a hard-core of every one-way function ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)). The result extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>'s for which ƒ is hard to invert.

Zero-knowledge proofs of identity <=SEP=> In this paper we extend the notion of zero knowledge proofs of membership (which reveal one bit of information) to zero knowledge proofs of knowledge (which reveal no information whatsoever). After formally defining this notion, we show its relevance to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. In the last part of the paper we consider the question of sequential versus parallel executions of zero knowledge protocols, define a new notion of “transferable information”, and prove that the parallel version of our identification scheme (which is not known to be zero knowledge) is secure since it reveals no transferable information.

Adversarial Localization Network <=SEP=> We propose the Adversarial Localization Network, a novel weakly supervised approach to generate object masks in an image. We train a corruption net to mask out regions of the image to reduce prediction confidence of the classifier. To avoid generating adversarial artifacts due to vulnerability of deep networks to adversarial perturbation, we also co-train the classifier to correctly predict the corrupted images. Our approach could efficiently produce reasonable object masks with a simple architecture and few hyper-parameters. We achieve competitive results on the ILSVRC2012 dataset for object localization with only image level labels and no bounding boxes for training.

Essential communication practices for Extreme Programming in a global software development team <=SEP=> We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distributed team created a successful project in a new problem domain using a methodology that is dependent on informal, face-to-face communication. We collected quantitative and qualitative data and used grounded theory to identify four key factors for communication in globally-distributed XP teams working within a new problem domain. Our study suggests that, if these critical enabling factors are addressed, methodologies dependent on informal communication can be used on global software development projects.

A Multi-Modal Approach to Infer Image Affect <=SEP=> e group aect or emotion in an image of people can be inferred by extracting features about both the people in the picture and the overall makeup of the scene. e state-of-the-art on this problem investigates a combination of facial features, scene extraction and even audio tonality. is paper combines three additional modalities, namely, human pose, text-based tagging and CNN extracted features / predictions. To the best of our knowledge, this is the rst time all of the modalities were extracted using deep neural networks. We evaluate the performance of our approach against baselines and identify insights throughout this paper.

Privacy by BlockChain Design: A BlockChain-enabled GDPR-compliant Approach for Handling Personal Data <=SEP=> This paper takes an initial step forward in bringing to life the certification mechanisms according to Art. 42 of the General Data Protection Regulation (GDPR). These newly established methods of legal specification act not only as a central vehicle for overcoming widely articulated and discussed legal challenges, but also as a sandbox for the much needed close collaboration between computer sciences and legal studies. In order to illustrate, for example, what data protection seals could look like in the future, the authors propose a methodology for "translating" legal requirements into technical guidelines: architectural blueprints designed using legal requirements. The purpose of these blueprints is to show developers how their solutions might comply with the principle of Privacy by Design (Art. 25 GDPR). To demonstrate this methodology, the authors propose an architectural blueprint that embodies the legal concept of the data subject’s consent (Art. 6 sec. 1 lit. a GDPR) and elevates best practice to a high standard of Privacy by Design. Finally, the authors highlight further legal problems concerning blockchain technology under the GDPR that will have to be addressed in order to achieve a comprehensive certification mechanism for Privacy by Blockchain Design in the future. ACM Classification

Systematic literature reviews in software engineering - A systematic literature review <=SEP=> Background: In 2004 the concept of evidence-based software engineering (EBSE) was introduced at the ICSE04 conference. Aims: This study assesses the impact of systematic literature reviews (SLRs) which are the recommended EBSE method for aggregating evidence. Method: We used the standard systematic literature review method employing a manual search of 10 journals and 4 conference proceedings. Results: Of 20 relevant studies, eight addressed research trends rather than technique evaluation. Seven SLRs addressed cost estimation. The quality of SLRs was fair with only three scoring less than 2 out of 4. Conclusions: Currently, the topic areas covered by SLRs are limited. European researchers, particularly those at the Simula Laboratory appear to be the leading exponents of systematic literature reviews. The series of cost estimation SLRs demonstrate the potential value of EBSE for synthesising evidence and making it available to practitioners. ! 2008 Elsevier B.V. All rights reserved.

Generating Sentence Planning Variations for Story Telling <=SEP=> There has been a recent explosion in applications for dialogue interaction ranging from direction-giving and tourist information to interactive story systems. Yet the natural language generation (NLG) component for many of these systems remains largely handcrafted. This limitation greatly restricts the range of applications; it also means that it is impossible to take advantage of recent work in expressive and statistical language generation that can dynamically and automatically produce a large number of variations of given content. We propose that a solution to this problem lies in new methods for developing language generation resources. We describe the ES-TRANSLATOR, a computational language generator that has previously been applied only to fables, and quantitatively evaluate the domain independence of the EST by applying it to personal narratives from weblogs. We then take advantage of recent work on language generation to create a parameterized sentence planner for story generation that provides aggregation operations, variations in discourse and in point of view. Finally, we present a user evaluation of different personal narrative retellings.

Persecutory delusions and catastrophic worry in psychosis: developing the understanding of delusion distress and persistence. <=SEP=> In a recent theoretical account of persecutory delusions, it is suggested that anxiety and worry are important factors in paranoid experience [Freeman, D., Garety, P. A., Kuipers, E., Fowler, D., & Bebbington, P. E. (2002). A cognitive model of persecutory delusions. British Journal of Clinical Psychology, 41(4), 331-347]. In emotional disorders worry has been understood in terms of catastrophising. In the current study, the concept of catastrophising is applied for the first time with persecutory delusions. Thirty individuals with current persecutory delusions and 30 non-clinical controls participated in a cross-sectional study. The group with persecutory delusions was also followed up at 3 months to assess predictors of delusion persistence. At its most severe, 21% of individuals with persecutory delusions had clinical worry, 68% had levels of worry comparable with treatment seeking GAD patients. Further, high levels of anxiety, worry and catastrophising were associated with high levels of persecutory delusion distress and with the persistence of delusions over 3 months. If future research replicates these findings, worry reduction interventions for individuals with persecutory delusions may be warranted.

Resilience and Sustainable Development : Theory of resilience , systems thinking and adaptive governance <=SEP=>  Basic information on SD  Country profiles  Quarterly reports  Policy briefs  Case studies  Conference papers  Workshop papers  Getting in touch with us The European Sustainable Development Network (ESDN) is an informal network of public administrators and other experts who deal with sustainable development strategies and policies. The network covers all 27 EU Member States, plus other European countries. The ESDN is active in promoting sustainable development and facilitating the exchange of good practices in Europe and gives advice to policy-makers at the European and national levels. This ESDN Quarterly Report (QR) provides a condensed overview of the concept of resilience. Despite the complexity of the theory behind resilience, this QR tries to communicate the main notions behind this concept in a way that is understandable and not overly technical. The intention of this QR is to serve as a guide through the concept of resilience. The report does not aim at being exhaustive but intends to provide an overview on the links which are particularly relevant for sustainable development (SD) in general and SD governance in particular. A multitude of diverse sources have been used, mainly from the academic literature. It has to be mentioned the significant and decisive role that the Resilience Alliance has in providing extensive knowledge: the website that they are running, is an exceptionally good source of information for those who are interested and want to deepen their knowledge of resilience. Additionally, among all the scientific publications cited throughout the report, a special mention goes to the book by Walker and Salt (2006) entitled " Resilience thinking: sustaining ecosystems and people in a changing world " , which is very much suggested as a practical source of information on resilience. As a first chapter, an executive summary is provided with a short overview of the report with the essential notions that are depicted throughout the QR. The second chapter then introduces the concept of resilience and gives an extensive background on the notions behind it. It intends to provide guidance, especially to understand the linkages between the concept of resilience and sustainable development, and the importance of resilience and systems thinking for policy-makers and for those who work on SD governance. The third chapter summarizes the relationships among resilience, society, governance and policy. Therefore, the concept of 'adaptive governance' is advanced as a more appropriate way to deal with …

Structured light in scattering media <=SEP=> Virtually all structured light methods assume that the scene and the sources are immersed in pure air and that light is neither scattered nor absorbed. Recently, however, structured lighting has found growing application in underwater and aerial imaging, where scattering effects cannot be ignored. In this paper, we present a comprehensive analysis of two representative methods - light stripe range scanning and photometric stereo - in the presence of scattering. For both methods, we derive physical models for the appearances of a surface immersed in a scattering medium. Based on these models, we present results on (a) the condition for object detectability in light striping and (b) the number of sources required for photometric stereo. In both cases, we demonstrate that while traditional methods fail when scattering is significant, our methods accurately recover the scene (depths, normals, albedos) as well as the properties of the medium. These results are in turn used to restore the appearances of scenes as if they were captured in clear air. Although we have focused on light striping and photometric stereo, our approach can also be extended to other methods such as grid coding, gated and active polarization imaging.

Multigranulation decision-theoretic rough sets <=SEP=> Article history: Available online 23 March 2013

Perfectly Matched Layers for Elastodynamics : A New Absorbing Boundary <=SEP=> The use of perfectly matched layers (PML) has recently been introduced by Berenger as a material absorbing boundary condition (ABC) for electromagnetic waves. In this paper, we will rst prove that a ctitious elastodynamic material half-space exists that will absorb an incident wave for all angles and all frequencies. Moreover, the wave is attenuative in the second half-space. As a consequence, layers of such material could be designed at the edge of a computer simulation region to absorb outgoing waves. Since this is a material ABC, only one set of computer codes is needed to simulate an open region. Hence, it is easy to parallelize such codes on multiprocessor computers. For instance, it is easy to program massively parallel computers on the SIMD (single instruction multiple data) mode for such codes. We will show two and three dimensional computer simulations of the PML for the linearized equations of elastodyanmics. Comparison with Liao's ABC will be given.

Mitigating IoT security threats with a trusted Network element <=SEP=> Securing the growing amount of IoT devices is a challenge for both the end-users bringing IoT devices into their homes, as well as the corporates and industries exposing these devices into the Internet as part of their service or operations. The exposure of these devices, often poorly configured and secured, offers malicious actors an easy access to the private information of their users, or potential to utilize the devices in further activities, e.g., attacks on other devices via Distributed Denial of Service. This paper discusses the current security challenges of IoT devices and proposes a solution to secure these devices via a trusted Network Edge Device. NED offloads the security countermeasures of the individual devices into the trusted network elements. The major benefit of this approach is that the system can protect the IoT devices with user-defined policies, which can be applied to all devices regardless of the constraints of computing resources in the IoT tags. Additional benefit is the possibility to manage the countermeasures of multiple IoT devices/gateways at once, via a shared interface, thus largely avoiding the per-device maintenance operations.

The All Relevant Feature Selection using Random Forest <=SEP=> In this paper we examine the application of the random forest classifier for the all relevant feature selection problem. To this end we first examine two recently proposed all relevant feature selection algorithms, both being a random forest wrappers, on a series of synthetic data sets with varying size. We show that reasonable accuracy of predictions can be achieved and that heuristic algorithms that were designed to handle the all relevant problem, have performance that is close to that of the reference ideal algorithm. Then, we apply one of the algorithms to four families of semi-synthetic data sets to assess how the properties of particular data set influence results of feature selection. Finally we test the procedure using a well-known gene expression data set. The relevance of nearly all previously established important genes was confirmed, moreover the relevance of several new ones is discovered.

Using Indirect Encoding of Multiple Brains to Produce Multimodal Behavior <=SEP=> An important challenge in neuroevolution is to evolve complex neural networks with multiple modes of behavior. Indirect encodings can potentially answer this challenge. Yet in practice, indirect encodings do not yield effective multimodal controllers. Thus, this paper introduces novel multimodal extensions to HyperNEAT, a popular indirect encoding. A previous multimodal HyperNEAT approach called situational policy geometry assumes that multiple brains benefit from being embedded within an explicit geometric space. However, experiments here illustrate that this assumption unnecessarily constrains evolution, resulting in lower performance. Specifically, this paper introduces HyperNEAT extensions for evolving many brains without assuming geometric relationships between them. The resulting MultiBrain HyperNEAT can exploit human-specified task divisions to decide when each brain controls the agent, or can automatically discover when brains should be used, by means of preference neurons. A further extension called module mutation allows evolution to discover the number of brains, enabling multimodal behavior with even less expert knowledge. Experiments in several multimodal domains highlight that multi-brain approaches are more effective than HyperNEAT without multimodal extensions, and show that brains without a geometric relation to each other outperform situational policy geometry. The conclusion is that Multi-Brain HyperNEAT provides several promising techniques for evolving complex multimodal behavior.

Securing distributed storage: challenges, techniques, and systems <=SEP=> The rapid increase of sensitive data and the growing number of government regulations that require longterm data retention and protection have forced enterprises to pay serious attention to storage security. In this paper, we discuss important security issues related to storage and present a comprehensive survey of the security services provided by the existing storage systems. We cover a broad range of the storage security literature, present a critical review of the existing solutions, compare them, and highlight potential research issues.

The YouTube Lens: Crowdsourced Personality Impressions and Audiovisual Analysis of Vlogs <=SEP=> Despite an increasing interest in understanding human perception in social media through the automatic analysis of users' personality, existing attempts have explored user profiles and text blog data only. We approach the study of personality impressions in social media from the novel perspective of crowdsourced impressions, social attention, and audiovisual behavioral analysis on slices of conversational vlogs extracted from YouTube. Conversational vlogs are a unique case study to understand users in social media, as vloggers implicitly or explicitly share information about themselves that words, either written or spoken cannot convey. In addition, research in vlogs may become a fertile ground for the study of video interactions, as conversational video expands to innovative applications. In this work, we first investigate the feasibility of crowdsourcing personality impressions from vlogging as a way to obtain judgements from a variate audience that consumes social media video. Then, we explore how these personality impressions mediate the online video watching experience and relate to measures of attention in YouTube. Finally, we investigate on the use of automatic nonverbal cues as a suitable lens through which impressions are made, and we address the task of automatic prediction of vloggers' personality impressions using nonverbal cues and machine learning techniques. Our study, conducted on a dataset of 442 YouTube vlogs and 2210 annotations collected in Amazon's Mechanical Turk, provides new findings regarding the suitability of collecting personality impressions from crowdsourcing, the types of personality impressions that emerge through vlogging, their association with social attention, and the level of utilization of nonverbal cues in this particular setting. In addition, it constitutes a first attempt to address the task of automatic vlogger personality impression prediction using nonverbal cues, with promising results.

Analysis of Ethernet AVB for automotive networks using Network Calculus <=SEP=> Future functions of vehicles to make driving safer, more comfortable and more exciting rely on suitable in-vehicle networks. Legacy Ethernet extended by AVB to meet recent and future requirements is discussed as a proper candidate. Investigation of its forwarding, synchronization and resource reservation mechanisms are an important prerequisite for the object: The progressive vehicle integration unleashing its whole potential as an in-vehicle network. This paper focuses on AVB's forwarding policy by using Network Calculus as a theory for calculating worst case delays.

Low-Quality Product Review Detection in Opinion Summarization <=SEP=> Product reviews posted at online shopping sites vary greatly in quality. This paper addresses the problem of detecting lowquality product reviews. Three types of biases in the existing evaluation standard of product reviews are discovered. To assess the quality of product reviews, a set of specifications for judging the quality of reviews is first defined. A classificationbased approach is proposed to detect the low-quality reviews. We apply the proposed approach to enhance opinion summarization in a two-stage framework. Experimental results show that the proposed approach effectively (1) discriminates lowquality reviews from high-quality ones and (2) enhances the task of opinion summarization by detecting and filtering lowquality reviews.

Normative data stratified by age and education for two measures of verbal fluency: FAS and animal naming. <=SEP=> Normative data stratified by three levels of age (16-59, 60-79, and 80-95 years) and three levels of education (0-8, 9-12, and 13-21 years) are presented for phonemic verbal fluency (FAS) and categorical verbal fluency (Animal Naming). The normative sample, aged 16 to 95 years, consisted of 1,300 cognitively intact individuals who resided in the community. Years of education ranged from 0 to 21. The total number of words in 1 minute for each of the letters F, A, and S was correlated r =.52 with the number of animal names generated in 1 minute. Regression analyses showed that FAS was more sensitive to the effects of education (18.6% of the variance) than age (11.0% of the variance). The opposite relationship occurred for Animal Naming, where age accounted for 23.4% of the variance and education accounted only for 13.6%. Gender accounted for less than 1% of variance for FAS and Animal Naming. The clinical utility of these norms is discussed.

Application of the Laminar Navier-Stokes Equations for Solving 2D and 3D Pathfinding Problems with Static and Dynamic Spatial Constraints: Implementation and Validation in Comsol Multiphysics <=SEP=> Pathfinding problems consist in determining the optimal shortest path, or at least one path, between two points in the space. In this paper, we propose a particular approach, based on methods used in Computational Fluid Dynamics, that intends to solve such problems. In particular, we reformulate pathfinding problems as the motion of a viscous fluid via the use of the laminar Navier-Stokes equations completed with suitable boundary conditions corresponding to some characteristics of the considered problem: position of the initial and final points, a-priori information of the terrain, One-way routes and dynamic spatial configuration. The advantages of this technique, regarding existing ones (e.g., A* algorithm) is that it does not require a pre-processing method (e.g., graph conversion) of the environment and can manage complex geometries. Then, we propose a particular numerical implementation of this methodology by using Comsol Multiphysics (i.e., a modeling software based on Finite Element Methods). Finally, we validate our approach by considering several 2D and 3D benchmark cases. Results are compared with the ones returned by a simple A* algorithm. From those numerical tests, we deduce that our algorithms generate suitable routes (but not the shortest ones) for the studied problems in a computational time similar to the considered A*.

One-shot learning for fine-grained relation extraction via convolutional siamese neural network <=SEP=> Extracting fine-grained relations between entities of interest is of great importance to information extraction and large-scale knowledge graph construction. Conventional approaches on relation extraction require an existing knowledge graph to start with or sufficient observed samples from each relation type in the training process. However, such resources are not always available, and fine-grained manual labeling is extremely time-consuming and requires extensive expertise for specific domains such as healthcare and bioinformatics. Additionally, the distribution of fine-grained relations is often highly imbalanced in practice. We tackle this label scarcity and distribution imbalance issue from a one-shot classification perspective via a convolutional siamese neural network which extracts discriminative semantic-aware features to verify the relations between a pair of input samples. The proposed siamese network effectively extracts uncommon relations with only limited observed samples on the tasks of 1-shot and few-shot classification, demonstrating significant benefits to domain-specific information extraction in practical applications.

Fault classification and fault signature production for rolling element bearings in electric machines <=SEP=> Most condition monitoring techniques for rolling element bearings are designed to detect the four characteristic fault frequencies. This has lead to the common practice of categorizing bearing faults according to fault location (i.e., inner race, outer race, ball, or cage fault). While the ability to detect the four characteristic fault frequencies is necessary, this approach neglects another important class of faults that arise in many industrial settings. This research introduces the notion of categorizing bearing faults as either single-point defects or generalized roughness. These classes separate bearing faults according to the fault signatures that are produced rather than by the physical location of the fault. Specifically, single-point defects produce the four predictable characteristic fault frequencies while faults categorized as generalized roughness produce unpredictable broadband changes in the machine vibration and stator current. Experimental results are provided from bearings failed in situ via a shaft current. These results illustrate the unpredictable and broadband nature of the effects produced by generalized roughness bearing faults. This issue is significant because a successful bearing condition monitoring scheme must be able to reliably detect both classes of faults.

DCA for bot detection <=SEP=> Ensuring the security of computers is a non-trivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emerged in the form of networks of hijacked zombie machines used to perform complex distributed attacks such as denial of service and to obtain sensitive data such as password information. These zombie machines are said to be infected with a dasiahotpsila - a malicious piece of software which is installed on a host machine and is controlled by a remote attacker, termed the dasiabotmaster of a botnetpsila. In this work, we use the biologically inspired dendritic cell algorithm (DCA) to detect the existence of a single hot on a compromised host machine. The DCA is an immune-inspired algorithm based on an abstract model of the behaviour of the dendritic cells of the human body. The basis of anomaly detection performed by the DCA is facilitated using the correlation of behavioural attributes such as keylogging and packet flooding behaviour. The results of the application of the DCA to the detection of a single hot show that the algorithm is a successful technique for the detection of such malicious software without responding to normally running programs.

Neural systems behind word and concept retrieval <=SEP=> Using both the lesion method and functional imaging (positron emission tomography) in large cohorts of subjects investigated with the same experimental tasks, we tested the following hypotheses: (A) that the retrieval of words which denote concrete entities belonging to distinct conceptual categories depends upon partially segregated regions in higher-order cortices of the left temporal lobe; and (B) that the retrieval of conceptual knowledge pertaining to the same concrete entities also depends on partially segregated regions; however, those regions will be different from those postulated in hypothesis A, and located predominantly in the right hemisphere (the second hypothesis tested only with the lesion method). The analyses provide support for hypothesis A in that several regions outside the classical Broca and Wernicke language areas are involved in name retrieval of concrete entities, and that there is a partial segregation in the temporal lobe with respect to the conceptual category to which the entities belong, and partial support for hypothesis B in that retrieval of conceptual knowledge is partially segregated from name retrieval in the lesion study. Those regions identified here are seen as parts of flexible, multi-component systems serving concept and word retrieval for concrete entities belonging to different conceptual categories. By comparing different approaches the article also addresses a number of method issues that have surfaced in recent studies in this field.

CortexNet: a Generic Network Family for Robust Visual Temporal Representations <=SEP=> In the past five years we have observed the rise of incredibly well performing feed-forward neural networks trained supervisedly for vision related tasks. These models have achieved super-human performance on object recognition, localisation, and detection in still images. However, there is a need to identify the best strategy to employ these networks with temporal visual inputs and obtain a robust and stable representation of video data. Inspired by the human visual system, we propose a deep neural network family, CortexNet, which features not only bottom-up feedforward connections, but also it models the abundant top-down feedback and lateral connections, which are present in our visual cortex. We introduce two training schemes — the unsupervised MatchNet and weakly supervised TempoNet modes — where a network learns how to correctly anticipate a subsequent frame in a video clip or the identity of its predominant subject, by learning egomotion clues and how to automatically track several objects in the current scene. Find the project website at tinyurl.com/CortexNet.