ppxscal/embedding_network huggingface dataset:
The impact of experimentation on product development in companies involved in interactive marketing
Authors: H. Perrin Garsombke
Venue:  (2009)

Since its emergence, the Internet and Internet related technologies have permeated almost all aspects of the modern life. The impact of the Internet on the day-to-day activities of its users has been quite dramatic. However, its effect on the business community has been even more profound. Besides yielding additional opportunities for existing businesses, the Internet has facilitated a new era of companies that have the Internet at the center of their business model, businesses that simply would not be able to exist without it. As such Internet-centric and increasingly traditional businesses now rely on interactive marketing as a source of revenue, differentiation and competitive advantage. Despite the obvious importance to many businesses, the efficiency and improvement of interactive marketing has largely stagnated or at least proceeds at a low pace. This study examined interactive marketing through the prism of experimentation as a way of propelling interactive marketing forward and enabling it to keep pace with technological advances.Experimentation lies at the core of product development, improvement and innovation. Active experimentation has been utilized as a product strategy in numerous business fields, but it has been largely ignored in interactive marketing. This study examined a number of experimentation models and their applicability to interactive marketing. In addition it focused on the elements of interactive marketing that are conducive to experimentation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A contribution to user interface modelling based on graph transformations approach
Authors: Martin Molhanec
Venue: Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation (2009)

At present time a very big progress proceeds in all branches of the software engineering field. Anyhow, one particular area is not under the enhanced focus of software developers and researchers. It is the area of the GUI formalization and modelling. The aim of our article is to overcome this deficiency by the suggestion of lightweight formal method for the design of user interface by the GUI modelling based on the graph transformations of underlying conceptual data model. The proposed method gives us a very visual tool for our objective. In addition, our method is an innovative and original specification and modelling technique targeted primarily for a utilization of large and complex modern-day web based applications.
Boundary asymptotic behavior and uniqueness of large solutions to quasilinear elliptic equations
Authors: Jing Mo, Zuodong Yang
Venue: Computers Mathematics with Applications (2010)

We study the existence, uniqueness and exact asymptotic behavior of solutions near the boundary to a class of quasilinear elliptic equations -div(|@?u|^p^-^2@?u)=@lg(u)-b(x)f(u)in@W where @l is a real number, and b(x)>0 in @W and vanishes on @?@W. The uniqueness of such a solution follows as a consequence of the exact blow-up rate.
Cost-sensitive boosting neural networks for software defect prediction
Authors: Jun Zheng
Venue: Expert Systems with Applications: An International Journal (2010)

Software defect predictors which classify the software modules into defect-prone and not-defect-prone classes are effective tools to maintain the high quality of software products. The early prediction of defect-proneness of the modules can allow software developers to allocate the limited resources on those defect-prone modules such that high quality software can be produced on time and within budget. In the process of software defect prediction, the misclassification of defect-prone modules generally incurs much higher cost than the misclassification of not-defect-prone ones. Most of the previously developed predication models do not consider this cost issue. In this paper, three cost-sensitive boosting algorithms are studied to boost neural networks for software defect prediction. The first algorithm based on threshold-moving tries to move the classification threshold towards the not-fault-prone modules such that more fault-prone modules can be classified correctly. The other two weight-updating based algorithms incorporate the misclassification costs into the weight-update rule of boosting procedure such that the algorithms boost more weights on the samples associated with misclassified defect-prone modules. The performances of the three algorithms are evaluated by using four datasets from NASA projects in terms of a singular measure, the Normalized Expected Cost of Misclassification (NECM). The experimental results suggest that threshold-moving is the best choice to build cost-sensitive software defect prediction models with boosted neural networks among the three algorithms studied, especially for the datasets from projects developed by object-oriented language.
Statistical Lp-approximation by double Gauss-Weierstrass singular integral operators
Authors: George A. Anastassiou, Oktay Duman
Venue: Computers Mathematics with Applications (2010)

In this paper, we study statistical L"p-approximation properties of the double Gauss-Weierstrass singular integral operators which do not need to be positive. Also, we present a non-trivial example showing that our statistical L"p-approximation is stronger than the ordinary one.
Brief paper: Fault tolerant control for singular systems with actuator saturation and nonlinear perturbation
Authors: Zhiqiang Zuo, Daniel W. C. Ho, Yijing Wang
Venue: Automatica (Journal of IFAC) (2010)

In this paper, the problem of robust fault tolerant control for a class of singular systems subject to both time-varying state-dependent nonlinear perturbation and actuator saturation is investigated. A sufficient condition for the existence of a fixed-gain controller is first proposed which guarantees the regularity, impulse-free and stability of the closed-loop system under all possible faults. An optimization problem with LMI constraints is formulated to determine the largest contractively invariant ellipsoid. An adaptive fault tolerant controller is then developed to compensate for the failure effects on the system by estimating the fault and updating the design parameter matrices online. Both of these two controllers are in the form of a saturation avoidance feedback with the advantage of relatively small actuator capacities compared with the high gain counterpart. An example is included to illustrate the proposed procedures and their effectiveness.
Intra market optimization for express package carriers with station to station travel and proportional sorting
Authors: Luke Schenk, Diego Klabjan
Venue: Computers and Operations Research (2010)

The flow of packages of an express package carrier consists of pick ups at costumer locations by couriers and delivering the packages to a local station for sorting. The packages are then transported to a major regional sorting facility called the ramp. At the ramp, packages can be sorted again before departing to a hub. From the hub they are moved to the destination ramp, where the entire process repeats in the reverse order until ultimate delivery of the package to the end customer. We focus on the afternoon and evening operations concerning stations and the ramp. Sorting and transportation decisions among these locations are considered. The most important decisions are: (1) which packages to aggregate at the stations, and (2) what is the most efficient transportation among locations to meet time deadlines at the ramp. Several options for modeling the sorting process at stations and the ramp, as well as the possibility of vehicles traveling from one station to another station to consolidate volume before proceeding to the ramp are considered. We model these processes by means of a dynamic program, where time periods represent time slices in the afternoon and evening. The overall model is solved by approximate dynamic programming, where the value function is approximated by a linear function. Further strategies are developed to speed up the algorithm and decrease the time needed to find feasible solutions. The methodology is tested on several instances from an express package carrier. The dynamic program solutions are substantially better than the current best practice and the best solutions obtained from an integer programming formulation of the problem.
On a web-graph-based micronetwork architecture for SoCs
Authors: L. Wang, S. Piao, Y. Jiang, L. Zhang
Venue: International Journal of Computers and Applications (2008)

The Network-on-Chip (NoC) concept has been identified as an attractive solution to the ever-increasing interconnect problem in complex System-on-Chip (SoC) designs. In this paper, we propose a highly scalable topology structure for NoC designs based on the web graph. This topology, named as Spidernet, is compared favourably to other five popular NoC topologies, including mesh, torus, fat tree, octagon, and spidergon in terms of node degree, network diameter, connection degree, average most short-circuit path, and average shortest wire length. We further propose a 2D layout design for Spidernet, and experiment results have confirmed its superiority over layouts derived from the above five competing topologies.
Positive solutions for third-order Sturm-Liouville boundary value problems with p-Laplacian
Authors: Chen Yang, Jurang Yan
Venue: Computers Mathematics with Applications (2010)

In this paper, by using the fixed point index method, we establish the existence of at least one or at least two positive solutions for the third-order Sturm-Liouville boundary value problem with p-Laplacian {(@f"p(u^''(t)))^'+f(t,u(t))=0,t@?(0,1),@au(0)-@bu^'(0)=0,@cu(1)+@du^'(1)=0,u^''(0)=0 where @f"p(s)=|s|^p^-^2s,p>1. As an application, an example is given to demonstrate the main result.
Linked Metabolites: A tool for the construction of directed metabolic graphs
Authors: John M. Easton, Lisa M. Harris, Mark R. Viant, Andrew C. Peet, Theodoros N. Arvanitis
Venue: Computers in Biology and Medicine (2010)

Metabolic pathway diagrams provide a wealth of information on how reactions combine to perform biological functions. While pathway diagrams are arranged in a way that allows a specific area of metabolism to be visualised, the inherent complexity of each pathway makes it difficult to identify the sets of reactions linking groups of compounds; a common task for researchers attempting to explain observed correlations or looking for further compounds of potential interest to use in validation work. Here we introduce Linked Metabolites, a tool that identifies sets of reactions linking groups of compounds in the context of the KEGG pathway diagrams.
Pattern Search optimization with applications on synthesis of linear antenna arrays
Authors: Filiz Güneş, Fikret Tokan
Venue: Expert Systems with Applications: An International Journal (2010)

In this work, Pattern Search (PSearch) method is introduced as a direct, efficient and derivative-free optimization tool with the applications on the antenna array synthesis in the antenna engineering. PSearch is a nonrandom method which can be exploited as a direct searching tool for minimization of a function which is not necessarily differentiable, stochastic, or even continuous. Thus, firstly antenna array synthesis is defined as a multi-objective optimization problem with its feasible variable and target spaces. For this aim, maximum amount of the side-lobe suppressions and broad/narrow null generations in any desired directions are simultaneously expressed as objectives in the target space while ensuring maximization in the gain performance of the antenna array. At the same time, the inter-element spacings and excitation amplitudes are considered as optimization variables that results in determination of the physical layout and feeding network of the array. In the optimization procedure, a fitness function is defined based on the target and synthesis variable spaces that can be applied into various antenna array designs, combining part by part with the different requirements. Besides convergence is made fast by a seeding process which consists of running ''genetic'' algorithm once with the random initial values. Finally, the whole PSearch synthesis method is verified by applying into the many linear antenna arrays synthesizes with various multi-objective requirements, and all of the optimized arrays are observed to outperform uniform arrays and representative designs.
Linguistic truth-valued lattice-valued propositional logic system lP(X) based on linguistic truth-valued lattice implication algebra
Authors: Jiajun Lai, Yang Xu
Venue: Information Sciences: an International Journal (2010)

In the semantics of natural language, quantification may have received more attention than any other subject, and syllogistic reasoning is one of the main topics in many-valued logic studies on inference. Particularly, lattice-valued logic, a kind of important non-classical logic, can be applied to describe and treat incomparability by the incomparable elements in its truth-valued set. In this paper, we first focus on some properties of linguistic truth-valued lattice implication algebra. Secondly, we introduce some concepts of linguistic truth-valued lattice-valued propositional logic system @?P(X), whose truth-valued domain is a linguistic truth-valued lattice implication algebra. Then we investigate the semantic problem of @?P(X). Finally, we further probe into the syntax of linguistic truth-valued lattice-valued propositional logic system @?P(X), and prove the soundness theorem, deduction theorem and consistency theorem.
Classification of vector-valued modular forms of dimension less than six
Authors: Geoffrey Mason
Venue:  (2009)

The main purpose of this dissertation is to classify spaces of vector-valued modular forms associated to irreducible, T-unitarizable representations of the full modular group, of dimension less than six. Given such a representation, it is shown that the associated graded complex linear space of vector-valued modular forms is a free module over the ring of integral weight modular forms for the full modular group, whose rank is equal to the dimension of the given representation. An explicit basis is computed for the module structure in each case, and this basis is used to compute the Hilbert-Poincar&eacute; series associated to each graded space. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Modelling and dynamics of a two-stage pressure rate controllable relief valve: a bondgraph approach
Authors: K. Dasgupta, J. Watton
Venue: International Journal of Modelling and Simulation (2008)

The dynamic analysis of a two-stage pressure rate controllable relief valve is studied. The modelling of the system has been performed with the help of bondgraph simulation technique. While modelling the system, various non-linear characteristics of the valve are considered. The simulation study identifies some critical design parameters, which have significant effect on the transient response of the system. The simulation results have been verified with the experimental data.
Reflective communications framework: an approach to rapid deployment of communications architectures in distributed systems
Authors: Carl D. Iii
Venue:  (2009)

The Reflective Communications Framework (RCF) is a novel approach to distributed system development that enables rapid deployment of a wide range of communications architectures. It generalizes the core components common to most distributed systems and is designed in a highly modular fashion. The RCF includes several key features: (1) Generalized message structuring that is format independent. (2) Decoupling of the low-level communications from the high-level application logic. (3) Automated tracking and processing of the modular components. (4) Cross-platform compatibility. (5) Rapid application development. Architectures developed with this framework are naturally event-driven and are capable of dynamic reconfiguration. They can be easily modified and updated due to the modular design. An implementation of the Joint Architecture for Unmanned Systems (JAUS) has been created with this framework to demonstrate feasibility and to provide an example of how the components interact. A great focus has been placed on performance of the underlying framework. The result is a generalized and highly flexible architecture that approaches the performance of native code in many areas while still leveraging the conveniences of a managed, object-oriented environment. This enables far more rapid and reliable application development than would be possible in many existing systems. While the toolset that has been developed and demonstrated using the .NET framework, the architectural design could easily be implemented in any environment that supports similar features. The standardization of development tools represents a major advancement in the creation of distributed systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Goal programming model for agricultural land allocation problems
Authors: D. K. Sharma, A. Gaur, D. Ghosh
Venue: International Journal of Modelling and Simulation (2008)

Most of the real-world problems in the agricultural sector are multi-objective. Multi-objective programming techniques such as lexicographic goal programming (LGP) can be used to solve agricultural land allocation problems. The purpose of this paper is to present an LGP model for optimal allocation of land under cultivation and to propose an annual agricultural plan for the various crops. Sensitivity analysis on the priority structure of the goals as defined in the LGP model was performed to obtain different solutions in the decision-making environment. The study uses Euclidean distance function to measure distances of all possible solutions from the ideal solution. The minimum distance from different solutions to the ideal solution identifies the best compromise solution, and the associated priority structure is the appropriate structure according to the decision-making situation. The effectiveness of the LGP model is demonstrated via a case example.
Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing
Authors: Yiqun Cao, Tao Jiang, Thomas Girke
Venue: Bioinformatics (2010)

Motivation: Similarity searching and clustering of chemical compounds by structural similarities are important computational approaches for identifying drug-like small molecules. Most algorithms available for these tasks are limited by their speed and scalability, and cannot handle today's large compound databases with several million entries. Results: In this article, we introduce a new algorithm for accelerated similarity searching and clustering of very large compound sets using embedding and indexing (EI) techniques. First, we present EI-Search as a general purpose similarity search method for finding objects with similar features in large databases and apply it here to searching and clustering of large compound sets. The method embeds the compounds in a high-dimensional Euclidean space and searches this space using an efficient index-aware nearest neighbor search method based on locality sensitive hashing (LSH). Second, to cluster large compound sets, we introduce the EI-Clustering algorithm that combines the EI-Search method with Jarvis–Patrick clustering. Both methods were tested on three large datasets with sizes ranging from about 260 000 to over 19 million compounds. In comparison to sequential search methods, the EI-Search method was 40–200 times faster, while maintaining comparable recall rates. The EI-Clustering method allowed us to significantly reduce the CPU time required to cluster these large compound libraries from several months to only a few days. Availability: Software implementations and online services have been developed based on the methods introduced in this study. The online services provide access to the generated clustering results and ultra-fast similarity searching of the PubChem Compound database with subsecond response time. Contact: thomas.girke@ucr.edu Supplementary information: Supplementary data are available at Bioinformatics online. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Hybrid one-way delay estimation for networked control system
Authors: Wenjun Xu, Zude Zhou, Quan Liu
Venue: Advances in Engineering Software (2010)

One-way delay estimation in the forward and feedback channels is crucial for a networked control system (NCS) due to its important role in the reliability and availability design. Problems existing in current one-way delay estimation schemes are investigated in this paper. A novel hybrid one-way delay estimation scheme, utilizing the hybrid technique that contains an online monitoring mechanism and an end-to-end estimation method, is proposed to overcome the effects of network asymmetry and delay dynamics in the NCS. Therefore, accurate one-way delay values in the forward and feedback channels can be obtained. In the proposed scheme, only the delay value of the initial packet starting the control loop of the NCS is estimated by the online monitoring mechanism, all the other estimations are performed by the host using the end-to-end method. The experimental results demonstrate that the performance of the proposed novel hybrid one-way delay estimation scheme is better than the other current estimation schemes for the NCS in terms of its high accuracy in tracking delay values as well as requiring lower computation complexity of the system.
A comparative study of numerical integration based on Haar wavelets and hybrid functions
Authors: Siraj-ul-Islam, Imran Aziz, Fazal Haq
Venue: Computers Mathematics with Applications (2010)

A quadrature rule based on uniform Haar wavelets and hybrid functions is proposed to find approximate values of definite integrals. The wavelet-based algorithm can be easily extended to find numerical approximations for double, triple and improper integrals. The main advantage of this method is its efficiency and simple applicability. Error estimates of the proposed method alongside numerical examples are given to test the convergence and accuracy of the method.
Dynamic hierarchical algorithms for document clustering
Authors: Reynaldo Gil-García, Aurora Pons-Porrata
Venue: Pattern Recognition Letters (2010)

In this paper, two clustering algorithms called dynamic hierarchical compact and dynamic hierarchical star are presented. Both methods aim to construct a cluster hierarchy, dealing with dynamic data sets. The first creates disjoint hierarchies of clusters, while the second obtains overlapped hierarchies. The experimental results on several benchmark text collections show that these methods not only are suitable for producing hierarchical clustering solutions in dynamic environments effectively and efficiently, but also offer hierarchies easier to browse than traditional algorithms. Therefore, we advocate its use for tasks that require dynamic clustering, such as information organization, creation of document taxonomies and hierarchical topic detection.