ppxscal/embedding_network huggingface dataset:
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
Authors: Rahul Urgaonkar, Michael J. Neely
Venue: IEEE Transactions on Mobile Computing (2009)

We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision constraints with the primary (licensed) users. We consider a cognitive network with static primary users and potentially mobile secondary users. We use the technique of Lyapunov Optimization to design an online flow control, scheduling, and resource allocation algorithm that meets the desired objectives and provides explicit performance guarantees.
Modular data centers: how to design them?
Authors: Kashi Venkatesh Vishwanath, Albert Greenberg, Daniel A. Reed
Venue: Proceedings of the 1st ACM workshop on Large-Scale system and application performance (2009)

There has been a recent interest in modularized shipping containers as the building block for data centers. However, there are no published results on the different design tradeoffs it offers. In this paper we investigate a model where such a container is never serviced during its deployment lifetime, say 3 years, for hardware faults. Instead, the hardware is over-provisioned in the beginning and failures are handled gracefully by software. The reasons vary from ease of accounting and management to increased design flexibility owing to its sealed and service-free nature. We present a preliminary model for performance, reliability and cost for such service-less containerized solutions. There are a number of design choices/policies for over-provisioning the containers. For instance, as a function of dead servers and incoming workload we could decide which servers to selectively turn on/off while still maintaining a desired level of performance. While evaluating each such choice is challenging, we demonstrate that arriving at the best and worst-case design is tractable. We further demonstrate that projected lifetimes of these extreme cases are very close to each other, often no more than 10% different. One way to interpret this number is, from a reliability perspective the utility of keeping machines as cold spares within the container, in anticipation of server failures, is not too different than starting out with all machines active. So as we engineer the containers in sophisticated ways for cost and performance, we can arrive at the associated reliability estimates using a simpler more-tractable approximation. We demonstrate that these bounds are robust to general distributions for failure times of servers. We hope that this paper stirs up a number of research investigations geared towards understanding these next generation data center building blocks. This involves both improving the models and corroborating them with field data.
Considerations of KMS implementation in perspectivesConsiderations of KMS implementation in Concurrent Engineering --economic perspectives
Authors: Billy T. W. Yu, Peter K. C. Lee, W. M. To
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The importance of knowledge management (KM) systems for organizational performance is now well recognized. Seeking to better utilize these systems in concurrent engineering (CE), this article focuses on the implementation considerations of KM systems from different economic perspectives. Specifically, the contribution of this paper is threefold. First, the paper reviews and compares various economic theories on the implementation of KM systems. Their respective ancestors are also identified. Second, based on some extant studies, some important considerations pertinent to the special features of KM are identified. Finally, we offer suggestions for more efficient handling of the identified CE deficiencies and the use of KM as a strategic tool to address those deficiencies.
CroMo --Morphological Analysis for Standard Croatian and its Synchronic and Diachronic Dialects and Variants
Authors: Damir Ćavar, Ivo-Pavao Jazbec, Tomislav Stojanov
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

CroMo is a finite state transducer that combines three major functionalities into one high-performance monolithic machine for morphological segmentation, annotation, and lemmatization. It is designed to be flexible, extensible, and applicable to any language that allows for purely morphotactic modeling on the lexical level of morphological structure. While it minimizes the development cycle of the morphology, its annotation schema maximizes interoperability by using a direct mapping from the GOLD ontology of linguistic concepts and features. The use of standardized ontology based annototains provides advanced possibilities for a DL-based post-processing of the annotated output.
Aligning METS with the OAI-ORE data model
Authors: Jerome P. McDonough
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

The Open Archives Initiative - Object Reuse and Exchange (OAI-ORE) specifications provide a flexible set of mechanisms for transferring complex data objects between different systems. In order to serve as an exchange syntax, OAI-ORE must be able to support the import of information from localized data structures serving various communities of practice. In this paper, we examine the Metadata Encoding & Transmission Standard (METS) and the issues that arise when trying to map from a localized structural metadata schema into the OAI-ORE data model and serialization syntaxes.
Tell Me Who I Am: An Interactive Recommendation System
Authors: Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
Venue: Theory of Computing Systems (2009)

We consider a model of recommendation systems, where each member from a given set of players has a binary preference to each element in a given set of objects: intuitively, each player either likes or dislikes each object. However, the players do not know their preferences. To find his preference of an object, a player may probe it, but each probe incurs unit cost. The goal of the players is to learn their complete preference vector (approximately) while incurring minimal cost. This is possible if many players have similar preference vectors: such a set of players with similar &#x201c;taste&#x201d; may split the cost of probing all objects among them, and share the results of their probes by posting them on a public billboard. The problem is that players do not know a priori whose taste is close to theirs. In this paper we present a distributed randomized peer-to-peer algorithm in which each player outputs a vector which is close to the best possible approximation of the player&#x2019;s real preference vector after a polylogarithmic number of rounds. The algorithm works under adversarial preferences. Previous algorithms either made severely limiting assumptions on the structure of the preference vectors, or had polynomial overhead.
Functional Language of Digital Computers I
Authors: Kenneth K. Nwabueze
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In digital electronics there may be situations in which the designer may need the system to be able to “undo” certain processes. If that is a requirement, what the designer does, in simple mathematical terms, is to restrict the domain so that the process becomes a one-to-one function. The purpose of this short note is to discuss some simple logical operations in computer science in the context mathematical functions.
Stages of Cognitive Development in Uncertain-Logic-Based AI Systems
Authors: Ben Goertzel, Stephan Vladimir Bugaj
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

A novel theory of stages in cognitive development is presented, loosely corresponding to Piagetan theory but specifically oriented toward AI systems centered on uncertain inference components. Four stages are articulated (infantile, concrete, formal and reflexive), and are characterized both in terms of external cognitive achievements (a la Piaget) and in terms of internal inference control dynamics. The theory is illustrated via the analysis of specific problem solving tasks corresponding to the different stages. The Novamente AI Engine, with its Probabilistic Logic Networks uncertain inference component and its embodiment n the AGI-SIM simulation world, is used as an example throughout.
Spatio-temporal memory streaming
Authors: Stephen Somogyi, Thomas F. Wenisch, Anastasia Ailamaki, Babak Falsafi
Venue: ACM SIGARCH Computer Architecture News (2009)

Recent research advocates memory streaming techniques to alleviate the performance bottleneck caused by the high latencies of off-chip memory accesses. Temporal memory streaming replays previously observed miss sequences to eliminate long chains of dependent misses. Spatial memory streaming predicts repetitive data layout patterns within fixed-size memory regions. Because each technique targets a different subset of misses, their effectiveness varies across workloads and each leaves a significant fraction of misses unpredicted. In this paper, we propose Spatio-Temporal Memory Streaming (STeMS) to exploit the synergy between spatial and temporal streaming. We observe that the order of spatial accesses repeats both within and across regions. STeMS records and replays the temporal sequence of region accesses and uses spatial relationships within each region to dynamically reconstruct a predicted total miss order. Using trace-driven and cycle-accurate simulation across a suite of commercial workloads, we demonstrate that with similar implementation complexity as temporal streaming, STeMS achieves equal or higher coverage than spatial or temporal memory streaming alone, and improves performance by 31%, 3%, and 18% over stride, spatial, and temporal prediction, respectively.
Energy detection of multilevel PAM signals with systematic threshold mismatch
Authors: Antti Anttonen, Adrian Kotelba, Aarne Mämmelä
Venue: Research Letters in Communications (2009)

We address a symbol decision problem with spectrally efficient energy detected multilevel pulse amplitude modulated (PAM) signals. First, we analytically quantify the relationship between a systematic threshold mismatch and the required increase of the average signal-to-noise ratio to preserve a desired symbol error rate. For the case in which such an increase is not tolerable, we present a novel near-optimal multilevel threshold selection scheme, which is accurate for a wide range of system parameters.
Optimal formation switching
Authors: Dalila B.M.M. Fontes, Fernando A.C.C. Fontes
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

We propose a dynamic programming approach to address the problem of determining how a structured formation of autonomous undistinguishable agents can be reorganized into another, eventually non-rigid, formation based on changes in the environment, perhaps unforeseeable. The methodology can also be used to correctly position the agents into a particular formation from an initial set of random locations. Given the information of the current agents location and the final locations, there are n! possible permutations for the n agents, and we seek the one that minimizes a total relative measure, e.g. distance traveled by the agents during the switching. Possible applications can be found amongst surveillance, damage assessment, chemical or biological monitoring, among others, where the switching to another formation, not necessarily predefined, may be required due to changes in the environment.
Applying Wavelet and Fourier Transform Analysis to Large Geophysical Datasets
Authors: Bjørn-Gustaf J. Brooks
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The recurrence of periodic environmental states is important to many systems of study, and particularly to the life cycles of plants and animals. Periodicity in parameters that are important to life, such as precipitation, are important to understanding environmental impacts, and changes to their intensity and duration can have far reaching impacts. To keep pace with the rapid expansion of Earth science datasets, efficient data mining techniques are required. This paper presents an automated method for Discrete Fourier transform (DFT) and wavelet analysis capable of rapidly identifying changes in the intensity of seasonal, annual, or interannual events. Spectral analysis is used to diagnose model behavior, and locate land surface cells that show shifting cycle intensity, which could be used as an indicator of climate shift. The strengths and limitations of DFT and wavelet spectral analysis are also explored. Example routines in Octave/Matlab and IDL are provided. 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
Energy Aware Algorithm and Implementation of SDR Oriented HSDPA Chip Level Equalizer
Authors: Min Li, Bruno Bougard, Liesbet Perre, Francky Catthoor
Venue: Journal of Signal Processing Systems (2009)

The flexibility and programmability of SDR come at the expense of reduced efficiency and increased energy consumption. This is usually considered as the penalty of SDR. However, the flexibility and programmability have great potentials for improving the system-wide efficiency if they are properly exploited. In this paper, we present a HSDPA chip equalizer that is explicitly designed for SDR implementations. The first SDR-specific feature of our work is the multi-mode operation based on heterogeneous algorithms. The proposed equalizer combines an optimized LMS variant (with subspace-aware extension) and an optimized SRI-RLS algorithm based on QRD. Instead of always applying the powerful SRI-RLS algorithm, the equalizer switches to simple LMS-variant when possible. With negligible BER degradation, the multi-mode operation can reduce 60% of the cycle-count on TI TMS320C6713 for 3GPP case 4 with 16QAM modulation. The proposed equalizer framework also incorporates a generic, robust and efficient scheme for equalization-length adaptation. The length-adaptation scheme can make very fast run-time decision based on an efficient policy-template, which is optimized with large training set at design time. We test 14 representative channel profiles specified in ITU-R M.1225, 3GPP TR 25.943 and 3GPP TS 25.101. Comparing to worst-case based design the length-adaptation achieves more than 10× cycle-count reductions for ten of the cases.
Competence of IT Professionals in E-Business Venture Teams: The Effect of Experience and Expertise on Preference Structure
Authors: Tobias Kollmann, Matthias HäSel, Nicola Breugst
Venue: Journal of Management Information Systems (2009)

The ascension of e-business has significantly changed competence requirements of information technology (IT) professionals. In this paper, we derive a competence set that addresses these changes and investigate individual preferences for specific competence components within e-business teams. We connect these preferences and competence valuation with personal characteristics of team members that were found to influence the perception of competence requirements in previous research. To empirically address this issue, we apply a Web-based questionnaire with adaptive conjoint measurement. By cluster analysis, we identify four competence profiles preferred by team members. Data from 176 respondents suggest that experience is related to the preferred profile, whereas expertise is related to overall competence valuation. Our research suggests that immature teams should consider that preferences regarding IT professionals may change with venture maturation, whereas interdisciplinary teams should discuss each member's value contribution. Considering our results, these suggestions could optimize the process of team composition.
Computational Fluid Dynamics: A Practical Approach
Authors: Jiyuan Tu, Guan Heng Yeoh, Chaoqun Liu
Venue:  (2007)

A senior level undergraduate and graduate textbook for a wide audience of engineering students taking a first course in CFD or Computer Aided Engineering. Fully course matched, with the most extensive and rigorous pedagogy and features of any book in the field. The first book in the field aimed at CFD users rather than developers. The only course text available that is specifically designed to give an applications lead, software oriented approach to understanding and using CFD. This is coupled with a complete grounding in the necessary mathematical principles of CFD. Unlike existing books this has not been written with the needs of advanced students who are expected to develop their own CFD code in mind. The widespread availability of commercial software enables this book to meet the needs of beginner CFD students who use commercial software. Meets the needs of students taking a wide range of courses. Unlike existing titles it does not focus on the needs of advanced aerospace or applied math courses. Ideal for use on the burgeoning courses in mechanical, automotive, marine, environmental, civil and chemical engineering that harness CFD or computer aided engineering more generally.The strongest pedagogy of any available book. Core mathematics are developed in a step by step fashion, with no assumed steps left out in order to develop a solid understanding of the conservation laws, mathematical transport equations and basic concepts of fluid mechanics and heat transfer that comprise the key to effective use of CFDDetailed worked examples reinforce learning and link to the real applications students will work with; end of chapter knowledge check exercises, homework assignment questions, plus separate Instructor's Manual
Linking Multidimensional Feature Space Cluster Visualization to Multifield Surface Extraction
Authors: Lars Linsen, Tran Van Long, Paul Rosenthal
Venue: IEEE Computer Graphics and Applications (2009)

The IEEE Visualization Design Contests aim to foster the development of new visualization tools, techniques and solutions to existing real-world problems. This article describes the scientific questions posed for the contest for a turbulence data set, contest evaluation procedure, and the 2008 contest results. The winning entry presents a system for linking multi-dimensional feature-space cluster visualization to surface extraction from multi-field volume data designed to answer the contest questions. This article also includes a sidebar by Amit Chourasia and Russell M. Taylor II.
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
Authors: Frank D. McSherry
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

We report on the design and implementation of the Privacy Integrated Queries (PINQ) platform for privacy-preserving data analysis. PINQ provides analysts with a programming interface to unscrubbed data through a SQL-like language. At the same time, the design of PINQ's analysis language and its careful implementation provide formal guarantees of differential privacy for any and all uses of the platform. PINQ's unconditional structural guarantees require no trust placed in the expertise or diligence of the analysts, substantially broadening the scope for design and deployment of privacy-preserving data analysis, especially by non-experts.
Preference representation with 3-points intervals
Authors: Meltem Öztürk, Alexis Tsoukiàs
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 this article we are interested in the representation of qualitative preferences with the help of 3-points intervals (a vector of three increasingly ordered points). Preferences are crucial when an agent has to autonomously make a choice over several possible actions. We provide first of all an axiomatization in order to characterize our representation and then we construct a general framework for the comparison of 3-points intervals. Our study shows that from the fifteen possible different ways to compare 3-points intervals, seven different preference structures can be defined, allowing the representation of sophisticated preferences. We show the usefulness of our results in two classical problematics: the comparison of alternatives and the numerical representation of preference structures. Concerning the former one, we propose procedures to construct non classical preference relations (intransitive preferences for example) over objects being described by three ordered points. Concerning the latter one, assuming that preferences on the pairwise comparisons of objects are known, we show how to associate a 3-points interval to every object, and how to define some comparison rules on these intervals in order to have a compact representation of preferences described with these pairwise comparisons.
Improving the performances of the collocation method for numerically solving linear differential equations of the wavefunctions in large atomic systems
Authors: Sever Spanulescu, Mircea Moldovan
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

The influence of analytical treatment of terms in collocation method applied to the boundary condition equations of Hartree-Fock type is presented. The explicit form of matrix elements for monomial and Chebyshev trial functions is given and some methods for increasing the speed in these time critical problems are proposed. The numerical tests indicate the possibility of decreasing the amount of computing effort up to 10 times with the proposed technique while maintaining the precision.
A LRT framework for fast spatial anomaly detection
Authors: Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gums
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Given a spatial data set placed on an n x n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithms that, given any user-supplied arbitrary likelihood function, conduct a likelihood ratio hypothesis test (LRT) over each rectangular region in the grid, rank all of the rectangles based on the computed LRT statistics, and return the top few most interesting rectangles. To speed this process, we develop methods to prune rectangles without computing their associated LRT statistics.