ppxscal/embedding_network huggingface dataset:
Frame Detection over the Semantic Web
Authors: Bonaventura Coppola, Aldo Gangemi, Alfio Gliozzo, Davide Picca, Valentina Presutti
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

In the past, research in ontology learning from text has mainly focused on entity recognition, taxonomy induction and relation extraction. In this work we approach a challenging research issue: detecting semantic frames from texts and using them to encode web ontologies. We exploit a new generation Natural Language Processing technology for frame detection, and we enrich the frames acquired so far with argument restrictions provided by a super-sense tagger and domain specializations. The results are encoded according to a Linguistic MetaModel, which allows a complete translation of lexical resources and data acquired from text, enabling custom transformations of the enriched frames into modular ontology components.
Generating research websites using summarisation techniques
Authors: Advaith Siddharthan, Ann Copestake
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Demo Session (2008)

We describe an application that generates web pages for research institutions by summarising terms extracted from individual researchers' publication titles. Our online demo covers all researchers and research groups in the Computer Laboratory, University of Cambridge. We also present a novel visualisation interface for browsing collaborations.
Color Index 2: Over 1500 New Color Combinations. For Print and Web Media. CMYK and RGB Formulas.
Authors: Jim Krause
Venue:  (2007)

A new take on color combinations! Color Index 2 contains hundreds of different color combinations, each with an accurate formula for both print and web use. You'll easily find the best colors for your piece with chapters organized by dominant hue, and with unique expansion palettes--sets of four related hues arranged from dark to light--that allow you to explore even more color combinations for limitless possibilities. Designers, illustrators, photographers and fine artists alike will find this book an indispensible tool when it comes to finding color-related ideas and solutions. A companion to its best-selling predecessor, Color Index 2 offers even more colors and fresh new combinations of colors, making it easier than ever to create harmonious palettes for whatever project you're working on!
Description Logics, Data Modelling and Relational Dependencies
Authors: Tapio Niemi, Marko Niinimäki, Santtu Toivonen
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

Description Logics are a well-known formalism used in artificial intelligence. We present an approach where a Description Logic is used as an intuitive modelling language. Unlike many other modelling methods, this provides a sound semantic basis for modelling. We indicate that the database implementation is effective and unambiguous, since there is a direct mapping between our formalism and dependencies in the relational model. We also give an example applying the method to the Semantic Web.
Author index
Authors: Scott W. Ambler
Venue: Proceedings of the 2009 ICSE Workshop on Software Development Governance (2009)

Agile project teams are potentially easy to govern than traditional project teams due to the greater visibility and opportunities to steer provided to stakeholders. Unfortunately, traditional IT governance strategies prove to be at odds to agile's collaborative, value-focused strategies. As a result a lean approach based on enablement, collaboration, and motivation is required to effectively govern agile teams.
Keyword search in databases: the power of RDBMS
Authors: Lu Qin, Jeffrey Xu Yu, Lijun Chang
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMS. In brief, it finds how the tuples containing the given keywords are connected via sequences of connections (foreign key references) among tuples in an RDB. Such interconnected tuple structures can be found as connected trees up to a certain size, sets of tuples that are reachable from a root tuple within a radius, or even multi-center subgraphs within a radius. In the literature, there are two main approaches. One is to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. Due to a large number of relational algebra expressions needed to process, most of the existing works take a middleware approach without fully utilizing RDBMSs. The other is to materialize an RDB as a graph and find the interconnected tuple structures using graph-based algorithms in memory. In this paper we focus on using SQL to compute all the interconnected tuple structures for a given keyword query. We use three types of interconnected tuple structures to achieve that and we control the size of the structures. We show that the current commercial RDBMSs are powerful enough to support such keyword queries in RDBs efficiently without any additional new indexing to be built and maintained. The main idea behind our approach is tuple reduction. In our approach, in the first reduction step, we prune tuples that do not participate in any results using SQL, and in the second join step, we process the relational algebra expressions using SQL over the reduced relations. We conducted extensive experimental studies using two commercial RDBMSs and two large real datasets, and we report the efficiency of our approaches in this paper.
Mechanisms and Functional Brain Areas
Authors: Gregory Johnson
Venue: Minds and Machines (2009)

Explanations of how psychological capacities are carried out often invoke functional brain areas. I argue that such explanations cannot succeed. Psychological capacities are carried out by identifiable entities and their activities in the brain, but functional brain areas are not the relevant entities. I proceed by assuming that if functional brain areas did carry out psychological capacities, then these brain areas could be included in descriptions of mechanisms. And if functional brain areas participate in mechanisms, then they must engage in activities. A number of ways in which we might understand the claim that functional brain areas engage in activities are examined. None are successful, and so one conclusion is that functional brain areas do not participate in mechanisms. Consequently, they are not the entities that carry out psychological capacities.
Using distributed w-learning for multi-policy optimization in decentralized autonomic systems
Authors: Ivana Dusparic, Vinny Cahill
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

Distributed W-Learning (DWL) is a reinforcement learning-based algorithm for multi-policy optimization in agent-based systems. In this poster we propose the use of DWL for decentralized multi-policy optimization in autonomic systems. Using DWL agents learn and exploit the dependencies between the policies that they are implementing, to collaboratively optimize the performance of an autonomic system. Our initial evaluation shows that DWL is a feasible algorithm for multi-policy optimization in decentralized autonomic systems. Our results show that a multi-policy collaborative DWL deployment outperforms individual single policy deployments, as well non-collaborative deployments.
Transparent multi-core cryptographic support on Niagara CMT Processors
Authors: James Hughes, Gary Morton, Jan Pechanec, Christoph Schuba, Lawrence Spracklen, Bhargava Yenduri
Venue: Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering (2009)

How cryptographic functionality has been implemented and made available in application scenarios has evolved over time. Pure software implementations were the obvious first choice, followed by dedicated hardware devices, be it co-processors or hardware accelerators accessible on the main bus.
Second Sourcing vs. Sole Sourcing with Capacity Investment and Asymmetric Information
Authors: Cuihong Li, Laurens G. Debo
Venue: Manufacturing Service Operations Management (2009)

We study the decision of a manufacturer (the buyer), expecting new sourcing opportunities in the future, in selecting between sole-and second-sourcing strategies for a noncommodity component. In a sole-sourcing strategy, the buyer commits to sourcing from a single supplier (the incumbent) over the entire horizon. In a second-sourcing strategy, the buyer keeps the option open to source from a new supplier (the entrant) in the future. Supplier costs are private information, and the incumbent's cost may change in the future because of what it has learned. The buyer is relatively sure about current demand but uncertain about future demand. A supplier has to invest in capacity to produce the inputs for the buyer. With future private cost information, the incumbent earns rent in the future, and this prospective rent influences the incumbent's decision early in the horizon. On one hand, a second-sourcing strategy allows the buyer to take advantage of alternative sourcing opportunities, lowering her future cost. This benefit to the buyer is referred to as the option value of second sourcing. On the other hand, the future supplier competition in second-sourcing hurts the incumbent's future profit. The expectation of a lower future profit in second sourcing induces the incumbent to ask for a higher price at the beginning of the horizon. This causes more initial sourcing cost for the buyer in second sourcing than in sole sourcing, and is referred to as the cost of future supplier competition of second sourcing. The overall benefit of second sourcing relative to sole sourcing is influenced by the demand distribution and capacity cost. If the demand increases over time with positive probability, the incumbent's initial capacity may not be able to cover all future demand. If the capacity is cheap, the entrant may serve as an exclusive supplier, ousting the incumbent. In this case, the option value of second sourcing is high. If the capacity is expensive, the entrant may serve as a supplementary supplier by receiving only the demand in excess of the incumbent's installed capacity. In this case, the cost of future supplier competition is low and the option value is still significant. Thus second sourcing is better than sole sourcing not only when the capacity cost is low, but also when it is high (under the condition that demand increases over time with positive probability and the entrant's cost is relatively low). For intermediate capacity cost, the cost of future supplier competition dominates the option value; hence, sole sourcing is preferred. We also find that second sourcing is more attractive when the buyer expects the future demand to be higher or more volatile. Finally, more initial incumbent capacity strengthens the incumbent's competitiveness against the entrant, reducing the cost of future supplier competition. As a result, we find that second sourcing may lead to overinvestment of the initial capacity.
Beyond boxes and arrows: argumentation support in terms of the knowledge structure of a legal topic
Authors: Maaike Schweers, Bart Verheij
Venue: Proceeding of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference (2007)

Today's argumentation software mostly emphasizes the logical structure of reasoning, and especially the structure as it can be represented in boxes-and-arrows style diagrams. In this paper an alternative way of providing argumentation support is proposed. A content-oriented, relatively lowtech tool is presented, based on the knowledge structure of a legal topic, inspired by the structure of legal treatises. The design for this system builds on research in the areas of law, logic, argumentation theory and cognitive ergonomics. A small user evaluation has been performed to examine the usefulness of the system. We show that supporting legal reasoning based on the knowledge structure of a legal topic can be an interesting foundation for argumentation software.
On sophie germain primes
Authors: Manuel Meireles
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

This article proves: the (Sophie Germain prime numbers are numbers of the type Nβ = 6a + 5 with a ∈ N, a ≥ 0 ; b) there are infinites germain prime numbers. This article interests potentially for all those that are researching new and every larger Sophie Germain primes.
New Results for Horn Cores and Envelopes of Horn Disjunctions
Authors: Thomas Eiter, Kazuhisa Makino
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs that has appealing properties (e.g., it is polynomial for a bounded disjunction). Furthermore, we show that recognizing the Horn envelope of a disjunction of two Horn CNFs is intractable, and that computing a compact Horn CNF for it (that is irredundant and prime) is not feasible in polynomial total time unless P=NP; this answers an open problem.
Atomic layer deposition of Ge2Sb2Te5 thin films
Authors: Mikko Ritala, Viljami Pore, Timo Hatanpää, Mikko Heikkilä, Markku Leskelä, Kenichiro Mizohata, Alejandro Schrott, Simone Raoux, Stephen M. Rossnagel
Venue: Microelectronic Engineering (2009)

Ge"2Sb"2Te"5 (GST) thin films were deposited by Atomic Layer Deposition (ALD) method using a novel alkylsilyl tellurium precursor. Film composition was studied with time-of-flight elastic recoil detection analysis (TOF-ERDA) and energy dispersive x-ray analysis. Phase change properties of the films were characterised by high-temperature X-ray diffraction and laser based crystallization measurements. Crystallization properties of ALD GST were found to be similar to sputter-deposited films.
The adaptive operational Tau method for systems of ODEs
Authors: S. Mohammad Hosseini
Venue: Journal of Computational and Applied Mathematics (2009)

As the Tau method, like many other numerical methods, has the limitation of using a fixed step size with some high degree (order) of approximation for solving initial value problems over long intervals, we introduce here the adaptive operational Tau method. This limitation is very much problem dependent and in such case the fixed step size application of the Tau method loses the true track of the solution. But when we apply this new adaptive method the true solution is recovered with a reasonable number of steps. To illustrate the effectiveness of this method we apply it to some stiff systems of ordinary differential equations (ODEs). The numerical results confirm the efficiency of the method.
The impact of e-learning in education
Authors: Claudia Blezu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

It is evident that information and communication technologies (ICT) have transformed our lives and reshaped the nature of everyday activities and contemporary times are often called the 'information age' or the 'knowledge society'. In today's day and age, education plays a big role in which we are and what we can achieve in our lifetime. Planning and implementing courses - no matter whether done for face-to-face education or within e-learning environments - deal a lot with pedagogical issues. Learning is influenced by a couple of factors such as attention, motivation, emotions, etc. as well as by learner characteristics like prior knowledge, cognitive and learning styles, intellectual capabilities, constitutional states and the forth. E-learning is the unifying term to describe the fields of online learning, web-based training and technology-delivered instruction. Nothing is changing as fast as all the terms related to E-learning. In E-learning environments learners interact with learning materials, their instructors and other learners from various locations and often at various times using network technologies.
Windows Home Server For Dummies: For Dummies Computer/Tech
Authors: Woody Leonhard
Venue:  (2007)

If you work in an office, you probably dont lose much sleep worrying about whether your files are safe if your PC melts down. Company IT departments handle those things for business networks. But how about all those precious photos, address lists, the family genealogy, and everything else that lives on your home network? Windows Home Server can save the day if one of your personal PCs hiccups, and Windows Home Server For Dummies serves up all the stuff you need to know to put it to work. Forget everything youve heard about previous versions of Windows Server; this all-new variation has been designed for people who dont wear white lab coats or pocket protectors. Woody Leonhard has tested it and it passed with flying colors. If you have a home or small business network, this book shows you how Windows Home Server helps you Share files among all the PCs in your home Access your files from anywhere Make regular backups automatically Store files securely Play music, TV shows, or movies on your Xbox Share multimedia across your network Keep your virus protection and system upgrades up to date Get regular reports on the overall health of your network Windows Home Server For Dummies provides sage advice on choosing a version of Windows Home Server, installing it, setting up users and passwords, using remote access, scheduling automatic scans and backups, and having fun with multimedia. Trust Woody youll sleep better. 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
Fast radial basis function interpolation with Gaussians by localization and iteration
Authors: Claudio E. Torres, L. A. Barba
Venue: Journal of Computational Physics (2009)

Radial basis function (RBF) interpolation is a technique for representing a function starting with data on scattered points. In the vortex particle method for solving the Navier-Stokes equations, the representation of the field of interest (the fluid vorticity) as a sum of Gaussians is like an RBF approximation. In this application, there are two instances when one may need to solve an RBF interpolation problem: upon initialization of the vortex particles, and after spatial adaptation to replace a set of disordered particles by another set with a more regular distribution. Solving large RBF interpolation problems is notoriously difficult with basis functions of global support, due to the need to solve a linear system with a fully populated and badly conditioned matrix. In the vortex particle method, in particular, one uses Gaussians of very small spread, which lead us to formulate a method of solution consisting of localization of the global problem, and improvement of solutions over iterations. It can be thought of as an opposite approach from the use of compact support basis functions to ease the solution procedure. Compact support bases result in sparse matrices, but at the cost of reduced approximation qualities. Instead, we keep the global basis functions, but localize their effect during the solution procedure, then add back the global effect of the bases via the iterations. Numerical experiments show that convergence is always obtained when the localized domains overlap via a buffer layer, and the particles overlap moderately. Algorithmic efficiency is excellent, achieving convergence to almost machine precision very rapidly with well-chosen parameters. We also discuss the complexity of the method and show that it can scale as O(N) for N particles.
Towards Agent-Based Collaborative Design
Authors: Md. Mosharrof Hossain Sarker
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

A complex system is concerned with several differential stages and heterogeneous skills of partners. To complete this type of design within a specific timeframe and with a reasonable cost, the task of design is distributed by nature. Getting geographically dispersed partners together to collaborate on a joint project is costly and time consuming. Developing a virtual teamwork based on web technology where the partners can express their opinions without traveling could reduce the complexity to meet them together in a place. With the advent of the internet and the techniques available from Distributed Artificial Intelligence (DAI), electronic collaborative design has become possible. Therefore, descriptions of architectures of query agent and manipulating agent are given, and two agents are considered for distributed collaborative design. One agent is dealing with T-Bar while the other agent is dealing with C-Bar. A typical square bar consisting of T-Bar and C-Bar is built using “Point to Point” notion. Knowledge Query and Manipulating Language (KQML) is used as a protocol for knowledge and information exchange.
Smoothing Newton Method for L1 Soft Margin Data Classification Problem
Authors: Weibing Chen, Hongxia Yin, Yingjie Tian
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

A smoothing Newton method is given for solving the dual of the l 1 soft margin data classification problem. A new merit function was given to handle the high-dimension variables caused by data mining problems. Preliminary numerical tests show that the algorithm is very promising.
Qualitative Analysis of General Discrete-Time Recurrent Neural Networks with Impulses
Authors: Xinquan Zhao
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this article, the qualitative analysis of general discrete-time recurrent neural networks with impulses is discussed. First, a sufficient condition and a sufficient and necessary condition for existence and uniqueness of the equilibrium point of this neural networks are given with the help of degree theory; second, some sufficient rules for the global exponential stability of this neural networks are obtained by using Lyapunov function; finally the instability of the equilibrium is studied.
Technology as Experience
Authors: John McCarthy, Peter Wright
Venue:  (2007)

In Technology as Experience, John McCarthy and Peter Wright argue that any account of what is often called the user experience must take into consideration the emotional, intellectual, and sensual aspects of our interactions with technology. We don't just use technology, they point out; we live with it. They offer a new approach to understanding human-computer interaction through examining the felt experience of technology. Drawing on the pragmatism of such philosophers as John Dewey and Mikhail Bakhtin, they provide a framework for a clearer analysis of technology as experience. Just as Dewey, in Art as Experience, argued that art is part of everyday lived experience and not isolated in a museum, McCarthy and Wright show how technology is deeply embedded in everyday life. The "zestful integration" or transcendent nature of the aesthetic experience, they say, is a model of what human experience with technology might become. McCarthy and Wright illustrate their theoretical framework with real-world examples that range from online shopping to ambulance dispatch. Their approach to understanding human-computer interactionseeing it as creative, open, and relational, part of felt experienceis a measure of the fullness of technologys potential to be more than merely functional.