‘The Problem of the Future in Nineteenth-Century Spain’

This article examines the problems and paradoxes in the representation of the future in three nineteenth-century Spanish works: El futuro Madrid (1868) by Fernández de los Ríos, ‘Madrid en el siglo xxi’ (1847) by Neira de Mosquera, and Ni en la vida ni en la muerte by Juan Bautista Amorós (Silverio Lanza). While these texts demonstrate Spain’s participation in the general movement towards using the future as a setting for literary works, they do not corroborate the theory that the nineteenth century was a time of optimism and belief in the doctrine of Progress. Concepts derived from discussions of the future in the history of ideas, such as historia magistra vitae, are shown to be relevant to discussion of these futuristic fictions, in sometimes unexpected ways.

Query Suggestions for Textual Problem Solution Repositories

Textual problem-solution repositories are available today in
various forms, most commonly as problem-solution pairs from community
question answering systems. Modern search engines that operate on
the web can suggest possible completions in real-time for users as they
type in queries. We study the problem of generating intelligent query
suggestions for users of customized search systems that enable querying
over problem-solution repositories. Due to the small scale and specialized
nature of such systems, we often do not have the luxury of depending on
query logs for finding query suggestions. We propose a retrieval model
for generating query suggestions for search on a set of problem solution
pairs. We harness the problem solution partition inherent in such
repositories to improve upon traditional query suggestion mechanisms
designed for systems that search over general textual corpora. We evaluate
our technique over real problem-solution datasets and illustrate that
our technique provides large and statistically significant

The effect of preferential paw usage on dogs' (Canis familiaris) performance in a manipulative problem-solving task

In a number of species, individuals showing lateralized hand/paw usage (i.e. the preferential use of either the right or left paw) compared to ambilateral individuals have been shown to be more proactive in novel situations. In the current study we used an established test to assess preferential paw usage in dogs (the Kong test) and then compared the performance of ambilateral and lateralized dogs as well as left- vs. right-pawed dogs in a novel manipulative problem solving task. Results showed an equal proportion of ambilateral and lateralized dogs but contrary to predictions non-lateralized dogs were faster at accessing the apparatus in test trials. No differences emerged between right- and left-pawed dogs. Results are discussed in relation to previous studies on lateralization. © 2013 Elsevier B.V.

A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time

A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.

Whose sins do the Brethren confess? The problem of sin as the problem of expiation

Among Brethren fisher families in Gamrie, northeast Scotland, professional clergy and written liturgy are held to be blasphemous denials of the true workings of the Holy Spirit. God, I was told, chooses to speak through all born-again (male) persons, unrestricted by the vain repetitions of lettered clerics and their prayer books. In this context, confession of one’s own sin is a private and pointedly interior affair. In Gamrie, not only did every man seek to be his own skipper, but also his own priest. Yet, much of Brethren worship is given over to ritualised acts of confession. So whose sins do the Brethren confess, and to what end? This article argues that among the Brethren of Gamrie, such acts involve confessing not one’s own sin, but the sins of a ‘sick’ and ‘fallen’ world. More than this, by attending to the sociological (as opposed to theological) processes of confessing the sins of another, we see a collapse in the distinction between confiteor and credo that has so dogged anthropological studies of Christianity. In Brethren prayer and bible study, as well as in everyday gossip, the “I confess” of the confiteor and the “I believe” of credo co-constitute one another in and through evidences of the ‘lostness’ of ‘this present age’. But how, if at all, does this solve ‘the problem of sin’? This article suggests that, with the ritual gaze of confession turned radically outward, Brethren announcements of global wickedness enact (in a deliberate tautology) both a totalising call for repentance from sin, and a millenarian creed of the imminent apocalypse. Here, the problem of ritual can be understood as the problem of (partially failed) expiation.

Convex Quadratic Programming Approach to the Maximum Matching Problem

The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.

Performance analysis of 4G wireless networks using system level simulator

In the last decade, mobile wireless communications have witnessed an explosive growth in the user’s penetration rate and their widespread deployment around the globe. In particular, a research topic of particular relevance in telecommunications nowadays is related to the design and implementation of mobile communication systems of 4th generation (4G). 4G networks will be characterized by the support of multiple radio access technologies in a core network fully compliant with the Internet Protocol (all IP paradigms). Such networks will sustain the stringent quality of service (QoS) requirements and the expected high data rates from the type of multimedia applications (i.e. YouTube and Skype) to be available in the near future. Therefore, 4G wireless communications system will be of paramount importance on the development of the information society in the near future. As 4G wireless services will continue to increase, this will put more and more pressure on the spectrum availability. There is a worldwide recognition that methods of spectrum managements have reached their limit and are no longer optimal, therefore new paradigms must be sought. Studies show that most of the assigned spectrum is under-utilized, thus the problem in most cases is inefficient spectrum management rather spectrum shortage. There are currently trends towards a more liberalized approach of spectrum management, which are tightly linked to what is commonly termed as Cognitive Radio (CR). Furthermore, conventional deployment of 4G wireless systems (one BS in cell and mobile deploy around it) are known to have problems in providing fairness (users closer to the BS are more benefited relatively to the cell edge users) and in covering some zones affected by shadowing, therefore the use of relays has been proposed as a solution. To evaluate and analyse the performances of 4G wireless systems software tools are normally used. Software tools have become more and more mature in recent years and their need to provide a high level evaluation of proposed algorithms and protocols is now more important. The system level simulation (SLS) tools provide a fundamental and flexible way to test all the envisioned algorithms and protocols under realistic conditions, without the need to deal with the problems of live networks or reduced scope prototypes. Furthermore, the tools allow network designers a rapid collection of a wide range of performance metrics that are useful for the analysis and optimization of different algorithms. This dissertation proposes the design and implementation of conventional system level simulator (SLS), which afterwards enhances for the 4G wireless technologies namely cognitive Radios (IEEE802.22) and Relays (IEEE802.16j). SLS is then used for the analysis of proposed algorithms and protocols.

Implicit optimality criterion for convex SIP problem with box constrained index set

We consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in [20] for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.