ppxscal/embedding_network huggingface dataset:
Necessary and sufficient conditions of reachability for a model of multidimensional hybrid systems
Authors: Valeriu Prepelita
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

A model of multidimensional time-invariant hybrid systems is studied, which depends on q continuous-time variables and on r discrete-time ones. The general response of the model is provided and some necessary and sufficient conditions of controllability and reachability are obtained by means of a suitable controllability matrix and a reachability Gramian. The relationship between the concepts of controllability and reachability is emphasized. The geometric characterization of the subspace of reachable states is given and a list of controllability and reachability criteria is derived.
Zero-Correlation Zone Sequence Set Constructed from a Perfect Sequence and a Complementary Sequence Pair
Authors: Takafumi Hayashi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The present paper introduces the construction of a class of sequence sets with zero-correlation zones called zero-correlation zone sequence sets. The proposed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence and an arbitrary Golay complementary sequence pair. The proposed construction is a generalization of the zero-correlation zone sequence construction previously reported by the present author. The proposed sequence set can successfully provide CDMA communication without co-channel interference.
Geno-mathematical identification of the multi-layer perceptron
Authors: Ralf &#x00d6;stermark
Venue: Neural Computing and Applications (2009)

In this paper, we will focus on the use of the three-layer backpropagation network in vector-valued time series estimation problems. The neural network provides a framework for noncomplex calculations to solve the estimation problem, yet the search for optimal or even feasible neural networks for stochastic processes is both time consuming and uncertain. The backpropagation algorithm&#x2014;written in strict ANSI C&#x2014;has been implemented as a standalone support library for the genetic hybrid algorithm (GHA) running on any sequential or parallel main frame computer. In order to cope with ill-conditioned time series problems, we extended the original backpropagation algorithm to a K nearest neighbors algorithm (K-NARX), where the number K is determined genetically along with a set of key parameters. In the K-NARX algorithm, the terminal solution at instant t can be used as a starting point for the next t, which tends to stabilize the optimization process when dealing with autocorrelated time series vectors. This possibility has proved to be especially useful in difficult time series problems. Following the prevailing research directions, we use a genetic algorithm to determine optimal parameterizations for the network, including the lag structure for the nonlinear vector time series system, the net structure with one or two hidden layers and the corresponding number of nodes, type of activation function (currently the standard logistic sigmoid, a bipolar transformation, the hyperbolic tangent, an exponential function and the sine function), the type of minimization algorithm, the number K of nearest neighbors in the K-NARX procedure, the initial value of the Levenberg&#x2013;Marquardt damping parameter and the value of the neural learning (stabilization) coefficient &#x03b1;. We have focused on a flexible structure allowing addition of, e.g., new minimization algorithms and activation functions in the future. We demonstrate the power of the genetically trimmed K-NARX algorithm on a representative data set.
Analytic network process and multi-period goal programming integration in purchasing decisions
Authors: Ezgi Aktar Demirtas, Ozden Ustun
Venue: Computers and Industrial Engineering (2009)

This paper presents a multi-period inventory lot sizing scenario, where there is single product and multiple suppliers. By considering multi-period planning horizon, an integrated approach of Archimedean Goal Programming (AGP) and Analytic Network Process (ANP) is suggested. This integrated approach proposes a two-stage mathematical model to evaluate the suppliers and to determine their periodic shipment allocations given a number of tangible and intangible criteria. In the evaluation stage, the suppliers are evaluated according to 14 criteria that are involved in four control hierarchies; benefit, opportunity, cost and risk (BOCR). In the shipment stage, a multi objective mixed integer linear programming (MOMILP) model is described to solve the order allocation problem. This MOMILP model is suggested to achieve target values of periodic goals: budget, aggregate quality, total value of purchasing (TVP) and demand over the planning horizon, without exceeding vendor production capacities. This multi-period model is solved by using AGP. Finally some computational experiments are conducted to test the performance of the proposed method.
Managing and Leading Software Projects, annotated edition edition
Authors: Richard E. Fairley
Venue:  (2009)

The book is organized around basic principles of software project management: planning and estimating, measuring and controlling, leading and communicating, and managing risk. Introduces software development methods, from traditional (hacking, requirements to code, and waterfall) to iterative (incremental build, evolutionary, agile, and spiral). Illustrates and emphasizes tailoring the development process to each project, with a foundation in the fundamentals that are true for all development methods. Topics such as the WBS, estimation, schedule networks, organizing the project team, and performance reporting are integrated, rather than being relegating to appendices. Each chapter in the book includes an appendix that covers the relevant topics from CMMI-DEV-v1.2, IEEE/ISO Standards 12207, IEEE Standard 1058, and the PMI Body of Knowledge.
CaRet With Forgettable Past
Authors: Laura Bozzelli
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We study the extension of the full logic CaRet with the unary regular modality N (which reads ''from now on'') which allows to model forgettable past. For such an extension, denoted NCaRet, we show the following: (1) NCaRet is expressively complete for the first-order fragment of MSO^@m, which extend MSO over words with a binary matching predicate, (2) satisfiability and pushdown model checking are 2Exptime-complete, and (3) pushdown model checking against the regular fragment of NCaRet remains 2Exptime-hard.
New Spatial Configurations
Authors: Harald Gropp
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

This second paper on constructions of spatial configurations follows the author&rsquo;s paper of 1994 [2]. For the first time again new spatial configurations are constructed, in particular a configuration (338)2, the smallest known configuration (v 8)2, and several configurations (v 9)2, in particular for v&thinsp;=&thinsp;40 and for v&thinsp;&ge;&thinsp;43. 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
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Authors: João C. N. Clímaco, Marta M. B. Pascoal
Venue: Computers and Operations Research (2009)

In this paper we introduce a method to compute non-dominated bicriteria shortest pairs, each including two disjoint simple paths. The method is based on an algorithm for ranking pairs of disjoint simple paths by non-decreasing order of cost, that is an adaptation of a path ranking algorithm applied to a network obtained from the original one after a suitable modification of the topology. Each path in this new network corresponds to a pair of paths in the former one. Computational results are presented and analysed for randomly generated networks.
The DrawStream Station or the AVCs of Video Cocktail Napkins
Authors: Steve Harrison, Scott Minneman, Joshua Marinacci
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper reports on the development of a multimedia system to support collaborative design processes. The DrawStream Station was developed through a cycle of observation of real work, identification of problem characteristics and system requirements, development of the technology, and observation of the technology in use. The system is a combination of a high quality multimedia infrastructure and a particular form of "Space Above / Space Below" interface merging real and virtual representations. The control interface mixes a variety of temporal and logical representations to display a threaded conversation. We report on the use of the system as a way to understand the dynamics of genre systems. Two nascent genres are identified: Asynchronous Video Conversations and Video Cocktail Napkins.
Formal Definitions of Reason Fallacies to Aid Defect Exploration in Argument Gaming
Authors: G. S. Mahalakshmi, T. V. Geetha
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Reason fallacies are fallacious reasons presented in arguments during argumentative discussions. The fallacious reasons do not support the claim of argument and therefore, the argument gets defeated. Defect exploration is the process of analysing argument inconsistencies due to the presence of fallacious reasons. The context of argument exchange is a knowledge base represented in the form of Indian logic based ontology, and defect exploration actually entails analyzing the ontological elements of submitted arguments, during the `tarka' style of argumentation. The process of defect exploration exploits the Navya- Nyaya methodology for identifying defects by exploring the presence or absence of invariable concomitance relation between elements of submitted arguments and populates them into a defect set. The defect set can then be utilized by the participant for designing appropriate defeat strategies, which help in generation of associated counter-arguments. In this paper, we propose the formal definitions of reason fallacies in terms of elements of arguments recommended by Nyaya logics, so that, the arguments are thoroughly analysed in a `tarka' based argumentation setting.
Scalable OLAP and mining of information networks
Authors: Jiawei Han, Xifeng Yan, Philip S. Yu
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

With the ubiquity of information networks and their broad applications, there have been numerous studies on the construction, online analytical processing, and mining of information networks in multiple disciplines, including social network analysis, World-Wide Web, database systems, data mining, machine learning, and networked communication and information systems. In this tutorial, we present an organized picture on scalable OLAP (online analytical processing) and mining of information networks, with the inclusion of the following topics: (1) an introduction to information networks and information network analysis, (2) general statistical behavior of information networks, (3) mining frequent subgraphs in large graphs and networks, (4) data integration, data cleaning and data validation in information networks, (5) clustering graphs and information networks, (6) classification of graphs and information networks; (7) summarization and simplification of graphs and information networks, (8) OLAP and multidimensional analysis of information networks, (9) evolution of dynamic information networks, and (10) research challenges on OLAP and mining of information networks.
A Multi-facet Requirement Assessment of Customer-Oriented Mobile Tourism Services
Authors: Chien-Chih Yu, Hsiao-ping Chang
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper presents a multi-facet requirement assessment approach for specifying and relating potential business-to-customer mobile tourism services. An integrated requirement model of mobile tourism services including search & notification, community, tour-guide, recommendation, auction, and transaction & payment services is formulated and validated. Three surveys are conducted to collect data from tourists, 3G operators, and travel agencies for assessing usefulness, importance, feasibility, and effectiveness, as well as for illustrating structural relationships of these services. Survey results and implications serve as a valuable guidance for helping mobile service providers in the tourism domain to improve their services for meeting customers' needs.
A Parallel Corpus Labeled Using Open and Restricted Domain Ontologies
Authors: Ester Boldrini, Sergio Ferrández, Ruben Izquierdo, David Tomás, Jose Luis Vicedo
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

The analysis and creation of annotated corpus is fundamental for implementing natural language processing solutions based on machine learning. In this paper we present a parallel corpus of 4500 questions in Spanish and English on the touristic domain, obtained from real users. With the aim of training a question answering system, the questions were labeled with the expected answer type, according to two different ontologies. The first one is an open domain ontology based on Sekine's Extended Named Entity Hierarchy, while the second one is a restricted domain ontology, specific for the touristic field. Due to the use of two ontologies with different characteristics, we had to solve many problematic cases and adjusted our annotation thinking on the characteristics of each one. We present the analysis of the domain coverage of these ontologies and the results of the inter-annotator agreement. Finally we use a question classification system to evaluate the labeling of the corpus.
Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
Authors: Willem Conradie
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We develop a new algorithm, based upon the SQEMA-algorithm, for computing first-order frame correspondents of hybrid formulas. It is shown that the success of this algorithm on an input formula guarantees its sd-persistence and hence the completeness of the logic obtained by adding that formula as axiom to the basic hybrid system. These results are employed to obtain a hybridized extension of Sahlqvist's theorem.
Combining Job and Team Selection Heuristics
Authors: Chris L. Jones, K. Suzanne Barber
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

In open markets and within business and government organizations, selfish agents often face the question of what tasks to work on, and what partners to work with. Optimal solutions are particularly difficult to find in large-scale, unpredictably dynamic environments. Previous work has examined the use of separate job selection and team selection heuristics to guide agent decisions in these domains, but did not explore how these decisions influence each other, and how these heuristics should therefore be used together. Accordingly, this paper presents a mechanism for combining job and team selection heuristics for agents operating in a large-scale, unpredictably dynamic environment. An experimental analysis of this new job/team selection mechanism demonstrates significant improvements in agent performance, both in terms of credit earned and in percentage of jobs successfully completed.
A comparative study of genetic algorithm components in simulation-based optimisation
Authors: Birkan Can, Andreas Beham, Cathal Heavey
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, we present a comparative study of different stochastic components of genetic algorithms for simulation-based optimisation of the buffer allocation problem. We explore the effects of elements such as operators, fitness assignment strategies and elitism. Three different recombination operators, incorporated with constraint handling mechanisms such as repair and penalty functions, are examined. Under the shed of the experiments, we incorporate problem specific knowledge to further enhance the practicality of GA in decision making for buffer allocation problem.
Cooperative learning in E-learning: A peer assessment of student-centered using consistent fuzzy preference
Authors: Ting-Yi Chang, Yi-Ting Chen
Venue: Expert Systems with Applications: An International Journal (2009)

E-learning is a popular method of disseminating knowledge in a variety of fields. In order to promote student interaction, this paper integrates the concept of cooperative learning into an E-learning environment. However, how to assess individual student achievement in groups is an important issue needing to be solved. Since a teacher can not observe students' interactions in an E-learning environment, the peer assessment appears more important. Peer assessment in a group is an important part of both teaching and the learning processes that allow student to assess the others' contributions in a group. Based on the concept of student-centered learning, a fuzzy peer assessment system (FPAS) is developed to satisfy the requirements of cooperative learning in an E-learning environment. All students participate all phases of the assessment processes; cooperatively creating the peer assessment questionnaire, assessing other peers' works, and finally assigning the appropriate score to each student.
A closed-form reduction of multi-class cost-sensitive learning to weighted multi-class learning
Authors: Fen Xia, Yan-wu Yang, Liang Zhou, Fuxin Li, Min Cai, Daniel D. Zeng
Venue: Pattern Recognition (2009)

In cost-sensitive learning, misclassification costs can vary for different classes. This paper investigates an approach reducing a multi-class cost-sensitive learning to a standard classification task based on the data space expansion technique developed by Abe et al., which coincides with Elkan's reduction with respect to binary classification tasks. Using this proposed reduction approach, a cost-sensitive learning problem can be solved by considering a standard 0/1 loss classification problem on a new distribution determined by the cost matrix. We also propose a new weighting mechanism to solve the reduced standard classification problem, based on a theorem stating that the empirical loss on independently identically distributed samples from the new distribution is essentially the same as the loss on the expanded weighted training set. Experimental results on several synthetic and benchmark datasets show that our weighting approach is more effective than existing representative approaches for cost-sensitive learning.
Artificial neural network design for behaviours of reinforced concrete column under axial load and comparison of experimental study
Authors: M. Tolga Cogurcu, M. Sami Donduren, Ismail Saritas, Mehmet Kamanli, Mustafa Altin, Mevlüt Yasar Kaltakci
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Construction (building) sector is one of the sectors which adapt the rapid development of the technology. Especially in frame (skeleton) systems, very serious studies on columns that are vertical conveyors (carriers) are being done. Generally, these studies are implemented by experimentally and computer software is used in these studies as they offer good results. Artificial neural network (ANN) has been used in several engineering application areas including civil engineering. The use of ANN to predict the behaviour of reinforced concrete (R/C) members, using the vast amount of experimental data as a test-bed for learning and verification of results, proved to be available method for carrying out parametric studies. In the present study, columns under the axial load were manufactured from concrete that has been produced without carrying out the standards. Load conveying capacities and tension-unit deformation relationships of columns manufactured with different geometrical and equipment (outfit) properties and same cross-section area have been investigated. At the same time, research has been done via modelling by using ANN that is one of techniques of artificial intelligence and gained importance in recent years. SPSS statistical packet program is used to evaluate the results of this research. After comparisons of results obtained in the experiments, it has been determined that square column samples have the most axial load conveying capacity. It has also been determined that number of displacement is less in samples of columns wrapped (winded) with fret comparing to samples of columns wrapped with stirrup. The same results are obtained after modelling by ANN. As the result of statistical analyses that have been done in %5 reliability interval between data obtained from experiments and ANN, it has been seen that ANN can be used as reliable method.
Java memory model aware software validation
Authors: Arnab De, Abhik Roychoudhury, Deepak D'Souza
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

The Java Memory Model (JMM) provides a semantics of Java multithreading for any implementation platform. The JMM is defined in a declarative fashion with an allowed program execution being defined in terms of existence of "commit sequences" (roughly, the order in which actions in the execution are committed). In this work, we develop OpMM, an operational under-approximation of the JMM. The immediate motivation of this work lies in integrating a formal specification of the JMM with software model checkers. We show how our operational memory model description can be integrated into a Java Path Finder (JPF) style model checker for Java programs.
A novel low-complexity transmission power adaptation in MC-CDMA systems with a-MRC receiver over Nakagami-m fading channels
Authors: Yizhi Feng, Jiayin Qin, Gang Wei, Fei Ji
Venue: International Journal of Communication Systems (2009)

In this paper, we propose a novel low-complexity transmission power adaptation with good bit error rate (BER) performance for multicarrier code-division multiple-access (MC-CDMA) systems over Nakagami-m fading channels. We first propose a new receiver called ath-order-maximal-ratio-combining (a-MRC) receiver with which the receiver power gain for the nth subcarrier is the ath (a埳) power of the corresponding channel gain. Incorporating the a-MRC receiver, we then propose a new transmission power adaptation scheme where the transmission power is allocated over all the N subcarriers according to the subchannel gains and the transmitter adapts its power to maintain a constant signal-to-interference-plus-noise (SINR) at the receiver. The proposed scheme has a significant performance gain over the nonadaptive transmission scheme over both independent and correlated fading channels. Moreover, the proposed scheme keeps good BER performance while it is much simpler than the previous power control-adaptation schemes. Copyright &copy; 2008 John Wiley Sons, Ltd.