ppxscal/embedding_network huggingface dataset:
Qualitative modelling to prospect expert's reasoning
Authors: Kamal Kansou, Guy Della Valle, Amadou Ndiaye
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

In this paper we present a functional representation of human expert reasoning throughout its statements when assessing the condition of a given object. The human expert statements are represented as conjunctions of elementary propositions. We demonstrate that the conjunctions of elementary propositions can be represented as qualitative additions of qualitative functions in the Q-algebra (Q, ≈,, $\otimes$). We validate our functional representation by formalizing a representative human expert reasoning: assessment of dough condition in function with the ingredients characteristics.
Coloring number and on-line Ramsey theory for graphs and hypergraphs
Authors: H. A. Kierstead, Goran Konjevod
Venue: Combinatorica (2009)

Let c,s,t be positive integers. The (c,s,t)-Ramsey game is played by Builder and Painter. Play begins with an s-uniform hypergraph G 0=(V,E 0), where E 0=&#x00d8; and V is determined by Builder. On the ith round Builder constructs a new edge e i (distinct from previous edges) and sets G i =(V,E i ), where E i =E i&#x2212;1&#x222a;{e i }. Painter responds by coloring e i with one of c colors. Builder wins if Painter eventually creates a monochromatic copy of K s t , the complete s-uniform hypergraph on t vertices; otherwise Painter wins when she has colored all possible edges. We extend the definition of coloring number to hypergraphs so that &#x03c7;(G)&#x2264;col(G) for any hypergraph G and then show that Builder can win (c,s,t)-Ramsey game while building a hypergraph with coloring number at most col(K s t ). An important step in the proof is the analysis of an auxiliary survival game played by Presenter and Chooser. The (p,s,t)-survival game begins with an s-uniform hypergraph H 0 = (V,&#x00d8;) with an arbitrary finite number of vertices and no edges. Let H i&#x2212;1=(V i&#x2212;1,E i&#x2212;1) be the hypergraph constructed in the first i &#x2212; 1 rounds. On the i-th round Presenter plays by presenting a p-subset P i &#x2286;V i&#x2212;1 and Chooser responds by choosing an s-subset X i &#x2286;P i . The vertices in P i &#x2212; X i are discarded and the edge X i added to E i&#x2212;1 to form E i . Presenter wins the survival game if H i contains a copy of K s t for some i. We show that for positive integers p,s,t with s&#x2264;p, Presenter has a winning strategy.
Region Extraction and Verification for Spatial and Spatio-temporal Databases
Authors: Mark Mckenney
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

Newer spatial technologies, such as spatio-temporal databases, geo-sensor networks, and other remote sensing methods, require mechanisms to efficiently process spatial data and identify (and in some cases fix) data items that do not conform to rigorously defined spatial data type definitions. In this paper, we propose an $O(n \lg n )$ time complexity algorithm that examines a spatial configuration, eliminates any portions of the configuration that violate the definition of spatial regions, and constructs a valid region out of the remaining configuration. 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
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
Authors: R. Tavakkoli-Moghaddam, F. Taheri, M. Bazzazi, M. Izadi, F. Sassani
Venue: Computers and Operations Research (2009)

This paper presents a novel, two-level mixed-integer programming model of scheduling N jobs on M parallel machines that minimizes bi-objectives, namely the number of tardy jobs and the total completion time of all the jobs. The proposed model considers unrelated parallel machines. The jobs have non-identical due dates and ready times, and there are some precedence relations between them. Furthermore, sequence-dependent setup times, which are included in the proposed model, may be different for each machine depending on their characteristics. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditional approaches or optimization tools is extremely difficult. This paper proposes an efficient genetic algorithm (GA) to solve the bi-objective parallel machine scheduling problem. The performance of the presented model and the proposed GA is verified by a number of numerical experiments. The related results show the effectiveness of the proposed model and GA for small and large-sized problems.
On hybrid systems modeling with Petri nets
Authors: Drighiciu Mircea, Manolea Gheorghe, Petrisor Anca, Popescu Marius
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

For the last past years, the formalism of classic Petri nets and their various extensions, offer powerful concepts and formal techniques for modeling, simulation and analysis of hybrid dynamic systems. In this way, this paper presents a Petri net approach to specify and simulate hybrid dynamic systems with autonomous commutation of the model generated by a hysteresis phenomenon, in order to validate their behavior for several simulation scenarios. An application to a thermostat with anticipative resistance used into a control temperature process is treated.
Gas Turbine Fault Diagnosis using Random Forests
Authors: Manolis Maragoudakis, Euripides Loukis, Panayotis-Prodromos Pantelides
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In the present paper, Random Forests are used in a critical and at the same time non trivial problem concerning the diagnosis of Gas Turbine blading faults, portraying promising results. Random forests-based fault diagnosis is treated as a Pattern Recognition problem, based on measurements and feature selection. Two different types of inserting randomness to the trees are studied, based on different theoretical assumptions. The classifier is compared against other Machine Learning algorithms such as Neural Networks, Classification and Regression Trees, Naive Bayes and K-Nearest Neighbor. The performance of the prediction model reaches a level of 97% in terms of precision and recall, improving the existing state-of-the-art levels achieved by Neural Networks by a factor of 1.5%--2%.
An update on the GENI project
Authors: Chip Elliott, Aaron Falk
Venue: ACM SIGCOMM Computer Communication Review (2009)

Environment for Network Innovations. Early prototypes of GENI are starting to come online as an end-to-end system and network researchers are invited to participate by engaging in the design process or using GENI to conduct experiments.
Similarity as a Quality Indicator in Ontology Engineering
Authors: Krzysztof Janowicz, Patrick Maué, Marc Wilkes, Sven Schade, Franca Scherer, Matthias Braun, Sören Dupke, Werner Kuhn
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

In the last years, several methodologies for ontology engineering have been proposed. Most of these methodologies guide the engineer from a first paper draft to an implemented --mostly description logics-based --ontology. A quality assessment of how accurately the resulting ontology fits the initial conceptualization and intended application has not been proposed so far. In this paper, we investigate the role of semantic similarity as a quality indicator. Based on similarity rankings, our approach allows for a qualitative estimation whether the domain experts' initial conceptualization is reflected by the developed ontology and whether it fits the users' application area. Our approach does not propose yet another ontology engineering methodology but can be integrated into existing ones. A plug-in to the Protégé ontology editor implementing our approach is introduced and applied to a scenario from hydrology. The benefits and restrictions of similarity as a quality indicator are pointed out.
Computational methods for evaluating student and group learning histories in intelligent tutoring systems
Authors: Carole Beal, Paul Cohen
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Intelligent tutoring systems customize the learning experiences of students. Because no two students have precisely the same learning history, traditional analytic techniques are not appropriate. This paper shows how to compare the learning histories of students and how to compare groups of students in different experimental conditions. A class of randomization tests is introduced and illustrated with data from the AnimalWatch ITS project for elementary school arithmetic.
Smooth Scheduling under Variable Rates or&#x00a0;the&#x00a0;Analog-Digital Confinement Game
Authors: Ami Litman, Shiri Moran-Schein
Venue: Theory of Computing Systems (2009)

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client &#x03b3; has a rate, a real number &#x03c1; &#x03b3; (t), that specifies his needs in this slot. The rates satisfy the restriction &#x2211; &#x03b3; &#x03c1; &#x03b3; (t)&#x2264;m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is &#x0394; -smooth if for all time intervals I the absolute difference between the amount of service received by each client &#x03b3; to his nominal needs of &#x2211; t&#x2208;I &#x03c1; &#x03b3; (t) is less than &#x0394;. Our objective are online schedulers that produce &#x0394;-smooth schedules where &#x0394; is a small constant which is independent of m and&#x00a0;n. Our paper constructs such schedulers; these are the first online &#x0394;-smooth schedulers, with a constant &#x0394;, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction &#x201c;adds a surprising amount of difficulty&#x201d; to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule.
Framework for visualizing and exploring high-dimensional geometry
Authors: Andrew J. Hanson
Venue:  (2008)

Understanding geometric structures embedded in high dimensional spaces is a difficult and challenging task. A fundamental approach is to interactively search for informative low-dimensional projections. However, the manual interaction-based approach is limited in its scope, and often infeasible for exploring complex structures in very high dimensions.We present a framework for visualizing and exploring high-dimensional geometry that employs an automatic method to expose interesting and informative projections of geometric structures. The method is based on optimizing a set of numerical measures or indices that recognize potentially significant geometric features and topological properties. Several such measures are presented and are used to identify informative projections. We investigate also the visualizability of the optimization problem itself to expose additional features of the viewfinding process.Another component of the overall framework supports view exploration by navigating among optimal projections selected by the view-finding system. The problem of navigation and camera control in three dimensions is well understood; in higher dimensions, however, the problem of moving among viewpoints is complex. Our navigation and exploration framework is based on smooth interpolation of projection matrices corresponding to optimal views.An important complementary problem is to evaluate the perceptual effectiveness of high-dimensional visualization methods. Preliminary studies suggest that naive observers can be trained to discriminate properties of objects projected in certain ways from four dimensions to three dimensions.
An Integrated Framework for Fine-Grained Analysis and Design of Group Learning Activities
Authors: Seiji Isotani, Riichiro Mizoguchi
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

To evaluate the teaching-learning process in collaborative learning sessions and its educational benefits for learners, we should analyze the interaction process during each session and select appropriate learning goals and tasks for each learner. However, the interaction process is very difficult to analyze, even for experts, and furthermore choosing appropriate goals/tasks can be even more challenging. The main objective of our work is to construct a conceptual structure based on ontology to help the interaction analysis and the learning design. We aim to make the tacit benefits for the learners explicit identifying the relationships among interactions and educational benefits. Through this conceptual structure we show how it is possible to analyze and design effective collaborative learning sessions proposing tasks and goals with justification by learning theories.
Intelligent control system for monitoring drilling process
Authors: Sorin Dan Grigorescu, Costin Cepisca, Octavian Mihai Ghita, Ion Potarniche, Elena Grigorescu
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

World wide drilling is developing for oil, gas or water resources. Electric motors power 75% of the total drilling rigs installation, augmenting to 95% for the case of Romania. Monitoring diesel generators micropower station and motors of the rig is the second important thing to do and complete the main task of drilling process monitoring. This paper describe a monitoring and control system intended for inland and offshore drilling rig applications.
Model selection for generalized linear models with factor-augmented predictors
Authors: Tomohiro Ando, Ruey S. Tsay
Venue: Applied Stochastic Models in Business and Industry (2009)

This paper considers generalized linear models in a data-rich environment in which a large number of potentially useful explanatory variables are available. In particular, it deals with the case that the sample size and the number of explanatory variables are of similar sizes. We adopt the idea that the relevant information of explanatory variables concerning the dependent variable can be represented by a small number of common factors and investigate the issue of selecting the number of common factors while taking into account the effect of estimated regressors. We develop an information criterion under model mis-specification for both the distributional and structural assumptions and show that the proposed criterion is a natural extension of the Akaike information criterion (AIC). Simulations and empirical data analysis demonstrate that the proposed new criterion outperforms the AIC and Bayesian information criterion. Copyright &copy; 2009 John Wiley & Sons, Ltd.
A memory system design framework: creating smart memories
Authors: Amin Firoozshahian, Alex Solomatnikov, Ofer Shacham, Zain Asgar, Stephen Richardson, Christos Kozyrakis, Mark Horowitz
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

As CPU cores become building blocks, we see a great expansion in the types of on-chip memory systems proposed for CMPs. Unfortunately, designing the cache and protocol controllers to support these memory systems is complex, and their concurrency and latency characteristics significantly affect the performance of any CMP. To address this problem, this paper presents a microarchitecture framework for cache and protocol controllers, which can aid in generating the RTL for new memory systems. The framework consists of three pipelined engines' request-tracking, state-manipulation, and data movement' which are programmed to implement a higher-level memory model. This approach simplifies the design and verification of CMP systems by decomposing the memory model into sequences of state and data manipulations. Moreover, implementing the framework itself produces a polymorphic memory system. To validate the approach, we implemented a scalable, flexible CMP in silicon. The memory system was then programmed to support three disparate memory models' cache coherent shared memory, streams and transactional memory. Measured overheads of this approach seem promising. Our system generates controllers with performance overheads of less than 20% compared to an ideal controller with zero internal latency. Even the overhead of directly implementing a fully programmable controller was modest. While it did double the controller's area, the amortized effective area in the system grew by roughly 7%.
Practical Django Projects, Second Edition, 2nd edition
Authors: James Bennett
Venue:  (2009)

Build a django content management system, blog, and social networking site with James Bennett as he introduces version 1.1 of the popular Django framework. Youll work through the development of each project, implementing and running the applications while learning new features along the way. Web frameworks are playing a major role in the creation of todays most compelling web applications, because they automate many of the tedious tasks, allowing developers to instead focus on providing users with creative and powerful features. Python developers have been particularly fortunate in this area, having been able to take advantage of Django, a very popular open source web framework whose stated goal is to "make it easier to build better web applications more quickly with less code". Practical Django Projects introduces this popular framework by way of a series of realworld projects. Readers follow along with the development of each project, implementing and running each application while learning new features along the way. This edition is updated for Django 1.1 and includes a new chapter on unit testing in Django. What youll learn Capitalize upon the welldefined and stable framework architecture of Django 1.1 to build web applications faster than ever before. Learn by doing by working through the creation of three realworld projects, including a content management system, blog, and social networking site. Build userfriendly web sites with wellstructured URLs, session tracking, and syndication options. Let Django handle tedious tasks such as database interaction while you focus on building compelling applications. Who is this book for? Web developers seeking to use the powerful Django framework to build powerful web sites. About the Apress Practical Series The Practical series from Apress is your best choice for getting the job done, period. From professional to expert, this series lets you apply projectmotivated templates (or frameworks) step by step in a very direct, practical, and efficient manner toward current realworld projects that may be sitting on your desk. So whatever your career goal, Apress can be your trusted guide to take you where you want to go on your IT career empowerment path.
On a control system design using the partial model matching of time-delay system
Authors: F. F. Shoji, K. Fujii, H. H. Lee
Venue: Proceedings of the 2nd conference on European computing conference (2008)

The partial model matching method is demonstrated as follows. The PID or I-PD controllers are designed so that the closed loop transfer function consistent with the reference model. The reference models are give by the denominator away form, here four types of reference models are used[3]. In order to apply the partial model matching method, it is required the original controlled system is transformed to the denominator array form, this is the main part of the partial model matching method. Although the original system is stable, the denominator array form of the original system sometimes becomes unstable. In this case the partial model matching method cannot be applied. This paper present that the PID controllers for time-delay system given by a fluid temperature and liquid level control system are designed. The denominator array form of the controlled system with time-delay is proposed, that is, Maclaurin expansion and Pade approximation. The proposed method can be obtain the stable closed loop transfer function.
An Ultrasonic 3D Positioning System Using a Single Compact Receiver Unit
Authors: Masanori Sugimoto, Kan Tulathimutte, Toshio Ito, Tetsuya Sato, Hiromichi Hashizume
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

We present a system that can identify positions of objects in three-dimensional space using ultrasonic communications. The proposed system uses the time of flight of ultrasonic waves to calculate the distance between a transmitter and a microphone. An innovative method called the Phase Accordance Method is used for accurate detection of the arrival time of the ultrasonic signal for distance measurements. The main benefit of the proposed system is that it can locate positions of static and moving objects in a three-dimensional space by using only one compact receiver unit mounting three ultrasonic microphones; this will reduce the users' deployment tasks. Experimental results prove that the system possesses sufficient accuracy levels and stable performance of position measurements in static and dynamic situations, even though the beacon geometry of the system is poor.