ppxscal/embedding_network huggingface dataset:
The maximum edit distance from hereditary graph properties
Authors: Noga Alon, Uri Stav
Venue: Journal of Combinatorial Theory Series B (2008)

For a graph property P, the edit distance of a graph G from P, denoted E"P(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the largest possible edit distance of a graph on n vertices from P? Denote this distance by ed(n,P). A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph G(n,p(P)) essentially achieves the maximal distance from P, proving: ed(n,P)=E"P(G(n,p(P)))+o(n^2) with high probability. The proof implicitly asserts the existence of such p(P), but it does not supply a general tool for determining its value or the edit distance. In this paper, we determine the values of p(P) and ed(n,P) for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of E"P(G(n,p)) as a function of p. The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemeredi Regularity Lemma, Ramsey Theory and properties of random graphs.
Querying continuous functions in a database system
Authors: Arvind Thiagarajan, Samuel Madden
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or stock prices or vehicle trajectories as a function of time. Querying raw or discrete data is unsatisfactory for these applications -- e.g., in a sensor network, it is necessary to interpolate sensor readings to predict values at locations where sensors are not deployed. In other situations, raw data can be inaccurate owing to measurement errors, and it is useful to fit continuous functions to raw data and query the functions, rather than raw data itself -- e.g., fitting a smooth curve to noisy sensor readings, or a smooth trajectory to GPS data containing gaps or outliers. Existing databases do not support storing or querying continuous functions, short of brute-force discretization of functions into a collection of tuples. We present FunctionDB, a novel database system that treats mathematical functions as first-class citizens that can be queried like traditional relations. The key contribution of FunctionDB is an efficient and accurate algebraic query processor - for the broad class of multi-variable polynomial functions, FunctionDB executes queries directly on the algebraic representation of functions without materializing them into discrete points, using symbolic operations: zero finding, variable substitution, and integration. Even when closed form solutions are intractable, FunctionDB leverages symbolic approximation operations to improve performance. We evaluate FunctionDB on real data sets from a temperature sensor network, and on traffic traces from Boston roads. We show that operating in the functional domain has substantial advantages in terms of accuracy (15-30%) and up to order of magnitude (10x-100x) performance wins over existing approaches that represent models as discrete collections of points.
An autonomic provisioning framework for outsourcing data center based on virtual appliances
Authors: Xiaoying Wang, Zhihui Du, Yinong Chen, Sanli Li, Dongjun Lan, Gang Wang, Ying Chen
Venue: Cluster Computing (2008)

As outsourcing data centers emerge to host applications and services from many different organizations, it is critical for data center owners to isolate different applications while dynamically and optimally allocate sharable resources among them. To address this issue, we propose a virtual-appliance-based autonomic resource provisioning framework for large virtualized data centers. We present the architecture of the data center with enriched autonomic features. We define a non-linear constrained optimization model for dynamic resource provisioning and present a novel analytic solution. Key factors, including virtualization overhead and reconfiguration delay, are incorporated into the model. Experimental results based on a prototype demonstrate that the system-level performance has been greatly improved by taking advantage of fine-grained server consolidation, and the whole system exhibits flexible adaptation in failure scenarios. Experiments with the impact of switching delay also show the efficiency of the framework due to significantly reduced provisioning time.
The influence of the ground effect to the corona onset and the breakdown voltage of small rod-rod air gaps
Authors: Athanasios Maglaras, Leandros Maglaras
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

In the present paper we investigate the Ground Effect of small rod-rod air gaps, a phenomenon, which is observed due to the fact that in air gap arrangements one of the two electrodes is usually at earth potential (grounded). The field distribution along the axis of the gaps is analyzed with the Finite Element Method. The maximum values of the field strength in a gap are recorded for the two different arrangements, the one with one electrode grounded, or with symmetrical charging of the electrodes. The distribution of the field along the axis of a gap is strongly affected by the gap length, and the geometry of the arrangement. The influence of the Ground Effect to the rod-plate air gaps and the Mirror Effect are also investigated. It is resulted that the Ground Effect influences the corona onset and the breakdown voltage of the air gaps analogically. It is intense in small air gaps, while the influence of the corona current appears in longer air gaps and overlaps the Ground Effect. The principle of action-reaction is valid.
Fast support vector machine training and classification on graphics processors
Authors: Bryan Catanzaro, Narayanan Sundaram, Kurt Keutzer
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Recent developments in programmable, highly parallel Graphics Processing Units (GPUs) have enabled high performance implementations of machine learning algorithms. We describe a solver for Support Vector Machine training running on a GPU, using the Sequential Minimal Optimization algorithm and an adaptive first and second order working set selection heuristic, which achieves speedups of 9-35x over LIBSVM running on a traditional processor. We also present a GPU-based system for SVM classification which achieves speedups of 81-138x over LIBSVM (5-24x over our own CPU based SVM classifier).
Flow over rectangular porous block in a fixed width channel: influence of porosity and aspect ratio
Authors: S. Z. Shuja, B. S. Yilbas
Venue: International Journal of Computational Fluid Dynamics (2007)

Flow over a rectangular porous block placed in a fixed width channel is considered and the influence of block aspect ratio on the heat transfer rate from the block is examined. A non-porous solid block is also accommodated to compare the effect of porosity on the flow field and heat transfer characteristics. Aspect ratio and the porosity of the block are varied in the simulations. A numerical scheme employing a control volume approach is considered when predicting the flow and temperature fields. The Reynolds number is selected to yield the mix convection situation in the flow field. It is found that the aspect ratio significantly influences Nu and Gr numbers, in which case increasing the aspect ratio enhances Nu while lowering Gr. Increasing porosity improves the heat transfer rates from the porous block, provided that at high aspect ratios, this situation ceases due to blockage effect of the body in the channel.
An IMS Performance Benchmark Implementation based on the TTCN-3 Language
Authors: George Din
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

Performance benchmarking is a method to assess performance characteristics of various systems across different system architectures under realistic conditions. A benchmark is executed to collect measurements such as fail rate, response times or round-trip delays. Additionally, it can be used to identify scalability or usability problems of the system under heavy load. This paper describes a performance benchmark for the IP Multimedia Subsystem (IMS). IMS is a standardised architecture for providing a unified session control on top of various access network technologies realising flexible multimedia applications. In the context of IMS, where a scalability of up to several millions of subscribers is required, the goal of a benchmarking system is to help understand how a system will perform when the number of calls per second and the number of active users increase. The Testing and Test Control Notation (TTCN-3) has been used to implement the benchmark specification.
Silicon microneedle array with biodegradable tips for transdermal drug delivery
Authors: Bangtao Chen, Jiashen Wei, Francis E. H. Tay, Yee Ting Wong, Ciprian Iliescu
Venue: Microsystem Technologies (2008)

This paper presents the fabrication process, characterization results and basic functionality of silicon microneedle array with biodegradable tips for transdermal drug delivery. In order to avoid the main problems related to silicon microneedles; the breaking of the top part of the needles inside the skin, a simple solution can be the fabrication of microneedle array with biodegradable tips. A silicon microneedle array was fabricated by deep reactive ion etching (RIE), using the photoresist reflow effect and RIE notching effect. The biodegradable tips were successfully realized using the electrochemical anodization process that selectively generated porous silicon only on the top part of the skin. The porous tips can be degraded within a few weeks if some of them are broken inside the skin during the insertion and release process. The paper presents also the results of in vitro release of calcein with animal skins using a microneedle array with biodegradable tips. Compared to the transdermal drug delivery without microneedle enhancer, the microneedle array had presented significant enhancement of drug release.
Verifying Statecharts with State Invariants
Authors: Emil Sekerinski
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Statecharts are an executable visual language for specifying the reactive behavior of systems. We propose to statically verify the design expressed by a statechart by allowing individual states to be annotated with invariants and checking the consistency of the invariants with the transitions. We present an algorithm that uses the locality of state invariants for generating "many small" verification conditions that should be more amenable to automatic checking than an approach based on a single global invariant.
Study on the Design of CRM System Based on Business Intelligence
Authors: Li He, Guan Xin, Gong Yufeng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This article concerns on analyzing the application of CRM which based on database warehouse, data investigating, data analyzing and processing.It integrates with CRM system requirements, creating a new system model which is based on commercial intelligent technology.This system will improve enterprises customer recourse, optimize enterprise management mode, integrate the functions of management information system, and unify customer management platform. The system has the important significance in actual application.
A high performance blind adaptive filtering algorithm
Authors: Jusak Jusak, Zahir M. Hussain, Richard Harris
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Recently a dithered signed-error constant modulus algorithm (DSE-CMA) has been proposed for the purpose of low complexity implementation of constant modulus algorithm (CMA), which is widely used for blind adaptive filtering due to its LMS-like desirable robustness properties. Despite the fact that this algorithm has robustness properties closely resembling those of CMA, it is very slow in convergence. In this work, we present a simple modification of DSE-CMA using a variable step size that results in faster convergence while preserves the low computational complexity and robustness properties of the DSE-CMA algorithm.
Ambiguous queries: test collections need more sense
Authors: Mark Sanderson
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Although there are many papers examining ambiguity in Information Retrieval, this paper shows that there is a whole class of ambiguous word that past research has barely explored. It is shown that the class is more ambiguous than other word types and is commonly used in queries. The lack of test collections containing ambiguous queries is highlighted and a method for creating collections from existing resources is described. Tests using the new collection show the impact of query ambiguity on an IR system: it is shown that conventional systems are incapable of dealing effectively with such queries and that current assumptions about how to improve search effectiveness do not hold when searching on this common query type.
On content delivery network protocols and applications
Authors: B. Molina, C. E. Palau, M. Esteve, J. Lloret
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Content delivery networks are overlay networks that reduce latency by placing a set of servers close to clients. It is specially effective for wide-area networks and the Internet, where network traffic may drive a user to wait for an unreasonable period of time. The approach for such a solution at application layers lacks for optimization techniques at network and data-link layer; from another point of view, it allows a rapid deployment of new applications and protocols, as well as enhancements of current tested ones. This article tries to describe and clarify current work and research in the mechanisms used at the upper-layers of the protocol stack of a content delivery network.
ZigBee Source Route Technology in Home Application
Authors: Yao-Ting Wu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

ZigBee is a new short-range wireless technology. ZigBee devices have parents and children relationship, and those devices can construct a huge mesh network. Most devices in ZigBee network can relay packets, repair route, etc. If a ZigBee device wants to send packets to another device, the source node needs to find a route to the destination. In an application, if data are sent to the concentrator form the sensing nodes and concentrator tends control the sensing nodes, the concentrator can record the path from sensing nodes to its self, and send the data to the sensing node directly according to the recorded path. The relaying nodes using the recoded nodes information relay packets. In this paper, we dealt about usage of the source route technology to find the best route and send packets directly according the recorded nodes information. In a huge mesh network, find a good route is very important. It can reduce the probability of packet collision and data loss. This technology is suitable in the application of user monitors the sensing area in the concentrator, and send control packets to the sensing nodes from concentrator.
A superlinearly and globally convergent algorithm for power control and resource allocation with general interference functions
Authors: Holger Boche, Martin Schubert
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In wireless networks, users are typically coupled by interference. Hence, resource allocation can strongly depend on receive strategies, such as beamforming, CDMA receivers, etc. We study the problem of minimizing the total transmission power while maintaining individual quality-of-service (QoS) values for all users. This problem can be solved by the fixed-point iteration proposed by Yates (1995) as well as by a recently proposed matrix-based iteration (Schubert and Boche, 2007). It was observed by numerical simulations that the matrix-based iteration has interesting numerical properties, and achieves the global optimum in only a few steps. However, an analytical investigation of the convergence behavior has been an open problem so far. In this paper, we show that the matrix-based iteration can be reformulated as a Newton-type iteration of a convex function, which is not guaranteed to be continuously differentiable. Such a behavior can be caused by ambiguous representations of the interference functions, depending on the choice of the receive strategy. Nevertheless, superlinear convergence can be shown by exploiting the special structure of the problem. Namely, the function is convex, locally Lipschitz continuous, and an invertible directional derivative exists for all points of interest.
Structural Features for Recognizing Degraded Printed Gurmukhi Script
Authors: Manish Kumar Jindal, Rajendra Kumar Sharma, Gurpreet Singh Lehal
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The performance of an OCR system depends upon printing quality of the input document. Many OCRs have been designed which correctly identify fine printed documents in Indian and other scripts. But, little reported work has been found on the recognition of the degraded documents. The performance of any standard OCR system working for fine printed documents decreases, if it is tested on degraded documents. Feature extraction is an important task for designing an OCR for recognizing degraded documents. In this paper, we have discussed efficient structural features selected for recognizing degraded printed Gurmukhi script characters.
Dynamical Yang-Baxter maps with an invariance condition
Authors: Youichi Shibukawa
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

By means of left quasigroups L = (L, ċ) and ternary systems, we construct dynamical Yang-Baxter maps associated with L, L, and (ċ) satisfying an invariance condition that the binary operation (ċ) of the left quasigroup L defines. Conversely, this construction characterize such dynamical Yang-Baxter maps. The unitary condition of the dynamical Yang-Baxter map is discussed. Moreover, we establish a correspondence between two dynamical Yang-Baxter maps constructed in this paper. This correspondence produces a version of the vertex-IRF correspondence.
Automated instrumentation of contracts and scenarios for requirements validation in .net
Authors: Dave Arnold, Jean-Pierre Corriveau
Venue: Proceedings of the 3rd international workshop on Automation of software test (2008)

During the development of an object-oriented reactive system, scenarios (such as UML's use cases) may be used for the elicitation of functional and non-functional requirements. The contribution of this paper is the overview of a framework for the specification of a testable requirements model and the automated instrumentation of this model into an implementation in order to validate the model's requirements against this implementation. Our testable model takes the form of contracts and is grounded in the notions of scenarios and responsibilities. More precisely, the validation of the requirements of this model depends on a user binding elements of contracts to actual procedures within a candidate implementation, (that also supplies test data). Once this is done, these requirements are validated against an execution. This validation consists in the invocation of both static and dynamic checks, the matching of scenarios, and the capture and evaluation of metrics for an execution. Metric evaluation allows our framework and testable model to also consider non-functional requirements.
NP-completeness of list coloring and precoloring extension on the edges of planar graphs
Authors: Dániel Marx
Venue: Journal of Graph Theory (2005)

In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-edge-coloring of the graph. In list edge coloring every edge has a list of admissible colors, and the question is whether there is a proper edge coloring where every edge receives a color from its list. We show that both problems are NP-complete on (a) planar 3-regular bipartite graphs, (b) bipartite outerplanar graphs, and (c) bipartite series-parallel graphs. This improves previous results of Easton and Parker [6], and Fiala [8]. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 313&ndash;324, 2005
Splines and anti-periodic boundary-value problems
Authors: M. Ahmadinia, G. B. Loghamni
Venue: International Journal of Computer Mathematics (2007)

Aftabizadeh, Pavel and Huang showed in 1994 that some second-order differential equations on (0, π) with anti-periodic conditions y(0)+y(π)=0, y'(0)+y'(π)=0 have a unique solution. In the present paper, the authors consider a differential equation g(t, x(t), x'(t), x''(t))=0 on (a, b) (t∈[a, b] and g continuous) having a solution satisfying the anti-periodic conditions x(i)(a)+x(i)(b)=0 (i=0, 1). They show that for every ε>0 there exist a positive integer k and a linear combination vk of spline functions such that [image omitted]  and vk satisfies the exact anti-periodic boundary conditions.
A skeleton based programming paradigm for mobile multi-agents on distributed systems and its realization within the MAGDA Mobile Agents platform
Authors: R. Aversa, B. Di Martino, N. Mazzocca, S. Venticinque
Venue: Mobile Information Systems (2008)

Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.
A Low-Power Double-Edge-Triggered Address Pointer Circuit for FIFO Memory Design
Authors: Saravanan Ramamoorthy, Haibo Wang, Sarma Vrudhula
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents a novel design of address pointer for FIFO memory circuits. Advantages of the proposed design include: reduced capacitive load on the pointer clock path, the use of a true single-phase clock, and double edge-triggering clock scheme. The circuit has low power consumption, is immune to circuit racing conditions and suitable for high-speed operations. Techniques to implement clock gating in pointer circuit design for further reducing power consumption are also discussed. The proposed circuit is implemented with a 65nm CMOS technology and its performance is compared with previous pointer circuits.