Search

Despite the obvious differences between the work of Dutch graphic artist M.C. Escher and that of Romanian draftsman S. Steinberg, with a closer look is possible to trace strong affinities between some of their works and many of the themes they handled, such as the drawing of metamorphoses, the figure-background relationship, and the intercourse between reality and representation space. In spite of a general mood difference between their respective graphic narrations, the work of the two authors appears to be based on the same kind of anxieties that have crossed the twentieth century, involving different fields of knowledge.

We prove that the generalized cancellation axiom for incomplete comparative probability relations introduced by Ríos Insua (Theory Decis 33:83-100, ) and Alon and Lehrer (J Econ Theory 151:476-492, ) is stronger than the standard cancellation axiom for complete comparative probability relations introduced by Scott (J Math Psychol 1:233-247, ), relative to their other axioms for comparative probability in both the finite and infinite cases. This result has been suggested but not proved in the previous literature. [ABSTRACT FROM AUTHOR]

This paper empirically investigates the interaction between repeated transactions and endogenous contractual incompleteness. We design an indefinitely repeated games experiment between identifiable players. In this experiment, the probability of continuation and the level of shared information vary over the treatments. The level of contractual completeness is decided by participants at each period. Our results show that past interactions are a stronger determinant of the level of investment in contractual completeness than the perspective of future business. [ABSTRACT FROM AUTHOR]

The recent observation of an energy structure in the reactor antineutrino spectrum is reviewed. The reactor experiments Daya Bay, Double Chooz, and RENO have reported a consistent excess of antineutrinos deviating from the flux predictions, with a local significance of about 4σ between 4 and 6 MeV of the positron energy spectrum. The possible causes of the structure are analyzed in this work, along with the different experimental approaches developed to identify its origin. Considering the available data and results from the three experiments, the most likely explanation concerns the reactor flux predictions and the associated uncertainties. Therefore, the different current models are described and compared. The possible sources of incompleteness or inaccuracy of such models are discussed, as well as the experimental data required to improve their precision. [ABSTRACT FROM AUTHOR]

We present an answer set programming realization of the h-approximation ( HPX ) theory [8] as an efficient and provably sound reasoning method for epistemic planning and projection problems that involve postdictive reasoning. The efficiency of HPX stems from an approximate knowledge state representation that involves only a linear number of state variables, as compared to an exponential number for theories that utilize a possible-worlds based semantics. This causes a relatively low computational complexity, i.e, the planning problem is in NP under reasonable restrictions, at the cost that HPX is incomplete. In this paper, we use the implementation of HPX to investigate the incompleteness issue and present an empirical evaluation of the solvable fragment and its performance. We find that the solvable fragment of HPX is indeed reasonable and fairly large: in average about 85% of the considered projection problem instances can be solved, compared to a PWS -based approach with exponential complexity as baseline. In addition to the empirical results, we demonstrate the manner in which HPX can be applied in a real robotic control task within a smart home, where our scenario illustrates the usefulness of postdictive reasoning to achieve error-tolerance by abnormality detection in a high-level decision-making task. [ABSTRACT FROM AUTHOR]

Background and Objectives: The "need for symmetry" is a well recognized yet little understood feature of obsessive-compulsive (OC) experience. In light of the strong associations between the OC-related trait of incompleteness and symmetry-related behaviors and symptoms, and between perceptual symmetry and aesthetic judgments, this study examined whether trait incompleteness is associated with enhanced natural aesthetic skill and/or aesthetic sensitivity, particularly as they pertain to visual symmetry.Methods: A quasi-experimental design was used to compare the responses of nonclinical individuals with high versus average levels of trait incompleteness on self-report measures and two performance measures of aesthetic judgment.Results: Compared to controls, participants high in incompleteness reported higher levels of self-perceived symmetry-related concerns and behaviors, and displayed greater aesthetic sensitivity in the form of substantially heightened preferences for symmetry in images. Contrary to the hypothesis relating to aesthetic skill, however, the two groups did not differ in their capacity to estimate accurately the objective aesthetic value of images. Nor did they differ in self-reported aesthetics interests and background.Limitations: A clinical sample was not included.Conclusions: Findings provide evidence that high trait incompleteness is associated not just with symptomatic symmetry-related concerns but with a nonspecific heightened preference for visual symmetry. Conceptual implications are discussed, particularly the potential value of the perceptual fluency theory of symmetry and aesthetic response for explaining the association between incompleteness and symmetry preferences and symptoms. [ABSTRACT FROM AUTHOR]

Previous studies of incomplete XML documents have identified three main sources of incompleteness - in structural information, data values, and labeling - and addressed data complexity of answering analogs of unions of conjunctive queries under the open world assumption. It is known that structural incompleteness leads to intractability, while incompleteness in data values and labeling still permits efficient computation of certain answers. The goal of this paper is to provide a detailed picture of the complexity of query answering over incomplete XML documents. We look at more expressive languages, at other semantic assumptions, and at both data and combined complexity of query answering, to see whether some well-behaving tractable classes have been missed. To incorporate non-positive features into query languages, we look at a gentle way of introducing negation via Boolean combinations of existential positive queries, as well as the analog of relational calculus. We also look at the closed world assumption which, due to the hierarchical structure of XML, has two variations. For all combinations of languages and semantics of incompleteness we determine data and combined complexity of computing certain answers. We show that structural incompleteness leads to intractability under all assumptions, while by dropping it we can recover efficient evaluation algorithms for some queries that go beyond those previously studied. In the process, we also establish a new result about relational query answering over incomplete databases, showing that for Boolean combinations of conjunctive queries, certain answers can be found in polynomial time. [ABSTRACT FROM AUTHOR]

We analyse the roles of network connectivity and topology on the monopoly pricing of network goods which enable social interaction between consumers. Connectivity between network members induces the well-known network externalities effect, while the topological effect is caused by the incompleteness of the social network’s linkage, and it has not been previously recognised in this context. We find that the topological effect counteracts, and dominates, the connectivity effect by reducing the monopoly’s capacity to extract consumer surplus. Our results are seen to hold in real cases of social network businesses. The monopolist benefits from price discrimination based on consumers’ social connections, but this has a social cost as consumer surplus loss is higher than the increase in profits, with the highly connected consumers being the primary losers. Therefore, privacy policies restricting excessive social profiling and tracking can have an antitrust role too. Our approach also extends the theory of multi-sided markets in relation to the underlying relations graph of different market sides. [ABSTRACT FROM AUTHOR]

In this paper, a novel rule base, Certainty Rule Base (CeRB), and its inference method are proposed. This rule base is firstly designed with certainty degrees embedded in the antecedent terms as well as in the consequent terms. CeRB is shown to be capable of capturing vagueness, incompleteness, uncertainty, and nonlinear causal relationships in an integrated way. Secondly, the CeRB inference method using the evidential reasoning approach is provided. The overall representation and inference framework offer a further improvement and a great extension of the recently uncertainty inference methods. Namely, the knowledge is represented by CeRB and the evidential reasoning approach is applied to the rule combination. In the end, two case studies including a numerical example and a software defect prediction are provided to illustrate the proposed CeRB representation, generation and inference procedure as well as demonstrate its high performance by comparing with some existing approaches. [ABSTRACT FROM AUTHOR]

We give explicit expressions of the Tutte polynomial of asymmetric complete flower graph and asymmetric incomplete flower graph. We then express these Tutte polynomials as generating functions and decode some valuable information about the asymmetric complete flower graph and asymmetric incomplete flower graph. Furthermore, we convert the Tutte polynomials into coboundary polynomials and give explicit expressions of the k-defect polynomials of these structures. Finally, we conclude that nonisomorphic graphs in this class have the same Tutte polynomials, the same chromatic polynomials, and the same defect polynomials. [ABSTRACT FROM AUTHOR]

Only 128 impact craters exposed at Earth's surface have been found so far, while new craters are discovered occasionally. Taking into account the permanent consumption of craters by erosion we present the first estimate on the number of impact craters that should be present at Earth's surface. Our study yields no evidence for any systematic incompleteness in the available inventory of the craters larger than about 6 km in diameter exposed at the surface. In contrast, more than 90 craters in the diameter range from 1 km to 6 km should still be waiting to be discovered, and even more than 250 between 0.25 km and 1 km diameter. The transition from a probably complete inventory above 6 km to a strongly incomplete record at smaller sizes may be related to the difference between simple and complex craters. Beyond these results on the terrestrial crater record, our findings tentatively suggest that erosion rates on the 10 to 100 million year scale may be closer to present-day erosion rates than previously assumed. [ABSTRACT FROM AUTHOR]

Einstein made several attempts to argue for the incompleteness of quantum mechanics (QM), not all of them using a separation principle. One unpublished example, the box parable, has received increased attention in the recent literature. Though the example is tailor-made for applying a separation principle and Einstein indeed applies one, he begins his discussion without it. An analysis of this first part of the parable naturally leads to an argument for incompleteness not involving a separation principle. I discuss the argument and its systematic import. Though it should be kept in mind that the argument is not the one Einstein intends, I show how it suggests itself and leads to a conflict between QM's completeness and a physical principle more fundamental than the separation principle, i.e. a principle saying that QM should deliver probabilities for physical systems possessing properties at definite times. [ABSTRACT FROM AUTHOR]

We study three kinds of compactness in some variants of Gödel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the compactness property of extensions of first-order Gödel logic enriched by nullary connective or the Baaz's projection connective. In the case of uncountable first-order language wo use the ultraproduct method to derive the compactness theorem. [ABSTRACT FROM AUTHOR]

In the last decade, many studies have used the Internet autonomous system (AS)-level topology to perform several analyses, from discovering its graph properties to assessing its impact on the effectiveness of worm-containment strategies. Yet, the Border Gateway Protocol (BGP) data used to reveal the topologies are far from complete. Our contribution is threefold. First, we analyze BGP data currently gathered by the most famous route collector projects, highlighting and explaining the causes of their incompleteness. We found that large areas of the Internet are not properly captured due to the geographical location of route collector feeders and due to BGP filters, such as export policies and decision processes. Second, we propose a methodology based on a new metric, named p2c-distance, which is able to: 1) identify the minimum number of ASs required to obtain an Internet AS-level topology that is closer to reality; and 2) identify a ranking list of these ASs to show that it is possible to obtain nonnegligible coverage improvements with a limited number of appropriately chosen feeding ASs. Third, we characterize the ASs that were found to be part of the solution of the above covering problems. We found that the route collectors are rarely connected to these ASs, thus highlighting that much effort is needed to devise a route collector infrastructure that ideally would be able to capture a complete view of the Internet. [ABSTRACT FROM PUBLISHER]

Faulty samples are much harder to acquire than normal samples, especially in complicated systems. This leads to incompleteness for training sample types and furthermore a decrease of diagnostic accuracy. In this paper, the relationship between sample-type incompleteness and the classifier-based diagnostic accuracy is discussed first. Then, a support vector data description-based approach, which has taken the effects of sample-type incompleteness into consideration, is proposed to refine the construction of fault regions and increase the diagnostic accuracy for the condition of incomplete sample types. The effectiveness of the proposed method was validated on both a Gaussian distributed dataset and a practical dataset. Satisfactory results have been obtained. [ABSTRACT FROM AUTHOR]

In this paper, we study a kind of effective preconditioning technique, which interleaves the incomplete Cholesky (IC) factorization with an approximate minimum degree ordering. An IC factorization algorithm derived from IKJ-version Gaussian elimination is proposed and some details on implementation are presented. Then we discuss the ways to compute the degrees of the unnumbered nodes exactly and approximately using the concept of element absorbing. When used in conjunction with conjugate gradient algorithm, the new preconditioners usually lead to fast convergence. The numerical experiments show that the interleaving of symbolic ordering and numerical IC factorization will generate better preconditioners than those generated by the IC factorization without ordering or with purely symbolic ordering ahead of the factorization. [ABSTRACT FROM AUTHOR]

Conventionalism about mathematics claims that mathematical truths are true by linguistic convention. This is often spelled out by appealing to facts concerning rules of inference and formal systems, but this leads to a problem: since the incompleteness theorems we've known that syntactic notions can be expressed using arithmetical sentences. There is serious prima facie tension here: how can mathematics be a matter of convention and syntax a matter of fact given the arithmetization of syntax? This challenge has been pressed in the literature by Hilary Putnam and Peter Koellner. In this paper I (i) sketch a conventionalist theory of mathematics, (ii) show that this conventionalist theory can meet the challenge just raised (this is done by considering how arithmetical coding works in non-standard models of arithmetic), and (iii) clarify the type of mathematical pluralism endorsed by the conventionalist by introducing the notion of a semantic counterpart. The paper's aim is an improved understanding of conventionalism, pluralism, and the relationship between them. [ABSTRACT FROM AUTHOR]

Data incompleteness and inconsistency are common issues in data-driven decision models. To some extend, they can be considered as two opposite circumstances, since the former occurs due to lack of information and the latter can be regarded as an excess of heterogeneous information. Although these issues often contribute to a decrease in the accuracy of the model, most modeling approaches lack of mechanisms to address them. This research focuses on an advanced belief rule-based decision model and proposes a dynamic rule activation (DRA) method to address both issues simultaneously. DRA is based on “smart” rule activation, where the actived rules are selected in a dynamic way to search for a balance between the incompleteness and inconsistency in the rule-base generated from sample data to achive a better performance. A series of case studies demonstrate how the use of DRA improves the accuracy of this advanced rule-based decision model, without compromising its efficiency, especially when dealing with multi-class classification datasets. DRA has been proved to be beneficial to select the most suitable rules or data instances instead of aggregating an entire rule-base. Beside the work performed in rule-based systems, DRA alone can be regarded as a generic dynamic similarity measurement that can be applied in different domains. [ABSTRACT FROM PUBLISHER]

Trygve Haavelmo’s Probability Approach aimed to implement economic theories, but he later recognized their incompleteness. Although he did not explicitly consider model selection, we apply it when theory-relevant variables, {Xt}, are retained without selection while selecting other candidate variables, {Wt}. Under the null that the {Wt} are irrelevant, by orthogonalizing with respect to the {Xt}, the estimator distributions of the Xt’s parameters are unaffected by selection even for more variables than observations and for endogenous variables. Under the alternative, when the joint model nests the generating process, an improved outcome results from selection. This implements Haavelmo’s program relatively costlessly. [ABSTRACT FROM AUTHOR]

We report on the development of a mathematical model of social uncertainty relations to replace traditional models of the interaction, as well as a model of complexity from econophysics. Our goal with this mathematics is to control hybrid teams, firms and systems (i.e., where "hybrids" are arbitrary combinations of humans, robots and machines). But uncertainty is created by states of interdependence between social objects: at one extreme, interdependence reduces to independence between agents, producing rational but asocial effects; at the other extreme, interdependence de-individuates a group's members until individual identity dissolves into a group (e.g., strong cults, mobs, gangs, and well-run teams and firms). In other studies, we have reviewed the structure of teams; in this report, we focus on how interdependence impedes efforts at direct control by making meaning incomplete. We begin with bistability to simplify interdependence, and generalize to full interdependence. [ABSTRACT FROM AUTHOR]

Examples suggest that one and the same A may be different Bs, and hence that there is some sort of incompleteness in the unqualified statement that x and y are the same which needs to be eliminated by answering the question 'the same what?' One way to make this more precise is by appeal to Geach's idea that identity is relative. In this paper I evaluate Geach's relative identity thesis. [ABSTRACT FROM AUTHOR]

We suggest an efficient method for finding the incomplete Belitskii normal form of a Hamiltonian system with many degrees of freedom and with a quasihomogeneous unperturbed part of special form. In particular, we obtain closed-form expressions for the incomplete Belitskii normal forms of two-degree-of-freedom Hamiltonian systems with unperturbed Hamiltonian of the form $h_1 x_1^{l_1 } y_1^{m_1 } + h_2 x_2^{l_2 } y_2^{m_2 } $. [ABSTRACT FROM AUTHOR]

A new method is proposed to solve multiple criteria group decision making (MCGDM) problems, in which both the criteria values and criteria weights take the form of linguistic information, and the information about linguistic criteria weights is partly known or completely unknown. Firstly, to get reasonable decision result, instead of assigning the same weight to the decision maker (DM) for all criteria, we propose a method to determine the weight of DM with respect to each criterion under linguistic environment by calculating the similarity degree between individual 2-tuple linguistic evaluation value and the mean given by all decision makers (DMs). Secondly, for the situations where the information about the criteria weights is partly known or completely unknown, we establish optimization models to determine the criteria weights by defining 2-tuple linguistic positive ideal solution (TL-PIS), 2-tuple linguistic right negative ideal solution (TL-RNIS) and 2-tuple linguistic left negative ideal solution (TL-LNIS) of the collective 2-tuple linguistic decision matrix. Thirdly, we propose a new method to solve MCGDM problems with partly known or completely unknown linguistic weight information. Finally, an illustrative example is given to demonstrate the calculation process of the proposed method. [ABSTRACT FROM AUTHOR]

The historical development of the famous Einstein formula $$E=mc^{2}$$ is briefly discussed. In this paper, on the basis of the Einstein viewpoint a new general approach is proposed for demonstrating the correctness of the formula $$E=mc^{2}$$ . It is can be seen that the generalized approach leads to Einstein's famous formula, too. During recent years, various papers have been published concerning the incompleteness of this famous formula. It is demonstrated that the presented claims in these articles are not mathematically legitimate. It is clear that there are still some important misunderstandings concerning the interpretation of Einstein's mass-energy equivalence formula. [ABSTRACT FROM AUTHOR]

Abstract: A significant effort by researchers has advanced the ability of computers to understand, index and annotate images. This entails automatic domain specific knowledge-base (KB) construction and metadata extraction from visual information and any associated textual information. However, it is challenging to fuse visual and textual information and build a complete domain-specific KB for image annotation due to several factors such as: the ambiguity of natural language to describe image features; the semantic gap when using image features to represent visual content and the incompleteness of the metadata in the KB. Typically the KB is based upon a domain specific Ontology. However, it is not an easy task to extract the data needed from annotations and images, and then to automatically process these and transform them into an integrated Ontology model, because of the ambiguity of terms and because of image processing algorithm errors. As such, it is difficult to construct a complete KB covering a specific domain of knowledge. This paper presents a Multi-Modal Incompleteness Ontology-based (MMIO) system for image retrieval based upon fusing two derived indices. The first index exploits low-level features extracted from images. A novel technique is proposed to represent the semantics of visual content, by restructuring visual word vectors into an Ontology model by computing the distance between the visual word features and concept features, the so called concept range. The second index relies on a textual description which is processed to extract and recognise the concepts, properties, or instances that are defined in an Ontology. The two indexes are fused into a single indexing model, which is used to enhance the image retrieval efficiency. Nonetheless, this rich index may not be sufficient to find the desired images. Therefore, a Latent Semantic Indexing (LSI) algorithm is exploited to search for similar words to those used in a query. As a result, it is possible to retrieve images with a query using (similar) words that do not appear in the caption. The efficiency of the KB is validated experimentally with respect to three criteria, correctness, multimodality, and robustness. The results show that the multi-modal metadata in the proposed KB could be utilised efficiently. An additional experiment demonstrates that LSI can handle an incomplete KB effectively. Using LSI, the system can still retrieve relevant images when information in the Ontology is missing, leading to an enhanced retrieval performance. [Copyright &y& Elsevier]

For the sake of gaining competitive advantages, it is important to evaluate the satisfaction level of a product or service from the users? perspective. This can be done by investigating the relationship among customer attributes (customer requirements) and design attributes (product configurations). However, such relationship would be highly non-linear in nature. In this regard, many approaches have been proposed over traditional linear methods. Particularly, the Adaptive Neuro-Fuzzy Inference System (ANFIS) method has been prevalently utilized in modeling such vague and complex relationship among these attributes and evaluating user satisfaction towards certain products or services. Despite the fact that the ANFIS method can explicitly model the non-linear relation among these attributes, it may be restricted if uncertain information can be observed due to subjectivity and incompleteness. To overcome these limitations, a belief rule base (BRB) approach with evidential reasoning (ER) is applied in this paper. For justification purpose, both the ANFIS and BRB methods are applied to the same case. Comparison results indicate that the BRB is capable of minimizing the human biases in evaluating user satisfaction and rectifying the inappropriateness associated with the ANFIS method. Also, the BRB method can generate more rational and informative evaluation results. [ABSTRACT FROM AUTHOR]

It is widely considered that Gödel's and Rosser's proofs of the incompleteness theorems are related to the Liar Paradox. Yablo's paradox, a Liar-like paradox without self-reference, can also be used to prove Gödel's first and second incompleteness theorems. We show that the situation with the formalization of Yablo's paradox using Rosser's provability predicate is different from that of Rosser's proof. Namely, by using the technique of Guaspari and Solovay, we prove that the undecidability of each instance of Rosser-type formalizations of Yablo's paradox for each consistent but not Σ-sound theory is dependent on the choice of a standard proof predicate. [ABSTRACT FROM AUTHOR]

In a recent paper (Cieśliński and Urbaniak 2012), Urbaniak and Cieśliński describe an analogue of the Yablo Paradox, in the domain of formal provability. Just as the infinite sequence of Yablo sentences inherit the paradoxical behavior of the liar sentence, an infinite sequence of sentences can be constructed that inherit the distinctive behavior of the Gödel sentence. This phenomenon-the transfer of the properties of self-referential sentences of formal mathematics to their 'unwindings' into infinite sequences of sentences-suggests a number of interesting logical questions. The purpose of this paper is to give a precise statement of a conjecture from Cieśliński and Urbaniak (2012) regarding the unwinding of the Rosser sentence, and to demonstrate that this precise statement is false. We begin with some preliminary motivation, introduce the conjecture against the background of some related results, and finally, in the last section, move on to the proof, which adapts a method used by Solovay and Guaspari. [ABSTRACT FROM AUTHOR]

A formalization of Gödel’s incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows Świerczkowski (2003), who gave a detailed proof using hereditarily finite set theory. The adoption of this theory is generally beneficial, but it poses certain technical issues that do not arise for Peano arithmetic. The formalization itself should be useful to logicians, particularly concerning the second incompleteness theorem, where existing proofs are lacking in detail. [ABSTRACT FROM PUBLISHER]

The famous Gödel incompleteness theorem states that for every consistent, recursive, and sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but how can we obtain them? One classical (and well studied) approach is to add to some theory T an axiom that claims the consistency of T. In this paper we discuss another approach motivated by Chaitin's version of Gödel's theorem where axioms claiming the randomness (or incompressibility) of some strings are probabilistically added, and show that it is not really useful, in the sense that this does not help us prove new interesting theorems. This result answers a question recently asked by Lipton. The situation changes if we take into account the size of the proofs: randomly chosen axioms may help making proofs much shorter (unless ). We then study the axiomatic power of the statements of type “the Kolmogorov complexity of x exceeds n” (where x is some string, and n is some integer) in general. They are (universally quantified) statements of Peano arithmetic. We show that by adding all true statements of this type, we obtain a theory that proves all true -statements, and also provide a more detailed classification. In particular, as Theorem 7 shows, to derive all true -statements it is enough to add one statement of this type for each n (or even for infinitely many n) if strings are chosen in a special way. On the other hand, one may add statements of this type for most x of length n (for every n) and still obtain a weak theory. We also study other logical questions related to “random axioms”. Finally, we consider a theory that claims Martin-Löf randomness of a given infinite binary sequence. This claim can be formalized in different ways. We show that different formalizations are closely related but not equivalent, and study their properties. [ABSTRACT FROM AUTHOR]

Analytically obtained mode shapes do not match with those of the experimental results due to external noise, including modeling and measurement errors. This inconsistency can pose significant difficulties for the subsequent analysis and design. It is impractical to collect the data for the full set of degrees of freedom (DOFs) of a dynamic system. The incomplete data set should be expanded to the full data set. This work provides a method to correct the analytical mode shapes to match the measured modes. We present the updated forms of the parameter matrices based on the estimated mode shape data. A numerical example illustrates the validity of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper we provide a global description in quantitative terms, of the developments in road safety research from the early 1900's until 2010. To this end, electronic databases have been searched and papers matching search criteria were selected for analysis. Word and co-word frequencies of key-words in all the titles and abstracts of these publications were collected and analysed. In this study, we explored the possibility to identify historical trends in road safety research topics. Furthermore we explored whether the important paradigms concerning the history of road safety research as presented in the literature can be confirmed on quantitative grounds. It is concluded that the first results are promising: varying trends over time could be identified in the selected topics, which are generally in line with the different road safety paradigms. Finally, a number of limitations of the present study are listed, including the incompleteness of the currently used dataset. [ABSTRACT FROM AUTHOR]

SUMMARY Multireceiver identity (ID) based encryption and ID-based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay-per-view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy-preserving (or anonymous) multireceiver ID-based encryption and ID-based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy-preserving multireceiver ID-based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID-based encryption and ID-based broadcast encryption schemes, the proposed scheme has better performance and robust security. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The budget network design problem and fixed-charge network design problem imply different economic pursuits on travel cost and construction cost and structure these two cost components in different ways. A more general version of these two classic formulations is the biobjective network design problem. This article discusses an exact solution strategy for the biobjective discrete network design problem with equilibrium constraints, which eliminates the inexactness and incompleteness deficiencies pertaining to heuristics or metaheuristics presented in previous research. In particular, we adapted and justified a dichotomic solution framework for the biobjective network design problem, in which the complete solution set of the problem can be exhausted by repeatedly solving a parameterized scalar problem and updating the parameter set. A generalized Benders decomposition method, a widely used solution strategy for nonlinear mixed integer programming problems, is further implemented in the solution framework, which offers an efficient algorithmic tool for solution of the scalar problem. Numerical results obtained from the example problems justify the solution optimality, completeness, and efficiency of the presented solution method. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(4), 286-305 2014 [ABSTRACT FROM AUTHOR]

I argue that three main interpretations of the aim of Russell's early logicism in The Principles of Mathematics (1903) are mistaken, and propose a new interpretation. According to this new interpretation, the aim of Russell's logicism is to show, in opposition to Kant, that mathematical propositions have a certain sort of complete generality which entails that their truth is independent of space and time. I argue that on this interpretation two often-heard objections to Russell's logicism, deriving from Gödel's incompleteness theorem and from the non-logical character of some of the axioms of Principia Mathematica respectively, can be seen to be inconclusive. I then proceed to identify two challenges that Russell's logicism, as presently construed, faces, but argue that these challenges do not appear unanswerable. [ABSTRACT FROM AUTHOR]

Highlights: [•] A fast method for computing necessarily optimal solutions is developed. [•] Four kinds of elicitation criterions for one time elicitation are explored. [•] Idea of expected elicitation times is used in one elicitation criterion. [•] A system is built to implement the proposed elicitation criterions. [Copyright &y& Elsevier]