ppxscal/embedding_network huggingface dataset:
Combining Information Extraction Systems Using Voting and Stacked Generalization
Authors: Georgios Sigletos, Georgios Paliouras, Constantine D. Spyropoulos, Michalis Hatzopoulos
Venue: The Journal of Machine Learning Research (2005)

This article investigates the effectiveness of voting and stacked generalization -also known as stacking- in the context of information extraction (IE). A new stacking framework is proposed that accommodates well-known approaches for IE. The key idea is to perform cross-validation on the base-level data set, which consists of text documents annotated with relevant information, in order to create a meta-level data set that consists of feature vectors. A classifier is then trained using the new vectors. Therefore, base-level IE systems are combined with a common classifier at the meta-level. Various voting schemes are presented for comparing against stacking in various IE domains. Well known IE systems are employed at the base-level, together with a variety of classifiers at the meta-level. Results show that both voting and stacking work better when relying on probabilistic estimates by the base-level systems. Voting proved to be effective in most domains in the experiments. Stacking, on the other hand, proved to be consistently effective over all domains, doing comparably or better than voting and always better than the best base-level systems. Particular emphasis is also given to explaining the results obtained by voting and stacking at the meta-level, with respect to the varying degree of similarity in the output of the base-level systems.
Multiple Object Class Detection with a Generative Model
Authors: Krystian Mikolajczyk, Bastian Leibe, Bernt Schiele
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper we propose an approach capable of simultaneous recognition and localization of multiple object classes using a generative model. A novel hierarchical representation allows to represent individual images as well as various objects classes in a single, scale and rotation invariant model. The recognition method is based on a codebook representation where appearance clusters built from edge based features are shared among several object classes. A probabilistic model allows for reliable detection of various objects in the same image. The approach is highly efficient due to fast clustering and matching methods capable of dealing with millions of high dimensional features. The system shows excellent performance on several object categories over a wide range of scales, in-plane rotations, background clutter, and partial occlusions. The performance of the proposed multi-object class detection approach is competitive to state of the art approaches dedicated to a single object class recognition problem.
It's okay to be wrong: recognizing mechanistic reasoning during student inquiry
Authors: Rosemary S. Russ, Paul Hutchison
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Recent reforms in science education place emphasis on engaging students in inquiry similar to that of research scientists. In their attempt to assess this goal, many educators and researchers evaluate student inquiry based on how well their conceptual understanding aligns with canonical knowledge. Such assessments fail to recognize other more valuable aspects of inquiry. We assert that mechanistic reasoning, shown by the history and philosophy of science literatures to be vital in the construction of scientific knowledge, is a more appropriate dimension along which to measure the quality of inquiry. We present a coding scheme designed to identify this reasoning and use it to analyze a discussion among second grade students about why juice boxes collapse when you suck on their straws. Assessing their mechanistic reasoning in this way reveals a value and sophistication that is obscured by current measures of conceptual correctness.
IT worker turnover: an empirical examination of intrinsic motivation
Authors: Jason Bennett Thatcher, Yongmei Liu, Lee P. Stepina, Joseph M. Goodman, Darren C. Treadway
Venue: ACM SIGMIS Database (2006)

This study examined intrinsic motivation's influence on information technology (IT) workers' attitudes and intentions. Drawing on Human Resource management research (Eby & Freeman, 1999), we model Intrinsic motivation as mediating the influence of motivators (i.e., intrinsic job characteristics) and hygiene factors (i.e., pay and supervisory satisfaction) on workplace attitudes (i.e., job satisfaction and affective organizational commitment). In turn, workplace attitudes mediate the influence of intrinsic motivation on turnover intention. The model was tested using data collected from public sector IT workers in the Southeastern United States. Although intrinsic motivation did not fully mediate the influence of motivators and hygiene factors, findings suggest that intrinsic motivation positively influences workplace attitudes and has a mediated influence on turnover intent. Implications for research and practice are offered.
Strengthening Method Contracts for Objects
Authors: Atul Gupta, Amit Raj
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

The main objective of a 'Design by Contracts' approach as applied to object-oriented systems, is to develop complete and consistent method contracts for the objects of the system. In this work, we propose a practical approach to develop these contracts for an object from its annotated structural representation, namely, UML constrained class diagram. We generate, simulate, and refine an object statechart from an initial set of method contracts which in turn help further validating and enhancing these contracts. The impact of this analysis can be multifold: first, it identi- fies various discrepancies like incomplete and inconsistent class specifications, second, a correct and consistent object statechart model is obtained from which reliable automated code and unit tests can easily be generated, third, facilitate essential and effective verification for software re-use, forth, the resulting statechart and class specifications are in a lock-steps which facilitates effective incremental development and change management and fifth, it allows a modeler to specify object's dynamic requirements declaratively on an abstract level, without the need to use full operational dynamic diagrams. We have also designed a tool ObjectSim that performs automated statechart generation and their interactive simulations. We demonstrate our approach using an example and discuss other related issues.
CEQMM: a complete and efficient quality of service model for MANETs
Authors: Hakim Badis, Khaldoun Al Agha
Venue: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks (2006)

This paper specifies CEQMM, a Complete and Efficient Quality of Service (QoS) Model for MANETs which combines the positive aspects of both IntServ and DiffServ. It uses a hybrid per-flow and per-class provisioning scheme. In such a scheme, QoS traffic of highest priority is given per-flow provisioning while other priority QoS classes are given per-class provisioning. To offer this scheme and to ensure that certain packets receive higher priority transmission than other packets, priority classifier, active queue management and packet scheduler are integrated. CEQMM applies the QOLSR protocol to support multiple-metric routing criteria and to respond quickly when changes in topology and/or QoS conditions are detected. Once a path is chosen for one QoS flow, CEQMM performs call admission control (CAC) at each intermediate node. For only QoS flows of highest priority, a node can proceed to soft and later hard bandwidth reservation on links during the CAC process. CEQMM implements congestion avoidance mechanisms to prevent a network from entering the congested state. However, in MANETs, network congestion can still occur frequently under mobility. In order to prevent performance degradation due to mobility-triggered congestion, CEQMM uses a new congestion control scheme. Preliminary simulation results show that CEQMM achieves better performance than the best-effort model
Oscillations and stability in quasiautonomous system. I. Simple point of the one-parameter family of periodic motions
Authors: V. N. Tkhai
Venue: Automation and Remote Control (2006)

Oscillations in the quasiautonomous periodic system were studied for the case where the generating autonomous system admits the one-parameter family ¿(h) of periodic motions with period T(h). Generation of a single cycle was shown to be usual at the ordinary point (dT(h) ¿ 0). Conditions for cycle stability were obtained.
Throughput analysis and admission control for IEEE 802.11a
Authors: Mustafa Ergen, Pravin Varaiya
Venue: Mobile Networks and Applications (2005)

We propose a new Markov model for the distributed coordination function (DCF) of IEEE 802.11. The model incorporates carrier sense, non-saturated traffic and SNR, for both basic and RTS/CTS access mechanisms. Analysis of the model shows that the throughput first increases, and then decreases with the number of active stations, suggesting the need for an admission control mechanism.We introduce such a mechanism, which tries to maximize the throughput while maintaining a fair allocation. The maximum achievable throughput is tracked by the mechanism as the number of active stations increases. An extensive performance analysis shows that the mechanism provides significant improvements.
Merging Knowledge from Different Disciplines in Search of Potential Design Axioms
Authors: Silke Berit Lang
Venue: Proceedings of the conference on Information Visualization (2006)

This paper presents the idea of merging different schools of thinking which have been separated for centuries. Design as a process of creating artifacts and systems varies substantially among individual disciplines. There exists no universally valid and concise definition of the concept design. We first describe different understandings and uses of design with a focus on architecture, engineering, management, and nature. We then show that there is a profound need for merging these different schools of thinking and forming the discipline of design science. The term 'Design Science' got its first recognition in the 1960s but without attaining a remarkable impact on affected disciplines. Progress in design research and multidisciplinary work arose in the last decades. Research in knowledge transfer and knowledge visualization supports the design science's ability to bridge the remaining gap between disciplines.
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Authors: Samuel R. Buss
Venue: Theoretical Computer Science (2006)

A grid graph has rectangularly arranged vertices with edges permitted only between orthogonally adjacent vertices. The st- connectivity principle states that it is not possible to have a red path of edges and a green path of edges which connect diagonally opposite corners of the grid graph unless the paths cross somewhere.We prove that the propositional tautologies which encode the st-connectivity principle have polynomial-size Frege proofs and polynomial-size TC0-Frege proofs. For bounded-width grid graphs, the st-connectivity tautologies have polynomial-size resolution proofs. A key part of the proof is to show that the group with two generators, both of order two, has word problem in alternating logtime (Alogtime) and even in TC0.Conversely, we show that constant depth Frege proofs of the st-connectivity tautologies require near-exponential size. The proof uses a reduction from the pigeonhole principle, via tautologies that express a "directed single source" principle SINK, which is related to Papadimitriou's search classes PPAD and PPADS (or, PSK).The st-connectivity principle is related to Urquhart's propositional Hex tautologies, and we establish the same upper and lower bounds on proof complexity for the Hex tautologies. In addition, the Hex tautology is shown to be equivalent to the SINK tautologies and to the one-to-one onto pigeonhole principle.
Web Interact: An e-Learning Support System
Authors: Chima Adiele, Christina E. Adiele, Mohiuddin Rana
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Internet-enabled technology has given impetus to elearning as choice educational environment for millions of learners. E-learning presents new opportunities for institutions to cost-effectively expand access to education and attract a culturally-diverse student population. Despite positive strides made in e-learning, the drop out rate of students remains high. Most educators attribute this negative trend to lack of interactivity among students. This paper presents an enterprise-wide e-learning support system, called Web Interact System (WebIS). WebIS provides a platform for both intra- and inter-institutional interactivity among learners. The system leverages an existing interactivity model to dynamically measure the interactivity of learners. We provide a prototype of the proposed system and discuss some of its services.
A frequency domain filtering method for generation of long complex Gaussian sequences with required spectra
Authors: Weimin Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The frequency domain filtering method treats the i.i.d. Gaussian samples as in the frequency domain and thus the generation of out-band samples is not necessary. It is efficient when the Doppler bandwidth is low in comparison with the sampling rate, such as in simulations of multipath fading channels. A proposed time domain smooth joining scheme maintains the mean and variance unchanged and controls the power spectral density distortion. The data window used in the joining sessions is cosine and the resultant autocorrelation window ranges from triangle to Papoulis, depending on the degree of overlapping. The spectrum distortions are observed as a trade-off with computational efficiency. It can be seen as a reciprocal work of power spectrum estimation. 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
Data farming: discovering surprise
Authors: Gary E. Home, Theodore E. Meyer
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Data Farming is a methodology and capability that makes use of high performance computing to run models many times. This capability gives modelers and their clients the enhanced ability to discover trends and outlier in results, do sensitivity studies, verify and validate over extended ranges of input parameters, and consider modeling and analyzing non-linear phenomena with characteristics that can not be precisely defined. As high performance computing, in the form of distributed computing capabilities and commodity node systems becomes more pervasive and cost effective, Data Farming can become more available to modelers. In this paper the authors summarize Data Farming and the processes and data architecture of Data Farming systems that make high performance computing readily available to modelers.
Throughput models for SCTP with parallel subflows
Authors: Jianping Zou, M. Ümit Uyar, Mariusz A. Fecko, Sunil Samtani
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Multi-streaming provides SCTP with an aggregation mechanism to accommodate heterogeneous objects, which belong to the same application but may require different type of QoS from the network. However, in the current SCTP specification, supporting QoS inside an SCTP association is not a concern; it is also hindered by the fact that all streams share the flow and congestion control at the association level. We introduce the concept of subflow and propose to modify the current SCTP such that the streams are grouped into several subflows according to their required QoS. To prevent false sharing, each subflow in the modified SCTP (SF-SCTP) implements its own flow and congestion control. Our design also integrates fractional congestion control to improve the fairness of the modified SCTP towards other network traffic. Analytic models are presented to compare the throughput of the original SCTP and SF-SCTP using different flow and congestion control mechanisms. Simulations with ns-2 are used to estimate the throughput in a simplified Diff-Serv network. The analytic models are confirmed to accurately reflect the SCTP behavior. The simulation shows that our proposed solution is able to support QoS among the SCTP streams, and that it achieves a better throughput. The results also indicate that SF-SCTP is more fair to the original SCTP after fractional congestion control is introduced.
Quality assessment, verification, and validation of modeling and simulation applications
Authors: Osman Balci
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Many different types of modeling and simulation (M&S) applications are used in dozens of disciplines under diverse objectives including acquisition, analysis, education, entertainment, research, and training. M&S application verification and validation (V&V) are conducted to assess mainly the accuracy, which is one of many indicators affecting the M&S application quality. Much higher confidence can be achieved in accuracy if a quality-centered approach is used. This paper presents a quality model for assessing the quality of large-scale complex M&S applications as integrated with V&V. The guidelines provided herein should be useful for assessing the overall quality of an M&S application.
Semiconductor-gas discharge electronic devices: stability, patterns and control
Authors: Yu. A. Astrov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Recent results of studying the transport properties of planar semiconductor-gas discharge devices are reviewed. The device can operate in the stable mode or in regimes where self-organization of spatial and temporal patterns occurs. In the range of stability, it can be applied as a high speed converter of infrared images. Simple non-linear models of operation in both modes are presented. The equations corresponding to the converter regime are used to implement a control scheme that can essentially optimize the process of switching on of the state of discharge with increased current. Different scenarios of pattern formation are described and examples both of global and local control of patterns are presented. Some experimental data are accompanied by results of numerical study of the corresponding two-dimensional reaction-diffusion model.
Destination-driven shortest path tree algorithms
Authors: Baoxian Zhang, Hussein T. Mouftah
Venue: Journal of High Speed Networks (2006)

Shortest Path Tree (SPT) is the most widely used type of tree for multicast provisioning due to its simplicity and low per-destination cost. An SPT minimizes the accumulated cost, individually, from the source of a group to each destination of the group. However, SPTs have not considered the overall resource utilization in their constructions. This work aims at building cost-effective SPTs by enhancing link sharing between destinations of a group. We achieve this goal by introducing destination-driven characteristic into SPT constructions. Specifically, each destination is connected with the source via a shortest path. When equal cost multiple paths are available, priority is given to the one biasing through a destination among all such routes. We accordingly present the design of an algorithm building destination-driven SPTs. To achieve further improved performance in resource utilization, we also present an algorithm, which is designed to further enhance link sharing among the destinations of a group while meeting a maximum path length constraint for each destination. Simulation results are used to demonstrate the high performance of the proposed algorithms.
An Adaptive Multi-agent Organization Model Based on Dynamic Role Allocation
Authors: Mark Hoogendoorn, Jan Treur
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Organizations involving multiple agents require adaptation mechanisms to guarantee robustness, especially in critical domains. A template is presented for analysis and design of organizations with adaptation by dynamic role reallocation. This adaptive organization model can be used both for qualitative and quantitative domains, shown in two application cases made to evaluate the applicability of the model.
Load Forecasting on Special Days & Holidays in Power Distribution Substation Using Neural & Fuzzy Networks
Authors: Saeid Nahi
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The demand for neural and fuzzy network techniques to predict the increasing load and its application has changed to an ordinary action. However the facts of the real world caused special and exceptional conditions to be created in this network. Like studying the historical background of abnormal behaviors of the network, like holidays or special days, the sudden sale and change in switching operation and changes in customers'habit to decrease the cost of energy [8]-[9] are effective in load prediction. This research investigates the ways of avoiding disharmony and decreasing the errors under the above-mentioned conditions, which will be explained in real examples of current, reactive and active power. For this purpose, we will explain the required conditions for prediction of the next 24 hours, maximum load of the next day and prediction in the next day as fuzzy numbers. Then we will explain the details of project execution, training method and design and then will explain that how the operations will be carried out on special days and holidays and other problems which influence creation of errors in this paper.
Discrete optimization via simulation using coordinate search
Authors: L. Jeff Hong
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper we propose a coordinate search algorithm to solve the optimization-via-simulation problems with integer-ordered decision variables. We show that the sequence of solutions generated by the algorithm converges to the set of local optimal solutions with probability 1 and the estimated optimal values satisfy a central limit theorem. We compare the coordinate search algorithm to the COMPASS algorithm proposed in Hong and Nelson (2004) through a set of numerical experiments. We see that the coordinate search has a better performance.
Job distribution algorithms
Authors: P. A. Chentsov
Venue: Automation and Remote Control (2006)

Two job distribution problems are studied, extremum for several criteria are estimated, and an approximate algorithm for solving these problems is designed. Such kind of problems are encountered in distributing jobs to processors in multi-processor computing systems, commodities to warehouses, and in many other cases.