ppxscal/embedding_network huggingface dataset:
About a differential equation characterizing gas volume control
Authors: H. D. Wacker, J. Boercsoek
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

Firstly the authors explain the nature of contracts between primary suppliers of gas and local suppliers. They then describe and investigate an effect observed frequently in the field of gas volume and flow control. Instead of running a straight line, the volume controller opens or closes the control valve dramatically at the end of the accounting period. The effect is explained by introducing an easy differential equation to describe the issue and solving it. The reason causing the phenomenon turns out to be a deviation of the measured value of the gas flow rate from the actual value. Rounding errors occurring during necessary calculations may lead to the same effect.
Parallel Generation of l-Sequences
Authors: Cédric Lauradoux, Andrea Röck
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

The generation of pseudo-random sequences at a high rate is an important issue in modern communication schemes. The representation of a sequence can be scaled by decimation to obtain parallelism and more precisely a sub-sequences generator. Sub-sequences generators and therefore decimation have been extensively used in the past for linear feedback shift registers (LFSRs). However, the case of automata with a non linear feedback is still in suspend. In this paper, we have studied how to transform of a feedback with carry shit register (FCSR) into a sub-sequences generator. We examine two solutions for this transformation, one based on the decimation properties of l-sequences, i.e. FCSR sequences with maximal period, and the other one based on multiple steps implementation. We show that the solution based on the decimation properties leads to much more costly results than in the case of LFSRs. For the multiple steps implementation, we show how the propagation of carries affects the design.
Ontology-Based Competence Management for Team Configuration
Authors: Vladimir Tarasov, Thomas Albertsen, Alexey Kashevnik, Kurt Sandkuhl, Nikolay Shilov, Alexander Smirnov
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

When manufacturers, distributors and dealers need to collaborate, they form production networks because this provides significant advantages in production variety, flexibility and lead time. Production processes in such networks often spawn different specific tasks that are to be solved by the network members. This requires creation of a team able to tackle the identified problem. When dealing with multiple organizations and multiple processes within a complicated production network, trying to find a member that has required competence can be a laborious, time-consuming process. Developing and maintaining competence profiles of all the relevant parties associated with production can significantly reduce the time. The paper proposes an approach to team configuration based on competence profiles. The approach utilizes such technologies as ontology management, context management and profiling. Using ontological representation makes it possible to identify those team members who are best suited for the task by ontology matching.
Guaranteed Scheduling for Worst-Case in HR-WPAN
Authors: Jae Eun Kang, Jong Kyu Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

So far, the Link-status Dependent Scheduling (LDS) Algorithm in HR-WPAN (High Rate Wireless Personal Area Network) mainly focused on the throughput elevation in terms of an entire network. However, in the LDS algorithm the throughput of each DEV (Device) is not sensibly considered for the elevation. For instance in case where the DEV has been connected under the bad channel quality, the LDS algorithm does not clearly provide avoidance of the bad user experience of the UE. From this consideration, we introduce a new algorithm which is Guaranteed Scheduling for Worst-case (GSW) that the throughput of each DEV can be individually guaranteed.
Clustering analysis of motif significance profile in software networks
Authors: Zhang Lin, Qian Guanqun, Zhang Li
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

There has been considerable recent interest in network motif for understand network local features, growth and evolution mechanisms. Here, we extended the researches of network motif to the domain of software which is absent in previous researches of network categories based on motif. After compared triad significance profile of 110 java open source software packages, we found that software network could be divided into 3 clusters which are consistent with the known superfamilies from various networks. Moreover, we discuss the representative motif in software, and presented evidence that software scale may be one of the reason cause different motif SP distribution.
Using Nested Surfaces for Visual Detection of Structures in Databases
Authors: Arturas Mazeika, Michael H. Böhlen, Peer Mylov
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

We define, compute, and evaluate nested surfaces for the purpose of visual data mining. Nested surfaces enclose the data at various density levels, and make it possible to equalize the more and less pronounced structures in the data. This facilitates the detection of multiple structures, which is important for data mining where the less obvious relationships are often the most interesting ones. The experimental results illustrate that surfaces are fairly robust with respect to the number of observations, easy to perceive, and intuitive to interpret. We give a topology-based definition of nested surfaces and establish a relationship to the density of the data. Several algorithms are given that compute surface grids and surface contours, respectively.
A functional model-view-controller software architecture for command-oriented programs
Authors: Alley Stoughton
Venue: Proceedings of the ACM SIGPLAN workshop on Generic programming (2008)

Command-oriented functional programs are currently structured in an ad hoc way that makes the development of multiple user-interfaces difficult and error prone, and makes it difficult to abstractly understand a program's command-oriented behavior. To rectify this, we propose a software architecture for such programs that we call functional model-view-controller (MVC), by a rough analogy with object-oriented MVC. In functional MVC, a program is structured as a model (domain-specific aspects), view (abstract user) and controller (command loops). In contrast to object-oriented MVC, a controller is active, consisting of a number of recursive functions. It calls its view to get user input and to display results to the user; it calls its model to do domain-specific work. To increase adaptability, a controller should be parameterized by its model and view, using a function or an ML-style functor. With this approach, one can write terminal and graphical views; one can also write views that do abstract scripting. One can understand and reason about a program's command-oriented aspects at a high-level of abstraction by focusing on the controller. Of particular note is the way we are able to allow computations of the model to be monitored and aborted by view. We illustrate our approach with a case study of a complete program, written in Standard ML, and using Concurrent ML and the eXene X window system toolkit.
Critical issues of information systems management in the Greek Public Sector
Authors: Euripidis N. Loukis, Niki Tsouma
Venue: Information Polity (2002)

Extensive research has been conducted on the main issues that organizations face concerning Information Systems (IS) management, in order to exploit the capabilities of the rapidly evolving Information and Communications Technologies (ICTs) to the highest possible extent. However most of this research has been directed towards the private sector. The present study attempts to contribute to the research of the critical issues of IS management in the public sector. Based on 32 interviews with IS Managers of Greek Public Sector organizations using a structured questionnaire, the main issues and challenges that the organizations of the Greek Public Sector face concerning the whole cycle of IS management are investigated. From this investigation it is concluded that the most important IS management issue currently faced is to hire 'New IS Human Resources', followed by the issues of 'Extending Use of Office Automation' and of 'Management and Use of Data Resources'. The results shed light on the profile of the modern IS management function, which has become highly complex and multidimensional, containing many both technical and non-technical management issues, which can be either internal or external to the IS Unit. The results also show the highly horizontal nature of the IS function: its success depends more on issues concerning its cooperation and relationship with the other functions of the organization, than on issues concerning its own functional expertise. From the study of the main expected IS management issues after 3 years, it is concluded that about one third of the main agenda currently faced by IS management is expected to change within three years, confirming the highly dynamic nature of the IS management function. The results of the present study were also compared with the results of previous studies of IS management issues conducted in Greece and in USA. From the comparison were determined both similarities and differences as to the main IS management issues faced. Therefore some of the main IS management issues faced by organizations are universal, while some others are specific to particular sectoral and national contexts.
On Satisfiability Games and the Power of Congestion Games
Authors: Vittorio Bilò
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

We introduce and study satisfiability games, a new class of games that can be seen as the non-cooperative version of classical maximum satisfiability problems. We give several results involving these games and mainly focus on their expressiveness. In particular, we show that there exists a strong correspondence between satisfiability games and congestion games. As one of the consequences of our results, we show that each game is isomorphic to a congestion game with player specific payoffs. Thus, each other game can be defined as a particular specialization of congestion games with player specific payoffs and this paper can be considered as a first effort in outlining a classification of non-cooperative games.
Reconstruction of binary matrices under fixed size neighborhood constraints
Authors: S. Brocchi, A. Frosini, C. Picouleau
Venue: Theoretical Computer Science (2008)

Using a dynamic programming approach, we prove that a large variety of matrix reconstruction problems from two projections can be solved in polynomial time whenever the number of rows (or columns) is fixed. We also prove some complexity results for several problems concerning the reconstruction of a binary matrix when a neighborhood constraint occurs.
Lessons Learned from Scaling Up a Web-Based Intelligent Tutoring System
Authors: Jozsef Patvarczki, Shane F. Almeida, Joseph E. Beck, Neil T. Heffernan
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Client-based intelligent tutoring systems present challenges for content distribution, software updates, and research activity. With server-based intelligent tutoring systems, it is possible to easily distribute new and updated content, deploy new features and bug fixes, and allow researchers to more easily perform randomized, controlled studies with minimal client-side changes. Building a scalable system architecture that provides reliable service to students, teachers, and researchers is a challenge for server-based intelligent tutors. Our research team has built Assistment, a Web-based tutor used by hundreds of students every day in the Worcester and Pittsburgh areas. Scaling up a server-based intelligent tutoring system requires a particular focus on speed and reliability from the software and system developers. This paper discusses the evolution of our architecture and how it has reduced the cost of authoring ITS and improved the performance and reliability of the system.
Evaluation of Justina: A Virtual Patient with PTSD
Authors: Patrick Kenny, Thomas D. Parsons, Jonathan Gratch, Albert A. Rizzo
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Recent research has established the potential for virtual characters to act as virtual standardized patients VP for the assessment and training of novice clinicians. We hypothesize that the responses of a VP simulating Post Traumatic Stress Disorder (PTSD) in an adolescent female could elicit a number of diagnostic mental health specific questions (from novice clinicians) that are necessary for differential diagnosis of the condition. Composites were developed to reflect the relation between novice clinician questions and VP responses. The primary goal in this study was evaluative: can a VP generate responses that elicit user questions relevant for PTSD categorization? A secondary goal was to investigate the impact of psychological variables upon the resulting VP Question/Response composites and the overall believability of the system.
Data Reduction Method for Categorical Data Clustering
Authors: Eréndira Rendón, J. Salvador Sánchez, Rene A. Garcia, Itzel Abundez, Citlalih Gutierrez, Eduardo Gasca
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

Categorical data clustering constitutes an important part of data mining; its relevance has recently drawn attention from several researchers. As a step in data mining, however, clustering encounters the problem of large amount of data to be processed. This article offers a solution for categorical clustering algorithms when working with high volumes of data by means of a method that summarizes the database. This is done using a structure called CM-tree. In order to test our method, the K-Modes and Click clustering algorithms were used with several databases. Experiments demonstrate that the proposed summarization method improves execution time, without losing clustering quality.
On the Query Complexity of Testing Orientations for Being Eulerian
Authors: Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a non-constant lower bound on the query complexity of 2-sided tests and a linear lower bound on the query complexity of 1-sided tests for this property. On the positive side, we give several 1-sided and 2-sided tests, including a sub-linear query complexity 2-sided test for general graphs. For special classes of graphs, including bounded-degree graphs and expander graphs, we provide improved results. In particular, we give a 2-sided test with constant query complexity for dense graphs, as well as for expander graphs with a constant expansion parameter.
Understanding Creativity-Technique Based Problem Solving Processes
Authors: Florian Forster, Michele Brocco
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Computer-supported creativity techniques can help people finding creative solutions for their problems. However, real-life creative processes demand a high level of flexibility of the support systems, which are normally tailored for one specific creativity technique only. We present a model for creativity-technique based problem solving processes that incorporates a variety of creativity techniques and can be a promising starting point towards more flexible creativity support systems in the future.
Non-dichotomies in Constraint Satisfaction Complexity
Authors: Manuel Bodirsky, Martin Grohe
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ¿-categorical template Γ such that L reduces to CSP(Γ) and CSP(Γ) is in coNP L (i.e., the class coNP with an oracle for L). CSPs with ¿-categorical templates are of special interest, because the universal-algebraic approach can be applied to study their computational complexity.Furthermore, we prove that there are ¿-categorical templates with coNP-complete CSPs and ¿-categorical templates with coNP- intermediate CSPs, i.e., problems in coNP that are neither coNP- complete nor in P (unless P=coNP). To construct the coNP-intermediate CSP with ¿-categorical template we modify the proof of Ladner's theorem. A similar modification allows us to also prove a non-dichotomy result for a class of left-hand side restricted CSPs, which was left open in [10]. We finally show that if the so-called local-global conjecture for infinite constraint languages (over a finite domain) is false, then there is no dichotomy for the constraint satisfaction problem for infinite constraint languages.
The Study of Mission Reliability of QRMS Based on the Multistage Markov Process
Authors: Liang Liang, Bo Guo
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The iteration is a fundamental characteristic of the complex developing process. The developing mission of new product, during the quick response manufacturing process, will be iterated step by step following certain probability rules at the work nodes. Based on the analysis of the development mission process, the method of the multi-stages, finite state Markov process is presented to describe the system process. The models of the mission reliability for both task stages and system have then been built. Finally, the quantitative methods of mission reliability calculation were explained in details through the analysis of an actual developing process. The methods can also be used to evaluate the development system.
Model of Facial Expressions Management for an Embodied Conversational Agent
Authors: Radosław Niewiadomski, Catherine Pelachaud
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this paper we present a model of facial behaviour encompassing interpersonal relations for an Embodied Conversational Agent (ECA). Although previous solutions of this problem exist in ECA's domain, in our approach a variety of facial expressions (i.e. expressed, masked, inhibited, and fake expressions) is used for the first time. Moreover, our rules of facial behaviour management are consistent with the predictions of politeness theory as well as the experimental data (i.e. annotation of the video-corpus). Knowing the affective state of the agent and the type of relations between interlocutors the system automatically adapts the facial behaviour of an agent to the social context. We present also the evaluation study we have conducted of our model. In this experiment we analysed the perception of interpersonal relations from the facial behaviour of our agent.
An Ethnographic Study on Recommendations in the Living Room: Implications for the Design of iTV Recommender Systems
Authors: Regina Bernhaupt, David Wilfinger, Astrid Weiss, Manfred Tscheligi
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

Today recommendations are used to improve the quality and the number of interactive TV services offered by providers all over the world. Their main goal is to recommend TV shows and TV events, sometimes combined with an automatic recording function. With the growing number of IPTV offers, the usage of recommendation systems will increase and help to personalize and individualize the TV viewing experience. This article studies recommendations for the home context investigating daily living habits and routines in 40 households in depth using playful and creative cultural probing. Study results are present design recommendations for the development of new forms of recommendation systems. Main results find that users prefer individualized recommendations in-time, either automated or user-oriented, but mostly prefer individualized recommendations for each member of a household rather than personalized for the whole household.
A Software Component for Content Management and Delivery to Mobile Phones and Digital Television
Authors: Gaetanino Paolone, Eliseo Clementini
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

The proposed software component is intended to facilitate the development of interactive software for the Digital Terrestrial Television (DTT), mobile phones and any other digital platform. The component implements and solves some software standard issues and is the basis for the integrated development of cross-platform software. We also illustrate a real process [1, 4, 5] that uses the software component for the development of an advertisements management application. The requirements that are needed for software development with the component are the knowledge of the "layer" pattern and the specific digital platform [4, 6].
A Hybrid Type System for Lock-Freedom of Mobile Processes
Authors: Naoki Kobayashi, Davide Sangiorgi
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We propose a type system for lock-freedom in the ¿-calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it can verify lock-freedom of concurrent programs that have sophisticated recursive communication structures; it can be fully automated; it is hybrid, in that it combines a type system for lock-freedom with local reasoning about deadlock-freedom, termination, and confluence analyses. Moreover, the type system is parameterized by deadlock-freedom/termination/confluence analyses, so that any methods (e.g. type systems and model checking) can be used for those analyses. A lock-freedom analysis tool has been implemented based on the proposed type system, and tested for non-trivial programs.
Potential Distribution Modelling Using Machine Learning
Authors: Ana C. Lorena, Marinez F. Siqueira, Renato Giovanni, André C. Carvalho, Ronaldo C. Prati
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Potential distribution modelling has been widely used to predict and to understand the geographical distribution of species. These models are generally produced by retrieving the environmental conditions where the species is known to be present or absent and feeding this data into a modelling algorithm. This paper investigates the use of Machine Learning techniques in the potential distribution modelling of plant species Stryphnodendron obovatum Benth (MIMOSACEAE). Three techniques were used: Support Vector Machines, Genetic Algorithms and Decision Trees. Each technique was able to extract a different representation of the relations between the environmental conditions and the distribution profile of the species being considered.