justin

Today I read a paper titled “A Comparative Study of Fuzzy Classification Methods on Breast Cancer Data”

The abstract is:
In this paper, we examine the performance of four fuzzy rule generation methods on Wisconsin breast cancer data.

The first method generates fuzzy if then rules using the mean and the standard deviation of attribute values.

The second approach generates fuzzy if then rules using the histogram of attributes values.

The third procedure generates fuzzy if then rules with certainty of each attribute into homogeneous fuzzy sets.

In the fourth approach, only overlapping areas are partitioned.

The first two approaches generate a single fuzzy if then rule for each class by specifying the membership function of each antecedent fuzzy set using the information about attribute values of training patterns.

The other two approaches are based on fuzzy grids with homogeneous fuzzy partitions of each attribute.

The performance of each approach is evaluated on breast cancer data sets.

Simulation results show that the Modified grid approach has a high classification rate of 99.73 %.

Today I read a paper titled “Improved randomized selection”

The abstract is:
We show that several versions of Floyd and Rivest’s improved algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+O(n^{1/2}\ln^{1/2}n)$ comparisons on average and with high probability.

This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements.

Encouraging computational results on large median-finding problems are reported.

Today I read a paper titled “A Social Network for Societal-Scale Decision-Making Systems”

The abstract is:
In societal-scale decision-making systems the collective is faced with the problem of ensuring that the derived group decision is in accord with the collective’s intention.

In modern systems, political institutions have instatiated representative forms of decision-making to ensure that every individual in the society has a participatory voice in the decision-making behavior of the whole–even if only indirectly through representation.

An agent-based simulation demonstrates that in modern representative systems, as the ratio of representatives increases, there exists an exponential decrease in the ability for the group to behave in accord with the desires of the whole.

To remedy this issue, this paper provides a novel representative power structure for decision-making that utilizes a social network and power distribution algorithm to maintain the collective’s perspective over varying degrees of participation and/or ratios of representation.

This work shows promise for the future development of policy-making systems that are supported by the computer and network infrastructure of our society.

Today I read a paper titled “Media Affordances of a Mobile Push-To-Talk Communication Service”

The abstract is:
This paper presents an exploratory study of college-age students using two-way, push-to-talk cellular radios.

We describe the observed and reported use of cellular radio by the participants, the activities and purposes for which they adopted it, and their responses.

We then examine these empirical results using mediated communication theory.

Cellular radios have a unique combination of affordances relative to other media used by this age group, including instant messaging (IM) and mobile phones; the results of our analysis do suggest explanations for some observed phenomena but also highlight the counter-intuitive nature of other phenomena.

For example, although the radios have many important dissimilarities with IM from the viewpoint of mediated communication theory, the observed use patterns resembled those of IM to a surprising degree.

Today I read a paper titled “Phoneme Recognition Using Acoustic Events”

The abstract is:
This paper presents a new approach to phoneme recognition using nonsequential sub–phoneme units.

These units are called acoustic events and are phonologically meaningful as well as recognizable from speech signals.

Acoustic events form a phonologically incomplete representation as compared to distinctive features.

This problem may partly be overcome by incorporating phonological constraints.

Currently, 24 binary events describing manner and place of articulation, vowel quality and voicing are used to recognize all German phonemes.

Phoneme recognition in this paradigm consists of two steps: After the acoustic events have been determined from the speech signal, a phonological parser is used to generate syllable and phoneme hypotheses from the event lattice.

Results obtained on a speaker–dependent corpus are presented..

Today I read a paper titled “Intelligent search strategies based on adaptive Constraint Handling Rules”

The abstract is:
The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP).

This presentation compares an improved version of conflict-directed backjumping and two variants of dynamic backtracking with respect to chronological backtracking on some of the AIM instances which are a benchmark set of random 3-SAT problems.

A CHR implementation of a Boolean constraint solver combined with these different search strategies in Java is thus being compared with a CHR implementation of the same Boolean constraint solver combined with chronological backtracking in SICStus Prolog.

This comparison shows that the addition of “intelligence” to the search process may reduce the number of search steps dramatically.

Furthermore, the runtime of their Java implementations is in most cases faster than the implementations of chronological backtracking.

More specifically, conflict-directed backjumping is even faster than the SICStus Prolog implementation of chronological backtracking, although our Java implementation of CHR lacks the optimisations made in the SICStus Prolog system.

To appear in Theory and Practice of Logic Programming (TPLP).

Today I read a paper titled “Decision Sort and its Parallel Implementation”

The abstract is:
In this paper, a sorting technique is presented that takes as input a data set whose primary key domain is known to the sorting algorithm, and works with an time efficiency of O(n+k), where k is the primary key domain.

It is shown that the algorithm has applicability over a wide range of data sets.

Later, a parallel formulation of the same is proposed and its effectiveness is argued.

Though this algorithm is applicable over a wide range of general data sets, it finds special application (much superior to others) in places where sorting information that arrives in parts and in cases where input data is huge in size.

Today I read a paper titled “Lock-Free and Practical Deques using Single-Word Compare-And-Swap”

The abstract is:
We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and uses atomic primitives which are available in modern computer systems.

Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses.

Our algorithm is based on a doubly linked list, and only requires single-word compare-and-swap atomic primitives, even for dynamic memory sizes.

We have performed an empirical study using full implementations of the most efficient algorithms of lock-free deques known.

For systems with low concurrency, the algorithm by Michael shows the best performance.

However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture.

Today I read a paper titled “A new architecture for making highly scalable applications”

The abstract is:
An application is a logical image of the world on a computer.

A scalable application is an application that allows one to update that logical image at run time.

To put it in operational terms: an application is scalable if a client can change between time T1 and time T2 – the logic of the application as expressed by language L; – the structure and volume of the stored knowledge; – the user interface of the application; while clients working with the application at time T1 will work with the changed application at time T2 without performing any special action between T1 and T2.

In order to realize such a scalable application a new architecture has been developed that fully orbits around language.

In order to verify the soundness of that architecture a program has been build.

Both architecture and program are called CommunSENS.

The main purpose of this paper is: – to list the relevant elements of the architecture; – to give a visual presentation of how the program and its image of the world look like; – to give a visual presentation of how the image can be updated.

Some relevant philosophical and practical backgrounds are included in the appendixes.