ppxscal/embedding_network huggingface dataset:
A Novel Approach for Extraction of Fuzzy Rules Using the Neuro-fuzzy Network and Its Application in the Blending Process of Raw Slurry
Authors: Rui Bai, Tianyou Chai, Enjie Ma
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

A novel approach is proposed to extract fuzzy rules from the inputoutput data using the neuro-fuzzy network combined the improved c-means clustering algorithm. Interpretability, which is one of the most important features of fuzzy system, is obtained using this approach. The fuzzy sets number of variables can also be determined appropriately using this approach. Finally, the proposed approach is applied to the blending process of raw slurry in the alumina sintering production process. The fuzzy system, which is used to determine the set values of the flow rate of materials, is extracted from the error of production index ---adjustment of the flow rate. Application results show that the fuzzy system not only improved the quality of raw slurry but also have good interpretability.
Speed Scaling with a Solar Cell
Authors: Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

We consider the speed scaling problem of scheduling a collection of tasks with release times, deadlines, and sizes so as to minimize the energy recharge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is O(1)-competitive with respect to recharge rate.
Pattern Based Composition of Web Services for Symbolic Computations
Authors: Alexandru Cârstea, Georgiana Macariu, Dana Petcu, Alexander Konovalov
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The suitability of the BPEL workflow description language for the dynamic composition of Web services representing computational algebra systems is investigated. The prototype implementation of the system for dynamic generation of BPEL workflows and two examples demonstrating the benefits of our approach are described. One of important aspects of the design is that the composition is achieved using standard workflow patterns without any modification of the underlying computational algebra systems, provided they support the OpenMath format.
An Indistinguishability-Based Characterization of Anonymous Channels
Authors: Alejandro Hevia, Daniele Micciancio
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

We revisit the problem of anonymous communication, in which users wish to send messages to each other without revealing their identities. We propose a novel framework to organize and compare anonymity definitions. In this framework, we present simple and practical definitions for anonymous channels in the context of computational indistinguishability. The notions seem to capture the intuitive properties of several types of anonymous channels (Pfitzmann and Köhntopp 2001) (eg. sender anonymity and unlinkability). We justify these notions by showing they naturally capture practical scenarios where information is unavoidably leaked in the system. Then, we compare the notions and we show they form a natural hierarchy for which we exhibit non-trivial implications. In particular, we show how to implement stronger notions from weaker ones using cryptography and dummy traffic --- in a provably optimal way. With these tools, we revisit the security of previous anonymous channels protocols, in particular constructions based on broadcast networks (Blaze et al. 2003), anonymous broadcast (Chaum 1981), and mix networks (Groth 2003, Nguyen et al. 2004). Our results give generic, optimal constructions to transform known protocols into new ones that achieve the strongest notions of anonymity.
Multi-channel MAC Protocols in Wireless Ad Hoc and Sensor Networks
Authors: Mingfei Wang, Linlin Ci, Ping Zhan, Yongjun Xu
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Multi-channel MAC protocols in wireless ad hoc and sensor networks allow a number of nodes in the same neighborhood to transmit in parallel on distinct channels without interfering with one another. The parallelism increases the throughput and can potentially reduce the delay. Free collision during the data transmission avoids the energy for packet retransmissions. Firstly, we described five important challenges for multi-channel MAC protocols. Secondly, we classified multi-channel MAC protocols in wireless ad hoc networks into four generalized categories and analyzed them respectively. Then, we showed the new challenges of multi-channel MAC protocols in wireless sensor networks and described several existing multi-channel MAC protocols. Finally, we pointed out the open research issues with regard to multi-channel MAC protocols in wireless networks.
Support vector machines, Decision Trees and Neural Networks for auditor selection
Authors: Efstathios Kirkos, Charalambos Spathis, Yannis Manolopoulos
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

The selection of a proper auditor is driven by several factors. Here, we use three data mining classification techniques to predict the auditor choice. The methods used are Decision Trees, Neural Networks and Support Vector Machines. The developed models are compared in term of their performances. The wrapper feature selection technique is used for the Decision Tree model. Two models reveal that the level of debt is a factor that influences the auditor choice decision. This study has implications for auditors, investors, company decision makers and researchers.
Non Expansive ε-Bisimulations
Authors: Simone Tini
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

&epsilon;-bisimulation equivalence has been proposed in the literature as a technique to study the concept of behavioral distance between probabilistic processes. In this paper we consider also two stronger equivalences: action &iquest;-bisimulation and global &iquest;-bisimulation. For each of these three equivalence notions we propose an SOS transition rule format ensuring the property of non-expansiveness. Non-expansiveness means that if the behavioral distance between s i and t i is &epsilon; i , then the behavioral distance between f(s 1,...,s n ) and f(t 1,...,t n ) is no more that &epsilon; 1 + ... + &epsilon; n . As expected, the stronger the &epsilon;-bisimulation considered, the (slightly) weaker the constraints of the transition rule format.
Transfer function representation approach of the LWR macroscopic traffic flow model based on the green function
Authors: Emil Nikolov
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In the present article we offer a method for the highway traffic flow modeling, based on the Green function as a transformation tool. This approach is suitable for distributed parameter systems in order to reformulate their partial differential equation description as sets of transfer functions. The model used in our work is the macroscopic continuous Lighthill-Whitham-Richards representation. The physical phenomena characteristic for the vehicular flow on a highway section are analyzed over some important length. This implies the description of the traffic as a distributed parameter plant. We present the Green function transformation's general case and after we apply it to the considered traffic flow model in order to obtain its transfer function form. The sets of expressions obtained can be specified using concrete fundamental diagrams and data, and also can be implemented in the design of control strategies.
Online Measurement of the Capacity of Multi-Tier Websites Using Hardware Performance Counters
Authors: Jia Rao, Cheng-Zhong Xu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Understanding server capacity is crucial for system capacity planning, configuration, and QoS-aware resource management. Conventional stress testing approaches measure the server capacity in terms of application-level performance metrics like response time and throughput. They are limited in measurement accuracy and timeliness. In a multitier website, resource bottleneck often shifts between tiers as client access pattern changes. This makes the capacity measurement even more challenging. This paper presents a measurement approach based on hardware performance counter metrics. The approach uses machine learning techniques to infer application-level performance at each tier. A coordinated predictor is induced over individual tier models to estimate system-wide performance and identify the bottleneck when the system becomes overloaded. Experimental results demonstrate that this approach is able to achieve an overload prediction accuracy of higher than 90% for a priori known input traffic patterns and over 85% accuracy even for traffic causing frequent bottleneck shifting. It costs less than 0.5% runtime overhead for data collection and no more than 50 ms for each on-line decision.
View generation for free viewpoint video system
Authors: Gangyi Jiang, Liangzhong Fan, Mei Yu, Feng Shao
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

View generation is one of the most time consuming parts at user side in free viewpoint video (FVV) system. A user side oriented framework of FVV system is presented, focus on the requirement and capability of user side. The calculation of disparity map, which is required at the user side, is moved to the server side, based on the fact that the user side is a terminal with constrained resource environment and block based disparity map can be easily obtained at the server side due to the usage of disparity compensation prediction at the MVC encoder. Based on the block based disparity map transmitted from server side, a fast pixel-wise disparity refinement scheme is designed to accelerate arbitrary view rendering by using the disparity consistency test. Experimental results show that compared with the conventional block-based matching method the new method speeds up view generation significantly and the quality of virtual view is improved greatly.
Fuzzy with lab VIEW software for reliability prediction at nuclear complex system (NCS)
Authors: Vasile Anghel
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

The reliability level for a nuclear installation is given in generally by the technological process quality of operation and maintenance and in particular by a lot of technical, technological, economic and human factors. The maintenance role is fundamental for a nuclear installation. In the maintenance activity as in any dynamic area, appear continuously new elements which, sometimes, require new methods of approach, thus for considered installation that is a Nuclear Detritiation Plant (NDP) existent as part of National Research and Development Institute for Cryogenics and Isotopic Technologies - ICSI, Rm.Valcea, for assurance the reliability level in operation is proposed for predictive maintenance the theory fuzzy, entropy theory and software LabVIEW. The final aim is to achieve the best practices for maintenance of Plant that process tritium.
Improved Approximation Algorithms for Budgeted Allocations
Authors: Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e - 1) approximation of Andelman and Mansour [1] and the e/(e - 1) - &epsilon; approximation (for &epsilon; &asymp; 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve this ratio to $\sqrt{2}$. We also show that the problem is APX-hard.
Social Perception and Steering for Online Avatars
Authors: Claudio Pedica, Hannes Vilhjálmsson
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

This paper presents work on a new platform for producing realistic group conversation dynamics in shared virtual environments. An avatar, representing users, should perceive the surrounding social environment just as humans would, and use the perceptual information for driving low level reactive behaviors. Unconscious reactions serve as evidence of life, and can also signal social availability and spatial awareness to others. These behaviors get lost when avatar locomotion requires explicit user control. For automating such behaviors we propose a steering layer in the avatars that manages a set of prioritized behaviors executed at different frequencies, which can be activated or deactivated and combined together. This approach gives us enough flexibility to model the group dynamics of social interactions as a set of social norms that activate relevant steering behaviors. A basic set of behaviors is described for conversations, some of which generate a social force field that makes the formation of conversation groups fluidly adapt to external and internal noise, through avatar repositioning and reorientations. The resulting social group behavior appears relatively robust, but perhaps more importantly, it starts to bring a new sense of relevance and continuity to the virtual bodies that often get separated from the ongoing conversation in the chat window.
A Probabilistic Relational Student Model for Virtual Laboratories
Authors: Julieta Noguez, L. Enrique Sucar, Enrique Espinosa
Venue: Proceedings of the 11th international conference on User Modeling (2007)

We have developed a novel student model based on probabilistic relational models (PRMs). This model combines the advantages of Bayesian networks and object-oriented systems. It facilitates knowledge acquisition and makes it easier to apply the model for different domains. The model is oriented towards virtual laboratories, in which a student interacts by doing experiments in a simulated or remote environment. It represents the students' knowledge at different levels of granularity, combining the performance and exploration behavior in several experiments, to decide the best way to guide the student in the next experiments. Based on this model, we have developed tutors for virtual laboratories in different domains. An evaluation of with a group of students, show a significant improvement in learning when a tutor based on the PRM model is incorporated to a virtual robotics lab.
Natural Landmark Detection for Visually-Guided Robot Navigation
Authors: Enric Celaya, Jose-Luis Albarral, Pablo Jiménez, Carme Torras
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

The main difficulty to attain fully autonomous robot navigation outdoors is the fast detection of reliable visual references, and their subsequent characterization as landmarks for immediate and unambiguous recognition. Aimed at speed, our strategy has been to track salient regions along image streams by just performing on-line pixel sampling. Persistent regions are considered good candidates for landmarks, which are then characterized by a set of subregions with given color and normalized shape. They are stored in a database for posterior recognition during the navigation process. Some experimental results showing landmark-based navigation of the legged robot Lauron III in an outdoor setting are provided.
MPC: A Unified Parallel Runtime for Clusters of NUMA Machines
Authors: Marc Pérache, Hervé Jourdren, Raymond Namyst
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Over the last decade, Message Passing Interface (MPI) has become a very successful parallel programming environment for distributed memory architectures such as clusters. However, the architecture of cluster node is currently evolving from small symmetric shared memory multiprocessors towards massively multicore, Non-Uniform Memory Access (NUMA) hardware. Although regular MPI implementations are using numerous optimizations to realize zero copy cache-oblivious data transfers within shared-memory nodes, they might prevent applications from achieving most of the hardware's performance simply because the scheduling of heavyweight processes is not flexible enough to dynamically fit the underlying hardware topology. This explains why several research efforts have investigated hybrid approaches mixing message passing between nodes and memory sharing inside nodes, such as MPI+OpenMP solutions [1,2]. However, these approaches require lots of programming efforts in order to adapt/rewrite existing MPI applications.In this paper, we present the MultiProcessor Communications environnement (MPC), which aims at providing programmers with an efficient runtime system for their existing MPI, POSIX Thread or hybrid MPI+Thread applications. The key idea is to use user-level threads instead of processes over multiprocessor cluster nodes to increase scheduling flexibility, to better control memory allocations and optimize scheduling of the communication flows with other nodes. Most existing MPI applications can run over MPC with no modification. We obtained substantial gains (up to 20%) by using MPC instead of a regular MPI runtime on several scientific applications.
Hierarchical Rules for a Hierarchical Classifier
Authors: Igor T. Podolak
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

A system of rule extraction out of a complex hierarchical classifier is proposed in this paper. There are several methods for rule extraction out of trained artificial neural networks (ANN's), but these methods do not scale well, i.e. results are satisfactory for small problems. For complicated problems hundreds of rules are produced, which are hard to govern.In this paper a hierarchical classifier with a tree-like structure and simple ANN's at nodes, is presented, which splits the original problem into several sub-problems that overlap. Node classifiers are all weak (i.e. with accuracy only better than random), and errors are corrected at lower levels. Single sub-problems constitute of examples that were hard to separate. Such architecture is able to classify better than single network models.At the same time if---then rules are extracted, which only answer which sub-problem a given example belongs to. Such rules, by introducing hierarchy, are simpler and easier to modify by hand, giving also a better insight into the original classifier behaviour. 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
Supervisory control of a multi-echelon supply chain: A modular Petri net approach for inter-organizational control
Authors: Julie Drzymalski, N. G. Odrey
Venue: Robotics and Computer-Integrated Manufacturing (2008)

Petri nets (PNs) are frequently utilized to model system dynamics due to their ability to handle concurrencies and sequential dependence. In this paper, a portion of the supply chain operations reference (SCOR) model has been extracted and modeled using PNs for the purpose of exerting supervisory control upon a multi-echelon supply chain (SC). The activities of source, make and deliver, inherent in the SCOR model form the basis of the representation of the PN model for each echelon considered in the SC model. Two control nets are utilized: one above the base model of each echelon to exert local constraints and an enterprise level supply chain manager (SCM). The local constraints are at the tactical and operational levels while the SCM enforces additional constraints consisting of long term planning goals at the strategic level. Place invariants are used to create the supervisors. Performance measures of the total SC are formulated to determine the effectiveness of any partnership. An efficient method for finding the current state of the system is developed which is used to determine the performance measures of each echelon. This paper presents a modular approach to the overall structure and PN modeling for a SC system. It is intended to extend the use of supervisory control from a shop-floor level to an inter-organizational facility and enterprise level.
Trilateralism, legitimacy and the Working Group on Internet Governance
Authors: Richard Collins
Venue: Information Polity (2007)

This discussion paper discusses the WSIS/WGIG processes and more specifically the outcomes of those processes. The two main outcomes of the WSIS/WGIG, the so-called 'Ch&acirc;teau de Bossey' document from the WGIG and the Tunis agenda for the information society, reflected the stalemate between proponents of the status quo and those who advocated bringing Internet governance (or at least control of the DNS) under the aegis of the ITU. The paper also discusses the 'trilateralism' of the WSIS/WGIG processes - the states, business and civil society. It was clear that the parties reflected differently on the outcomes of the WSIS/WGIG process.
OMNeT++ models for resource allocation in wireless networks
Authors: Doru Todinca, Dan Pescaru, Mihaela Viţălariu
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Nowadays Wireless Networks have an important impact in many activity domains. Due to the hardware and bandwidth limitations of these networks, resource allocation represents an important issue, being in the same time a very active research area. Considering the complexity of the wireless networks, analytical solutions are hard to be found. Hence, simulation becomes the most used methodology and OM--NeT++ proves to be a very useful tool for investigation. This paper presents our work concerning the performance of different resource allocation techniques for EGPRS and Wireless Sensor Networks.
A Task Scheduling Procedure in Multimachines System for Special Type of Processing Time Function
Authors: Zbigniew Buchalski
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper presents results of research on the problem of time-optimal tasks scheduling and resources allocation in multimachines system. We consider an multimachines system consisting of m parallel machines. This system can execute in independent tasks. The purpose of optimization is to find such a schedule of tasks on parallel machines and such an allocation of limited resources among machines that schedule length criterion is minimized. Because our problem belongs to the class of NP-complete problems we propose an heuristic algorithm, which employs some problem properties. Some results of executed computational experiments for basis of proposed heuristic algorithm and comparative analysis of heuristic algorithm and algorithm LPT are presented.