ppxscal/embedding_network huggingface dataset:
A New Approach to Creating Multisegment Fuzzy Systems
Authors: Artur Starczewski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Presented paper shows a new approach to creating a fuzzy system based on an exclusive use of clustering algorithms, which determine the value of necessary parameters. The applied multisegment fuzzy system functions as a classifier. Each segment makes an independent fuzzy system with a defined knowledge base and uses singleton fuzzification, as well as fuzzy inference with product operation as the Cartesian product and well-matched membership functions. Defuzzification method is not used. Only the rule-firing level must be analysed and its value suffices to determine the class. The use of clustering algorithms has allowed a qualification of the number of rules in the base of fuzzy rules for each independent segment, as well as a specification of the centers of fuzzy sets used in the given rules. The calculated parameters have proved precise, so that no additional methods have been applied to correct their values. This procedure greatly simplifies the creation of a fuzzy system. The constructed fuzzy system has been tested on medical data that come from the Internet. In the future, those systems may help doctors with their everyday work. 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
Minding the gap: R D in the Linux kernel
Authors: Muli Ben-Yehuda, Eric Van Hensbergen, Marc Fiuczynski
Venue: ACM SIGOPS Operating Systems Review (2008)

The Linux kernel, since its inception in 1991, has captured the interest of many thousands of developers and millions of users. It recently celebrated its 16th anniversary, includes many millions of lines of code, and is used in production systems around the world. It is also advancing at an increasingly rapid pace, undergoing many changes every single day. Indeed the kernel's importance to many large corporations has sparked a high level of contribution by those companies [3] [4], including the employment of many core kernel developers. Recently Linus Torvalds published statistics relating to contributions to the kernel over the past three years: 96,885 patches attributed to 4068 distinct authors have been accepted [5].
Finding the Rare Cube
Authors: Shlomo Hoory, Oded Margalit
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In this paper we investigate the problem of active learning the partition of the n-dimensional hypercube into m cubes, where the i-th cube has color i. The model we are using is exact learning via color evaluation queries, without equivalence queries, as proposed by the work of Fine and Mansour. We give a randomized algorithm solving this problem in O(mlogn) expected number of queries, which is tight, while its expected running time is O(m 2 n logn).Furthermore, we generalize the problem to allow partitions of the cube into m monochromatic parts, where each part is the union of p cubes. We give two randomized algorithms for the generalized problem. The first uses O(m p 2 2 p logn) expected number of queries, which is almost tight with the lower bound. However, its naïve implementation requires an exponential running time in n. The second, more practical, algorithm achieves a better running time complexity of $\tilde{O}(m^2 n^2 2^{2^p})$. However, it may fail to learn the correct partition with an arbitrarily small probability and it requires slightly more expected number of queries: $\tilde{O}(mn 4^p)$, where the $\tilde{O}$ represents a poly logarithmic factor in m,n,2 p .
Korean Web Site Usability for Disabled People
Authors: Seongeun Choi, Sejun Kim, Sukil Kim
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In this paper, we evaluated 10 Korean web sites whether these sites have enough usability for the disabled people. Theoretically, there must be no difference using web content to an ordinary user and to a user with disabilities. However, under practical manners, the difference cannot be overcome due to lack of sensory issues. We chose 10 most frequently accessing web sites in 5 categories. We also define the Disability Web Usability (DWU) that is the ratio between the web usability of the handicapped and the web usability of the ordinary. The experimental results show that DWUs of the web sites are between 0.49 and 0.76. This implies that the handicapped people are far more difficult to perform tasks navigating the given web sites.
Lazy Contract Checking for Immutable Data Structures
Authors: Robert Bruce Findler, Shu-Yu Guo, Anne Rogers
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structure, meaning that each object can only be used with a single contract and that a data structure with an invariant cannot be viewed as a subtype of the data structure without the invariant (thus inhibiting abstraction) or contracts are checked eagerly when an operation on the data structure is invoked, meaning that many redundant checks are performed, potentially even changing the program's asymptotic complexity.We explore the idea of adding a small, controlled amount of laziness to contract checkers so that the contracts on a data structure are only checked as the program inspects the data structure. Unlike contracts on the constructors, our lazy contracts allow subtyping and thus preserve the potential for abstraction. Unlike eagerly-checked contracts, our contracts do not affect the asymptotic behavior of the program.This paper presents our implementation of these ideas, an optimization in our implementation, performance measurements, and a discussion of an extension to our implementation that admits more expressive contracts by loosening the strict asymptotic guarantees and only preserving the amortized asymptotic complexity.
Energy Management for Periodic Real-Time Tasks with Variable Assurance Requirements
Authors: Dakai Zhu, Xuan Qi, Hakan Aydin
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Reliability-aware power management (RAPM) schemes, which consider the negative effects of voltage scaling on system reliability, were recently studied to save energy while preserving system reliability. The existing RAPM schemes for periodic tasks may be, however, inherently unfair in that they can manage only some tasks at the expense of the other remaining tasks. In this work, we propose the flexible reliability-aware power management framework, which allows the management of all the tasks in the system, according to their assurance requirements. Optimally solving this problem is shown to be NP-hard in the strong sense and upper bounds on energy savings are derived. Then, by extending the processor demand analysis, a pseudo-polynomial-time static scheme is proposed for the "deeply red" recovery patterns. On-line schemes that manage dynamic slack for better energy savings and reliability enhancement are also discussed. The schemes are evaluated extensively through simulations. The results show that, compared to the previous RAPM schemes, the new flexible RAPM schemes can guarantee the assurance requirements for all the tasks, but at the cost of slightly decreased energy savings. However, when combined with dynamic reclaiming, the new schemes become as competitive as the previous ones on the energy dimension, while improving overall reliability.
Implementation of a cognitive apprenticeship model on student programming and perception of problem-solving ability: an exploratory study
Authors: Sonja A. Irlbeck
Venue:  (2008)

The perceptions of the use of Problem-Solving Skills and programming expertise among students in a suburban middle school were explored. Participants completed an online survey to report on their experiences after completing a computer programming project based on a pilot cognitive apprenticeship model. The results indicated that the use of the pilot cognitive apprenticeship-based model was perceived by students to have been beneficial to their programming performance and their problem-solving processes. Areas that were revealed through student comments to have had an influence on student perceptions included prior experience, use of multiple resources, and the breadth of their technical skill background. These areas were consistent with the instructional design components of the pilot problem-solving model, RESOLVE. The areas noted also focused on learning strategies that embedded sociohistorical influences within the learning process. The results indicated the need for continued research to explore the development of broad-based problem-solving models based on cognitive apprenticeship principles that can be tailored to specific curriculum content. The design of such models is critical to educational endeavors to encourage problem-solving transfer across content areas.
Challenges for Exception Handling in Multi-Agent Systems
Authors: Eric Platon, Nicolas Sabouret, Shinichi Honiden
Venue: Software Engineering for Multi-Agent Systems V: Research Issues and Practical Applications (2007)

Exception handling has a commonly agreed semantics in many programming languages. When an operation is called with inappropriate conditions, the control flow of the program is reversed back to the caller to trigger some handling mechanisms. In Multi-Agent Systems (MAS), this semantics applies to the code of agents, but it does not cover the kind of exceptions that occur at the agent level. For instance, the usual handling semantics does not address the cases where the plan of an agent fails and re-planning is required. In fact, the agent code does not necessarily encounter a programming fault or a `catch' clause in such a case, but the agent has yet to deal with an exceptional situation.In this paper, we survey the literature on exception handling with the aim to demonstrate that research needs to be conducted in the case of MAS due to their openness, heterogeneity, and the encapsulation of agents. We identify research directions from the survey, and we present a simulation scenario to illustrate the occurrence of agent-level exceptions in a simple case. The current result of the survey analysis is that agent exceptions mechanisms should rely on the proactivity of agents, on exploiting the agent environment, on collaborative handling mechanisms, and on the potential links between code-level and agent-level exceptions.
Re-estimating the difficulty of closing the digital divide
Authors: Jeffrey James
Venue: Journal of the American Society for Information Science and Technology (2008)

While we now know the most important determinants of the digital divide, such as income, skills, and infrastructure, little has been written about how these variables relate to one another. Yet, it is on the basis of one's answer to this question that the difficulty of closing the divide ultimately depends. In this article, I have sought to challenge the (implicit) prevailing assumption in most of the digital-preparedness literature that variables can be perfectly substituted for one another and, hence, added together. In particular, and drawing on available evidence, I view the relationship between, say computers and computer skills, as being nearer the opposite extreme, of totally limited substitutability. On this basis, I suggest that the components of digital-preparedness indexes be multiplied rather than added. Using multiplication rather than addition in most current indexes of digital preparedness reveals a substantial understatement of the real difficulty in closing the digital divide and a different set of policies to deal with this larger problem. Such policies should include sharing arrangements and the use of intermediaries. &copy; 2008 Wiley Periodicals, Inc.
Bell polynomials and k-generalized Dyck paths
Authors: Toufik Mansour, Yidong Sun
Venue: Discrete Applied Mathematics (2008)

A k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane integer lattice ZxZ consisting of horizontal-steps (k,0) for a given integer k>=0, up-steps (1,1), and down-steps (1,-1), which never passes below the x-axis. The present paper studies three kinds of statistics on k-generalized Dyck paths: ''number of u-segments'', ''number of internal u-segments'' and ''number of (u,h)-segments''. The Lagrange inversion formula is used to represent the generating function for the number of k-generalized Dyck paths according to the statistics as a sum of the partial Bell polynomials or the potential polynomials. Many important special cases are considered leading to several surprising observations. Moreover, enumeration results related to u-segments and (u,h)-segments are also established, which produce many new combinatorial identities, and specially, two new expressions for Catalan numbers.
GRADIS --- Multiagent Environment Supporting Distributed Graph Transformations
Authors: Leszek Kotulski
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Graph transformations are a powerful notation formally describing different aspects of modeled systems. Multiagent systems introduce distribution, parallelism and autonomous decision properties. In the paper a basic properties of the GRADIS agent's framework, joining of both approaches, are discussed. This framework supports splitting the graph, describing a problem, onto a few partial graphs, that can be maintained by different agents. Moreover, the multiagent's cooperation enables the application to the local graphs the graph transformation rules introduced for the centralizes graph; this permits us transfer all theoretical achievements of the centralized graph trans-formations to the distributed environment. The usefulness of the hierarchical graphs structure are and some examples of its usefulness are presented.
The Effectiveness of Personalized Movie Explanations: An Experiment Using Commercial Meta-data
Authors: Nava Tintarev, Judith Masthoff
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

This paper studies the properties of a helpful and trustworthy explanation in a movie recommender system. It discusses the results of an experiment based on a natural language explanation prototype. The explanations were varied according to three factors: degree of personalization, polarity and expression of unknown movie features. Personalized explanations were not found to be significantly more Effective than non-personalized, or baseline explanations. Rather, explanations in all three conditions performed surprisingly well. We also found that participants evaluated the explanations themselves most highly in the personalized, feature-based condition.
A note on the event horizon for a processor sharing queue
Authors: Robert C. Hampshire, William A. Massey
Venue: Queueing Systems: Theory and Applications (2008)

In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey (Queueing Syst. 53(1---2), 19---30, 2006). If the arrival rate for a processor sharing queue has unbounded growth over time, then it is possible for the number of customers in a processor sharing queue to grow so quickly that a newly entering job never finishes. We define the minimum size for such a job to be the event horizon for a processor sharing queue. We discuss the use of such a concept and develop some of its properties. This short article serves both as errata for Hampshire, Harchol-Balter and Massey (Queueing Syst. 53(1---2), 19---30, 2006) and as documentation of a characteristic feature for some processor sharing queues with time varying rates.
Externalizing Java Server Concurrency with CAL
Authors: Charles Zhang, Hans-Arno Jacobsen
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

One of the most important design decisions about a server program is regarding its concurrency mechanisms. However, good concurrency models for general-purpose server programs are increasingly difficult to conceive as the runtime conditions are hard to predict. In this work, we advocate that the concurrency code is to be decoupled from server programs. To enable such separation, we propose and evaluate CAL, -- the Concurrency Aspect Library. CAL provides uniform concurrency programming abstractions and mediates the intrinsic differences among concurrency models. Through CAL, a server program is not tied to any particular concurrency model and framework. CAL can be configured without modifications to use concurrency frameworks of fundamentally different natures. The concurrency code based on CAL is simpler and looks closer to the design. Leveraging the customizability of CAL, we show that a commercial middleware server, refactored to use CAL, outperforms its original version by as much as 10 times.
Solving Stochastic Path Problem: Particle Swarm Optimization Approach
Authors: Saeedeh Momtazi, Somayeh Kafi, Hamid Beigy
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations.
On-Line Approximate String Matching with Bounded Errors
Authors: Marcos Kiwi, Gonzalo Navarro, Claudio Telha
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter ¿ so that the algorithm is allowed to miss occurrences with probability ¿. This is particularly appropriate for this problem, as approximate searching is used to model many cases where exact answers are not mandatory. We show that the relaxed version of the problem allows us breaking the average-case optimal lower bound of the classical problem, achieving average case O(nlog ¿ m/m) time with any $\epsilon = \textrm{poly}(k/m)$, where n is the text size, m the pattern length, k the number of errors for edit distance, and ¿ the alphabet size. Our experimental results show the practicality of this novel and promising research direction.
Enabling gigabit IP for intelligent systems
Authors: Nick Tsakiris, Greg Knowles
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In complex, intelligent systems a common requirement is to provide some form of communication between the system and a computer. Whether the purpose is for streaming content, or simply sending blocks of data between the two machines for processing. This paper provides a solution in the form of an IP based Gigabit Ethernet connection with a specially-designed IP layer implemented directly in hardware to facilitate the connection.The IP core was designed in VHDL and after testing and synthesis, the final results show the interface code to use approximately 1000 slices of FPGA lookup tables, running at just over 125 MHz on a Xilinx Spartan 3 FPGA.
Use Chatbot CSIEC to Facilitate the Individual Learning in English Instruction: A Case Study
Authors: Jiyou Jia, Meixian Ruan
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

CSIEC (Computer Simulation in Educational Communication), is not only an intelligent web-based human-computer dialogue system with natural language for English instruction, but also a learning assessment system for learners and teachers. Its multiple functions including grammar gap filling exercises, talk show and chatting on a given topic, can satisfy the various needs from the students with different backgrounds and learning abilities. In this paper we present a case study of the integration of CSIEC's multiple functions into English syllabus design in a middle school and its pedagogical effectiveness. The comparison of two examination results before and after the system integration shows great improvement of students' performance, and the survey data also indicates the students' favor to this system.
Constrained Unsharp Masking for Image Enhancement
Authors: Radu Ciprian Bilcu, Markku Vehvilainen
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

In this paper we present a cost-effective solution for combined de-noising and sharpening of digital images. Our method combines the unsharp masking and sigma filtering techniques through a regularization mechanism thus ensuring effective noise reduction and edge enhancement in the processed image. We describe our method in detail and we analyze the proposed implementation through extensive experiments done in various scenarios. Due to its low computational complexity the proposed method is well suited for mobile implementations.
Selection of Radial Basis Functions via Genetic Algorithms in Pattern Recognition Problems
Authors: Renato Tinós, Luiz Otávio Murta Júnior
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

The mixed use of different shapes of radial basis functions (RBFs) in RBF Networks is investigated in this paper. For this purpose, we propose the use of the q-Gaussian function, which reproduces different RBFs by changing a real parameter q, in RBF Networks. In the proposed methodology, the centers of the radial units are determined by the k-means algorithm. Then, a Genetic Algorithm is employed to select the number of hidden neurons, type and width of each RBF associated with each radial unit. In order to test the performance of the proposed methodology, an experimental study with two pattern recognition problems is presented. The RBF Network with the q-Gaussian RBF is compared to RBF Networks with Gaussian, Cauchy, and Inverse Multiquadratic RBFs.
Video Retrieval Method Using Non-parametric Based Motion Classification
Authors: N. W. Kim, H. Y. Song
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this paper, we propose a novel video retrieval method using non-parametric based motion classification in the shot-based video indexing structure. The proposed system gets the representative frame and motion information from each shot segmented by the shot change detection method, and extracts visual features and non-parametric based motion information from them. Then, we construct a real-time video retrieval system using similarity comparison between these spatio-temporal features. The extraction of non-parametric based motion features, after the normalized motion vectors are created from an MPEG-compressed stream, is effectively fulfilled by discretizing each normalized motion vector into various angle bins, and by considering the mean, variance, and direction of motion vectors in these bins. In addition, we use the edge-based spatial descriptor to extract the visual feature in representative frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.