ppxscal/embedding_network huggingface dataset:
The collapsing method of defuzzification for discretised interval type-2 fuzzy sets
Authors: Sarah Greenfield, Francisco Chiclana, Simon Coupland, Robert John
Venue: Information Sciences: an International Journal (2009)

This paper proposes a new approach for defuzzification of interval type-2 fuzzy sets. The collapsing method converts an interval type-2 fuzzy set into a type-1 representative embedded set (RES), whose defuzzified values closely approximates that of the type-2 set. As a type-1 set, the RES can then be defuzzified straightforwardly. The novel representative embedded set approximation (RESA), to which the method is inextricably linked, is expounded, stated and proved within this paper. It is presented in two forms: Simple RESA: this approximation deals with the most simple interval FOU, in which a vertical slice is discretised into 2 points. Interval RESA: this approximation concerns the case in which a vertical slice is discretised into 2 or more points. The collapsing method (simple RESA version) was tested for accuracy and speed, with excellent results on both criteria. The collapsing method proved more accurate than the Karnik-Mendel iterative procedure (KMIP) for an asymmetric test set. For both a symmetric and an asymmetric test set, the collapsing method outperformed the KMIP in relation to speed.
Testing-based Process for Evaluating Component Replaceability
Authors: Andres Flores, Macario Polo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Replacing pieces of component-based systems carries a serious risk on the expected stability. Substitutability of components must then be carefully identified. With this intent, this paper presents a process to evaluate replacement components by complementing the conventional compatibility analysis with component testing criteria. Functions of data transformation encapsulated by components (i.e. their behaviour) are analysed according to the Observability testing metric. For a component under substitution, a Component Behaviour Test Suite is built to be later applied on candidate replacement components. This approach is also known as Back-to-Back testing. The whole process is currently supported through the tool testooj, which is focused on testing Java components.
Migrativity of aggregation functions
Authors: H. Bustince, J. Montero, R. Mesiar
Venue: Fuzzy Sets and Systems (2009)

In this paper we introduce a slight modification of the definition of migrativity for aggregation functions that allows useful characterization of this property. Among other things, in this context we prove that there are no t-conorms, uninorms or nullnorms that satisfy migrativity (with the product being the only migrative t-norm, as already shown by other authors) and that the only migrative idempotent aggregation function is the geometric mean. The k-Lipschitz migrative aggregation functions are also characterized and the product is shown to be the only 1-Lipschitz migrative aggregation function. Similarly, it is the only associative migrative aggregation function possessing a neutral element. Finally, the associativity and bisymmetry of migrative aggregation functions are discussed.
Adaptive and intelligent path discovery on-demand for wireless networks using service composition
Authors: Cheng-Liang Lin, Ting-Wei Hou, Tzu-Chiang Chiang, Cheng-Feng Tai
Venue: Expert Systems with Applications: An International Journal (2009)

Route setup and discovery require low communication overhead in portable computing and wireless environments. We propose an adaptive and intelligent route discovery on-demand approach that introduces a service composition concept. Since service composition along a network is like a path in a multicast tree, path discovery can be regarded as service composition. Hence, a route-composition is proposed to combine existing services (paths) into candidate complex services (paths) called on-demand route compositions. The proposed route setup mechanism has the following characteristics: (1) on-demand route setup to avoid periodical multicast overhead for member discovery; (2) a directed service graph to represent a transparent route-composition; (3) candidate routes are found adaptively and intelligently; (4) the best route among candidate routes is determined by the max-flow and min-cut algorithm. The simulation shows that for a newly joining multicast receiver, the proposed method can avoid periodical multicast-related control overhead for member discovery, and improve the throughput for multicast communication from 29% to 74% as compared with the nearest neighbor algorithm.
Power Electronic Circuits Design: A Particle Swarm Optimization Approach
Authors: Jun Zhang, Yuan Shi, Zhi-Hui Zhan
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The development of power electronics results in a growing need for automatic design and optimization for power electronic circuits (PECs). This paper presents a particle swarm optimization (PSO) approach for the PECs design. The optimization problem is divided into two processes using a decoupled technique and PSO is employed to optimize the values of the circuit components in the power conversion stage (PCS) and the feedback network (FN), respectively. A simple mutation operator is also incorporated into PSO to enhance the population diversity. The algorithm is applied to the optimization of a buck regulator for meeting requirements under large-signal changes and at steady state. Compared with genetic algorithm (GA), PSO can yield more optimized values of circuit components with lower computational effort.
An efficient time series data mining technique
Authors: Hatim A. Aboalsamh, Alaaeldin M. Hafez, Ghazy M. R. Assassa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Data Mining is the process of discovering potentially valuable patterns, associations, trends, sequences and dependencies in data. Data mining techniques can discover information that many traditional business analysis and statistical techniques fail to deliver. In our study, we emphasis on the use of data mining techniques on time series, where mining techniques and tools are used in an attempt to recognize, anticipate and learn the time series behavior with different directly related or looked unrelated factors. Targeted data are sequences of observations collected over intervals of time. Each sequence describes a phenomenon or a factor. Such factors could have either a direct or indirect impact on the time series under study. Examples of factors with direct impact include the yearly budgets and expenditures, taxations, local stocks prices, unemployment rates, inflation rates, fallen angels, and rising odds for upgrades. Indirect factors could include any phenomena in the local or global environments, such as, global stocks prices, education expenditures, weather conditions, employment strategies, and medical services. Analysis on data includes discovering trends (or patterns) and association between sequences in order to generate non-trivial knowledge. In this paper, we propose a data mining technique to predict the dependency between factors that affect performance. The proposed technique consists of three phases: (a) for each data sequence that represents a chosen phenomenon, generate its trend sequences, (b) discover maximal frequent trend patterns, generate pattern vectors (to keep information of frequent trend patterns), use trend pattern vectors to predict future factor sequences.
Harmonix "Rockband"
Authors: Pete Candeland
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Created by Harmonix, the leading developer of music-based games, Rock Band is a new platform for music fans and gamers to interact with music like never before. It challenges players to master the lead and bass guitar, drums, and vocals as solo artists or cooperatively as part of their own bands. Passion Pictures worked on the Rock Band cinematic with Ryan Lesser, Art Director, and one of the original game developers at Harmonix. See www.rockband.com to view the cinematic and learn more about Rock Band.
Capabilities of the bubble technology
Authors: Hsu Chang
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This paper aims at a technology forecast for magnetic bubbles. The approach is not to extrapolate the past rate of progress into the future, but to examine the rich varieties of current studies so as to bring attention to what can be evolved to enhance the basic capabilities of the bubble technology.
Effects of communication style and culture on ability to accept recommendations from robots
Authors: P.L. Patrick Rau, Ye Li, Dingjun Li
Venue: Computers in Human Behavior (2009)

The objective of this paper is to investigate the effects of communication styles and culture on people's accepting recommendations from robots. The goal was to provide insight for culturally adaptive robot design. The independent variables were communication style (i.e. implicit or explicit), the participants' cultural background (i.e. Chinese or German), and the robot's language (i.e. native language and English for Chinese and German subjects). A laboratory experiment was conducted with 16 Chinese and 16 German college students. Basic descriptive statistics and t-test are used for biographical information analysis; reliability test is used for questionnaire; MANOVA and non-parametric test are used for testing the hypotheses. The results showed that the Chinese participants preferred an implicit communication style than German participants. Chinese participants evaluated the robots as being more likable, trustworthy, and credible, and were more likely to accept the implicit recommendations. The German participants evaluated the robots as being less likable, trustworthy, and credible, and were less inclined to accept implicit recommendations.
Vehicular monitoring for arbitrary routes in the city
Authors: Emmanuel Gomez-Nuñez, Miguel Angel Garcia-Gomez, Mario Reyes-Ayala, Edgar Alejandro Andrade-Gonzalez, Jose Alfredo Tirado-Mendez
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper, the design and implementation of a vehicular monitoring is presented. The Global Positioning System (GPS) is used to obtain the real time position of a prototype mounted in a vehicles set. The system carried out receives a RF carrier per mobile and it shows the vehicles position in a station base, where the paths are supervised. The system can be employed to identify problems in the operation of the vehicle system and, to optimize its resources.
On line mode incremental Hough transform implementation on Xilinx Fpga's
Authors: H. Bessalah, S. Seddiki, F. Alim, M. Bencherif
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Knowing that, the computing process of the Incremental Hough Transform (IHT) is characterized by a purely sequential structure, and from the fact, the on line mode arithmetic is more suitable for the computation of this kind of operations. We propose in this paper, a new Incremental Hough Transform algorithm and a suitable architecture implemented on a Xilinx FPGA circuit. In this study, we will show how on line arithmetic is used to implement a pipelined architecture of the Incremental Hough Transform and we will demonstrate that it might be used successfully for real time applications.
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Authors: Yung Yi, Junshan Zhang, Mung Chiang
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity. However, by and large it remains open to quantify the impact of message passing complexity on throughput and delay. In this paper, we study the effective throughput and delay performance in wireless scheduling by explicitly considering complexity through a vacation model, where signaling complexity is treated as "vacations" and data transmissions as "services," with a focus on delay analysis in heavy traffic regimes. We analyze delay performance in two regimes of vacation models, depending on the relative lengths of data transmission and vacation periods. State space collapse properties proved here enable a significant dimensionality reduction in the challenging problem of delay characterization. We then explore engineering implications and quantify intuitions based on the heavy traffic analysis.
Design of dual-band frequency selective surfaces with gridded-square elements
Authors: X. F. Luo, C. K. Lee
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Two examples are demonstrated to design a narrow dual-band Frequency Selective Surfaces with gridded-square elements respectively. The equivalent circuit model combined with optimization algorithm, differential evolution strategy is employed. The simulation results are in good agreement with the measurement results. The good results are obtained in very short computational time and trial-and-error process is avoided.
A middleware-based application framework for active space applications
Authors: Manuel Román, Roy H. Campbell
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

Ubiquitous computing challenges the conventional notion of a user logged into a personal computing device, whether it is a desktop, a laptop, or a digital assistant. When the physical environment of a user contains hundreds of networked computer devices each of which may be used to support one or more user applications, the notion of personal computing becomes inadequate. Further, when a group of users share such a physical environment, new forms of sharing, cooperation and collaboration are possible and mobile users may constantly change the computers with which they interact; we refer to these digitally augmented physical spaces as Active Spaces. We present in this paper an application framework that provides mechanisms to construct, run or adapt existing applications to ubiquitous computing environments. The framework binds applications to users, uses multiple devices simultaneously, and exploits resource management within the users' environment that reacts to context and mobility. Our research contributes to application mobility, partitioning and adaptation within device rich environments, and uses context-awareness to focus the resources of ubiquitous computing environments on the needs of users.
OMA DM Based Remote RF Signal Monitoring of Mobile Devices for QoS Improvement
Authors: Joon-Myung Kang, Hong-Taek Ju, Mi-Jung Choi, James Won-Ki Hong
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

As mobile devices and functionalities have increased and become intelligent, many related problems have occurred. Especially, the degraded quality of service caused by the shadow area has given the end-users much inconvenience. In addition, the credibility of the service providers, the network operators, and the manufacturers of the mobile devices have also decreased. In order to solve these problems, we need to monitor the radio frequency (RF) signal related information such as the received signal strength (RSS) for finding the shadow areas. So far, no appropriate method has been given. In this paper, we propose a RF signal monitoring method for the quality of service (QoS) improvement based on the Open Mobile Alliance (OMA) Device Management (DM) standard. We have defined the management objects (MOs) for finding the shadow areas and design the management operations for collecting the MOs at the central server. We have developed based on MOs and the management operations. We also present the result of the performance evaluation of our proposed management operations.
Optimal conclusive sets for comparator networks
Authors: Guy Even, Tamir Levi, Ami Litman
Venue: Theoretical Computer Science (2009)

A set of input vectors S is conclusive for a certain functionality if, for every comparator network, correct functionality for all input vectors is implied by correct functionality for all vectors in S. We consider four functionalities of comparator networks: sorting, merging, sorting of bitonic vectors, and halving. For each of these functionalities, we present two conclusive sets of minimal cardinality. The members of the first set are restricted to be binary, while the members of the second set are unrestricted. For all the above functionalities, except halving, the unrestricted conclusive set is much smaller than the binary one.
Topical web crawling using weighted anchor text and web page change detection techniques
Authors: Divakar Yadav, A. K. Sharma, J. P. Gupta
Venue: WSEAS Transactions on Information Science and Applications (2009)

In this paper, we discuss about the focused web crawler and relevance of anchor text as well as method for web page change detection for search engine. We have proposed a technique called weighted anchor text which uses the link structure to form the weighted directed graph of anchor texts. These weights are further used for deciding the relevance of the web pages as the indexing of these pages is done in the decreasing order of weights assigned to them. Weights are assigned for every incoming link for a node of the directed graph. We applied our algorithm on various websites and observed the results. We deduce that the algorithm can be very useful when incorporated with other existing algorithms. As Web usage has increased exponentially in the past few years. This collection of enormous web pages is highly changing and web pages show a rapid change, the degree of which varies from site to site. We discuss the relevance of change detection and then move on to explore the related work in the area. Based on this understanding we propose a new algorithm to map changes in a web page. After verifying results on various web pages we observe the relative merits of the proposed algorithm.
Data base: an emerging organizational function
Authors: Richard L. Nolan
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

A vignette of increasing frequency is for a manager with a problem to arrive in the EDP manager's office and ask for information required to solve his problem. The information required almost always cuts across computer applications and files of several functional areas. In the majority of the installations, the EDP manager is forced to flatly turn down the manager's request. He either cannot respond because the needed data is hopelessly locked up in existing poorly documented computer files, or because responding would throw the normal computer processing into upheaval.
Research on Urban Public Traffic Satisfaction Evaluation Model Based on BP Neural Network Algorithm
Authors: Shaomei Yang, Lin Jia
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Urban public traffic is an important basic infrastructure related to the nation’s economy and the people’s livelihood, which is social cause of public good closely linked people's production and life. In order to evaluate the urban public traffic satisfaction scientifically, based on the analysis of the urban public traffic present and problems, this paper establishes a satisfaction evaluation index system and describes the evaluation mechanism based on BP neural network. The satisfaction evaluation of 12 cities in Hebei shows that the results given by this model are reliable, and this method to evaluate urban public traffic satisfaction is feasible.
Conditional Lyapunov Exponent Depending on Spectrum of Input Noise in Common-Noise-Induced Synchronization
Authors: Shin-itiro Goto, Kazuyuki Yoshimura, Peter Davis
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We study the synchronization of dynamical systems induced by common additional external colored noise. In particular, we consider the special case that the external input noise is generated by a linear second-order differential equation forced by Gaussian white noise. So the frequency spectrum of this noise is not constant. In the case that noise-free dynamics is chaotic, we find examples where the synchronization is enhanced when the peak of the input noise is close to the peak of the noise-free dynamics in frequency space. In the case that noise-free dynamics is non-chaotic, we do not observe this phenomenon.
Data mining for adaptive learning sequence in English language instruction
Authors: Ya-huei Wang, Ming-Hseng Tseng, Hung-Chang Liao
Venue: Expert Systems with Applications: An International Journal (2009)

The purpose of this paper is to propose an adaptive system analysis for optimizing learning sequences. The analysis employs a decision tree algorithm, based on students' profiles, to discover the most adaptive learning sequences for a particular teaching content. The profiles were created on the basis of pretesting and posttesting, and from a set of five student characteristics: gender, personality type, cognitive style, learning style, and the students' grades from the previous semester. This paper address the problem of adhering to a fixed learning sequence in the traditional method of teaching English, and recommend a rule for setting up an optimal learning sequence for facilitating students' learning processes and for maximizing their learning outcome. By using the technique proposed in this paper, teachers will be able both to lower the cost of teaching and to achieve an optimally adaptive learning sequence for students. The results show that the power of the adaptive learning sequence lies in the way it takes into account students' personal characteristics and performance; for this reason, it constitutes an important innovation in the field of Teaching English as a Second Language (TESL).
Binary Particle Swarm Optimization Based Algorithm for Feature Subset Selection
Authors: Basabi Chakraborty
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

The feature subset selection can be considered as a global combinatorial optimization problem in which the optimum subset of features is selected from a large set of features. Lots of techniques have developed so far, still research is going on to find better solution in terms of optimality and computational ease. In this work an algorithm based on binary particle swarm optimization (bPSO) is proposed for feature subset selection. From simple simulation experiments it has been found that bPSO based algorithm performs well and computationally less demanding than genetic algorithm, another population based evolutionary search technique.
Evolutionary design of secrecy amplification protocols for wireless sensor networks
Authors: Petr Švenda, Lukáš Sekanina, Václav Matyáš
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

We propose a new method for automatic generation of secrecy amplification protocols for wireless sensor networks, utilizing evolutionary algorithms. We were able to rediscover all published protocols for secrecy amplification we are aware of, and found a new protocol that outperforms the existing ones. An alternative construction of secrecy amplification protocols with a comparable fraction of secure links to that of the original "node-oriented" approach was also designed. This new construction exhibits only linear (instead of exponential) increase of necessary messages when the number of communication neighbours grows. This efficient protocol can significantly reduce the sensor battery power consumption because of the decreased message transmission rate. We used a combination of linear genetic programming and a network simulator in this work.