ppxscal/embedding_network huggingface dataset:
Business Driven Technology with Premium Content Card, 3 edition
Authors: Paige Baltzan, Amy Phillips, Stephen Haag
Venue:  (2008)

Business Driven Technology discusses various business initiatives first and how technology supports those initiatives second. The premise for this unique approach is that business initiatives should drive technology choices. Every discussion first addresses the business needs and then addresses the technology that supports those needsTable of contentsChapter 1 Business Driven TechnologyChapter 2 Identifying Competitive AdvantagesChapter 3 Strategic Initiatives for Implementing Competitive AdvantagesChapter 3 Measuring the Success of Strategic InitiativesChapter 4 Organizational Structures that Support Strategic InitiativesChapter 5 Valuing Organizational InformationChapter 6 Storing Organizational Information – DatabasesChapter 7 Accessing Organizational Information – Data WarehouseChapter 8 Enabling the Organization – Decision MakingChapter 9 Extending the Organization – Supply Chain ManagementChapter 10 Building a Customer-Centric Organization – Customer Relationship ManagementChapter 11 Integrating the Organization from End-to-End – Enterprise Resource PlanningChapter 12 Creating Innovative OrganizationsChapter 13 E-BusinessChapter 14 Creating Collaborative PartnershipsChapter 15 Integrating Wireless Technology in BusinessChapter 16 Building Software to Support an Agile OrganizationChapter 17 Outsourcing in the 21st CenturyChapter 18 Developing a 21st Century Organization Business Plug-InsB1 Business BasicsB2 Business ProcessB3 Hardware and SoftwareB4 Enterprise ArchitecturesB5 Networks, Telecommunications, and Wireless ComputingB6 Information SecurityB7 EthicsB8 Supply Chain ManagementB9 Customer Relationship ManagementB10 Enterprise Resource PlanningB11 E-Business ModelsB12 Emerging Trends and TechnologyB13 Strategic OutsourcingB14 Systems DevelopmentB15 Project ManagementTechnical Plug-InsT1 Personal Productivity Using IT (OLC only)T2 Basic Skills Using Excel (OLC only)T3 Problem Solving Using Excel (OLC only)T4 Decision Making Using Excel (OLC only)T5 Designing Database Applications (OLC only)T6 Basic Skills Using Access (OLC only)T7 Problem Solving Using Access (OLC only)T8 Decision Making Using Access (OLC only)T9 Designing Web Pages (OLC only)T10 Creating Web Pages Using HTML (OLC only)T11 Creating Web Pages Using Dreamweaver (OLC only)T12 Creating Gantt Charts with Excel and Microsoft Project (OLC only)
SemTAG: a platform for specifying tree adjoining grammars and performing TAG-based semantic construction
Authors: Claire Gardent, Yannick Parmentier
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

In this paper, we introduce SemTag, a free and open software architecture for the development of Tree Adjoining Grammars integrating a compositional semantics. SemTag differs from XTAG in two main ways. First, it provides an expressive grammar formalism and compiler for factorising and specifying TAGs. Second, it supports semantic construction.
Restrained utilization of idleness for transparent scheduling of background tasks
Authors: Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, Erik Riedel
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal to keep these features transparent to the user. In this paper, we present an algorithmic framework that determines the schedulability of non-preemptable low priority tasks in storage systems. The framework estimates when and for how long idle times can be utilized by low priority background tasks, without violating pre-defined performance targets of user foreground tasks. The estimation is based on monitored system information that includes the histogram of idle times. This histogram captures accurately important statistical characteristics of the complex demands of the foreground activity. The robustness and the effectiveness of the proposed framework is corroborated via extensive trace driven simulations under a wide range of system conditions and background activities, and via experimentation on a Linux kernel 2.6.22 prototype.
Code Generation with the Exemplar Flexibilization Language
Authors: R. Heradio, J. A. Cerrada, J. C. Lopez, J. R. Coz
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Code Generation is an increasing popular technique for implementing Software Product Lines that produces code from abstract specifications written in Domain Specific Languages (DSLs). This paper proposes to take advantage of the similitude among the products in a domain to generate them by analogy. That is, instead of synthesizing the final code from scratch or transforming the DSL specifications, the final products are obtained by adapting a previously developed domain product. The paper also discusses the capabilities and limitations of several currently available tools and languages to implement this kind of generators and introduce a new language to overcome the limitations.
Agile development: issues and avenues requiring a substantial enhancement of the business perspective in large projects
Authors: Oualid Ktata, Ghislain Lévesque
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Large-scale projects, are often delivering low value software to businesses due to stakeholders' misunderstanding. Evolutionary software development represents an alternative to plan-driven development in order to tackle today's turbulent environments. In agile development, a type of evolutionary development, the product owner (P.O.) who is the customer representative---real accountable role---is ill-equipped to identify and prioritize the stakeholders' most success-critical expectations and potential sources of business value. Furthermore, the tools he can use have their own scalability issues that question their underlying principles. Moreover, without a substantial involvement to take into account all stakeholders, software providers are more likely acting as commodity-utility providers than real business partners. In today's business context, there is a clear need for a value-driven development which embraces changes along with higher visibility and understanding of business transformations. The current problems of software crisis could be condensed in a twofold business perspective dilemma: Doing the right product and providing efficient guidance to the development project. Approaches based on goals have been successfully used in Requirements Engineering (RE) and IT governance to address issues similar to the current software crisis. Commonalities in motivations behind the use of goals in both domains can open new avenues for improving the business perspective in Scrum. A goal-value oriented approach is then proposed as a candidate approach to balance the stakeholders' needs and expectations for large-scale agile developments and ensure focus on delivering high value functionalities.
Strong Cyclic Planning under Partial Observability
Authors: Piergiorgio Bertoli, Alessandro Cimatti, Marco Pistore
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Strong Cycling Planning aims at generating iterative plans that implement trial-and-error strategies, where loops are allowed only so far as there is a chance to reach the goal. In this paper, we tackle the problem of Strong Cyclic Planning under Partial Observability, making three main contributions. First, we provide a formal definition of the problem. We point out that several degrees of solution are possible and equally interesting, depending on the admissible delay between achieving the goal and detecting that it has been achieved. Second, we present a family of planning algorithms that tackle the different versions of the problem. Third, we implement the algorithms using efficient symbolic representation techniques, and experimentally compare their performances.
Simplex stability
Authors: Dhruv Mubayi, Reshma Ramadurai
Venue: Combinatorics, Probability and Computing (2009)

A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009705_char1"/></private-char> be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if <inline-graphic mime-subtype="gif" xlink="S0963548309009705_inline1"><alt-text>$|\cG| \geq (1-o(1))\binom{n-1 }{k-1}$</alt-text></inline-graphic>, then there is a vertex x of <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009705_char1"/></private-char> such that the number of sets in <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009705_char1"/></private-char> omitting x is o(nk−1) (here o(1)→ 0 and n → ∞). A similar result when n/k is bounded from above was recently proved in [10]. Our main result is actually stronger, and implies that if <inline-graphic mime-subtype="gif" xlink="S0963548309009705_inline2"><alt-text>$|\cG| > (1 + \epsilon)\binom{n-1 }{ k-1}$</alt-text></inline-graphic> for any ϵ n sufficiently large, then <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009705_char1"/></private-char> contains d + 2 sets A, A1,. . .,Ad+1 such that the Ais form a d-simplex, and A contains an element of ∩j≠iAj for each i. This generalizes, in asymptotic form, a recent result of Vestraëte and the first author [18], who proved it for d = 1, ϵ = 0 and n ≥ 2k.
Investigating Generative Factors of Score Matrices
Authors: Titus Winters, Christian R. Shelton, Tom Payne
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

An implicit assumption in psychometrics and educational statistics is that the generative model for student scores on test questions is governed by the topics of those questions and each student's aptitude in those topics. That is, a function to generate the matrix of scores for m students on n questions should rely on each student's ability in a set of t topics, and the relevance of each question to those topics. In this paper, we use educational data mining techniques to analyze score matrices from university-level computer science courses, and demonstrate that no such structure can be extracted from this data.
Reducing sensing error in cognitive PANs through reduction of the channel set and split sensing
Authors: Vojislav B. Mišić, Jelena Mišić
Venue: Computer Communications (2009)

Cognitive radio technology necessitates accurate and timely sensing of the primary users' activity on the chosen set of channels. If sensing error is unacceptably high, we can reduce the number of working channels so as to improve the channels-vs.-sensing nodes ratio, and undertake differential or split sensing in which subsets of sensing nodes target idle and active channels, respectively. The paper presents a probabilistic analysis of the sensing process, including the split sensing policy, and investigates the range of values in which such, incomplete sensing is capable of maintaining an accurate view of the status of the working channel set.
Unified Definition of Heuristics for Classical Planning
Authors: Jussi Rintanen
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.
A note on the stopping redundancy of linear codes
Authors: Shu-Tao Xia
Venue: Journal of Computer Science and Technology (2006)

In this paper, we study the stopping sets, stopping distance and stopping redundancy for binary linear codes. Stopping redundancy is a new concept proposed by Schwartz and Vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel (BEC). Since the exact value of stopping redundancy is difficult to obtain in general, good lower and upper bounds are important. We obtain a new general upper bound on the stopping redundancy of binary linear codes which improves the corresponding results of Schwartz and Vardy.
System improvements in Mobile Haptic Interface
Authors: In Lee, Inwook Hwang, Kyung-Lyoung Han, Oh Kyu Choi, Seungmoon Choi, Jin S. Lee
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

A Mobile Haptic Interface (MHI), a force-feedback haptic interface with a mobile base, allows to render very large virtual objects in a safe and portable manner. In this paper, we present a novel MHI system, featured with: 1) extended horizontal workspace using a omni-directional mobile base, 2) extended vertical workspace using a linear lift, 3) high-accuracy estimation of the position of the haptic interface tool, 4) efficient motion planning algorithm to move the mobile base while avoiding collisions with the user and other objects, and 5) closed-loop force control to compensate the undesired effect of mobile base dynamics on the final rendering force perceived by the user. As a consequence, our MHI system can provide high quality haptic rendering of large virtual objects.
Encouraging mindful feedback processing: computer-based instruction in descriptive statistics
Authors: Roxana Morenoo
Venue:  (2008)

This study investigated the effectiveness of three computer-administered feedback methods and how a goal intervention influenced the effectiveness of these methods when learning concepts and rules pertaining to the topic of descriptive statistics. Three methods of feedback: knowledge of correct response feedback, explanatory-implicit feedback, and no-feedback were crossed with two goal conditions (goal and no goal) to form six experimental conditions. Learning was measured as increased correct answers on a 24-item multiple-choice test given on three repeated trials. One hundred and thirty college undergraduates enrolled in a pre-service teacher education program were randomly assigned to the six experimental conditions. Students given feedback (knowledge of correct response and explanatory-implicit) showed significantly greater learning across the three trials in comparison to the no-feedback control, but those in the knowledge of correct response and explanatory-implicit feedback conditions showed essentially equal performance on the learning measure across the three trials. For individuals given explanatory-implicit feedback, those receiving a goal intervention performed significantly better on the learning measure than those not receiving the goal intervention. This study supports past research showing the benefit of feedback when learning from a computer-assisted instruction. In addition, this study showed how a goal intervention interacts with various feedback methods to enhance learning.
Mapsearch: a protocol and prototype application to find maps
Authors: Michael E. Lesk
Venue:  (2008)

Even geographers need ways to find what they need among the thousands of maps buried in map libraries and in journal articles. It is not enough to provide search by region and keyword. Studies of queries show that people often want to look for maps showing a certain location at a certain time period or with a subject theme. The difficulties in finding such maps are several. Maps in physical and digital collections often are organized by region. Multi-dimensional manual indexing is time-consuming and so many maps are not indexed. Further, maps in non-geographical publications are indexed rarely, making them essentially invisible. In an attempt to solve actual problems, this dissertation research automatically indexes maps in published documents so that they become visible to searchers. The MapSearch prototype aggregates journal components to allow finer-grained searching of article content. MapSearch allows search by region, time, or theme as well as by keyword (http://scilsresx.rutgers.edu/&sim;gelern/maps/). Automatic classification of maps is a multi-step process. A sample of 150 maps and the text (that becomes metadata) describing the maps have been copied from a random assortment of journal articles. Experience taking metadata manually enabled the writing of instructions to mine data automatically; experience with manual classification allowed for writing algorithms that classify maps by region, time and theme automatically. That classification is supported by ontologies for region, time and theme that have been generated or adapted for the purpose and that allow what has been called intelligent search, or smart search. The 150 map training set was loaded into the MapSearch engine repeatedly, each time comparing automatically-assigned classification to manually-assigned classification. Analysis of computer misclassifications suggested whether the ontology or classification algorithm should be modified in order to improve classification accuracy. After repeated trials and analyses to improve the algorithms and ontologies, MapSearch was evaluated with a set of 55 previously unseen maps in a test set. Automated classification of the test set of maps was compared to the manual classification, with the assumption that the manual process provides the most accurate classification obtainable. Results showed an accuracy, or a correspondence between manual and automated classification, of 75% for region, 69% for time, and 84% for theme. The dissertation contributes: (1) a protocol to harvest metadata from maps in published articles that could be adapted to aggregate other sorts of journal article components such as charts, diagrams, cartoons or photographs, (2) a method for ontology-supported metadata processing to allow for improved result relevance that could be applied to other sorts of data, (3) algorithms to classify maps into region, time and theme facets that could be adapted to classify other document types, and (4) a proof-of-concept MapSearch system that could be expanded with heterogeneous map types.
Multi-agent planning with confidentiality
Authors: Jiefei Ma, Alessandra Russo, Krysia Broda, Emil Lupu
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Distributed planning has seen a wide range of techniques aiming to address problems such as distributed plan formation and distributed plan execution. Common to these techniques is the notion of Multi-Agent Planning (MAP) as a combination of planning and coordination by de Weerdt et al. [2]. Among the three types of MAP problems summarised by Durfee [3], distributed planning for distributed plans is considered to be the most challenging. The key issue to tackle is the plan merging, which concerns about resolving potential conflicts (negative interactions) between individual plans (sequences of actions) of the agents. A more complex version of the problem that has many real world examples, is that where agents need to maintain confidential information such as private knowledge, and/or do not wish to expose their individual plans. Such confidentiality constraints may make the central/direct analysis of action interactions impossible. This paper focuses on the task of distributed planning for distributed plans with confidentiality.
Managing democratic grids: architecture and lessons learnt
Authors: Leandro Navarro
Venue: Proceedings of the 6th international conference industry session on Grids meets autonomic computing (2009)

This paper presents the results and lessons learnt in the EU project Grid4All (2006-2009) on the construction of a democratic grid infrastructure, where self-* properties are an essential element. These grids have challenging and novel requirements: usability, content sharing and collaboration, security, scalability and availability via decentralization, brokerage of resources, and autonomic management of the dynamics of organizations and applications. These are considered essential factors for next generation Internet computing and generic enablers for cloud computing. We present the architecture of the Grid4All infrastructure, the self-* mechanisms incorporated to enable these grids built on conventional computers and networks contributed by the participants, and the lessons learnt during the construction and evaluation.
Kernelized value function approximation for reinforcement learning
Authors: Gavin Taylor, Ronald Parr
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

A recent surge in research in kernelized approaches to reinforcement learning has sought to bring the benefits of kernelized machine learning techniques to reinforcement learning. Kernelized reinforcement learning techniques are fairly new and different authors have approached the topic with different assumptions and goals. Neither a unifying view nor an understanding of the pros and cons of different approaches has yet emerged. In this paper, we offer a unifying view of the different approaches to kernelized value function approximation for reinforcement learning. We show that, except for different approaches to regularization, Kernelized LSTD (KLSTD) is equivalent to a modelbased approach that uses kernelized regression to find an approximate reward and transition model, and that Gaussian Process Temporal Difference learning (GPTD) returns a mean value function that is equivalent to these other approaches. We also discuss the relationship between our modelbased approach and the earlier Gaussian Processes in Reinforcement Learning (GPRL). Finally, we decompose the Bellman error into the sum of transition error and reward error terms, and demonstrate through experiments that this decomposition can be helpful in choosing regularization parameters.