ppxscal/embedding_network huggingface dataset:
Multilingual word sense discrimination: a comparative cross-linguistic study
Authors: Alla Rozovskaya, Richard Sproat
Venue: Proceedings of the Workshop on Balto-Slavonic Natural Language Processing: Information Extraction and Enabling Technologies (2007)

We describe a study that evaluates an approach to Word Sense Discrimination on three languages with different linguistic structures, English, Hebrew, and Russian. The goal of the study is to determine whether there are significant performance differences for the languages and to identify language-specific problems. The algorithm is tested on semantically ambiguous words using data from Wikipedia, an online encyclopedia. We evaluate the induced clusters against sense clusters created manually. The results suggest a correlation between the algorithm's performance and morphological complexity of the language. In particular, we obtain FScores of 0.68, 0.66 and 0.61 for English, Hebrew, and Russian, respectively. Moreover, we perform an experiment on Russian, in which the context terms are lemmatized. The lemma-based approach significantly improves the results over the word-based approach, by increasing the FScore by 16%. This result demonstrates the importance of morphological analysis for the task for morphologically rich languages like Russian.
Throughput versus fairness: channel-aware scheduling in multiple antenna downlink
Authors: Eduard A. Jorswieck, Aydin Sezgin, Xi Zhang
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. Alternatively, each user could be served equally in order to maximize fairness. Obviously, there is a tradeoff between average throughput and fairness in the system. In this paper, we study four representative schedulers, namely the maximum throughput scheduler (MTS), the proportional fair scheduler (PFS), the (relative) opportunistic round robin scheduler (ORS), and the round robin scheduler (RRS) for a space-time coded multiple antenna downlink system. The system applies TDMA based scheduling and exploits the multiple antennas in terms of spatial diversity. We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrical distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distribution.
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form
Authors: Nicola Gatti
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strategically, being in competition, and their analysis is carried out by employing game theoretical tools. One of the most challenging strategic interaction situation is the strategic patrolling: a guard patrols a number of houses in the attempt to catch a rob, which, in its turn, chooses a house to rob in the attempt to be not catched by the guard. Our contribution in this paper is twofold. Firstly, we provide a critique concerning the models presented in literature and we propose a model that is game theoretical satisfactory. Secondly, by exploit the game theoretical analysis to design a solving algorithm more efficient than state-of-the-art's ones.
Model-versioning-in-the-large: Algebraic foundations and the tile notation
Authors: Zinovy Diskin, Krzysztof Czarnecki, Michal Antkiewicz
Venue: Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models (2009)

Model-versioning-in-the-large is concerned with complex scenarios involving multiple updates and multiple replicas of a model. The paper introduces tile systems as rephrasing of double categories in model versioning terms, and shows that the tile language enables a very general formalization of versioning concepts. The formalization makes the concepts amenable to algebraic analysis and provides a convenient notation for version system designers. It also allows one to formulate algebraic laws that a correct versioning system must or may want to satisfy.
Critical Density for Coverage and Connectivity in Three-Dimensional Wireless Sensor Networks Using Continuum Percolation
Authors: Habib M. Ammari, Sajal K. Das
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Although most of the studies on coverage and connectivity in wireless sensor networks (WSNs) considered two-dimensional (2D) settings, such networks can in reality be accurately modeled in a three-dimensional (3D) space. The concepts of continuum percolation theory best fit the problem of connectivity in WSNs to find out whether the network provides long-distance multihop communication. In this paper, we focus on percolation in coverage and connectivity in 3D WSNs. We say that the network exhibits a coverage percolation (respectively, connectivity percolation) when a giant covered region (respectively, giant connected component) almost surely spans the entire network for the first time. Because of the dependency between coverage and connectivity, the problem is not only a continuum percolation problem but also an integrated continuum percolation problem. Thus, we propose an integrated-concentric-sphere model to address coverage and connectivity in 3D WSNs in an integrated way. First, we compute the critical density \lambda_{c}^{\rm cov} above which coverage percolation in 3D WSNs will almost surely occur. Second, we compute the critical density \lambda_{c}^{con} above which connectivity percolation in 3D WSNs will almost surely occur. Third, we compute the critical density \lambda_{c}^{{\rm cov}{-}con} above which both coverage and connectivity percolation in 3D WSNs will almost surely occur. For each of these three problems, we also compute their corresponding critical network degree. Our results can be helpful in the design of energy-efficient topology control protocols for 3D WSNs in terms of coverage and connectivity.
On neighbor discovery in cognitive radio networks
Authors: Neeraj Mittal, Srinivasan Krishnamurthy, R. Chandrasekaran, S. Venkatesan, Yanyan Zeng
Venue: Journal of Parallel and Distributed Computing (2009)

A cognitive radio node is a radio device capable of operating over multiple channels. As a result, a network consisting of one or more cognitive radio nodes can adapt to varying channel availability in its geographical region by dynamically changing the channel (or channels) nodes are using for communication. We investigate the problem of designing a fast deterministic algorithm for neighbor discovery in an undirected network consisting of one or more cognitive radio nodes when different nodes may have different subsets of channels available for communication at their location. We say that a neighbor discovery algorithm is fast if its time-complexity is polynomial in actual network-size. We prove that it is impossible to devise a fast algorithm to solve the neighbor discovery problem if nodes are neither size-aware nor collision-aware. When nodes are collision-aware, we present a fast algorithm for neighbor discovery with time-complexity of O(pmlogn), where p denotes the actual number of nodes present in the network, n denotes the size of space used for assigning labels to the nodes, and m denotes the number of channels over which nodes can operate. Our algorithm has the desirable property that every node knows when the neighbor discovery has completed and, moreover, all nodes terminate at the same time. When nodes are size-aware, we use a gossiping algorithm for a single-channel network with large labels that was proposed recently to derive a fast adaptive algorithm for neighbor discovery. We also investigate the neighbor discovery problem when the network may be directed. Finally, we describe a way to speed up neighbor discovery when nodes are collision-aware and channel availability sets of neighboring nodes do not vary significantly.
97 Things Every Software Architect Should Know, 1st edition
Authors: Richard Monson-Haefel
Venue:  (2009)

In this truly unique technical book, today's leading software architects present valuable principles on key development issues that go way beyond technology. More than four dozen architects -- including Neal Ford, Michael Nygard, and Bill de hOra -- offer advice for communicating with stakeholders, eliminating complexity, empowering developers, and many more practical lessons they've learned from years of experience. Among the 97 principles in this book, you'll find useful advice such as: Don't Put Your Resume Ahead of the Requirements (Nitin Borwankar) Chances Are, Your Biggest Problem Isn't Technical (Mark Ramm) Communication Is King; Clarity and Leadership, Its Humble Servants (Mark Richards) Simplicity Before Generality, Use Before Reuse (Kevlin Henney) For the End User, the Interface Is the System (Vinayak Hegde) It's Never Too Early to Think About Performance (Rebecca Parsons) To be successful as a software architect, you need to master both business and technology. This book tells you what top software architects think is important and how they approach a project. If you want to enhance your career, 97 Things Every Software Architect Should Know is essential reading.
Trace retrieval for evolving artifacts
Authors: Stefan Winkler
Venue: Proceedings of the 2009 ICSE Workshop on Traceability in Emerging Forms of Software Engineering (2009)

IR-based trace retrieval is a method to derive traceability links using information retrieval (IR) algorithms. So far, this method has been applied only to static artifacts. In this paper, we address IR-based trace retrieval applied to evolving artifacts. We describe our enhancements to existing algorithms and present first promising results by applying the enhanced algorithm to two different data sets.
An Iterative Hybrid Filter-Wrapper Approach to Feature Selection for Document Clustering
Authors: Mohammad-Amin Jashki, Majid Makki, Ebrahim Bagheri, Ali A. Ghorbani
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

The manipulation of large-scale document data sets often involves the processing of a wealth of features that correspond with the available terms in the document space. The employment of all these features in the learning machine of interest is time consuming and at times reduces the performance of the learning machine. The feature space may consist of many redundant or non-discriminant features; therefore, feature selection techniques have been widely used. In this paper, we introduce a hybrid feature selection algorithm that selects features by applying both filter and wrapper methods in a hybrid manner, and iteratively selects the most competent set of features with an expectation maximization based algorithm. The proposed method employs a greedy algorithm for feature selection in each step. The method has been tested on various data sets whose results have been reported in this paper. The performance of the method both in terms of accuracy and Normalized Mutual Information is promising.
InDesign CS3 for Macintosh and Windows, 1st edition
Authors: Sandee Cohen
Venue:  (2007)

Visual QuickStart Guidethe quick and easy way to learn! Users of Adobe InDesign will be impressed with the power, ease of use, and integration found in the new InDesign CS3, Adobe's page-design component of Creative Suite 3. Users will also find more robust file-placing capabilities, new Find features, and great new text and transparency effects, among other exciting features. Adobe InDesign CS3 for Macintosh and Windows: Visual QuickStart Guide will highlight the important new features, as well as covering the ones readers have relied on in previous versions of InDesign. Using the task-based, visual approach that readers count on in the Visual QuickStart Guides, this volume introduces readers to all aspects of InDesign CS3. Users will learn how to create and automate documents, import and style text and objects, manage long documents, export files for a wide variety of purposes, and Easy visual approach uses pictures to guide you through InDesign and show you what to do. Concise steps and explanations let you get up and running in no time. Page for page, the best content and value around.much more. 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
Knowledge Management to Support Lean Product Development
Authors: Alan Harris, Ahmed Al-Ashaab, Chike Odouza
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

With NPD/I, there are no hard and fast rules to determine the length of such projects and quite often over a 10-year period several hundred projects could come into being, and this quite often coincides with huge advances in technology over the same period. This advancement in technology has often taken over the role of the designer carrying out calculations and providing solutions. This has resulted in certain cases; designers having very little to no understanding or practical experience of the manufacturing processes and the design calculations required to ratify product designs. The resultant loss of information and intent and the lack of exploitation of manufacturing constraints and product knowledge can and quite often lead to product re-design and in some cases failure in the hands of the customer. Research carried out here has studied knowledge management and the knowledge required to support the development of new products within the cold roll forming industry and analyses whether knowledge management to support product development can be defined as lean product development.
Clustering Hierarchical Data Using Self-Organizing Map: A Graph-Theoretical Approach
Authors: Argyris Argyrou
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

The application of Self-Organizing Map (SOM) to hierarchical data remains an open issue, because such data lack inherent quantitative information. Past studies have suggested binary encoding and Generalizing SOM as techniques that transform hierarchical data into numerical attributes. Based on graph theory, this paper puts forward a novel approach that processes hierarchical data into a numerical representation for SOM-based clustering. The paper validates the proposed graph-theoretical approach via complexity theory and experiments on real-life data. The results suggest that the graph-theoretical approach has lower algorithmic complexity than Generalizing SOM, and can yield SOM having significantly higher cluster validity than binary encoding does. Thus, the graph-theoretical approach can form a data-preprocessing step that extends SOM to the domain of hierarchical data.
Developing Scientific Applications with Loosely-Coupled Sub-tasks
Authors: Shantenu Jha, Yaakoub El-Khamra, Joohyun Kim
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The Simple API for Grid Applications (SAGA) can be used to develop a range of applications which are in turn composed of multiple sub-tasks. In particular SAGA is an effective tool for coordinating and orchestrating the many sub-tasks of such applications, whilst keeping the application agnostic to the details of the infrastructure used. Although developed primarily in the context of distributed applications, SAGA provides an equally valid approach for applications with many sub-tasks on single high-end supercomputers, such as emerging peta-scale computers. Specifically, in this paper we describe how SAGA has been used to develop applications from two types of applications: the first with loosely-coupled homogeneous sub-tasks and, applications with loosely-coupled heterogeneous sub-tasks. We also analyse and contrast the coupling and scheduling requirements of the sub-tasks for these two applications. We find that applications with multiple sub-tasks often have dynamic characteristics, and thus require support for both infrastructure-independent programming models and agile execution models. Hence attention must be paid to the practical deployment challenges along with the theoretical advances in the development of infrastructure-independent applications. 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
Human factors, automation, and alerting mechanisms in nursing home electronic health records
Authors: Marilyn Rantz
Venue:  (2005)

Objectives. Evaluate a clinical decision support system in an electronic medical record (EMR) to determine activation frequencies, patterns of activity, and how automated alerting mechanisms affect clinical responses. Design. Descriptive. Setting. Three nursing homes. Participants. Midwestern nursing homes where administrative staff had committed to implementing an EMR and clinical decision support system called OneTouch Technologies. Measurements. Automated alerts in the OneTouch EMR including constipation, decline in condition, dehydration, improvement in condition, skin integrity, weight gain, and weight loss were evaluated. Using alert calculations, frequencies of alerts and triggers were counted. Spearman&rsquo;s rank correlations were determined between the frequency of active alerts and the number of secondary diagnoses for residents. Finally, a comparison was made of clinical responses to active and non-active alerts. Results. Alert data from two facilities totaling 155 days were included in the study. The most frequent alerts were dehydration and improvement in condition. One moderately significant positive correlation was found between the number of secondary diagnoses and weight gain alert frequencies in residents who had a CVA. There were more clinical responses than no clinical responses overall. However, there were as many clinical responses to conditions with no active alerts as active. Conclusions. Frequencies of alerts is an indicator of how much information has to be managed in order to meet complex issues in nursing home residents. Automated alerts play a role in reminding nursing home staff of potential trouble spots in resident care.
A general approach for qualitative reasoning models based on intervals
Authors: Ester Martínez, M. Teresa Escrig
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

In qualitative spatial and temporal reasoning we can distinguish between comparing magnitudes of concepts and naming magnitudes of concepts. Qualitative models are defined by: (1) a representation model, (2) the basic step of inference process and (3) the complete inference process. We present a general algorithm to solve the representation model and the basic step of inference process of qualitative models based on intervals. The general model is based on the definition of two algorithms: the qualitative addition and the qualitative difference. In this article, the general model is instanced to two known spatio-temporal concepts, naming distance and qualitative velocity, and a novel one, qualitative acceleration.
A blind watermarking method using maximum wavelet coefficient quantization
Authors: Wei-Hung Lin, Yuh-Rau Wang, Shi-Jinn Horng, Tzong-Wann Kao, Yi Pan
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes a blind watermarking algorithm based on maximum wavelet coefficient quantization for copyright protection. The wavelet coefficients are grouped into different block size and blocks are randomly selected from different subbands. We add different energies to the maximum wavelet coefficient under the constraint that the maximum wavelet coefficient is always maximum in a block. The watermark is embedded the local maximum coefficient which can effectively resist attacks. Also, using the block-based watermarking, we can extract the watermark without using the original image or watermark. Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks.
Short communication: A multi-scale method of mapping urban influence
Authors: Timothy G. Wade, James D. Wickham, Nicola Zacarelli, Kurt H. Riitters
Venue: Environmental Modelling Software (2009)

Urban development can impact environmental quality and ecosystem services well beyond urban extent. Many methods to map urban areas have been developed and used in the past, but most have simply tried to map existing extent of urban development, and all have been single-scale techniques. The method presented here uses a clustering approach to look beyond the extant urban area at multiple scales. The result is a single, synoptic multi-scale map of urban influence that should be useful in urban, regional and environmental planning efforts.
Applying Constructionist Design Methodology to Agent-Based Simulation Systems
Authors: Kristinn R. Thórisson, Rögnvaldur J. Saemundsson, Gudny R. Jonsdottir, Brynjar Reynisson, Claudio Pedica, Pall Runar Thrainsson, Palmi Skowronski
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Among the benefits of agent-based modeling is parallel development and implementation of components. Integrating large numbers of agents developed by many is, however, a significant challenge. Further, architectural changes can require significant redesign. We have developed CDM-S, the Constructionist Design Methodology for Simulation, an agent-oriented methodology for developing, implementing and evolving multi-agent systems. CDM-S's strength lies in simplifying modeling and construction of systems with architectural evolution of complex control hierarchies and data flow. We have applied CDM-S in the development of a family of market simulations where companies, employees, banks and consumers are modeled at multiple abstraction levels. These were designed and built by 14 students over a period of 10 weeks. Experience shows CDM-S to be a promising high-level methodology for constructing large multi-agent systems. Here we describe CDM-S and present data on its application in the development process.
Learning non-redundant codebooks for classifying complex objects
Authors: Wei Zhang, Akshat Surve, Xiaoli Fern, Thomas Dietterich
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Codebook-based representations are widely employed in the classification of complex objects such as images and documents. Most previous codebook-based methods construct a single codebook via clustering that maps a bag of low-level features into a fixed-length histogram that describes the distribution of these features. This paper describes a simple yet effective framework for learning multiple non-redundant codebooks that produces surprisingly good results. In this framework, each codebook is learned in sequence to extract discriminative information that was not captured by preceding codebooks and their corresponding classifiers. We apply this framework to two application domains: visual object categorization and document classification. Experiments on large classification tasks show substantial improvements in performance compared to a single codebook or codebooks learned in a bagging style.