ppxscal/embedding_network huggingface dataset:
Model Checking LTL Formulae in RAISE with FDR
Authors: Abigail Parisaca Vargas, Ana G. Garis, S. Lizeth Tarifa, Chris George
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

The Raise Specification Language (RSL) is a modeling language which supports various specification styles. To apply model checking to RSL concurrent descriptions, we translate RSL specifications into the input language CSPM of FDR. FDR is the model checker for the process algebra CSP. First, we define a syntactic and semantic translation from the concurrent applicative subset of RSL to CSPM, and show that this translation is a strong bisimulation which preserves properties such as traces and deadlock. Consequently, results obtained by refinement checks in FDR are sound for the original RSL descriptions. Second, RSL uses Linear Temporal Logic (LTL) to specify desired properties, but FDR does not support LTL. LTL formulas may be translated to CSP test processes in order to check them with FDR. We build a tool which automates the translation of RSL specifications into CSPM and translates LTL formulas to CSP processes, enabling the model checking of LTL formulas over RSL descriptions with FDR.
A novel fixed-outline floorplanner with zero deadspace for hierarchical design
Authors: Ou He, Sheqin Dong, Jinian Bian, Satoshi Goto, Chung-Kuan Cheng
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Fixed-outline floorplanning, which enables hierarchical design, is considered more and more important nowadays. In this paper, a novel SA-based Fixed-outline Floorplanner with the Optimal Area utilization named SAFFOA is introduced to improve the total wirelength. The basic idea is to build and solve a group of four quadratic equations in four variables iteratively, which can handle the fixed-outline constraint of any aspect ratio. A new topological representation called Ordered Quadtree is then custom-made for this basic idea to facilitate its integration into SA iterations. After the fixed-outline constraint with 100% area utilization is achieved, we will solve the tradeoff between the chip area and wirelength and thus concentrate on the latter in SA process. Experimental results show that the chip wirelength is decreased by about 16.8% and 8.6% on average, compared with two previous fixed-outline floorplanners on soft modules, which are both proved to be better than Parquet. Besides, our method is still competitive on the wirelength, even if compared with some leading-edge outline-free floorplanners. At last, Local Refinement is also adopted to guide the SA process and reshape soft modules to meet the constraint on their aspect ratios (ARs). With its help, SAFFOA can still generate feasible floorplans with no deadspace under a strict AR constraint such as [0.5,2].
A new combined stable and dispersion relation preserving compact scheme for non-periodic problems
Authors: T. K. Sengupta, V. Lakshmanan, V. V. S. N. Vijay
Venue: Journal of Computational Physics (2009)

A new compact scheme is presented for computing wave propagation problems and Navier-Stokes equation. A combined compact difference scheme is developed for non-periodic problems (called NCCD henceforth) that simultaneously evaluates first and second derivatives, improving an existing combined compact difference (CCD) scheme. Following the methodologies in Sengupta et al. [T.K. Sengupta, S.K. Sircar, A. Dipankar, High accuracy schemes for DNS and acoustics, J. Sci. Comput. 26 (2) (2006) 151-193], stability and dispersion relation preservation (DRP) property analysis is performed here for general CCD schemes for the first time, emphasizing their utility in uni- and bi-directional wave propagation problems - that is relevant to acoustic wave propagation problems. We highlight: (a) specific points in parameter space those give rise to least phase and dispersion errors for non-periodic wave problems; (b) the solution error of CCD/NCCD schemes in solving Stommel Ocean model (an elliptic p.d.e.) and (c) the effectiveness of the NCCD scheme in solving Navier-Stokes equation for the benchmark lid-driven cavity problem at high Reynolds numbers, showing that the present method is capable of providing very accurate solution using far fewer points as compared to existing solutions in the literature.
Applying wavelets transform and support vector machine for copper clad laminate defects classification
Authors: Te-Sheng Li
Venue: Computers and Industrial Engineering (2009)

In this paper, we present a multi-resolution approach for the inspection local defects embedded in homogeneous copper clad laminate (CCL) surfaces. The proposed method does not rely on the extraction of local textural features in a spatial basis. It is based mainly on the wavelet transform and inverse wavelet transform on the smooth subimage and detail subimages by properly selecting the adequate decomposition levels. The restored image will remove regular, repetitive texture patterns and enhance only local anomalies. Based on these local anomalies, feature extraction methods can then be used to discriminate between the defective regions and homogeneous regions in the restored image. Real samples with five classes of defects have been classified using this novel multi-classifier, namely, support vector machine. The experimental results show the efficacy of the proposed method.
Algorithm design for a class of base station location problems in sensor networks
Authors: Yi Shi, Y. Thomas Hou, Alon Efrat
Venue: Wireless Networks (2009)

Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1 - ɛ) approximation algorithms for base station placement problems under any desired small error bound ɛ > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1/ɛ2 complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem when the optimization objective is to maximize network capacity. Our (1 - ɛ) approximation algorithm is the first theoretical result on this problem.
Knowledge to go: using mobile technologies for mobile learning inside and outside university and school
Authors: Hendrik Buedding, Fabian Schroer
Venue: International Journal of Mobile Learning and Organisation (2009)

This article presents the first experiences in utilising palm sized computers (PDAs) in university and school projects in Muenster, Germany. PDAs were used in combination with wireless transmission techniques, to be able to run web-based and offline applications as well as learn management systems and feedback systems for evaluating online and offline learn-lessons and other educational evaluations. These applications were field-tested in ICT&#47;computer science courses at the University of Muenster and at several secondary schools, to evaluate the integration of mobile media into educational environments and to explore their effects on learning designs, teaching methods and outcomes by comparing these new strategies to classic media and working processes.
Sparse and Passive Reduced-Order Interconnect Modeling by Eigenspace Method
Authors: Yuichi Tanji
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The passive and sparse reduced-order modeling of a RLC network is presented, where eigenvalues and eigenvectors of the original network are used, and thus the obtained macromodel is more accurate than that provided by the Krylov subspace methods or TBR procedures for a class of circuits. Furthermore, the proposed method is applied to low pass filtering of a reduced-order model produced by these methods without breaking the passivity condition. Therefore, the proposed eigenspace method is not only a reduced-order macromodeling method, but also is embedded in other methods enhancing their performances.
Fast communication: Generalization of Hilbert transform for symbolic analysis of noisy signals
Authors: Soumik Sarkar, Kushal Mukherjee, Asok Ray
Venue: Signal Processing (2009)

A recent publication has reported a Hilbert-transform-based partitioning method, called analytic signal space partitioning (ASSP), which essentially replaces wavelet space partitioning (WSP) for symbolic analysis of time series data in dynamical systems. When used in conjunction with D-Markov machines, also reported in the recent literature, ASSP provides a fast method of pattern recognition. However, wavelet transform facilitates denoising, which allows D-Markov machines to have a small depth D even if the time series data have a low signal-to-noise ratio. Since Hilbert transform does not specifically address the issue of noise reduction, usage of D-Markov machines with a small D could potentially lead to information loss for noisy signals. On the other hand, a large D tends to make execution of pattern recognition computationally less efficient due to an increased number of machine states. This paper explores generalization of Hilbert transform that addresses symbolic analysis of noise-corrupted dynamical systems. In this context, theoretical results are derived based on the concepts of information theory. These results are validated on time series data, generated from a laboratory apparatus of nonlinear electronic systems.
A Novel Downlink Handover Priority Scheduling Algorithm for Providing Seamless Mobility and QoS in IEEE802.16e BWA System
Authors: Hamed Fehri, Jalil Chitizadeh, Mohammad H. Yaghmaee
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In IEEE 802.16e wireless metropolitan area networks, users could take their broadband connections with them as they move from one location to another with different speeds. Providing QoS is more challenging for mobile subscribers at vehicular speeds than for others. On the other hand, time variability and unpredictability of the wireless channel may cause QoS degradation for these users. Therefore, providing seamless handovers especially at vehicular speeds is necessary for maintaining QoS. This paper proposes a new downlink handover priority scheduling algorithm for different scheduling services which is providing lossless handovers and QoS. Taking the power degradation rates into consideration, this algorithm assigns higher priority to the users who have higher speeds. A priority based AMC (Adaptive Modulation and Coding) is also performed for better performance. The analysis results show the efficiency of proposed scheme.
Using situational simulations to collect and analyze dynamic construction management decision-making data
Authors: Matt Watkins, Amlan Mukherjee, Nilufer Onder
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper we lay the foundations for studying decision-making in complex dynamic construction management scenarios using situational simulations as experimental testbeds. We draw on research conducted in dynamic decision making, construction data-mining and situational simulations to develop methods to study human decision-making data collected in ICDMA - a situational simulation of a real four story steel frame office building construction project. Specifically, we address challenges in the collection, organization and analysis of human subject data. We define a discipline driving the collection of human decision-making data, establish a semantics to organize the data and a simple mathematical syntax to represent it. We also present an analysis of preliminary experimental work and show that our method can be used to analyze patterns in complex construction decision-making. Finally, we present an agenda of research in construction decision-making using situational simulations that can be conducted using our proposed methods.
Analysis of sampling techniques for association rule mining
Authors: Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only on the empirical evaluation of the effectiveness of sampling for the step of finding frequent itemsets. To the best of our knowledge, a theoretical framework to analyze the quality of the solutions obtained by sampling has not been studied. Our contributions are two-fold. First, we present the notions of &epsilon;-close frequent itemset mining and &epsilon;-close association rule mining that help assess the quality of the solutions obtained by sampling. Secondly, we show that both the frequent items mining and association rule mining problems can be solved satisfactorily with a sample size that is independent of both the number of transactions size and the number of items. Let &theta; be the required support, &epsilon; the closeness parameter, and 1/h the desired bound on the probability of failure. We show that the sampling based analysis succeeds in solving both &epsilon;-close frequent itemset mining and &epsilon;-close association rule mining with a probability of at least (1 - 1/h) with a sample of size S = O(1/&epsilon;2&theta; [&Delta; + log h/(1 - &epsilon;)&theta;]), where &Delta; is the maximum number of items present in any transaction. Thus, we establish that it is possible to speed up the entire process of association rule mining for massive databases by working with a small sample while retaining any desired degree of accuracy. Our work gives a comprehensive explanation for the well known empirical successes of sampling for association rule mining.
Passivity analysis of discrete-time stochastic neural networks with time-varying delays
Authors: Qiankun Song, Jinling Liang, Zidong Wang
Venue: Neurocomputing (2009)

In this paper, the problem of passivity analysis is investigated for a class of discrete-time stochastic neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, where the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By constructing proper Lyapunov-Krasovskii functional and employing a combination of the free-weighting matrix method and stochastic analysis technique, a delay-dependent passivity condition is derived in terms of linear matrix inequalities (LMIs). Furthermore, when the parameter uncertainties appear in the discrete-time stochastic neural networks with time-varying delays, a delay-dependent robust passivity condition is also presented. An example is given to show the effectiveness of the proposed criterion.
Mixed Radix-2 and High-Radix RNS Bases for Low-Power Multiplication
Authors: Ioannis Kouretas, Vassilis Paliouras
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper investigates the performance of a novel set of Residue Number System (RNS) bases, emphasizing on the minimization of the power&times;delay product. The proposed bases introduce moduli of the form 3 n , to the usual choice of moduli of the form 2 n , 2 n &thinsp;&minus;&thinsp;1, or 2 n &thinsp;+&thinsp;1. It is found that for particular dynamic ranges, the introduction of high-radix modulo-3 n multipliers significantly improves the power&times;delay performance of residue multiplication, in comparison to conventional two&rsquo;s-complement implementations as well as to RNS architectures using bases composed of radix-2 moduli. Experimental results demonstrate reduction of the power&times;delay product by almost a factor of two, for some cases.
TCP Westwood with Limited Congestion Window
Authors: Mohamed Tekala
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

TCP Westwood (TCPW) is a sender side modification of TCP congestion control. It estimates the connection rate by monitoring the acknowledgment reception rate; this estimation is used to compute congestion window and slow start threshold. The sender continuously computes the current eligible rate estimation: upon a packet loss the sender sets the slow start threshold and the congestion according to this estimation. In this work, we modify TCPWto limit its congestion window some value higher than the estimated slow start threshold. This mechanism avoids buffer overflow hence multiple losses for steady states while also maintains full utilization of the bottleneck link.The limited congestion window algorithm also prevents the periodic oscillation of the sender’s windows size, thus result flows experience stable round trip time that produces less jitter. The proposed method is numerically evaluated by simulations.
Parallel computing for graphics
Authors: Tim Foley, Justin Hensley, Jason Yang
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

This course provides an introduction to parallel-programming architectures and environments for interactive graphics and demonstrates how to combine traditional rendering API with advanced parallel computation.
ClientVisor: leverage COTS OS functionalities for power management in virtualized desktop environment
Authors: Huacai Chen, Hai Jin, Zhiyuan Shao, Ke Yu, Kun Tian
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

As an emerging trend, virtualization is more and more widely used in today's computing world. But, the introduc-tion of virtual machines bring trouble for the power man-agement (PM for short), since the operating system can not directly access and control the hardware as before. Solu-tions were proposed to manage the power in the server con-solidation case. However, such solutions are VMM-centric: the VMM gathers the PM decisions of the guests as hints, and makes the final decision to manipulate the hardware. These solutions do not fit well for the virtualized desktop environment, which is highly interactive with the users. In this paper, we propose a novel solution, called Cli-entVisor, to manage the power in the virtualized desktop environment. The key idea of our scheme is to leverage the functionalities of the Commercial-Off-The-Shelf (COTS) operating system, which actually interacts with the user, to manage the power of the processor and the peripheral de-vices in all possible cases. VMM coordinates the PM deci-sions of the guests only at the key points. By prototype implementation and experiments, we find our scheme re-sults in 22% lower power consumption in the static power usage scenario, and about 8% lower in the dynamic sce-nario than the corresponding cases of Xen. Moreover, the experimental data shows that the deployment of our scheme will not deteriorate the user experience.
An Efficient Multi-Patterns Parameterized String Matching Algorithm with Super Alphabet
Authors: Rajesh Prasad, Suneeta Agarwal
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

In the parameterized string matching, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. This problem has an important application in software maintenance where it is required to find equivalency between two sections of codes. Two sections of codes are said to be equivalent if one can be transformed into the other by renaming identifiers and variables only. In this paper, we extend single pattern exact shift-or string matching algorithm to find all parameterized occurrences of multiple patterns P0, P1, P2 ...Pr-1, (r31), each of equal size m , in the text T. The set of r multiple patterns is being handled by using the concept of classes of characters. The new algorithm is named as multi-pattern parameterized shift-or (MPSO) string matching algorithm. We further extend MPSO by using the concept of super alphabets. Implementation results show that by using a super alphabet of size s, the algorithm (MPSO) is speeded-up by a factor of s, where s is the size of the super alphabet (i.e. s is the number of characters processed simultaneously). By using multi-pattern parameterized string matching, the search time is lesser than individual pattern searching in the text. We also show the performance of super alphabet MPSO with respect to duplicity present in the code. However these algorithms are applicable only when pattern length (m) is less than or equal to word length (w) of computer used (i.e. m&le;w).
DRM policies for web map service
Authors: Alban Gabillon, Patrick Capolsini
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

Open Digital Rights Language (ODRL) is an extensible language for specifying Rights Policy in the context of Digital Rights Management (DRM) applications. The OpenGIS&reg; Web Map Service (WMS) supports the creation and display of maps. In this paper we extend ODRL to accommodate licensing for geographic data created by WMS.
On the comparison of microdata disclosure control algorithms
Authors: Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell Whitley
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Privacy models such as k-anonymity and l-diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set. However, they fail to give an accurate measure of privacy with respect to the individual tuples. For example, two anonymizations achieving the same value of k in the k-anonymity model will be considered equally good with respect to privacy protection. However, it is quite possible that for one of the anonymizations a majority of the individual tuples have lesser probabilities of privacy breaches than their counterparts in the other anonymization. We therefore reject the notion that all anonymizations satisfying a particular privacy property, such as k-anonymity, are equally good. The scalar or aggregate value used in privacy models is often biased towards a fraction of the data set, resulting in higher privacy for some individuals and minimalistic for others. Consequently, to better compare anonymization algorithms, there is a need to formalize and measure this bias. Towards this end, we advocate the use of vector-based methods for representing privacy and other measurable properties of an anonymization. We represent the measure of a given property for an anonymized data set using a property vector. Anonymizations are then compared using quality index functions that quantify the effectiveness of the property vectors. A formal analysis with respect to their scope and limitations is provided. Finally, we present preference based techniques when comparisons are to be made across multiple properties induced by anonymizations.