ppxscal/embedding_network huggingface dataset:
Automating discovery of software tuning parameters
Authors: Nevon Brake, James R. Cordy, Elizabeth Dan y, Marin Litoiu, Valentina Popes u
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Software Tuning Panels for Autonomic Control (STAC) is a project to assist in the integration of existing software into autonomic frameworks. It works by identifying tuning parameters and rearchitecting to expose them as a separate control panel module. The project poses three distinct research challenges: automating the identification of tuning parameters, rearchitecting to centralize and expose them, and combining these two capabilities to facilitate the integration of existing software into autonomic frameworks. Our previous work focused on the second problem, automating the rearchitecture to expose and isolate tuning parameters. In this paper we concentrate on the first problem, automating the identification of tuning parameters. We begin with an empirical study of documented tuning parameters in a number of open source applications. From our observations of these known tuning parameters, we create a catalogue of different kinds and organize them into a taxonomy. Finally, we characterize a member of the taxonomy as a source code pattern that is used to find similar tuning parameters. We report our experience in applying this methodology in the context of a large, open source Java system.
A graph theoretical approach for a multistep mapping software for the FACETS project
Authors: Karsten Wendt, Matthias Ehrlich, René Schüffny
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper discusses the mapping problem, i.e. the assignment of complex biological networks to a special hardware system. The problem is modeled as a map of two disjoint sets. Further a graph model is introduced to overcome the lack of adequate system representations for the mapping software framework, which controls the complex mapping process. The characteristics of the graph model are described and possible applications for both the biological networks and hardware systems are shown. Consequently the mapping is expanded to a graph relation. After a short consideration of implementation aspects the mapping process, i.e. the handling with the graph models during creation of the mapping itself is represented.
BlueTrust in a Real World
Authors: Bradley Markides, Marijke Coetzee
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Social networks are evolving as mobile devices are able to establish direct communication with each other. Devices enable social interaction, as a level of trust for another person can be determined in the background. This paper describes BlueTrust, a trust mechanism that takes advantage of both the capabilities of the Semantic Web and mobile ad-hoc networks, which are suitable to solve the problems of creation, distribution and discovery of trust information in mobile social networks.
A Practical Approach to Wrist Pulse Segmentation and Single-period Average Waveform Estimation
Authors: Chunming Xia, Yan Li, Jianjun Yan, Yiqin Wang, Haixia Yan, Rui Guo, Fufeng Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A practical method is proposed to segment the wrist pulse waveform and estimate the average waveform. Some key issues that would affect the performance of the tasks are addressed. A zero-phase filtering was used to accommodate low frequency variations and high frequency noise without the phase-shift distortion, and a moving-window adaptive threshold based segmentation algorithm was used to ensure the segmenting performance. Waveform rotating and scaling, outlier elimination, cross-covariance based alignment, and average waveform estimation were introduced. Testing results show the effectiveness of segmentation performance, and the resulting average waveform well reflect the typical characteristics of the analyzed wrist pulse trend.
Applying MDA approach for the SA forum platform
Authors: Zoltán Szatmári, András Kövi, Manfred Reitenspiess
Venue: Proceedings of the 2nd workshop on Middleware-application interaction: affiliated with the DisCoTec federated conferences 2008 (2008)

The Application Interface Specification of the Service Availability Forum is a set of relatively new but well elaborated service specifications that facilitate the creation of highly available, fault tolerant applications. Even if not many, but there exist applications developed based on the specifications; however, a systematic way for creating those has not been published yet. This work describes a model-driven framework for the development of AIS based applications. It enables the creation and manipulation of the application models that are used for the generation of system configuration and component code skeletons, and which can be used for the automatic checking of correctness and various other non-functional requirements.
Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
Authors: Gui-Hua Lin, Xiaojun Chen, Masao Fukushima
Venue: Mathematical Programming: Series A and B (2008)

In this paper, we consider the stochastic mathematical programs with linear complementarity constraints, which include two kinds of models called here-and-now and lower-level wait-and-see problems. We present a combined smoothing implicit programming and penalty method for the problems with a finite sample space. Then, we suggest a quasi-Monte Carlo approximation method for solving a problem with continuous random variables. A comprehensive convergence theory is included as well. We further report numerical results with the so-called picnic vender decision problem.
Optimal confidence interval for the largest mean of correlated normal populations and its application to stock fund evaluation
Authors: Hubert J. Chen, Hsiu-Ling Li, Miin-Jye Wen
Venue: Computational Statistics Data Analysis (2008)

A single-sample sampling procedure for obtaining an optimal confidence interval for the largest or smallest mean of several correlated normal populations is proposed. It is assumed that the common variance is either known or unknown and the common correlation coefficient is a given non-negative value. The optimal confidence interval is obtained by maximizing the coverage probability with the expected confidence width being fixed at a least favorable configuration of means. Statistical tables of the critical values are calculated to implement the optimal confidence interval. Finally, this interval procedure is employed to estimate the mean return of the best stock fund among four diversified mutual funds in the United States from the years of 1977 to 2005. It has been found, with 95% confidence, that the best mutual fund has a mean return falling between nine and twenty-one percent, and the worst one has a mean return falling in a range from three and fifteen percent. Therefore, it can be concluded that stock fund investment in the U.S. stock market outperforms the long term inflation rate.
Systems science serves enterprise integration: a tutorial
Authors: John N. Warfield
Venue: Enterprise Information Systems (2007)

Enterprise integration is a major global challenge of these times. It is now possible for a new generation of practitioners to engage this challenge selectively by applying a recently articulated version of systems science (WSS). This tutorial paper argues that a half-century of disarray of the systems field can be seen as ending; and that the distillation of WSS to support a wide variety of application areas (in this instance, enterprise integration) can occupy practitioners as they harness the work program of complexity (WPOC) selectively. Carrying out the WPOC yields predictable portfolio components, consisting of a well-defined mix of tangible and intangible products. The three causes of poor intellectual productivity identified by Kenneth Boulding are nullified when appropriate role matching is achieved between WSS and enterprise integration.
Dynamic Compaction for High Quality Delay Test
Authors: Zheng Wang, D. M. H. Walker
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Dynamic compaction of K Longest Paths Per Gate (KLPG) test sets is performed, resulting in test sets of similar size to transition fault test sets, but with higher quality.
A hybrid approach for automatic lip localization and viseme classification to enhance visual speech recognition
Authors: Walid Mahdi, Salah Werda, Abdelmajid Ben Hamadou
Venue: Integrated Computer-Aided Engineering (2008)

An automatic lip-reading system is among assistive technologies for hearing impaired or elderly people. We can imagine, for example, a dependent person ordering a machine with an easy lip movement or by a simple visemes (visual phoneme) pronunciation. A lip-reading system is decomposed into three subsystems: a lip localization subsystem, then a feature extracting subsystem, followed by a classification system that maps feature vectors to visemes. The major difficulty in a lip-reading system is the extraction of the visual speech descriptors. In fact, to ensure this task it is necessary to carry out an automatic localization and tracking of the labial gestures. We present, in this paper, a new automatic approach for lip POI localization and feature extraction on a speaker's face based on mouth color information and a geometrical model of the lips. The extracted visual information is then classified in order to recognize the uttered viseme. We have developed our Automatic Lip Feature Extraction prototype (ALiFE). ALiFE prototype is evaluated for multiple speakers under natural conditions. Experiments include a group of French visemes for different speakers. Results revealed that our system recognizes 94.64% of the tested French visemes.
Nonnegative matrices with prescribed extremal singular values
Authors: Emedin Montaño, Mario Salas, Ricardo L. Soto
Venue: Computers Mathematics with Applications (2008)

We consider the problem of constructing nonnegative matrices with prescribed extremal singular values. In particular, given 2n-1 real numbers @s"1^(^j^) and @s"j^(^j^),j=1,...,n, we construct an nxn nonnegative bidiagonal matrix B and an nxn nonnegative semi-bordered diagonal matrix C, such that @s"1^(^j^) and @s"j^(^j^) are, respectively, the minimal and the maximal singular values of certain submatrices B"j and C"j of B and C, respectively. By using a singular value perturbation result, we also construct an nxn nonnegative matrix with prescribed singular values @s"1>=...>=@s"n.
Parallel computing and the Grid-experiences and applications
Authors: Peter Praxmarer, Dieter Kranzlmüller
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

In recent years, Grid computing evolved from first implementations as prototype Grid environments to large-scale production Grid infrastructures utilised during everyday work by scientists around the world. This demonstrates that the concept of the Grid is more than merely a marketing phrase, but instead an enabler for new application domains in parallel and distributed computing. Among others, the EU project EGEE ("Enabling Grids for E-Science") is probably the worlds largest initiative for establishing a permanent Grid infrastructure on a 24 × 7 basis. Such a Grid that is always on and there to serve the community just like the ubiquitous networking infrastructures today is on the horizon, waiting for users to utilise it in their applications. This paper explores the different possibilities for utilising Grids in parallel applications, focusing on different parallel computing aspects as provided by Grid environments. Basic concepts such as using the Grid as a large data storage and management basis or as a collection of distributed supercomputers represent a new approach to computational science, where users are expecting to utilise unprecedented amounts of performance for tackling their scientific problems.
Effects of Correlated Shadowing: Connectivity, Localization, and RF Tomography
Authors: Neal Patwari, Piyush Agrawal
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Unlike current models for radio channel shadowing indicate, real-world shadowing losses on different links in a network are not independent. The correlations have both detrimental and beneficial impacts on sensor, ad hoc, and mesh networks. First, the probability of network connectivity reduces when link shadowing correlations are considered. Next, the variance bounds for sensor self-localization change, and provide the insight that algorithms must infer localization information from link correlations in order to avoid significant degradation from correlated shadowing. Finally, a major benefit is that shadowing correlations between links enable the tomographic imaging of an environment from pairwise RSS measurements. This paper applies measurement-based models, and measurements themselves, to analyze and to verify both the benefits and drawbacks of correlated link shadowing.
New Efficient and Authenticated Key Agreement Protocol in Dynamic Peer Group
Authors: Shengke Zeng, Mingxing He, Weidong Luo
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The members in the Dynamic Peer Group (DPG) are divided into several clusters according to Linker Cluster Architecture [1]. In each cluster, the members perform the BD protocol [2] to establish the cluster key and the TGDH protocol [3] is performed among the clusters to generate the group key. This method cannot only avoid the weakness of AKA(Auxiliary Key Agreement) of BD, but also reduce the computation cost of TGDH scheme. In our scheme the members have been authenticated based identity, and we prove the security in Random Oracle Model.
Run-time Information Flow Monitoring based on Dynamic Dependence Graphs
Authors: Salvador Cavadini, Diego Cheda
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Protecting sensitive information —credit card data, personal medical information, etc— is becoming an increasingly important issue due to ubiquity of computing systems. Traditionally, conﬁdentiality of information is guaranteed by access control mechanisms, but there is a renewed interest in developing mechanisms that track how information ﬂows during program execution. There are two established means to enforce information ﬂow policies: static veriﬁcation, and run-time or dynamic monitoring. Run-time monitoring is more ﬂexible than static veriﬁcation, since it permits running all programs and only reject unsecure executions; of course, the increased ﬂexibility is mitigated by a degradation of run-time performance. This work presents two techniques for dynamic information ﬂow monitoring. Unlike most of run-time monitors that rely on program rewriting techniques, these techniques use dynamic dependence graphs to track information ﬂow at run-time. The proposed approaches scale to real languages and can cope with declassiﬁcation annotations.
MCDB: a monte carlo approach to managing uncertain data
Authors: Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Perez, Christopher Jermaine, Peter J. Haas
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database along with the data itself. This approach can severely limit the system's ability to gracefully handle complex or unforeseen types of uncertainty, and does not permit the uncertainty model to be dynamically parameterized according to the current state of the database. We introduce MCDB, a system for managing uncertain data that is based on a Monte Carlo approach. MCDB represents uncertainty via "VG functions," which are used to pseudorandomly generate realized values for uncertain attributes. VG functions can be parameterized on the results of SQL queries over "parameter tables" that are stored in the database, facilitating what-if analyses. By storing parameters, and not probabilities, and by estimating, rather than exactly computing, the probability distribution over possible query answers, MCDB avoids many of the limitations of prior systems. For example, MCDB can easily handle arbitrary joint probability distributions over discrete or continuous attributes, arbitrarily complex SQL queries, and arbitrary functionals of the query-result distribution such as means, variances, and quantiles. To achieve good performance, MCDB uses novel query processing techniques, executing a query plan exactly once, but over "tuple bundles" instead of ordinary tuples. Experiments indicate that our enhanced functionality can be obtained with acceptable overheads relative to traditional systems.
Basis functions for concave polygons
Authors: Gautam Dasgupta, Eugene L. Wachspress
Venue: Computers Mathematics with Applications (2008)

Polynomials suffice as finite element basis functions for triangles, parallelograms, and some other elements of little practical importance. Rational basis functions extend the range of allowed elements to the much wider class of well-set algebraic elements, where well-set is a convexity type constraint. The extension field from R(x,y) to R(x,y,x^2+y^2) removes this quadrilateral constraint as described in Chapter 8 of [E.L. Wachspress, A Rational Finite Element Basis, Academic Press, 1975]. The basis function construction described there is clarified here, first for concave quadrilaterals and then for concave polygons. Its application is enhanced by the GADJ algorithm [G. Dasgupta, E.L. Wachspress, The adjoint for an algebraic finite element, Computers and Mathematics with Applications, doi:10.1016/j.camwa.2004.03.021] for finding the denominator polynomial common to all the basis functions.
Parallel lossless data compression using the Burrows-Wheeler Transform
Authors: Jeff Gilchrist, Aysegul Cuhadar
Venue: International Journal of Web and Grid Services (2008)

In this paper, we present parallel algorithms for lossless data compression based on the Burrows-Wheeler Transform (BWT) block-sorting technique. We investigate the performance of using data parallelism and task parallelism for both multi-threaded and message-passing programming. The output produced by the parallel algorithms is fully compatible with their sequential counterparts. To balance the workload among processors we develop a task scheduling strategy. An extensive set of experiments is performed with a shared memory NUMA system using up to 120 processors and on a distributed memory cluster using up to 100 processors. Our experimental results show that significant speedup can be achieved with both data parallel and task parallel methodologies. These algorithms will greatly reduce the amount of time it takes to compress large amounts of data while the compressed data remains in a form that users without access to multiple processor systems can still use.
A weak version of the Blum, Shub and Smale model
Authors: P. Koiran
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We propose a weak version of the Blum-Shub-Smale model (1989) of computation over the real numbers. In this weak model only a "moderate" usage of multiplications and divisions is allowed. The class of languages recognizable in polynomial time as shown to be the complexity class P/poly. This implies under a standard complexity-theoretic assumption that P/spl ne/NP in the weak model, and that problems such as the real traveling salesman problem cannot be solved in polynomial time. As an application, we generalize recent results of H.T. Siegelmann and E.D. Sontag (1993) on recurrent neural networks, and of W. Maass (1993) on feedforward nets.
Designing a Groupware with Handheld Devices for Learning Mathematics
Authors: Shu-Yuan Tao, Kuang-Wen Ho, Chen-Wei Chung, Baw-Jhiune Liu, Chen-Chung Liu
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This study proposed a groupware and a flow of learning activity to guide students in learning arithmetic word problem with handheld devices. Appropriating the concept of semi-situated learning which was aided by the 4-frame comic embedded into the PDA, this study expected the comic to play as a catalyst to trigger students in articulating some theme associated with the content of the 4-frame comic. The scenario and features of this groupware are presented in the paper and a preliminary study at an elementary school is also described and discussed.
Knowledge and wisdom
Authors: Pat Helland
Venue: ACM SIGMOD Record (2008)

Jim Gray was my mentor and friend for almost 25 years. Even before we met, he was changing my life through his writings. Jim continually and patiently nudged me to strive for more, accomplish more, and to pass these gifts on to others. He embodied those attributes that I most want to emulate. Jim influenced those around him both by sharing in his immense knowledge and by listening and guiding. Even more, he created a community that fostered growth and sharing across competitive boundaries with a clear ethical compass. This paper summarizes my experiences with Jim's approach to nurturing and mentoring.
Semiparametric Bayesian circular statistics
Authors: R. McVinish, K. Mengersen
Venue: Computational Statistics Data Analysis (2008)

In areas such as biology, geology and meteorology data often occur as angles. This paper examines the use of Bayesian mixtures of triangular distributions for the semiparametric analysis of circular data. Applications to density estimation, goodness-of-fit testing and semiparametric regression are demonstrated.
Tampering with a watermarking-based image authentication scheme
Authors: Raphael C. -W. Phan
Venue: Pattern Recognition (2008)

We analyse a recent image authentication scheme designed by Chang et al. [A watermarking-based image ownership and tampering authentication scheme, Pattern Recognition Lett. 27 (5) (2006) 439-446] whose first step is based on a watermarking scheme of Maniccam and Bourbakis [Lossless compression and information hiding in images, Pattern Recognition 37 (3) (2004) 475-486]. We show how the Chang et al. scheme still allows pixels to be tampered, and furthermore discuss why its ownership cannot be uniquely binding. Our results indicate that the scheme does not achieve its designed objectives of tamper detection and image ownership.
A consensus-driven fuzzy clustering
Authors: Witold Pedrycz, Kaoru Hirota
Venue: Pattern Recognition Letters (2008)

In this study, we are concerned with a concept of consensus-driven fuzzy clustering whose objective is to reconcile a structure developed for patterns in some data set with the structural findings already available for other related data sets (where these data sets are reflective of the same phenomenon which has led to the generation of the original patterns). The results of fuzzy clustering are provided in the form of prototypes and fuzzy partition matrices. Given this form of representation of granular results (clusters), we develop a suitable communication scheme using which consensus could be established in an effective manner. Here, we consider proximity matrices induced by the corresponding partition matrices. An overall optimization scheme is presented in detail along with a way of forming a pertinent criterion governing an intensity of collaboration between the data driven- and knowledge oriented hints guiding the process of consensus formation. Several illustrative numeric examples, using both synthetic data and the data coming from publicly available machine learning repositories are also included.