ppxscal/embedding_network huggingface dataset:
A Direct Approach to Achieving Maximum Power Conversion in Wind Power Generation Systems
Authors: Y. D. Song, X. H. Yin, Gary Lebby, Liguo Weng
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

A new approach is proposed to achieve maximum wind power conversion by directly controlling wind turbine to operate along the maximum power coefficient curve (PCC). The control design is based on the so called "power coefficient dynamics". It turns out that such dynamics are highly nonlinear and strongly coupled with uncertainties due to the involvement of both rotor dynamics and actuation (pitch) dynamics. Two set of control algorithms based on smooth variable structure control and memory-based control respectively are developed to ensure high precision PCC tracking, leading to high efficient power conversion. The effectiveness of the developed control algorithms are also verified via simulation.
Semantic Associative Search and Space Integration Methods Applied to Semantic Metrics for Multiple Medical Fields
Authors: Yasushi Kiyoki, Minoru Kawamoto
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

Semantic associative search and semantic space integration are promising and significant functions for obtaining appropriate and significant information resources in multimedia database and knowledge base environments. Semantic space creation and integration for semantic associative search are essentially important for realizing advanced semantic associative search environments and synergy effects among different domain fields. This paper presents implementation and application of our semantic associative search and semantic space integration methods to actual medical fields. This implementation realizes a domain-specific semantic associative search and semantic space integration by referring to domain-specific encyclopedias. This paper also shows the feasibility and applicability of the semantic associative search environment with integration of those medical fields. Several experimental results are shown to clarify the feasibility and applicability of the semantic associative search environment in actual medical fields.
Note---Pricing and Inventory Control for a Perishable Product
Authors: Yanzhi Li, Andrew Lim, Brian Rodrigues
Venue: Manufacturing Service Operations Management (2009)

In this note, we study the concurrent determination of pricing and inventory replenishment decisions for a perishable product in an infinite horizon. Demands in consecutive periods are independent and influenced by prices charged in each period. In particular, we treat price as a decision variable to maximize the total discounted profit. We analyze the optimal solution-structure of a two-period lifetime problem and from insights gained in numerical experiments, develop a base-stock/list-price heuristic policy for products with arbitrary fixed lifetimes. Experiments show this policy to be effective.
ASP.NET 3.5 Enterprise Application Development with Visual Studio 2008: Problem Design Solution
Authors: Vincent Varallo
Venue:  (2009)

Aimed at enterprise developers who use Visual Studio 2008, ASP.NET, C#, and SQL Server to deliver business applications, this book focuses on implementing patterns that can be used for real-world solutions. Each chapter establishes a problem, examines which solution will provide the best results, and then demonstrates how to go about executing that solution. The experienced author addresses building a framework for corporate intranet apps, designing the data access layer, implementing the Microsoft exception handling app block, customizing view and reports with Query Builder Control, installing the application, and much more.
An Asymptotic Independence Theorem for the Number of Matchings in Graphs
Authors: Elmar Teufl, Stephan Wagner
Venue: Graphs and Combinatorics (2009)

Let z(G) be the number of matchings (independent edge subsets) of a graph G. For a set M of edges and/or vertices, the ratio $$r_{G}(M) = z(G \setminus M)/z(G)$$represents the probability that a randomly picked matching of G does not contain an edge or cover a vertex that is an element of M. We provide estimates for the quotient $$r_{G}(A \cup B)/(r_{G}(A)r_G(B))$$, depending on the sizes of the disjoint sets A and B, their distance and the maximum degree of the underlying graph G. It turns out that this ratio approaches 1 as the distance of A and B tends to &#x221e;, provided that the size of A and B and the maximum degree are bounded, showing asymptotic independence. We also provide an application of this theorem to an asymptotic enumeration problem related to the dimer-monomer model from statistical physics.
Managing Co-reference Knowledge for Data Integration
Authors: Carlo Meghini, Martin Doerr, Nicolas Spyratos
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

This paper presents a novel model of co-reference knowledge, which is based on the distinction of (i) a model of a common reality, (ii) a model of an agent's opinion about reality, and (iii) a model of agents' opinions if they talk about the same object or not. Thereby it is for the first time possible to describe consistently the evolution of the agent's knowledge and its relative consistency, and to formally study algorithms for managing co-reference knowledge between multiple agents if they have the potential to lead to higher states of consistency, independent from the particular mechanism to recognize co-reference. As an example, a scalable algorithm is presented based on monitoring atomic knowledge increments and an abstract notion of belief ranking. The presented approach has a wide potential to study the formal properties of current methods to find co-reference, and to lead to new methods for the global management of co-reference knowledge.
A Bayesian approach to protein model quality assessment
Authors: Hetunandan Kamisetty, Christopher J. Langmead
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Given multiple possible models b1, b2, ... bn for a protein structure, a common sub-task in in-silico Protein Structure Prediction is ranking these models according to their quality. Extant approaches use MLE estimates of parameters ri to obtain point estimates of the Model Quality. We describe a Bayesian alternative to assessing the quality of these models that builds an MRF over the parameters of each model and performs approximate inference to integrate over them. Hyperparameters w are learnt by optimizing a list-wise loss function over training data. Our results indicate that our Bayesian approach can significantly outperform MLE estimates and that optimizing the hyper-parameters can further improve results.
Estimation of Rock Mass Rating System with an Artificial Neural Network
Authors: Zhi Qiang Zhang, Qing Ming Wu, Qiang Zhang, Zhi Chao Gong
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The geo-mechanical classification - rock mass rating (RMR) - is used for categorizing rock mass. Assessing RMR is an important factor for successful accomplishment of a tunneling project. In the rock mechanics and mining literatures, some empirical methods exist between rock mass and other rock properties, such as using characteristic of the rock, geological structure etc. However, those means have some limitations by special rock types. After analyzed the information to identify RMR, a new parameter as one of the input neurons was used to develop predictive relations. There are eight parameters as the input parameters are presented based on artificial neural networks (ANN). The situ-test data of the tunnel face were measured and the experimental results indicate the proposed method was effective.
Affine group linear operator-based channel characterization for mobile radio systems
Authors: Uche A. K. Okonkwo, Razali Ngah, Tharek A. Rahman
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Mobile radio channel characterization using linear operators of affine group is presented. The foundation of this approach is primarily based on the natural extension of basic concepts of time-scale representations of wavelet-type to the analysis and representation of the nonstationarity associated with the real-time mobile radio channel. We provide an operator-based characterization initiated by the need to present an intuitive and physical approach towards describing and representing the various effects of the channel. The concepts of delay-scale spreading function and operator as well as delay-scale scattering function and operator is introduced. We established the relationship between the continuous wavelet transform and these functions/operators by employing the powerful tool of group theory. We also derived canonical expression for the corresponding channel by discretizing the channel using frame concept. The practical relevance of our approach is illustrated via deterministic examples and the associated simulations.
Hashing Backoff: A Collision-Free Wireless Access Method
Authors: Paul Starzetz, Martin Heusse, Franck Rousseau, Andrzej Duda
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

In this paper, we propose Hashing Backoff, an access method in which stations select backoff values by means of asymptotically orthogonal hashing functions, so that contending stations converge to a collision-free state. This solution is a half-way between TDMA, CDMA, and random access. Our simulations show that it presents significant improvement over Idle Sense, the access method with much better performance that the standard 802.11 DCF. The fact that the proposed method focuses on reducing collisions makes it particularly interesting for some specific applications such as sensor networks in which eliminating collisions leads to energy savings.
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
Authors: Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

Recently, many speed-up techniques were developed for the computation of shortest paths in networks with rather static edge latencies. Very little is known about dealing with problems which rely on the computation of shortest paths in highly dynamic networks. However, with an increasing amount of traffic, static models of networks rather sparsely reflect realistic scenarios. In the framework of network congestion games, the edge latencies depend on the number of users traveling on the edges. We develop speed-up techniques for the selfish step algorithm to efficiently compute (pure) Nash equilibria in network congestion games. Our approaches 1 periodically compute estimations for lengths of shortest paths during the advance of the selfish step algorithm with the purpose to use A * for many path computations, and 1 completely save many path computations or substitute them by more efficient tests. In comparison to an implementation of the selfish-step algorithm using Dijkstra's algorithm we improve the total running time by a factor of 4 up to 9 on highway networks and grids.
Improving the live migration process of large enterprise applications
Authors: Stuart Hacking, Benoît Hudzia
Venue: Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing (2009)

Recent developments in virtualisation technology have resulted in its proliferation of usage across datacentres. Ultimately, the goal of this technology is to more efficiently utilise server resources to reduce Total Cost of Ownership (TCO) by abstracting hardware and consolidating servers. This results in lower equipment costs and less electrical consumption for server power and cooling. However, the TCO benefits of holistic virtualisation extend beyond server assets. One of these aspects relates to the ability of being able to migrate Virtual Machines (VM) across distinct physical hosts over a network. However, limitations of the current migration technology start to appear when they are applied on larger application systems such as SAP ERP or SAP ByDesign. Such systems consume a large amount of memory and cannot be transferred as seamlessly as smaller ones, creating service interruption. Limiting the impact and optimising migration becomes even more important with the generalisation of Service Level Agreement (SLA). In this document we present our design and evaluation of a system that enables live migration of VMs running large enterprise applications without severely disrupting their live services, even across the Internet. By combining well-known techniques and innovative ones we can reduce system down-time and resource impact for migrating live, large Virtual Execution Environments.
Investigating the relationships among computer self-efficacy, professional development, teaching experience, and technology integration of teachers
Authors: Kenneth Martin
Venue:  (2008)

Research suggests that computer self-efficacy, professional development, and years of teaching experience are critical factors that influence teachers' integration of educational technology in their classrooms. Results of a pilot study conducted by the researcher suggested a strong relationship between the degree of self-confidence teachers demonstrated toward technology and its use in their classrooms. This study builds upon previous research to focus on the relationships among computer self-efficacy and the technology integration perceptions of high school mathematics and science teachers in a Midwestern metropolitan area. This exploratory study selected this particular population to examine factors that may inhibit or encourage technology integration among secondary teachers. These factors were self-efficacy beliefs, professional development, and teaching experience. Data were collected from teachers who volunteered to participate in the study through surveys, semi-structured interviews, classroom observations, and teaching materials. The data were analyzed quantitatively and qualitatively to determine whether relationships existed among the factors under consideration, as well as to detect other patterns that emerged. A moderate, statistically significant relationship was found to exist between perceptions of computer self-efficacy and technology integration among the participants, a finding that was supported by qualitative analysis. The results can inform future research, as well as professional development, continuing education, technology training, and teacher education programs.
An Automaton-based Approach for Web Service Mediation
Authors: Marie-Christine Fauvet, Ali Aït-Bachir
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Interactions between Web services are based on interfaces which describe Web services on both structural and behavioral perspectives. It can happen that the interface provided by a service does no longer match (for instance, because of an evolution) the interface required by its partners. In this situation, and until the required interfaces are fixed, interactions cannot succeed. To address this issue, and focusing on the behavioral part of interfaces, we propose an approach based on a mediator which aims to seamlessly resolve incompatibilities during service interactions. We adopted a formal tool as finite-state automata, particularly Labeled Transition Systems to model the behavioral aspects of operations exposed by Web services.
Minimum flows in bipartite networks
Authors: Eleonor Ciurea, Oana Georgescu, Daniela Marinescu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

We present two classes of algorithms for finding minimum flow in bipartite networks. The time bounds for several minimum flow algorithms automatically improve when the algorithms are applied without modification on bipartite networks. We obtain further running time improvements by modifying the algorithms. This modification applies only to preflow algorithms.
Complexity of (p,1)-total labelling
Authors: Frédéric Havet, Stéphan Thomassé
Venue: Discrete Applied Mathematics (2009)

A (p,1)-total labelling of a graph G=(V,E) is a total colouring L from V@?E into {0,...,l} such that |L(v)-L(e)|>=p whenever an edge e is incident to a vertex v. The minimum l for which G admits a (p,1)-total labelling is denoted by @l"p(G). The case p=1 corresponds to the usual notion of total colouring, which is NP-hard to compute even for cubic bipartite graphs [C.J. McDiarmid, A. Sanchez-Arroyo, Total colouring regular bipartite graphs is NP-hard, Discrete Math. 124 (1994), 155-162]. In this paper we assume p>=2. It is easy to show that @l"p(G)>=@D+p-1, where @D is the maximum degree of G. Moreover, when G is bipartite, @D+p is an upper bound for @l"p(G), leaving only two possible values. In this paper, we completely settle the computational complexity of deciding whether @l"p(G) is equal to @D+p-1 or to @D+p when G is bipartite. This is trivial when @D@?p, polynomial when @D=3 and p=2, and NP-complete in the remaining cases.
Fast and Stable Polynomial Equation Solving and Its Application to Computer Vision
Authors: Martin Byröd, Klas Josephson, Kalle Åström
Venue: International Journal of Computer Vision (2009)

This paper presents several new results on techniques for solving systems of polynomial equations in computer vision. Gröbner basis techniques for equation solving have been applied successfully to several geometric computer vision problems. However, in many cases these methods are plagued by numerical problems. In this paper we derive a generalization of the Gröbner basis method for polynomial equation solving, which improves overall numerical stability. We show how the action matrix can be computed in the general setting of an arbitrary linear basis for ¿[x]/I. In particular, two improvements on the stability of the computations are made by studying how the linear basis for ¿[x]/I should be selected. The first of these strategies utilizes QR factorization with column pivoting and the second is based on singular value decomposition (SVD). Moreover, it is shown how to improve stability further by an adaptive scheme for truncation of the Gröbner basis. These new techniques are studied on some of the latest reported uses of Gröbner basis methods in computer vision and we demonstrate dramatically improved numerical stability making it possible to solve a larger class of problems than previously possible.
Digital Painting in Photoshop
Authors: Susan Ruddick Bloom
Venue:  (2009)

Have you ever considered using Photoshop to create fine art?Photoshop is usually used for enhancing photos, but this extremely powerful software package is capable of so much more. Every feature, from brushes to background, can be customised and optimised for artistic effect. With a little guidance from a pro, your photoshop results can go from competent retouching of images to visually stunning re-interpretations of them, turning everyday pictures into breathtaking works of art.In this beautiful and inspiring book, acclaimed artist, author and lecturer Susan Bloom shows you how to do just that. Starting with the fundamentals: creating your own artistic brushes and textured papers virtually, she goes on to demonstrate how to create a variety of classic artistic styles in Photoshop, with chapters on watercolours, pastels, charcoal and oil. Further chapters cover illustration techniques in photoshop, and using third-party software to create painterly effects.While the results are highly polished and realistic, this is not a book written specifically for artists. The techniques are aimed squarely at the Photoshop user looking to broaden their pallette, with emphasis on altering photographs to create artwork, rather than creating artwork from scratch. Beautifully written, clearly laid out, and guaranteeing inspiring results, this book is a must-have for every Photoshop user. * Guide to using Photoshop to create fine art from photographs, covering many different artistic styles* Highly visual, inspiring content with clear step-by-step instructions and hundreds of screenshots* Backwards compatible approach: author has taken care to ensure that this fully up-to-date title also applies to previous editions of Photoshop
A note on convergence rates in the strong law of large numbers for associated sequences
Authors: Cecília Azevedo
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

Let Xn, n ∈ N, be a strictly stationary sequence of centered and associated real random variables. Sufficient conditions for the strong law of large numbers to hold are known, but no rates of convergence where given. We derive an upper bound for this convergence rate. This rate is made explicit for geometrically decreasing covariances.
Modelling Mediterranean landscape succession-disturbance dynamics: A landscape fire-succession model
Authors: James D. A. Millington, John Wainwright, George L. W. Perry, Raul Romero-Calcerrada, Bruce D. Malamud
Venue: Environmental Modelling Software (2009)

We present a spatially explicit Landscape Fire-Succession Model (LFSM) developed to represent Mediterranean Basin landscapes and capable of integrating modules and functions that explicitly represent human activity. Plant-functional types are used to represent spatial and temporal competition for resources (water and light) in a rule-based modelling framework. Vegetation dynamics are represented using a rule-based community-level modelling approach that considers multiple succession pathways and vegetation climax states. Wildfire behaviour is represented using a cellular-automata model of fire spread that accounts for land-cover flammability, slope, wind and vegetation moisture. Results show that wildfire spread parameters have the greatest influence on two aspects of the model: land-cover change and the wildfire regime. This sensitivity highlights the importance of accurately parameterising this type of grid-based model for representing landscape-level processes. We use a pattern-oriented modelling approach in conjunction with wildfire power-law frequency-area scaling exponent @b to calibrate the model. Parameters describing the role of soil moisture on vegetation dynamics are also found to significantly influence land-cover change. Recent improvements in understanding the role of soil moisture and wildfire fuel loads at the landscape-level will drive advances in Mediterranean LFSMs.
Novelty of behaviour as a basis for the neuro-evolution of operant reward learning
Authors: Andrea Soltoggio, Ben Jones
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

An agent that deviates from a usual or previous course of action can be said to display novel or varying behaviour. Novelty of behaviour can be seen as the result of real or apparent randomness in decision making, which prevents an agent from repeating exactly past choices. In this paper, novelty of behaviour is considered as an evolutionary precursor of the exploring skill in reward learning, and conservative behaviour as the precursor of exploitation. Novelty of behaviour in neural control is hypothesised to be an important factor in the neuro-evolution of operant reward learning. Agents capable of varying behaviour, as opposed to conservative, when exposed to reward stimuli appear to acquire on a faster evolutionary scale the meaning and use of such reward information. The hypothesis is validated by comparing the performance during evolution in two environments that either favour or are neutral to novelty. Following these findings, we suggest that neuro-evolution of operant reward learning is fostered by environments where behavioural novelty is intrinsically beneficial, i.e. where varying or exploring behaviour is associated with low risk.