On the complexity of bandwidth allocation in radio networks

We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting  . By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n^1−ε$n^{1-\epsilon }$ (n$n$ being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).     

AVCOL: Availability-aware information aggregation in large distributed systems under uncollaborative behavior

Aggregation of system-wide information in large-scale distributed systems, such as p2p systems and Grids, can be unfairly influenced by nodes that are selfish, colluding with each other, or are offline most of the time. We present AVCOL, which uses probabilistic and gossip-style techniques to provide availability-aware aggregation. Concretely, AVCOL is the first aggregation system that: (1) implements any (arbitrary) global predicate that explicitly specifies any node’s probability of inclusion in the global aggregate, as a mathematical function of that node’s availability (i.e., percentage time online); (2) probabilistically tolerates large numbers of selfish nodes and large groups of colluders; and (3) scales well with hundreds to thousands of nodes. AVCOL uses several unique design decisions: per-aggregation tree construction where nodes are allowed a limited but flexible probabilistic choice of parents or children, probabilistic aggregation along trees, and auditing of nodes both during aggregation as well as in gossip-style (i.e., periodically). We have implemented AVCOL, and we experimentally evaluated it using real-life churn traces. Our evaluation and our mathematical analysis show that AVCOL satisfies arbitrary predicates, scales well, and withstands a variety of selfish and colluding attacks.     

Efficiently solving linear bilevel programming problems using off-the-shelf optimization software

Many optimization models in engineering are formulated as bilevel problems. Bilevel optimization problems are mathematical programs where a subset of variables is constrained to be an optimal solution of another mathematical program. Due to the lack of optimization software that can directly handle and solve bilevel problems, most existing solution methods reformulate the bilevel problem as a mathematical program with complementarity conditions (MPCC) by replacing the lower-level problem with its necessary and sufficient optimality conditions. MPCCs are single-level non-convex optimization problems that do not satisfy the standard constraint qualifications and therefore, nonlinear solvers may fail to provide even local optimal solutions. In this paper we propose a method that first solves iteratively a set of regularized MPCCs using an off-the-shelf nonlinear solver to find a local optimal solution. Local optimal information is then used to reduce the computational burden of solving the Fortuny-Amat reformulation of the MPCC to global optimality using off-the-shelf mixed-integer solvers. This method is tested using a wide range of randomly generated examples. The results show that our method outperforms existing general-purpose methods in terms of computational burden and global optimality.     

A quality evaluation methodology for health-related websites based on a 2-tuple fuzzy linguistic approach

Nowadays, the patients and physicians use the health-related websites as an important information source and, therefore, it is critical the quality evaluation of health- related websites. The quality assessment of health-related websites becomes especially relevant because their use imply the existence of a wide range of threats which can affect people’s health. Additionally, website quality evaluation can also contribute to maximize the exploitation of invested resources by organizations in the development of user-perceived quality websites. But there is not yet a clear and unambiguous definition of the concept of website quality and the debate about quality evaluation on the Web remains open. In this paper, we present a qualitative and user-oriented methodology for assessing quality of health-related websites based on a 2-tuple fuzzy linguistic approach. To identify the quality criteria set, a qualitative research has been carried out using the focus groups technique. The measurement method generates linguistic quality assessments considering the visitors’ judgements with respect to those quality criteria. The combination of the linguistic judgements is implemented without a loss of information by applying a 2-tuple linguistic weighted average operator. This methodology means an improvement on quality evaluation of health websites through the commitment to put users first.     

Characterization of virus replication

New viruses spread faster than ever and current signature based detection do not protect against these unknown viruses. Behavior based detection is the currently preferred defense against unknown viruses. The drawback of behavior based detection is the ability only to detect specific classes of viruses or have successful detection under certain conditions plus false positives. This paper presents a characterization of virus replication which is the only virus characteristic guaranteed to be consistently present in all viruses. Two detection models based on virus replication are developed, one using operation sequence matching and the other using frequency measures. Regression analysis was generated for both models. A safe list is used to minimize false positives. In our testing using operation sequence matching, over 250 viruses were detected with 43 subsequences. There were minimal false negatives. The replication sequence of just one virus detected 130 viruses, 45% of all tested viruses. Our testing using frequency measures detected all test viruses with no false negatives. The paper shows that virus replication can be identified and used to detect known and unknown viruses.     

Dynamics of coupled and uncoupled two-phase flows in a slab mold

Two-phase flows in a mold of a slab caster are studied using water modeling, particle-image velocimetry (PIV), and computational fluid-dynamics techniques. Two-way coupled flows are observed in liquidgas systems, because both phases influence each other’s momentum transfer. In addition to this concept, PIV measurements indicate the existence of structurally coupled flows, where the velocity vectors of both phases observe similar orientations. When the drag forces of the liquid, exerted on the bubbles, exceed a certain value of the inertial forces of the liquid phase, at high mass loads of gas (ratio of mass flow rates of the gas phase and the liquid phase), the flow becomes structurally coupled. These types of flows promote large oscillations of the meniscus level. Two jets, liquid and bubble, were identified; the latter always reported larger angles than the first, independent of the gas load. Thus, a gas-rich jet is located closer to the lower edge of the submerged entry nozzle (SEN) port, and the liquid-rich jet is found above this position. The liquid-jet angle approaches that of the SEN port when the flow becomes structurally coupled. Structurally uncoupled flows report gas jets that follow torrent-type patterns which are well explained using a multiphase fluid-dynamics model. Structurally coupled flows yield gas jets with a continuous pattern.     

Learning Structure from Data and Its Application to Ozone Prediction

In this paper we propose an algorithm for structure learning in predictive expert systems based on a probabilistic network representation. The idea is to have the simplest structure (minimum number of links) with acceptable predictive capability. The algorithm starts by building a tree structure based on measuring mutual information between pairs of variables, and then it adds links as necessary to obtain certain predictive performance. We have applied this method for ozone prediction in México City, where the ozone level is used as a global indicator for the air quality in different parts of the city. It is important to predict the ozone level a day, or at least several hours in advance, to reduce the health hazards and industrial losses that occur when the ozone reaches emergency levels. We obtained as a first approximation a tree-structured dependency model for predicting ozone in one part of the city. We observe that even with only three parameters, its estimations are acceptable.A causal network representation and the structure learning techniques produced some very interesting results for the ozone prediction problem. Firstly, we got some insight into the dependence structure of the phenomena. Secondly, we got an indication of which are the important and not so important variables for ozone forecasting. Taking this into account, the measurement and computational costs for ozone prediction could be reduced. And thirdly, we have obtained satisfactory short term ozone predictions based on a small set of the most important parameters.     

Inductive transfer for learning Bayesian networks

In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with different conditions; or in industrial diagnosis, where there is equipment with similar specifications. In these cases it is common to have plenty of data for some scenarios but very little for others. In order to learn accurate models for rare cases, it is desirable to use data and knowledge from similar cases; a technique known as transfer learning. In this paper we propose an inductive transfer learning method for Bayesian networks, that considers both structure and parameter learning. For structure learning we use conditional independence tests, by combining measures from the target task with those obtained from one or more auxiliary tasks, using a novel weighted sum of the conditional independence measures. For parameter learning, we propose two variants of the linear pool for probability aggregation, combining the probability estimates from the target task with those from the auxiliary tasks. To validate our approach, we used three Bayesian networks models that are commonly used for evaluating learning techniques, and generated variants of each model by changing the structure as well as the parameters. We then learned one of the variants with a small dataset and combined it with information from the other variants. The experimental results show a significant improvement in terms of structure and parameters when we transfer knowledge from similar tasks. We also evaluated the method with real-world data from a manufacturing process considering several products, obtaining an improvement in terms of log-likelihood between the data and the model when we do transfer learning from related products.     

Medical knowledge management for specific hospital departments

Medical knowledge representation and management is concerned with how to organise the often vague clinical experience of medical staff required for computable models. However, few knowledge management and acquisition tools have entered routine use, since such tools are not perceived by physicians as part of the clinical information process. An attempt to partially solve this problem, we identify two key aspects of knowledge representation and management tasks. The first is to adopt a medical knowledge standardisation to provide a consistent terminology control and to simplify the integration between knowledge management tools and the health information system. The second is to establish an effective knowledge acquisition process in specific medical fields by adapting knowledge acquisition tools. Therefore, the main goal of this work is to define computational models and to design mechanisms for the effective acquisition and management of medical knowledge in real-life hospital departments. To this end, we analyse the representation of medical knowledge (based on deep-causal models) and the development of knowledge management tools (based on ontologies), integrated within the information processing activities of the clinical user. Finally, we illustrate its applicability in the Intensive Care Unit and Pediatry scenarios.