ppxscal/embedding_network huggingface dataset:
Comparing Approaches in AORE through ISO/IEC 9126
Authors: Luciana de Paiva Silva, Elisa H. M. Huzita, Tania F. Calvi Tait
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

The comparison of related approaches in aspects oriented requirements engineering (AORE) has been frequent in the last years. The comparisons made, until now, did not follow any standardization or were based on some previous specification with no patterns, what makes difficult the definition of characteristics or attributes to be taken in consideration at the time to elaborate the comparison properly. This paper has as objective to reduce the gap existent in the most approaches in AORE, providing a comparison through the derivation of the quality attributes defined by ISO/IEC 9126 norm.
Are complex systems hard to evolve?
Authors: Andy Adamatzky, Larry Bull
Venue: Complexity (2009)

Evolutionary complexity is measured here by the number of trials-evaluations needed for evolving a logical gate in a nonlinear medium. Behavioral complexity of the gates evolved is characterized in terms of cellular automata behavior. We speculate that hierarchies of behavioral and evolutionary complexities are isomorphic up to some degree, subject to substrate specificity of evolution, and the spectrum of evolution parameters. &copy; 2009 Wiley Periodicals, Inc. Complexity, 2009
On pushing weight constraints deeply into frequent itemset mining
Authors: Unil Yun
Venue: Intelligent Data Analysis (2009)

There have been many studies on mining frequent itemset (or pattern) in the data mining field because of its broad applications in mining association rules, correlations, graph patterns, constraint based frequent patterns, sequential patterns, and many other data mining tasks. One of major challenges in frequent pattern mining is a huge number of result patterns. As the minimum threshold becomes lower, an exponentially large number of itemsets are generated. Therefore, pruning unimportant patterns effectively in mining process is one of main topics in frequent pattern mining. In weighted frequent pattern mining, not only support but also weight are used and important patterns can be detected. In this paper, we propose two efficient algorithms for mining weighted frequent itemsets in which the main approaches are to push weight constraints into the Apriori algorithm and the pattern growth algorithm respectively. Additionally, we show how to maintain the downward closure property in mining weighted frequent itemsets. In our approach, the normalized weights within the weight range are used according to the importance of items. A weight range is used to restrict weights of items and a minimum weight is utilized to balance between weight and support of items for pruning the search space. Our approach generates fewer but important weighted frequent itemsets in large databases, particularly dense databases with low minimum supports. An extensive performance study shows that our algorithm outperforms previous mining algorithms. In addition, it is efficient and scalable.
Supervised machine learning algorithms for protein structure classification
Authors: Pooja Jain, Jonathan M. Garibaldi, Jonathan D. Hirst
Venue: Computational Biology and Chemistry (2009)

We explore automation of protein structural classification using supervised machine learning methods on a set of 11,360 pairs of protein domains (up to 35% sequence identity) consisting of three secondary structure elements. Fifteen algorithms from five categories of supervised algorithms are evaluated for their ability to learn for a pair of protein domains, the deepest common structural level within the SCOP hierarchy, given a one-dimensional representation of the domain structures. This representation encapsulates evolutionary information in terms of sequence identity and structural information characterising the secondary structure elements and lengths of the respective domains. The evaluation is performed in two steps, first selecting the best performing base learners and subsequently evaluating boosted and bagged meta learners. The boosted random forest, a collection of decision trees, is found to be the most accurate, with a cross-validated accuracy of 97.0% and F-measures of 0.97, 0.85, 0.93 and 0.98 for classification of proteins to the Class, Fold, Super-Family and Family levels in the SCOP hierarchy. The meta learning regime, especially boosting, improved performance by more accurately classifying the instances from less populated classes.
Enhancing the expressivity of PADL for specifying Web Services Architectures
Authors: Gregorio Díaz, María-Emilia Cambronero, M. Llanos Tobarra, Valentín Valero, Fernando L. Pelayo
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Process Algebra Description Language, PADL in short, is a description language for describing structural components specified as individual process working in parallel with communication capabilities. This description is close to what we consider a web service except for the communication process. The PADL language is consider for synchronous communication while we need an asynchronous definition in communications terms. Then we propose in this work an extension of PADL for specifying Web Services Architectures.
Investigating Motivation, Enjoyment, Usefulness toward Video on Demand
Authors: Shu-Sheng Liaw, Hsiu-Mei Huang
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The purpose of this study is to investigating learners' motivation, including perceived enjoyment and perceived usefulness, toward video on demand (VOD). Based on the statistical results, system quality, perceived self-efficacy toward VOD, and multimedia content are all critical factors to predict learners' motivation, including intrinsic and extrinsic motivation. From the results of this study, building high quality of VOD systems, enhancing learners' self-efficacy toward VOD systems, and abundant multimedia content are all successful factors for strengthening learners' motivation of using VOD systems.
Core schema mappings
Authors: Giansalvatore Mecca, Paolo Papotti, Salvatore Raunich
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algorithms to generate mappings based on visual specifications provided by users. On the other side, we have theoretical researches about data exchange. These study how to generate a solution - i.e., a target instance - given a set of mappings usually specified as tuple generating dependencies. However, despite the fact that the notion of a core of a data exchange solution has been formally identified as an optimal solution, there are yet no mapping systems that support core computations. In this paper we introduce several new algorithms that contribute to bridge the gap between the practice of mapping generation and the theory of data exchange. We show how, given a mapping scenario, it is possible to generate an executable script that computes core solutions for the corresponding data exchange problem. The algorithms have been implemented and tested using common runtime engines to show that they guarantee very good performances, orders of magnitudes better than those of known algorithms that compute the core as a post-processing step.
Enabling and optimizing pilot jobs using xen based virtual machines for the HPC grid applications
Authors: Omer Khalid, Richard J. Anthony, Paul Nilsson, Kate Keahey, Markus Schulz, Kevin Parrot, Miltos Petridis
Venue: Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing (2009)

The primary motivation for uptake of virtualization have been resource isolation, capacity management and resource customization: isolation and capacity management allow providers to isolate users from the site and control their resources usage while customization allows end-users to easily project the required environment onto a variety of sites. Various approaches have been taken to integrate virtualization with Grid technologies. In this paper, we propose an approach that combines virtualization on the existing software infrastructure such as Pilot Jobs with minimum change on the part of resource providers. We also present a standard API to enable a wider set of applications including Batch systems to deploy virtual machines on-demand as isolated job sandboxes. To illustrate the usefulness of this approach, we also evaluate the impact of Xen virtualization on memory and compute intensive tasks, and present our results that how memory and scheduling parameters could be tweaked to optimize job performance.
Sensor selection for energy-efficient ambulatory medical monitoring
Authors: Eugene I. Shih, Ali H. Shoeb, John V. Guttag
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

Epilepsy affects over three million Americans of all ages. Despite recent advances, more than 20% of individuals with epilepsy never achieve adequate control of their seizures. The use of a small, portable, non-invasive seizure monitor could benefit these individuals tremendously. However, in order for such a device to be suitable for long-term wear, it must be both comfortable and lightweight. Typical state-of-the-art non-invasive seizure onset detection algorithms require 21 scalp electrodes to be placed on the head. These electrodes are used to generate 18 data streams, called channels. The large number of electrodes is inconvenient for the patient and processing 18 channels can consume a considerable amount of energy, a problem for a battery-powered device. In this paper, we describe an automated way to construct detectors that use fewer channels, and thus fewer electrodes. Starting from an existing technique for constructing 18 channel patient-specific detectors, we use machine learning to automatically construct reduced channel detectors. We evaluate our algorithm on data from 16 patients used in an earlier study. On average, our algorithm reduced the number of channels from 18 to 4.6 while decreasing the mean fraction of seizure onsets detected from 99% to 97%. For 12 out of the 16 patients, there was no degradation in the detection rate. While the average detection latency increased from 7.8 s to 11.2 s, the average rate of false alarms per hour decreased from 0.35 to 0.19. We also describe a prototype implementation of a single channel EEG monitoring device built using off-the-shelf components, and use this implementation to derive an energy consumption model. Using fewer channels reduced the average energy consumption by 69%, which amounts to a 3.3x increase in battery lifetime. Finally, we show how additional energy savings can be realized by using a low-power screening detector to rule out segments of data that are obviously not seizures. Though this technique does not reduce the number of electrodes needed, it does reduce the energy consumption by an additional 16%.
The sudden experience of the computer
Authors: Robert Rosenberger
Venue: AI Society (2009)

The experience of computer use can be productively articulated with concepts developed in the phenomenological tradition of philosophy. Building on the insights of classical phenomenologists, Ihde has advanced a sophisticated view of the ways humans relate to technology. I review and expand on his notions of &#x201c;technological mediation,&#x201d; &#x201c;embodiment,&#x201d; and &#x201c;multistability,&#x201d; and apply them to the experience of computer interface. In particular, I explore the experience of using a computer that fails to work properly. A revealing example is the experience of a user who suddenly and unexpectedly encounters a slowly-loading webpage while using the Internet. This phenomenological framework provides an account of the ways a suddenly failing technology changes our relationships to the device, to the world, and to ourselves, and it also suggests how this experience can be usefully reconceptualized.
Infinite-Dimensional Quadrature and Approximation of&#x00a0;Distributions
Authors: Jakob Creutzig, Steffen Dereich, Thomas M&#x00fc;ller-Gronbach, Klaus Ritter
Venue: Foundations of Computational Mathematics (2009)

We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization and to the average Kolmogorov widths of the underlying probability measure. In addition to the general setting, we analyze, in particular, integration with respect to Gaussian measures and distributions of diffusion processes. We derive lower bounds for the worst case error of every algorithm in terms of its cost, and we present matching upper bounds, up to logarithms, and corresponding almost optimal algorithms. As auxiliary results, we determine the asymptotic behavior of quantization numbers and Kolmogorov widths for diffusion processes.
Behavior of a Technical Artifact: An Ontological Perspective in Engineering
Authors: Stefano Borgo, Massimiliano Carrara, Pieter E. Vermaas, Pawel Garbacz
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

The term 'behavior' is used ubiquitously in engineering. It refers roughly to the way technical artifacts 'behave' in a given or hypothetical situation, and plays a pivotal role in specific design methodologies since it allows connecting descriptions of the physical structure of technical artifacts to descriptions of their technical functions. However, behavior does not have a precise meaning: engineers use the term loosely and when attempting to pinpoint it, end up with incompatible characterizations. Here we formalize the different notions underlying the engineering usage by providing a uniform framework in which they can be related. This framework lays also a conceptual basis for a precise characterization of the notion of technical function in engineering. Our approach develops within the DOLCE ontology and introduces behavior as a new type of individual quality that relates a technical artifact to the event to which it participates. Starting with this assumption, one can distinguish actual, possible and general behaviors of an artifact (token). We add a few more definitions to capture more specific aspects and show their role in capturing engineering usage.
An integrated approach to evaluating the mutual influence of attributes in test recognition
Authors: S. I. Kolesnikova
Venue: Cybernetics and Systems Analysis (2009)

The problem of estimating the weight coefficients of attributes used in intelligent decision-support systems is considered. A procedure is proposed to estimate the relative significance of attributes based on special relative attribute-importance measures. The properties of the procedure are proved and illustrative examples are given.
Multi-policy optimization in decentralized autonomic systems
Authors: Ivana Dusparic, Vinny Cahill
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This paper addresses the challenge of multi-policy optimization in decentralized autonomic systems. We evaluate several multi-policy reinforcement learning-based optimization techniques in an urban traffic control simulation, a canonical example of a decentralized autonomic system. Our results indicate that W-learning, which learns separately for each policy and then selects between nominated actions based on current action importance, is a suitable approach for optimization towards multiple policies on non-collaborating agents in heterogeneous autonomic environments.
Testing Line Search Techniques for Finite Element Discretizations for Unsaturated Flow
Authors: Fred T. Tracy
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Unsaturated flow in porous media is often modeled using the finite element (FE) method. When employing an implicit version of the computational equations resulting from the FE discretization, a nonlinear system of equations is generated that must then be solved by techniques such as Newton's method. This paper reveals results of the effectiveness of three line search techniques when employed within the framework of the approximate Newton method. The methods of a bisection line search, a quadratic variation of the norm of the residual line search, and a relaxation technique are considered, all in the context of a parallel computing environment. 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
Networking Practitioner Research, 1st edition
Authors: Coll McLaughlin
Venue:  (2007)

A complement to Researching Schools by the same authors, this book provides readers with a strong theoretical framework for school-based research as well as valuable advice on the ways in which networks of specialist groups can work together to create a broad-ranging approach to educational research. Through a critical examination of existing research and current thinking, the authors draw out implications for the effective policy and practice of school-based research. Illustrated throughout with case studies and including a full and detailed literature review, this book will be a vital resource for all academics pursuing research into education. 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
Supporting daily scrum meetings with change structure
Authors: Jessica Rubart, Frank Freykamp
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

A flexible cooperative task board for supporting daily scrum meetings is described as an application of different hypermedia domains. In addition, change structure is introduced as a means to explicitly model changes in task management. It helps the scrum development team in a sprint retrospective to improve their planning.
Predictions of RNA secondary structure by combining homologous sequence information
Authors: Michiaki Hamada, Kengo Sato, Hisanori Kiryu, Toutai Mituyama, Kiyoshi Asai
Venue: Bioinformatics (2009)

Motivation: Secondary structure prediction of RNA sequences is an important problem. There have been progresses in this area, but the accuracy of prediction from an RNA sequence is still limited. In many cases, however, homologous RNA sequences are available with the target RNA sequence whose secondary structure is to be predicted. Results: In this article, we propose a new method for secondary structure predictions of individual RNA sequences by taking the information of their homologous sequences into account without assuming the common secondary structure of the entire sequences. The proposed method is based on posterior decoding techniques, which consider all the suboptimal secondary structures of the target and homologous sequences and all the suboptimal alignments between the target sequence and each of the homologous sequences. In our computational experiments, the proposed method provides better predictions than those performed only on the basis of the formation of individual RNA sequences and those performed by using methods for predicting the common secondary structure of the homologous sequences. Remarkably, we found that the common secondary predictions sometimes give worse predictions for the secondary structure of a target sequence than the predictions from the individual target sequence, while the proposed method always gives good predictions for the secondary structure of target sequences in all tested cases. Availability: Supporting information and software are available online at: http://www.ncrna.org/software/centroidfold/ismb2009/. Contact: hamada-michiaki@aist.go.jp Supplementary information:Supplementary data are available at Bioinformatics online.
Stability analysis for communication of voice terminals with packet reservation multiple access protocol
Authors: Amirali Sharifi, Eyad H. Abed
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper concerns stability analysis for the packet reservation multiple access (PRMA) protocol extendable for mobile satellite systems (MSSs). This protocol has been widely considered for providing speech and data communications in a terrestrial microcell system. Recently modified versions of the PRMA protocol have been the subject of extensive research, with the goal of application to low earth orbit mobile satellite systems (LEO-MSSs). These systems are expected to play a significant role in providing communication services to users around the world. The bistable behavior of the PRMA protocol for traffic with voice sources is investigated, and the bifurcations of the equilibrium points when control parameters change are determined. A price based bifurcation control scheme is proposed to increase the capacity of the PRMA protocol, defined as the number of simultaneous users within the system. By using Markov analysis, it is shown that the adaptively controlled system has a unique probability distribution function. Next, by using equilibrium point analysis (EPA) it is shown that the system possesses a unique equilibrium point. Finally, a brief discussion concerning the extension of the proposed bifurcation control scheme to the PRMA protocol over a random packet error channel is also provided.
Writing an OS Kernel in a Strictly and Statically Typed Language
Authors: Toshiyuki Maeda, Akinori Yonezawa
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

OS kernels have been written in weakly typed or non typed programming languages, for example, C. Therefore, it is extremely hard to verify even simple memory safety of the kernels. The difficulty could be resolved by writing OS kernels in strictly typed programming languages, but existing strictly typed languages are not flexible enough to implement important OS facilities (e.g., memory management and multi-thread management facilities). To address the problem, we designed and implemented TALK, a new strictly and statically typed assembly language which is flexible enough to implement OS facilities, and wrote an OS kernel with TALK. In our approach, the safety of the kernel can be verified automatically through static type checking at the level of binary executables without source code.
Dynamic video delivery in contact centers
Authors: David Skiba, George Erhart, Ramanujan Kashi, Valentine Matula
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Video is becoming an important medium for contact centers to serve customers, in addition to voice self service systems and live agents. Recently, video-enabled communication devices such as 3G mobile phones, IP softphones, and the like have become more widely deployed. For users of such video-enabled devices calling into contact centers, a more effective experience is possible using the video display combined with the existing voice output, and caller voice and DTMF input. In this paper we describe the architecture and implementation of a video contact center that provides both a video self-service and a rich agent-assisted video service with an application controlled dynamic video stream delivered to callers. Using dynamic video, the system provides for a level of interaction that goes beyond simply using video as another static recorded prompt technology. It closes with a list of issues to be addressed as the use of video matures.