Multi-Objective Optimization using Grid Computing

This paper analyzes some technical and practical issues concerning the use of parallel systems to solve multi-objective optimization problems using enumerative search. This technique constitutes a conceptually simple search strategy, and it is based on evaluating each possible solution from a given finite search space. The results obtained by enumeration are impractical for most computer platforms and researchers, but they exhibit a great interest because they can be used to be compared against the values obtained by stochastic techniques. We analyze here the use of a grid computing system to cope with the limits of enumerative search. After evaluating the performance of the sequential algorithm, we present, first, a parallel algorithm targeted to multiprocessor systems. Then, we design a distributed version prepared to be executed on a federation of geographically distributed computers known as a computational grid. Our conclusion is that this kind of systems can provide to the community with a large and precise set of Pareto fronts that would be otherwise unknown.     

Temporal Bayesian Knowledge Bases – Reasoning about uncertainty with temporal constraints

Time is ubiquitous. Accounting for time and its interaction with change is crucial to modeling the dynamic world, especially in domains whose study of data is sensitive to time such as in medical diagnosis, financial investment, and natural language processing, to name a few. We present a framework that incorporates both uncertainty and time in its reasoning scheme. It is based on an existing knowledge representation called Bayesian Knowledge Bases. It provides a graphical representation of knowledge, time and uncertainty, and enables probabilistic and temporal inferencing. The reasoning scheme is probabilistically sound and the fusion of temporal fragments is well defined. We will discuss some properties of this framework and introduce algorithms to ensure groundedness during the construction of the model. The framework has been applied to both artificial and real world scenarios.     

Benders decomposition for the uncapacitated multiple allocation hub location problem

In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported on links established between hubs, being then splitted and delivered to its final destination. Systems with this sort of topology are named hub-and-spoke (HS) systems or hub-and-spoke networks. They are designed to exploit the scale economies attainable through the shared use of high capacity links between hubs. Therefore, the problem is to find the least expensive HS network, selecting hubs and assigning traffic to them, given the demands between each origin–destination pair and the respective transportation costs. In the present paper, we present efficient Benders decomposition algorithms based on a well known formulation to tackle the UMAHLP. We have been able to solve some large instances, considered ‘out of reach’ of other exact methods in reasonable time.     

Overlapping melodic alarms are almost indiscriminable

OBJECTIVE: We explore how accurately and quickly nurses can identify melodic medical equipment alarms when no mnemonics are used, when alarms may overlap, and when concurrent tasks are performed. BACKGROUND: The international standard IEC 60601-1-8 (International Electrotechnical Commission, 2005) has proposed simple melodies to distinguish seven alarm sources. Previous studies with nonmedical participants reveal poor learning of melodic alarms and persistent confusions between some of them. The effects of domain expertise, concurrent tasks, and alarm overlaps are unknown. METHOD: Fourteen intensive care and general medical unit nurses learned the melodic alarms without mnemonics in two sessions on separate days. In the second half of Day 2 the nurses identified single alarms or pairs of alarms played in sequential, partially overlapping, or nearly completely overlapping configurations. For half the experimental blocks nurses performed a concurrent mental arithmetic task. RESULTS: Nurses' learning was poor and was no better than the learning of nonnurses in a previous study. Nurses showed the previously noted confusions between alarms. Overlapping alarms were exceptionally difficult to identify. The concurrent task affected response time but not accuracy. CONCLUSION: Because of a failure of auditory stream segregation, the melodic alarms cannot be discriminated when they overlap. Directives to sequence the sounding of alarms in medical electrical equipment must be strictly adhered to, or the alarms must redesigned to support better auditory streaming. APPLICATION: Actual or potential uses of this research include the implementation of IEC 60601-1-8 alarms in medical electrical equipment.     

Design and behavior study of a grammar-guided genetic programming algorithm for mining association rules

This paper presents a proposal for the extraction of association rules called G3PARM (Grammar-Guided Genetic Programming for Association Rule Mining) that makes the knowledge extracted more expressive and flexible. This algorithm allows a context-free grammar to be adapted and applied to each specific problem or domain and eliminates the problems raised by discretization. This proposal keeps the best individuals (those that exceed a certain threshold of support and confidence) obtained with the passing of generations in an auxiliary population of fixed size n. G3PARM obtains solutions within specified time limits and does not require the large amounts of memory that the exhaustive search algorithms in the field of association rules do. Our approach is compared to exhaustive search (Apriori and FP-Growth) and genetic (QuantMiner and ARMGA) algorithms for mining association rules and performs an analysis of the mined rules. Finally, a series of experiments serve to contrast the scalability of our algorithm. The proposal obtains a small set of rules with high support and confidence, over 90 and 99% respectively. Moreover, the resulting set of rules closely satisfies all the dataset instances. These results illustrate that our proposal is highly promising for the discovery of association rules in different types of datasets.     

基于COM的Delphi和Matlab接口编程研究

简要介绍了Delphi与Matlab各自的优缺点,较为全面地列举和分析了二者接口编程的几种方式,重点讨论了Delphi调用Matlab编译生成的COM组件的方法和原理,实现二者的无缝集成.提供的实现过程和应用实例均说明了该方法简便、可操作性强.通过Delphi和Matlab的整合,可以根据实际需要,开发功能强大而且界面友好的软件.     

Simulation of Temperature and Stress Fields during RCC Dam Construction

The worldwide experience in the construction of roller-compacted concrete (RCC) dams together with the use of numerical solutions, allows the simulation of different scenarios in a computer. It is well documented that thermal control is one of the most important problems for RCC dam construction. The dam temperature changes due to the heat produced by the internal hydration of concrete and the environmental boundary conditions influencing the elastic modulus and creep properties of concrete. The construction process was simulated to study how the temperature and stress change during dam construction. The numerical methodology considers the effect of temperature on the elastic modulus and the creep behavior of concrete. A 3D finite-element program was developed to simulate the construction process. An engineering application of this methodology is presented by simulating the construction of an RCC gravity dam in southern China. The results show how the temperature and stress change with the construction process. The results also show that it is feasible to build RCC dams in low temperature seasons without additional temperature control measures.     

Voces abriendo caminos (voices foraging paths): A qualitative study of the career development of notable Latinas.

This study used qualitative methodology to investigate the career development of 20 notable Latinas. The emergent theory proposed that Latina career development is influenced by sociopolitical, cultural, contextual, and personal variables. Results suggested that (a) career paths tended to be unplanned and nonlinear; (b) background variables, socioeconornic status, and educational experiences influenced the participants' sense of self and career motivation; (c) family, culture, and cultural identity werr influential; (d) relational support systems, particularly those that involved extended family, spouses, and mentors, were important; and (e) the participants' optimism, persistence, passion, and capacity for cognitive reframing helped them cope with challenges and remain true to their values, beliefs, and sense of self. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Cadmium-binding protein components of flaxseed: Influence of cultivar and location

The distribution of cadmium-(Cd)-binding components from five flaxseed cultivars grown at three locations in southern Manitoba was investigated to examine genotypic and environmental effects. Three protein fractions with different electrostatic properties, eluting at 0.10, 0.25 and 0.50 M NaCl by ion-exchange chromatography DEAE-Sephacel, represented 12%, 66% and 7% of the bound (extracted) protein, respectively, while 15% of the protein remained unbound. Cadmium and other divalent metal (zinc, copper and calcium) contents of protein fractions were strongly influenced by location. Cultivar differences in protein and cadmium contents of the protein fractions were highly significant. Cadmium and zinc accumulated similarly in the 0.10 and 0.25 M protein fractions at 51% and 40–43%, respectively. Transfer of copper occurred prominently in the 0.50 M fraction while most of the calcium (55%) remained unbound. The distribution of cadmium, zinc, copper and calcium in fractions of flaxseed proteins was strongly influenced by cultivar and location, indicating differences in their accumulation, migration and transfer.