ppxscal/embedding_network huggingface dataset:
An evaluation of the FCT method for high-speed flows on structured overlapping grids
Authors: J. W. Banks, W. D. Henshaw, J. N. Shadid
Venue: Journal of Computational Physics (2009)

This study considers the development and assessment of a flux-corrected transport (FCT) algorithm for simulating high-speed flows on structured overlapping grids. This class of algorithm shows promise for solving some difficult highly-nonlinear problems where robustness and control of certain features, such as maintaining positive densities, is important. Complex, possibly moving, geometry is treated through the use of structured overlapping grids. Adaptive mesh refinement (AMR) is employed to ensure sharp resolution of discontinuities in an efficient manner. Improvements to the FCT algorithm are proposed for the treatment of strong rarefaction waves as well as rarefaction waves containing a sonic point. Simulation results are obtained for a set of test problems and the convergence characteristics are demonstrated and compared to a high-resolution Godunov method. The problems considered are an isolated shock, an isolated contact, a modified Sod shock tube problem, a two-shock Riemann problem, the Shu-Osher test problem, shock impingement on single cylinder, and irregular Mach reflection of a strong shock striking an inclined plane.
Multi-criteria decision evaluation in groundwater zones identification in Moyale-Teltele subbasin, South Ethiopia
Authors: K. S. R. Murthy, Abiy Gatachew Mamo
Venue: International Journal of Remote Sensing (2009)

The conventional approaches such as ground-based surveys and exploratory drilling for groundwater investigation are time-consuming and uneconomical. Systematic organisation of data of characteristics of any terrain, evaluation of inter-thematic, interclass dependencies and variability, and also analysing cumulative effect on the development of groundwater regime is the best approach which the current decade requires. This is proved by generation of the thematic information on the above factors through remote sensing technique, and integration in geographic information system (GIS) for evaluation using multi-criteria decision-making techniques. This paper presents the results of the attempt made to identify the groundwater potential zones in the Moyale-Teltele Sub basin of the Genale Dawa River Basin in South Ethiopia using the integrated approaches of remote sensing and geographic information systems. Six geologic, physiographic, and hydrologic factors were applied namely: lithology, structure, geomorphology, slope, land cover, and drainage. Weighted Overlay Analysis using multicriteria decision technique is implemented to produce the groundwater potential map of the area. This result is further verified by groundwater yield data of boreholes and springs collected in the field and from previous reports. The validation revealed that the result is in good conformity with the actual yield of the wells and springs.
DLB: a novel real-time QoS control mechanism for multimedia transmission
Authors: Jian Li, Ye-Qiong Song
Venue: International Journal of High Performance Computing and Networking (2009)

This paper presents a new real-time Quality of Service (QoS) scheme, called Relaxed (m, k)-firm, for multimedia flow transmission which can tolerate occasional packet drops. In contrast to traditional real-time constraint, Relaxed (m, k)-firm requires the transmission delay constraint on a group of any k consecutive packets instead of imposing a transmission delay constraint per packet. Due to this relaxation, this novel scheme can achieve high resource utilisation. A new traffic control mechanism, called Double-Leaks Bucket (DLB), is also proposed to selectively drop a proportion of packets in case of network congestion while still guaranteeing the R-(m, k)-firm constraint.
Instruction-Based Online Periodic Self-Testing of Microprocessors with Floating-Point Units
Authors: George Xenoulis, Dimitris Gizopoulos, Mihalis Psarakis, Antonis Paschalis
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Online periodic testing of microprocessors is a valuable means to increase the reliability of a low-cost system, when neither hardware nor time redundant protection schemes can be applied. This is particularly valid for floating-point (FP) units, which are becoming more common in embedded systems and are usually protected from operational faults through costly hardware redundant approaches. In this paper, we present scalable instruction-based self-test program development for both single and double precision FP units considering different instruction sets (MIPS, PowerPC, and Alpha), different microprocessor architectures (32/64-bit architectures) and different memory configurations. Moreover, we introduce bit-level manipulation instruction sequences that are essential for the development of FP unit's self-test programs. We developed self-test programs for single and double precision FP units on 32-bit and 64-bit microprocessor architectures and evaluated them with respect to the requirements of low-cost online periodic self-testing: fault coverage, memory footprint, execution time, and power consumption, assuming different memory hierarchy configurations. Our comprehensive experimental evaluations reveal that the instruction set architecture plays a significant role in the development of self-test programs. Additionally, we suggest the most suitable self-test program development approach when memory footprint or low power consumption is of paramount importance.
Operations Research Methods for Autonomic Resource Management
Authors: Ramy Farha, Alberto Leon-Garcia
Venue: Journal of Network and Systems Management (2009)

Varying service demands on next generation networks requires autonomic resource management capabilities to ensure service delivery to customers, motivating the need to develop self-managing algorithms for this purpose. In this paper, we use algorithms from the Operations Research community for this purpose. First, we adapt the Transportation Model to manage distributed resources in the next generation network infrastructure. Coupled with monitoring capabilities, the proposed scheme can automatically adjust the virtual resource allocation to optimize the costs incurred by service providers in offering services to customers. Second, we propose the use of Inventory Control to predict needs for virtual resources and to pre-order required virtual resource amounts. We compare two possible Inventory Control models to manage the virtual resources involved in service delivery. We perform extensive simulations to show the performance improvements made possible by the use of the Transportation Model and Inventory Control for autonomic resource management in next generation networks.
An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays
Authors: Abdullah Konak, Sadan Kulturel-Konak
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

The network design problem with relays (NDPR) arises in many real-life telecommunication and supply chain networks. Similar to the multi-commodity network design problem, a set of commodities is given, and each commodity k is to be routed through single path from the source node s(k) to the sink node t(k). However, an upper bound ¿ is imposed on the distance that a commodity k can travel on the path from the source node s(k) to the sink node t(k) without visiting special nodes, called relays. For example, in digital telecommunication networks, relays represent points where attenuated communication signals are regenerated. A fixed cost of fi is incurred when a node i is dedicated as a relay, and each edge (i, j) has an installation cost of ci,j and a length of di,j. The NDPR is defined as selecting a set of edges from a given set of candidate edges and determining relay nodes to minimize the network design cost while making sure that each commodity k is routed through a single path on which the distances between the node s(k) and the first relay, between any consecutive relays, and between the last relay and the node t(k) are less than the upper bound ¿.
Display Blindness: The Effect of Expectations on Attention towards Digital Signage
Authors: Jörg Müller, Dennis Wilmsmann, Juliane Exeler, Markus Buzeck, Albrecht Schmidt, Tim Jay, Antonio Krüger
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

In this paper we show how audience expectations towards what is presented on public displays can correlate with their attention towards these displays. Similar to the effect of Banner Blindness on the Web, displays for which users expect uninteresting content (e.g. advertisements) are often ignored. We investigate this effect in two studies. In the first, interviews with 91 users at 11 different public displays revealed that for most public displays, the audience expects boring advertisements and so ignores the displays. This was exemplified by the inclusion of two of our own displays. One, the iDisplay, which showed information for students, was looked at more often than the other (MobiDiC) which showed coupons for shops. In a second study, we conducted repertory grid interviews with 17 users to identify the dimensions that users believe to influence whether they look at public displays. We propose possible solutions to overcome this "Display Blindness" and increase audience attention towards public displays.
Pseudo-equivalence of fuzzy PID controllers
Authors: Constantin Volosencu
Venue: WSEAS Transactions on Systems and Control (2009)

This paper presents a pseudo-equivalence of digital fuzzy PID controllers with linear PID controllers in the continuous time domain. Transfer functions and equivalence relations between controller's parameters are obtained for the common structures of the fuzzy PID controllers. The pseudo-equivalence is made using a graphic analytical analysis based on the input-output transfer characteristics of the fuzzy block, the linear characteristic of the fuzzy block around the origin and the usage of the gain in origin obtained as an origin limit of the variable gain of the fuzzy block. An algorithm of equivalence is presented. The paper presents a unitary theory, which may be applied to the most general fuzzy PID controllers, developed using all kind of membership functions, rule bases, inference methods and defuzzification methods. The term "pseudoequivalence" is emphasized because there is no straight equivalence between the non-linear fuzzy controllers and the linear PID controllers. A case study of a control system using linear and fuzzy controllers is presented. The action mode of the fuzzy controller is analyzed. Based on the transient characteristics a comparison analyses is done. Better control quality criteria are demonstrated for control systems using fuzzy controllers.
Application of Multi-objective Particle Swarm Optimization Algorithm in Integrated Marketing Method Selection
Authors: Qiwan Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Through multi-particle swarm optimization algorithm, this paper is aimed to solving the optimization problems of multi-production and multi-marketing strategy selection during the process of integrated marketing. In order to achieve benefit maximization, the fittest marketing method should be put in place into the marketing promotion of each product, which in fact is the problem of multi-objective optimization decision. During the optimization process, first of all, convert discrete variable into continuous variable through the equivalent probability matrix, then update particle swarm and normalize particle position, and finally complete the selection of particle individual extremum and the global extremum through decoding and fitness computing. The simulation results for the practical problem through this method show that the investment and rationalized distribution of marketing methods can obtain better expected benefits. The conclusion is that multi-objective particle swarm optimization algorithm is an effective method for solving the optimization allocation of products and marketing methods during the process of integrated marketing.
An Online Self-constructing Fuzzy Neural Network with Restrictive Growth
Authors: Ning Wang, Xianyao Meng, Meng Joo Er, Xinjie Han, Song Meng, Qingyang Xu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In this paper, a novel paradigm, termed online self constructing fuzzy neural network with restrictive growth (OSFNNRG) which incorporates a pruning strategy into new growth criteria, is proposed. The proposed growing procedure without pruning not only speeds up the online learning process but also results in a more parsimonious fuzzy neural network while comparable performance and accuracy can be achieved by virtue of the growing and pruning mechanism. The OSFNNRG starts with no hidden neurons and parsimoniously generates new hidden units according to the proposed growth criteria as learning proceeds. In the parameter learning phase, all the free parameters of hidden units, regardless of whether they are newly created or originally existing, are updated by the extended Kalman filter (EKF) method. The performance of the OSFNNRG algorithm is compared with other popular approaches like OLS, RBF-AFS, DFNN and GDFNN in nonlinear dynamic system identification. Simulation results demonstrate that the learning speed of the proposed OSFNNRG algorithm is faster and the network structure is more compact with comparable generalization performance and accuracy.
Sustaining Online Collaborative Problem Solving with Math Proposals
Authors: Gerry Stahl
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Learning takes place over long periods of time that are hard to study directly. Even the learning experience involved in solving a challenging math problem in a collaborative online setting can be spread across hundreds of utterances during an hour or more. Such long-term interactions are constructed out of utterance-level interactions, such as the strategic proposing of a next step. This paper identifies a pattern of exchange of utterances that it terms math proposal adjacency pair, and describes its characteristics. Drawing on the methodology of conversation analysis, the paper adapts this approach to mathematical problem-solving communication and to the computer-mediated circumstances of online chat. In particular, a failed proposal is contrasted with successful proposals in the log of an actual chat. Math proposal adjacency pairs constitute the collaborative group as a working group, give direction to their problem solving and help to sustain their interaction.
Agents with Anticipatory Behaviors: To be Cautious in a Risky Environment
Authors: Cristiano Castelfranchi, Rino Falcone, Michele Piunti
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This work presents some anticipatory mechanisms in an agent architecture, modeling affective behaviours as effects of surprise. Through experiment discussion, the advantages of becoming cautious are presented and is shown how this approach increases not only opportunism and reactivity but also anticipatory capabilities for planning and reasoning. Cautious agents outcomes are analyzed in risky surroundings both on the basis of the environment features and of the internal model of caution. Expectation-driven and caution enabled agents are designed with the BDI paradigm.
Taking into account the variability of the knowledge structure in Bayesian student models
Authors: Mathieu Hibou
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Bayesian belief networks have been widely used in student and user modelling. Their construction is the main difficulty for their use in student modelling. The choices made about their structures (especially the arcs orientation) have consequences in terms of information circulation. The analysis we present here is that the network structure depends on the expertise level of the student. Consequently, the evolution of the network should not only be numerical (update of the probabilities) but also structural. Hence, we propose a model constituted of different networks in order to take into account these evolutions.
A service measurement framework for adaptive applications, adaptive infrastructures, and rapid problem diagnosis
Authors: Gregory Brewster
Venue:  (2006)

Since the beginning of computer-based application development and implementation, the provision of stable application system performance has been and continues to be a significant and problematic issue. Poor performance is frequently a source of end user dissatisfaction and reflects on the entire quality of service delivered by IT. Maintaining stable application performance requires an effective ongoing management process that begins with accurate and objective measurements: including measurements of resource usage, application workload activity, and the service or response time delivered. However, end-to-end and component service measurements are not currently part of most Client/Server and Web application architectures. To address the issues described above, we develop a framework for end-to-end and component response time measurement, establish a flexible service measurement infrastructure/tool-set called ARTMS (Application Response Time Management System), and evaluate three uses of service measurement information. We make the following specific research contributions: (1) Design and implement end-to-end transaction and component correlation using a self-identifying tagged (embedded) packet based correlation communication. We consider multiple alternative designs, implement, and measure results. (2) Design, implement and test a class of adaptive algorithms that respond to service measurement feedback using potential extensions to the ARM API to facilitate communication between the application and the infrastructure. (3) Design, implement and test several new algorithms for rapid problem diagnosis using service and resource measurement feedback. In summary, this research examines and develops a standard methodology based upon the ARM (Application Response Measurement) API to implement ubiquitous end-to-end and component service measurements. Moreover, this research evaluates the methodology's effectiveness by exploring three exploitations of the measurements: Adaptive Applications, Adaptive Infrastructures, and Rapid Performance Problem Diagnosis.
Modelling Australian interest rate swap spreads by mixture autoregressive conditional heteroscedastic processes
Authors: W. S. Chan, C. S. Wong, A. H. L. Chung
Venue: Mathematics and Computers in Simulation (2009)

The observed difference between the swap rate and the government bond yield of corresponding maturity is known as the swap spread. The swap spread reflects the risk premium that is involved in a swap transaction instead of holding risk-free government bonds. It is primarily composed of the liquidity risk premium and the credit risk premium. In recent years there has been growing interest in modelling swap spreads because the swap spread is the key pricing variable for the swap rate. The Australian interest rate swap market is the most important over-the-counter (OTC) derivative market in Australia. In this paper we apply the class of mixture autoregressive conditional heteroscedastic (MARCH) models to three (3-year, 5-year and 10-year) swap spread series in Australia. The MARCH model is able to capture both of the stylised characteristics of the observed changes of the swap spread series: volatility persistence and the dependence of volatility on the level of the data. The proposed MARCH model also allows for regime switches in the swap spreads.
Using Partial Reference Alignments to Align Ontologies
Authors: Patrick Lambrix, Qiang Liu
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

In different areas ontologies have been developed and many of these ontologies contain overlapping information. Often we would therefore want to be able to use multiple ontologies. To obtain good results, we need to find the relationships between terms in the different ontologies, i.e. we need to align them.Currently, there already exist a number of ontology alignment systems. In these systems an alignment is computed from scratch. However, recently, some situations have occurred where a partial reference alignment is available, i.e. some of the correct mappings between terms are given or have been obtained. In this paper we investigate whether and how a partial reference alignment can be used in ontology alignment. We use partial reference alignments to partition ontologies, to compute similarities between terms and to filter mapping suggestions. We test the approaches on previously developed gold standards and discuss the results.
Modular Verification of Strongly Invasive Aspects
Authors: Emilia Katz, Shmuel Katz
Venue: Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday (2009)

An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of any particular base program to which they may be woven. Such aspects can change the underlying base program variables to new states, and after the aspect advice has completed, the base program code continues from states that were previously unreachable. The needed changes in the MAVEN model checker are described, and the soundness of the verification method is proven. An example is shown of its application to aspects that provide various bonus points to student grading programs.
The impact of Al interfacial layer on resistive switching of La0.7Sr0.3MnO3 for reliable ReRAM applications
Authors: Joonmyoung Lee, Hyejung Choi, Dong-jun Seong, Jaesik Yoon, Jubong Park, Seungjae Jung, Wootae Lee, Man Chang, Chunhum Cho, Hyunsang Hwang
Venue: Microelectronic Engineering (2009)

To acquire the reliable switching properties for ReRAM applications, we investigated the effect of Al interfacial layer on La"0"."7Sr"0"."3MnO"3 resistive switching. Using impedance spectroscopy method, we verified that the switching was induced by the change of Mn-O bonding chains by modulating the oxygen vacancies at top oxygen deficient layer, not the AlO"x formation. The device under nano-scale showed excellent retention properties at 125^oC and pulse switching endurance. Additionally, the good uniformity and yield properties under 4in. wafer were confirmed for the mass production.