ppxscal/embedding_network huggingface dataset:
Performance enhancement for neural fuzzy systems using asymmetric membership functions
Authors: Ching-Hung Lee, Hung-Yi Pan
Venue: Fuzzy Sets and Systems (2009)

This paper proposes a method to enhance the performance of interval-valued neural fuzzy systems using asymmetric membership functions (called IVNFS-As). Each asymmetric interval-valued membership function is constructed from parts of four Gaussian functions. The proposed IVNFS-As can capture the essence of nonlinearities in dynamic systems. In addition, the Lyapunov theorem is used to demonstrate the convergence of IVNFS-As, and the corresponding learning algorithm is derived using the gradient method. The asymmetric interval-valued membership functions improve the approximation accuracy of simulation results and reduce the computational complexity. The effectiveness of our approach is demonstrated by results obtained for nonlinear system identification, adaptive control, and chaotic-time-series prediction.
Speech as a man-computer communication channel
Authors: Rein Turn
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Many computer applications require continuous interaction between men and computers. Typically, men communicate to computers data and programs, requests for processing and information retrieval, and other information required for the performance of computer-aided tasks. In turn, computers communicate to men the results of processing operations, the requested information, and any other messages they are programmed to produce.
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Authors: Weida Xu, Tianyuan Xiao
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of assembly line balancing problem with mixed models, fuzzy operation times and drifting operations, which has the objective of minimizing the total work overload time. According to chance constrained programming, a fuzzy &alpha; total work overload time minimization model is built. Moreover, fuzzy simulation and genetic algorithm are integrated to design a hybrid intelligent algorithm to solve the above model. Finally, Extensive computational results are reported to demonstrate the efficiency and effectiveness of the algorithm.
Wheelchair Driving Control with Passenger's Posture Behavior Suppression and Evaluation of Comfort of Ride by Emotional Sweating
Authors: Daisuke Yamagami, Yuta Sato, Yoshiyuki Noda, Takanori Miyoshi, Kazuhiko Terashima
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper presents an advanced control system for a driving control system of an electrical wheelchair. The aim of the control system is to make possible a comfortable ride in the wheelchair. For this, a passenger model that uses a backrest in the wheelchair has been constructed and a driving pattern that suppresses a passenger’s posture behavior has been developed using optimization methods. Then, the quality of the ride while a passenger drives the wheelchair has been evaluated by a questionnaire and by measurements of emotional sweating. In comparison with the conventional driving pattern, the proposed driving pattern suppresses about half of the passenger’s previous posture behavior and improves the comfort of wheelchair driving.
Applying computer simulation to increase the surgical center occupation rate at a university hospital in Curitiba - Brazil
Authors: Roberto Max Protil, Joelson Ricardo Stroparo, Gerson Linck Bichinho
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The purpose of this document is to discuss the use of computer simulation for increasing the surgical center occupation rate at a University Hospital located in Curitiba, Brazil. For the attainment of this work three scenarios were created. The first scenario has six surgical rooms. It was possible to improve the orthopedic surgical occupation rate specially through changing some input variables. The two following scenarios demonstrated the impact of adding more room capacity. The second scenario uses input data from the real system, making it possible to obtain a better occupation rate. The third scenario showed an increase in occupancy using the input data. These results provided help for the reduction of idleness in this sector.
Ethological data mining: an automata-based approach to extract behavioral units and rules
Authors: Yasuki Kakishita, Kazutoshi Sasahara, Tetsuro Nishino, Miki Takahasi, Kazuo Okanoya
Venue: Data Mining and Knowledge Discovery (2009)

We propose an efficient automata-based approach to extract behavioral units and rules from continuous sequential data of animal behavior. By introducing novel extensions, we integrate two elemental methods--the N-gram model and Angluin's machine learning algorithm into an ethological data mining framework. This allows us to obtain the minimized automaton-representation of behavioral rules that accept (or generate) the smallest set of possible behavioral patterns from sequential data of animal behavior. With this method, we demonstrate how the ethological data mining works using real birdsong data; we use the Bengalese finch song and perform experimental evaluations of this method using artificial birdsong data generated by a computer program. These results suggest that our ethological data mining works effectively even for noisy behavioral data by appropriately setting the parameters that we introduce. In addition, we demonstrate a case study using the Bengalese finch song, showing that our method successfully grasps the core structure of the singing behavior such as loops and branches.
A robot that learns in stages utilizing scaffolds: toward an active and long-term human-robot interaction
Authors: Tanaka Kazuaki, Oka Natsuki
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In recent years, robots began to appear in our daily lives. However, people get bored with them after a short time. We therefore consider that robots that contact with people must have an ability to learn new actions, so that people enjoy the interaction for a long time. However, it is difficult for them to learn complex actions like games through human-robot interaction. If humans learn through human-human interaction, it is known that scaffolding is effective. Scaffolding is a method of promoting learning by gradually giving difficult learning tasks according to the ability of learners. If robots learn through human-robot interaction, it is possible that scaffolding also supports their learning. However, it has not clarified that scaffolding occurs actually through interactions with ordinary people in everyday situations. In this experiment, we clarify this problem, and propose the method of utilizing the scaffold given by ordinary people in everyday situations for robots that contact with people.
Flexible Deterministic Packet Marking: An IP Traceback System to Find the Real Source of Attacks
Authors: Yang Xiang, Wanlei Zhou, Minyi Guo
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

IP traceback is the enabling technology to control Internet crime. In this paper we present a novel and practical IP traceback system called Flexible Deterministic Packet Marking (FDPM) which provides a defense system with the ability to find out the real sources of attacking packets that traverse through the network. While a number of other traceback schemes exist, FDPM provides innovative features to trace the source of IP packets and can obtain better tracing capability than others. In particular, FDPM adopts a flexible mark length strategy to make it compatible to different network environments; it also adaptively changes its marking rate according to the load of the participating router by a flexible flow-based marking scheme. Evaluations on both simulation and real system implementation demonstrate that FDPM requires a moderately small number of packets to complete the traceback process; add little additional load to routers and can trace a large number of sources in one traceback process with low false positive rates. The built-in overload prevention mechanism makes this system capable of achieving a satisfactory traceback result even when the router is heavily loaded. It has been used to not only trace DDoS attacking packets but also enhance filtering attacking traffic.
Performance Modeling and Analysis of a Massively Parallel Direct - Part 1
Authors: Jian He, Alex Verstak, L.T. Watson, M. Sosonkina
Venue: International Journal of High Performance Computing Applications (2009)

Modeling and analysis techniques are used to investigate the performance of a massively parallel version of DIRECT, a global search algorithm widely used in multidisciplinary design optimization applications. Several high-dimensional benchmark functions and real world problems are used to test the design effectiveness under various problem structures. Theoretical and experimental results are compared for two parallel clusters with different system scales and network connectivities. The present work aims at studying the performance sensitivity to important parameters for problem configurations, parallel schemes, and system settings. The performance metrics include the memory usage, load balancing, parallel efficiency, and scalability. An analytical bounding model is constructed to measure the load balancing performance under different schemes. Additionally, linear regression models are used to characterize two major overhead sources, interprocessor communication and processor idleness, and also applied to the isoefficiency functions in scalability analysis. For a variety of high-dimensional problems and large-scale systems, the massively parallel design has achieved reasonable performance. The results of the performance study provide guidance for efficient problem and scheme configuration. More importantly, the generalized design considerations and analysis techniques are beneficial for transforming many global search algorithms into effective large-scale parallel optimization tools.
Capturing and sharing memories in a virtual world
Authors: Carman Neustaedter, Elena Fedorovskaya
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Virtual worlds (VWs) such as Second Life® (SL) contain a rich social culture where people engage in a multitude of experiences much like real life. With this comes the need to capture and share memories with others. To understand what tools people use to accomplish this and what limitations they may face, we conducted interviews with participants in SL. Our results identify two clusters of users - Casuals and Lifers - who differed in the ways in which they captured and shared memories. Here we describe the use of photos, landmarks, friend lists, and conversation logs. We also show how a lack of real life physical and social constraints in the VW affects user routines, and, in some cases, how it does not. This suggests design directions for memory tools in the VW and also real life that break the bounds of current everyday practice.
SKOS for an integrated vocabulary structure
Authors: Marcia L. Zeng, Wei Fan, Xia Lin
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

In order to transfer the Chinese Classified Thesaurus (CCT) into a machine-processable format and provide CCT-based Web services, a pilot study has been conducted in which a variety of selected CCT classes and mapped thesaurus entries are encoded with SKOS. OWL and RDFS are also used to encode the same contents for the purposes of feasibility and cost-benefit comparison.
Disk Striping and Block Replication Algorithms For Video File Servers
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In multimedia systems, compressed video files are stored digitally on disks within a video server. Object placement and object replication on disks influence the cost, the availability, and the throughput of a video server. The choice of algorithm, along with the workload, determines the number of disks needed to support a given number of users. There is a need to duplex video objects in order to provide reliable access in the event of disk failures. Duplexing also provides an opportunity to optimize I/O and improve throughput by providing two potential sources for each block. The Individual Permutation Algorithm uses a different permutation of the disks for each movie. This paper studies the performance impact of different means of selecting permutations. The value of dynamic load balancing afforded by duplex is also studied. Part of the motivation of this study was to better understand the wide striping of the IBM Tiger Shark video server. Simulations show that the choice of algorithm leads to maximum practical device utilizations from 63 to 95 percent, resulting in significant differences in system cost. 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
Token History Petri Nets
Authors: Kees van Hee, Alexander Serebrenik, Natalia Sidorova
Venue: Fundamenta Informaticae (2008)

State of the art information system commonly record events in log files, also known as audit trails. Moreover, business processes often go beyond the sole recording the events and base decisions on the events observed in the past. To model such processes we extend the basic Petri net framework with the notion of history by associating tokens with histories, adding guards evaluated on the history to the transitions and mapping arcs to expressions involving histories. Guards and arc expressions can involve data associated with the transitions.
Difference Histograms: A new tool for time series analysis applied to bearing fault diagnosis
Authors: Barend J. van Wyk, Michaël A. van Wyk, Guoyuan Qi
Venue: Pattern Recognition Letters (2009)

A powerful tool for bearing time series feature extraction and classification is introduced that is computationally inexpensive, easy to implement and suitable for real-time applications. In this paper the proposed technique is applied to two rolling element bearing time series classification problems and shown that in some cases no data pre-processing, artificial neural network or nearest neighbour approaches are required. From the results obtained it is clear that for the specific applications considered, the proposed method performed as well as or better than alternative approaches based on conventional feature extraction.
Critical Requirements Engineering Issues and their Solution
Authors: Humaira Naz, Muhammad Nadeem Khokhar
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The guidelines for Requirements Management have been documented many times formally but the actual problems faced by the software industry are quite different. Through research it is found that most of the software projects fail before they are completed or if they do reach completion their quality is not up to the mark. The aim of this Research study is to identify the loopholes in the requirements gathering practices and how they are affecting the entire SDLC including and final product. I have also tried to find solutions to these issues on basis of international research. The goal is towards making the requirements gathering practices effective by replacing these issues with respective solutions.
Frame Length Control for Wireless LANs in Fast Mobile Environments
Authors: Ryoichi Shinkuma, Takayuki Yamada, Tatsuro Takahashi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a novel solution to improving wireless channel quality of wireless local area networks (WLANs) in fast-mobile environments, which uses a media-access-control (MAC) layer approach: adaptive frame-length control and block acknowledgement (ACK). In fast-mobile environments, using short frame lengths can suppress channel estimation error and decrease frame errors. However, it increases the MAC overhead, resulting in decreased throughput. To solve this tradeoff, we combined block ACK, which is specified in IEEE802.11e as an optional function, with adaptive frame-length control. Although adaptive frame-length control considering this tradeoff has previously been investigated, the targets were different from WLANs using orthogonal frequency division multiplexing (OFDM) in fast-mobile environments. The MAC-overhead reduction using block ACK is suitable for our frame-length control because it does not change the frame format in the physical layer. Also, it is a new idea to use block ACK as a solution to improving channel quality in fast-mobile environments. In this paper, we evaluate our method through computer simulations and verify the effectiveness of adaptive frame-length control that can accommodate relative speeds.
Passive Online Detection of 802.11 Traffic Using Sequential Hypothesis Testing with TCP ACK-Pairs
Authors: Wei Wei, Kyoungwon Suh, Bing Wang, Yu Gu, James Kurose, Don Towsley, Sharad Jaiswal
Venue: IEEE Transactions on Mobile Computing (2009)

In this paper, we propose two online algorithms to detect 802.11 traffic from packet-header data collected passively at a monitoring point. These algorithms have a number of applications in \emph{realtime} wireless LAN management, for instance, in detecting unauthorized access points and detecting/predicting performance degradations. Both algorithms use sequential hypothesis tests, and exploit fundamental properties of the 802.11 CSMA/CA MAC protocol and the half duplex nature of wireless channels. They differ in that one requires training sets, while the other does not. We have built a system for online wireless-traffic detection using these algorithms and deployed it at a university gateway router. Extensive experiments have demonstrated the effectiveness of our approach: the algorithm that requires training provides rapid detection and is extremely accurate (the detection is mostly within 10 seconds, with very low false positive and false negative ratios); the algorithm that does not require training detects $60\%$-$76\%$ of the wireless hosts without any false positives; both algorithms are light-weight, with computation and storage overhead well within the capability of commodity equipment.
Adaptive information search: age-dependent interactions between cognitive profiles and strategies
Authors: Jessie Chin, Wai-Tat Fu, Thomas Kannampallil
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Previous research has shown that older adults performed worse in web search tasks, and attributed poorer performance to a decline in their cognitive abilities. We conducted a study involving younger and older adults to compare their web search behavior and performance in ill-defined and well-defined information tasks using a health information website. In ill-defined tasks, only a general description about information needs was given, while in well-defined tasks, information needs as well as the specific target information were given. We found that older adults performed worse than younger adults in well-defined tasks, but the reverse was true in ill-defined tasks. Older adults compensated for their lower cognitive abilities by adopting a top-down knowledge-driven strategy to achieve the same level of performance in the ill-defined tasks. Indeed, path models showed that cognitive abilities, health literacy, and knowledge influenced search strategies adopted by older and younger adults. Design implications are also discussed.
C-5 isochronal inspection process modeling
Authors: Alan W. Johnson, Charles Glasscock, Adam Little, Matthew Muha, David O'Malley, Michael Bennett
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

United States Air Mobility Command (AMC) has a limited number of C-5 aircraft, and so opportunities to either preserve or increase aircraft availability are of interest to them. In an attempt to reduce inspection costs and promote inspection scheduling predictability, the Air Force is reducing the number of C-5 Isochronal inspection (ISO) sites from five to three. C-5 ISOs require at least two weeks and involve an exhaustive inspection of the entire aircraft. AMC headquarters staff asked us to model the new ISO process to help them understand how the reduced number of ISO locations will affect inspection timeliness. We used the problem as the class project for a graduate discrete event simulation course at the Air Force Institute of Technology. We review our process and results, and present some insights on conducting simulation research as a class assignment.
Mobility models based on correlated random walks
Authors: Pablo Navarrete Michelini, Edward J. Coyle
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

We provide an overview of models of vehicular motion that are based on continuous-time Markov chains. Of these models, we concentrate on the subset represented by correlated random walks because they are general enough to capture essential patterns of the mobility of vehicles and simple enough to allow the analytical study of special but still realistic cases. We review the analytical techniques available to obtain stochastic properties of correlated random walks in simple configurations and introduce the general problem of computing statistics of absorbing times. The numerical problem reduces to the solution of sparse linear systems for which we configure and evaluate an algebraic multi-grid technique. We apply the numerical method in a simple 2D example of a correlated random walk that models the mobility of vehicles on a grid of city streets. We consider different configurations of absorbing states and obtain approximations of the expected value of absorbing times for arbitrary initial conditions. The approach works directly with the analytic expression for expected values and thus does not rely on ergodic assumptions.
Datalog&plusmn;: a unified approach to ontologies and integrity constraints
Authors: Andrea Calì, Georg Gottlob, Thomas Lukasiewicz
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

We report on a recently introduced family of expressive extensions of Datalog, called Datalog&plusmn;, which is a new framework for representing ontological axioms in form of integrity constraints, and for query answering under such constraints. Datalog&plusmn; is derived from Datalog by allowing existentially quantified variables in rule heads, and by enforcing suitable properties in rule bodies, to ensure decidable and efficient query answering. We first present different languages in the Datalog&plusmn; family, providing tight complexity bounds for all cases but one (where we have a low complexity AC0 upper bound). We then show that such languages are general enough to capture the most common tractable ontology languages. In particular, we show that the DL-Lite family of description logics and F-Logic Lite are expressible in Datalog&plusmn;. We finally show how stratified negation can be added to Datalog&plusmn; while keeping ontology querying tractable in the data complexity. Datalog&plusmn; is a natural and very general framework that can be successfully employed in different contexts such as data integration and exchange. This survey mainly summarizes two recent papers.