ppxscal/embedding_network huggingface dataset:
Multi-perspective evaluation of self-healing systems using simple probabilistic models
Authors: Rean Griffith, Gail Kaiser, Javier Alonso López
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

In this paper we construct an evaluation framework for a self-healing system, VM-Rejuv -- a virtual machine based rejuvenation scheme for web-application servers -- using simple, yet powerful, probabilistic models that capture the behavior of its self-healing mechanisms from multiple perspectives (designer, operator, and end-user). We combine these analytical models with runtime fault-injection to study the operation of VM-Rejuv, and use the results from the fault-injection experiments and model-analysis to reason about the efficacy of VM-Rejuv, its limitations and strategies for mitigating these limitations in system-deployments. Whereas we use VM-Rejuv as the subject of our evaluation in this paper, our main contribution is the demonstration of a practical evaluation approach that can be generalized to other self-healing systems.
Peak-valley segmentation algorithm for fatigue time series data
Authors: Z. M. Nopiah, M. I. Khairir, S. Abdullah, C. K. E. Nizwan
Venue: WSEAS Transactions on Mathematics (2008)

This paper presents the peak-valley (PV) segmentation algorithm for the purpose of producing a reliable method of fatigue time series segmentation and statistical segment-by-segment analysis of fatigue damage. The time series were segmented using a piecewise linear representation (PLR) based segmentation algorithm and consecutively the peak-valley (PV) segmentation algorithm. Statistical analysis and fatigue damage calculations were made on each segment and scatter plots were produced based on the relationship between segmental damage and its corresponding kurtosis value. Observations were made on the scatter plots produced by the PV segmentation algorithm to determine the reliability of the data scattering for fatigue data clustering prospects.
Some operations preserving primitivity of words
Authors: Jürgen Dassow, Gema M. Martín, Francisco J. Vico
Venue: Theoretical Computer Science (2009)

We investigate some operations where essentially, from a given word w, the word ww^' is constructed where w^' is a modified copy of w or a modified mirror image of w. We study whether ww^' is a primitive word provided that w is primitive. For instance, we determine all cases with an edit distance of w and w^' at most 2 such that the primitivity of w implies the primitivity of ww^'. The operations are chosen in such a way that in the case of a two-letter alphabet, all primitive words of length @?11 can be obtained from single letters.
Mashing up visual languages and web mash-ups
Authors: M. Cameron Jones, Elizabeth F. Churchill, Michael B. Twidale
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Research on web mashups and visual languages share an interest in human-centered computing. Both research communities are concerned with supporting programming by everyday, technically inexpert users. Visual programming environments have been a focus for both communities, and we believe that there is much to be gained by further discussion between these research communities. In this paper we explore some connections between web mashups and visual languages, and try to identify what each might be able to learn from the other. Our goal is to establish a framework for a dialog between the communities, and to promote the exchange of ideas and our respective understandings of human-centered computing.
Producing timely recommendations from social networks through targeted search
Authors: Anil Gürsel, Sandip Sen
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

There has been a significant increase in interest and participation in social networking websites recently. For many users, social networks are indispensable tools for sharing personal information and keeping abreast with updates by their acquaintances. While there has been research on understanding the structure and effects of social networks, research on using social networks for developing targeted referral systems are few even though this can be valuable because of the abundance of information about user preferences, activities and choices. The goal of this research is to develop agent-based referral systems that learn user preferences based on past rating activities and caters to an individual user's interests by selectively searching the contributions posted by other users in close proximity in this user's social network. In particular, we are interested in fast notification of relevant activities in the social network that will enhance user awareness, satisfaction, and currency. In this paper, we propose keeping different trust values for a friend on different topics of interest and emphasize its importance with empirical results. We have developed an online photo referral system that identifies photos of possible interest to a user based on meta-data and comments on the pages of linked users on a popular photo sharing social website (flickr.com). We develop a probabilistic category determination mechanism that allows us to identify the possible categories an item belongs to by examining its tags. We use comments as an indirect measure of user preference for a photo. Empirical results show that our Social Network-based Item Recommendation (SNIR) system outperforms a content-based approach as well as the current recommendation schemes.
Parallel algorithm for finding an Eulerian path in an undirected graph
Authors: Akio Tada, Daisaburo Yoshioka, Eiichi Mukai, Yoshimi Matsumoto
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

There is Fleury's algorithm as a sequential algorithm for finding an Eulerian path in an undirected graph. However, we cannot find a parallel algorithm for this problem. In this paper, we proposed an efficient parallel algorithm for finding an Eulerian path in an undirected graph with n vertices and m edges on a CREW-PRAM model. Namely, the proposed algorithm initially determines whether or not a given graph has an Eulerian path. Next, we divide each vertex into several new vertices which have a maximum of 2 edge degrees, and connect between new vertices by edges. Consequently, we find one Eulerian path in the given graph. The proposed algorithm requires O(n + m) processors and O(log(n + m)) time on a CREW-PRAM model.
Improving the identification of non-anaphoric it using support vector machines
Authors: José Carlos Clemente Litrán, Kenji Satou, Kentaro Torisawa
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

Identification of non-anaphoric use of the pronoun it is crucial to achieve full anaphora resolution. Nevertheless, this problem has been either ignored or considered too simple to deserve a deeper study. In this paper we present a machine-learning approach using Support Vector Machines. We collected several instances of both anaphoric and non-anaphoric it from the GENIA corpus, together with syntactic information about the context. We show how by using a limited amount of knowledge our approach can achieve better accuracy than previous methods. We also analyze the relevance of features used to predict non-anaphoric uses.
The conference room as a toolbox: technological and social routines in corporate meeting spaces
Authors: Christopher Plaue, John Stasko, Mark Baloga
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

HCI, CSCW, and ubicomp researchers have developed new technologies and interaction techniques to support collaboration, ranging from electronic whiteboards to software supporting display sharing. However, very few longitudinal studies have explored the technological and social routines of individuals using personal devices in conjunction with shared displays under authentic settings in meeting rooms. We extend previous work in this area by studying routines within two multi-purpose meeting spaces at two design and manufacturing-oriented corporations, with particular emphasis on the shared display found in each location. Our contribution to this space is a holistic approach to understanding the dynamics between people, devices, information, and the physical environment of meeting spaces. We argue that while it is important to improve technological infrastructures, such as enhancing display sharing abilities, understanding the social and technology routines that currently support collaboration are beneficial to technology designers aiming to enhance existing practices. In this paper, we analyze the routines occurring in these two spaces and discuss several routines that are impacted not only by technological limitations, but social conventions. We explore the types of interaction with devices and displays and identify other factors that contribute to the communities of information--items discussed, presented, or displayed--within these environments. To further explore the integrity of these routines, we introduced a second shared display to each space and observed groups responding very differently to the new technology, some integrating it into their routines while others dismissed it. We argue that meeting spaces need to be toolboxes containing many tools, some redundant, to successfully support information sharing routines.
Mobile health monitoring and smart sensors: a product line approach
Authors: Miguel A. Laguna, Javier Finat, José A. González
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

The evolution of the population pyramid in developed countries, with an increasing proportion of aged people introduces new challenges to the public and private assistance services. A form of improving these services while keeping controlled the associated costs is to use remote continuous assistance. Wireless sensors allow obtaining real-time information of health parameters in a non-intrusive way. The determination of alert values for these parameters and the computing possibilities of the current mobile devices can facilitate a faster intervention which will minimize risks linked to delays in medical assistance. However, the diversity of risk situations is a factor that increases costs as many similar but not exactly identical products will be necessary now and in the future. We aim to solve this problem using an approach of software product lines, as multiple options can be easily incorporated to each final product implementation. This article presents the product line generic architecture and some examples of application, using wireless sensors connected to a central station by means of a smart phone, which is able to detect alarm situations.
Mac OS X 10.5 Leopard: Peachpit Learning Series, 1st edition
Authors: Robin Williams
Venue:  (2007)

Learn how to get the most out of Mac OS X version 10.5 Leopard with legendary teacher and author Robin Williams. The Peachpit Learning Series brings you the best-selling authors you know and love, on the topics that are near and dear to you, in a format that allows you to learn just what you need to know, and at your own pace. With this book, you can learn in your own waywhether its working through the lessons from start to finish, jumping straight to step-by-step exercises about new features, or looking up just what you need to know at that moment. There are hundreds of exciting tools and hidden gems in your Macintosh. And with the gentle yet expert hand of Robin Williams guiding you along the way, you will learn to take full advantage of all that Leopard has to offer. If you are new to Mac OS X, you'll learn to use your Mac with help from a world-renowned teacher. From there, you can move on to customize it to suit the way you work. And if you've been using Mac OS X already, you'll learn to use the new features in Leopard, like Spaces, Quick Look, and Time Machine, and explore all the enhancements to favorites like Mail and iChat. 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
Intelligent Information Technologies: Concepts, Methodologies, Tools and Applications
Authors: Vijayan Sugumaran, Vijayan Sugumaran
Venue:  (2007)

A new generation of intelligent technologies such as Semantic Web, multi-agent systems, and Web ontologies are emerging rapidly as the next force for change, innovation, and opportunity in the information-technology realm. Intelligent Information Technologies: Concepts, Methodologies, Tools, and Applications compiles more than 240 chapters from the world s leading experts to provide a foundational body of research to drive further evolution and innovation of these next-generation technologies and their applications, of which the scientific, technological, and commercial communities have only begun to scratch the surface. Comprehensively covering leading-edge developments such as artificial intelligence, virtual environments, and multi-media information processing, this vast, four-volume collection is an essential reference acquisition for any library seeking to cover the leading edge of technological innovations.
Design and evaluation of FPGA based hardware accelerator for elliptic curve cryptography scalar multiplication
Authors: Kapil A. Gwalani, Omar Elkeelany
Venue: WSEAS Transactions on Computers (2009)

Embedded systems find applications in fields such as defense, communications, industrial automation and many more. For majority of these applications, security is a vital issue. Over the last decade, security has become the primary concern when discussing e-commerce. The rapid development in the field of information technology has led to the increase in need of techniques capable of providing security. Cryptography plays an important role in providing data security. Until recently, symmetric key encryption schemes were used for a majority of these applications. Now however, asymmetric key encryption schemes such as Elliptic curve cryptography are gaining popularity as they require less computational power and memory and are still capable of providing equivalent security when compared to their counterparts. Elliptic curve cryptography was first introduced in 1985 and has always been around since. Scalar or point multiplication in elliptic curve cryptography has been a topic of research interest. Improving the performance of scalar multiplication can improve the overall performance of elliptic curve cryptography. One popular method to improve scalar multiplication is by means of hardware accelerators. The authors of this paper have implemented scalar multiplication, the most time consuming operation in elliptic curve cryptography using binary non-adjacent form algorithm. The results of the software implementation have been presented in section- 4. Methodology to improve the performance of the scalar multiplication by use of hardware accelerators has also been presented in this paper.
The Emotion Machine: Commonsense Thinking, Artificial Intelligence, and the Future of the Human Mind
Authors: Marvin Minsky
Venue:  (2007)

In this mind-expanding book, scientific pioneer Marvin Minsky continues his groundbreaking research, offering a fascinating new model for how our minds work. He argues persuasively that emotions, intuitions, and feelings are not distinct things, but different ways of thinking.By examining these different forms of mind activity, Minsky says, we can explain why our thought sometimes takes the form of carefully reasoned analysis and at other times turns to emotion. He shows how our minds progress from simple, instinctive kinds of thought to more complex forms, such as consciousness or self-awareness. And he argues that because we tend to see our thinking as fragmented, we fail to appreciate what powerful thinkers we really are. Indeed, says Minsky, if thinking can be understood as the step-by-step process that it is, then we can build machines -- artificial intelligences -- that not only can assist with our thinking by thinking as we do but have the potential to be as conscious as we are.Eloquently written, The Emotion Machine is an intriguing look into a future where more powerful artificial intelligences await.
Modeling spatial and spatio-temporal co-occurrence patterns
Authors: Shashi Shekhar
Venue:  (2008)

As the volume of spatial and spatio-temporal data continues to increase significantly due to both the growth of database archives and the increasing number and resolution of spatio-temporal sensors, automated and semi-automated pattern analysis becomes more essential. Spatial and spatio-temporal (ST) data analyses have emerged in recent decades to develop understanding of the spatial and spatio-temporal characteristics and patterns. However, in the last decade, the growth in variety and volume of observational data, notably spatial and spatio-temporal data, has out-paced the capabilities of analytical tools and techniques.Major limitations of existing classical data mining models and techniques include the following. First, these do not adequately model richer temporal semantics of data observations (e.g. co-occurrence patterns of moving objects, emerging and vanishing patterns, multi-scale cascade patterns, periodic patterns). Second, these do not take into account time dimension of the data observations. Third, these do not provide sufficient interest measures and computationally efficient algorithms to discover spatial and spatio-temporal co-occurrence patterns. These limitations represent critical barriers in several application domains that require to analyze huge datasets.In this dissertation, I proposed addressed these limitations by (i) providing a framework to model the rich semantics of the ST patterns of data observations by developing a taxonomy of spatial and ST co-occurrence patterns, (ii) designing new techniques that are taking into account the time dimension of the data, and (iii) developing new monotonic composite interest measures and scalable algorithms. The proposed approaches reduced the manual effort by reducing the plausible set of hypotheses. Major focus would be on developing scalable algorithms to mine spatial and ST co-occurrence patterns.
An application of Semantic Information Retrieval System for International Relations
Authors: Shiori Sasaki, Yasushi Kiyoki, Hiroyasu Akutsu
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

In this paper, we present an implementation method of a semantic information retrieval system using specialized and general knowledge and its application for the field of International Relations (IR). To realize our system, we apply the Semantic Associative Search Method to the system. The Semantic Associative Search Method makes it possible to compute semantic relationships between words and documents according to a given context dynamically. The important features of our system are distilled to the three points: 1) a user can obtain and analyze IR-related documents by using general words even if the user does not have special knowledge of IR, 2) a user can analyze both time-varying and source-specific semantics of IR-related documents, 3) a user can acquire IR-related information that maintains relevancies to IR expertise. This new semantic retrieval environment for IR field is realized by creating a semantic vector space where document data with metadata of both technical terms and general words can be mapped, and also by applying a learning system to the IR document database, which can adapt retrieval results to individual context and improve accuracy of the database. To verify the feasibility and the practical effectiveness of our system, we performed qualitative and quantitative experiments with the evaluation by IR experts.
Towards traceable test-driven development
Authors: Jane Huffman Hayes, Alex Dekhtyar, David S. Janzen
Venue: Proceedings of the 2009 ICSE Workshop on Traceability in Emerging Forms of Software Engineering (2009)

Key among the Grand Challenges in Traceability are those that lead to achieving traceability as a by-product of the natural software development life cycle. This position paper profiles test-driven development (TDD), an emerging software development practice, in which automated tests and code satisfying them are developed in rapid succession over multiple iterations. Our position is that the nature of TDD offers unique opportunities for collecting traceability information throughout the TDD life cycle and that the provision of traceability information to the software developers during TDD will improve the process and the resulting software. We discuss the opportunities, challenges, and plans for the synthesis of TDD and traceability.
Formal specification of system functions
Authors: Bernd Spanfelner, Christian Leuxner, Wassiou Sitou
Venue: Proceedings of the 2009 ICSE Workshop on Modeling in Software Engineering (2009)

Today's software systems tend more and more to comprise a multitude of different, often interfering functionalities. Especially in the case of embedded systems with their high requirements on safety this imposes additional risks for unwanted system behavior. Use cases are a common way to describe system functionalities in very early phases of the system design. Systematically translating these use cases into formal models in terms of system functions or services, respectively, constitutes a logical next step resulting in formal, service-oriented models. These models may facilitate validation activities, but are not efficient for formal verification. In this paper we propose an algebraic approach to specifying system functions as services. The proposed approach allows for model restructuring and transformation heading towards sufficing both requirements: intuitive validation and more efficient formal verification.
Hamiltonian cycles in Dirac graphs
Authors: Bill Cuckler, Jeff Kahn
Venue: Combinatorica (2009)

We prove that for any n-vertex Dirac graph (graph with minimum degree at least n/2) G=(V,E), the number, &#x03a8;(G), of Hamiltonian cycles in G is at least $$exp_2 [2h(G) - n\log e - o(n)]$$, where h(G)=max&#x03a3;e x e log(1/x e ), the maximum over x: E &#x2192; &#x211c;+ satisfying &#x03a3;e&#x220b;&#x03c5; x e = 1 for each &#x03c5; &#x2208; V, and log =log2. (A second paper will show that this bound is tight up to the o(n).) We also show that for any (Dirac) G of minimum degree at least d, h(G) &#x2265; (n/2) logd, so that &#x03a8;(G) > (d/(e + o(1)))n . In particular, this says that for any Dirac G we have &#x03a8;(G) > n!/(2 + o(1))n , confirming a conjecture of G. S&#x00e1;rk&#x00f6;zy, Selkow, and Szemer&#x00e9;di which was the original motivation for this work.