Computer and information sciences topic list of research papers
-
A novel method for straightening curved text-lines in stylistic documents2014 / Brij Singh, Ankush Mittal, Debashis Ghosh
-
Internet-scale support for map-reduce processing2013 / Fernando Costa, Luís Veiga, Paulo Ferreira
-
Model-based reuse for crosscutting frameworks: assessing reuse and maintenance effort2013 / Thiago Gottardi, Rafael Durelli, Óscar López, Valter de Camargo
-
Share-kno: Knowledge Sharing Mechanism of the Temporal Object System
Abstract Temporal Object System (TOS) handles the structural and stature changes to an object in a uniform and temporal fashion. The TOS takes a hybrid approach of the class-based and prototype-based approaches in modeling the real-word objects and...
2013 / Abad Shah, Farshad Fotouhi, William Grosky -
Use of Big Data and Knowledge Discovery to Create Data Backbones for Decision Support Systems
Abstract The objective of this research is to provide decision support to assembly line planners when they perform assembly time estimations. There is a lack of consistency in the assembly time analysis performed by planners. The decision support...
2013 / Rahul Sharan Renu, Gregory Mocko, Abhiram Koneru -
Dominance breaking constraints2014 / Geoffrey Chu, Peter J. Stuckey
-
Method for Generating a Diverse Set of Requirements for Safety-critical Systems
Abstract Automatic digital safety-critical systems are often architected with redundant hardware in order to combat the effects of a single failure that could prevent the system from performing its safety function. Additionally, diverse hardware and ...
2014 / Joseph Maurio, Christopher McClure -
Using Performance Measurements to Improve MapReduce Algorithms
Abstract The Hadoop MapReduce software environment is used for parallel processing of distributively stored data. Data mining algorithms of increasing sophistication are being implemented in MapReduce, bringing new challenges for performance...
2012 / Todd D. Plantenga, Yung Ryn Choe, Ann Yoshimura -
The Research on Coding Scheme of Binary-Tree for XML
Abstract Usually, there are four different options when store and query the XML data: Firstly, use the file system; secondly, use relational database system; thirdly, use object-oriented database system; fourthly, establish a special database system ...
2011 / Xiao Ke -
Feature Selection with Attributes Clustering by Maximal Information Coefficient
Abstract Feature selection is usually a separate procedure which can not benefit from result of the data exploration. In this paper, we propose a unsupervised feature selection method which could reuse a specific data exploration result....
2013 / Xi Zhao, Wei Deng, Yong Shi -
Prediction of Enterprise Purchases Using Markov Models in Procurement Analytics Applications
Abstract Procurement is a set of activities and processes related to acquisition of goods and services through purchase orders placed by organization employees,from external contractors. Thisarticle describes practical experiments with procurement...
2015 / Adam Westerski, Rajaraman Kanagasabai, Jiayu Wong, Henry Chang -
Learning model-free robot control by a Monte Carlo EM algorithm2009 / Nikos Vlassis, Marc Toussaint, Georgios Kontes, Savas Piperidis
-
A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data2010 / Emily K. Szusz, Allan R. Willms
-
OLSR-based Topology Discovery for Mobile Situational Awareness Systems
Abstract In this paper, we propose a non-intrusive approach for connectivity visualization of OLSR-based MANET topology based on local topology databases available in an OLSR node. Two different scenarios are considered: a central (full view)...
2011 / Anand Dersingh, Z.M. Faizul Islam, Shahram Shah Heydari, Md. Mustafizur Rahman -
Analysis of evolutionary process in a lot sizing application
Abstract This paper seeks to determine the relationship between the best chromosome and its ancestors in genetic algorithms. The domain chosen is that of the classical lot sizing problem. A genetic algorithm software is developed to find the best...
2011 / Gürsel A Süer, Bulent Erenay, Meng-Yun Chen -
Collusion-Resistant Reputation Mechanism for Multi-Agents Systems
Abstract We address the collusion problem in a reputation-driven multi-agent system where agents represent service providers, consumers, and a controller. A game structure is proposed where players are supposed rational and payoff maximizers. The...
2011 / Babak Khosravifar, Jamal Bentahara, Mahsa Alishahi, Maziar Gomrokchi -
Use of Maximal Spanning Trees and the Gamma Test of Monotone Trend in the Development and Assessment of Teams
Abstract Analysis of Social Networks may be further supported through the collection of ordinal data. Such data may help to determine potentially optimal teams extending across groups or departments through the use of Kruskal‘s Algorithm for the...
2011 / Nicole Bhalla Fernandez, Juliet Aiken, James T. Smith -
Semantic Search based on the Online Integration of NLP Techniques
Abstract This paper introduces a framework for semantic information retrieval based on the integration of various natural language processing (NLP) techniques, each of which annotates a base text with different kinds of information extracted from...
2011 / Katsuya Masuda, Takuya Matsuzaki, Jun’ichi Tsujii -
Didactics and non-formal/informal relations. Online communication and knowledge processes
Abstract The use of technologies in didactics raises several issues that deserve to be further examined both to support teachers’ reflections about the effects of daily use of the Internet on students of, and to rethink teaching methods. The...
2011 / Serge Agostinelli, Valerie Campillo, Patrizia Magnoler, Pier Giuseppe Rossi -
A Clustering Method Based on K-Means Algorithm
Abstract In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means...
2012 / Youguo Li, Haiyan Wu