ppxscal/embedding_network huggingface dataset:
Computer aided diagnosis of ECG data on the least square support vector machine
Authors: Kemal Polat, Bayram Akdemir, Salih Güneş
Venue: Digital Signal Processing (2008)

In this paper we describe a technique that has successfully classified arrhythmia from an ECG dataset using a least square support vector machine (LSSVM). LSSVM was applied to the ECG dataset to distinguish between healthy persons and diseased persons (arrhythmia). The LSSVM classifier trained with four train-test parts including a training-to-test split of 50-50%, a training-to-test split of 70-30%, and a training-to-test split of 80-20%. We have used the classification accuracy, sensitivity and specificity analysis, and ROC curves to test the performance of LSSVM classifier on the detection of ECG arrhythmia. The classification accuracies obtained are 100% for all the training-to-test splits. These results show that the proposed method is more promising than previously reported classification techniques. The results suggest that the proposed method can be used to enhance the performance of a new intelligent assistance diagnosis system.
The Hearsay-I Speech Understanding System: An Example of the Recognition Process
Authors: D. R. Reddy
Venue: IEEE Transactions on Computers (1976)

This paper describes the structure and operation of the Hearsay-I1speech understanding system by the use of a specific example illustrating the various stages of recognition. The system consists of a set of cooperating independent processes, each representing a source of knowledge. The knowledge is used either to predict what may appear in a given context or to verify hypotheses resulti
A family of subdivision schemes with cubic precision
Authors: Kai Hormann, Malcolm A. Sabin
Venue: Computer Aided Geometric Design (2008)

The four-point subdivision scheme is well known as an interpolating subdivision scheme, but it has recently come to our notice that it is but the first scheme in a family all of whose members have the property that if all the control points lie equally spaced along the same cubic polynomial, the limit curve is exactly that polynomial. Other members of the family have higher smoothness. We study these schemes as functions, where the ordinate is given by the scheme, while the abscissae of the control points are equally spaced. Because all schemes include linear functions in their precision set, this may be regarded as a particular case of the parametric setting, rather than as a special case. This paper introduces the family and determines how the support, the Holder regularity, the precision set, the degree of polynomials spanned by the limit curves, and the artifact behavior vary with the integer parameter that identifies the members of the family. For the family members with an even parameter value, most of these properties have also been shown by Dong and Shen (Dong, B., Shen, Z., 2007. Pseudo-splines, wavelets and framelets. Appl. Comput. Harmon. Anal. 22 (1), 78-104), as they turn out to be a particular kind of pseudo-splines. But regarding the regularity exponent of the limit functions, we derive the exact values and thus improve the lower bounds given by Dong and Shen in that paper. Moreover, our analysis also covers the family members with an odd parameter value which do not seem to fit into the general framework of pseudo-splines. Just before this paper was submitted, (Choi, S.W., Lee, B.-G., Lee, Y.J., Yoon, J., 2006. Stationary subdivision schemes reproducing polynomials. Comput. Aided Geom. Design 23 (4), 351-360) appeared, which also discusses a family of subdivision schemes. The high order members of that family achieve higher degrees of polynomial reproduction, whereas ours aim only at cubic reproduction. This allows us to gain higher continuity for a given mask width.
Structure description tools
Authors: Philippe Salembier, Ana B. Benitez
Venue: Journal of the American Society for Information Science and Technology (2007)

This article provides an overview of the tools specified by the MPEG-7 standard for describing the structure of multimedia content. In particular, it focuses on tools that represent segments resulting from a spatial and/or temporal partitioning of multimedia content. The segments are described in terms of their decomposition and the general relations among them as well as attributes or features of segments. Decomposition efficiently represents segment hierarchies and can be used to create tables of contents or indexes. More general graph representations are handled by the various standard spatial and temporal relations. A segment can be described by a large number of features ranging from those targeting the life cycle of the content (e.g., creation and usage) to those addressing signal characteristics such as audio, color, shape, or motion properties.
A 2D Wigner Distribution-based multisize windows technique for image fusion
Authors: R. Redondo, S. Fischer, F. Šroubek, G. Cristóbal
Venue: Journal of Visual Communication and Image Representation (2008)

We present a scheme for image fusion based on a 2D implementation of the Wigner Distribution (WD) combined with a multisize windows technique. The joint space-frequency distribution provided by the WD can be managed as a measure of saliency that indicates which regions among different sources (channels) should be preserved. However such a saliency measure varies significantly according to the local analysis (window) in which the WD is calculated. Hence, large windows provide high resolution and robustness against possible noise present in channels and small windows provide accurate localization. The multisize windows technique combines the saliency measures of different windows taking advantage of the benefit contributed by each size. The performance assessment was conducted in artificial multifocus images under different noise exposures as well as real multifocus scenarios.
Efficient and robust decision delays selection scheme for multiuser MIMO DFE in power imbalance situation
Authors: Jeng-Kuang Hwang, Rih-Lung Chung
Venue: Wireless Personal Communications: An International Journal (2007)

Recently, it has been shown that the selection of decision delays has a crucial effect on the performance of finite-length multiple-input multiple-output decision-feedback equalization (MIMO-DFE) receiver for multiuser time division multiple access (TDMA) system. With the minimum joint-BER (MJB) criterion, choosing the optimum different decision delays for individual uplink users would require multi- dimensional searching, which is too costly for real-time applications. In this paper, we propose an efficient power-ratio-based (PRB) scheme to solve the multiuser decision delay problem in practice. First, it employs the MIMO channel responses to calculate the received power ratios among uplink users. The ratios are then compared to a set of preset thresholds to determine the decision delays. To optimize the thresholds, Gaussian approximation (GA) technique is used for speeding up the off-line searching process. Under power imbalance situation, we note that the decision delays must be carefully selected on a burst-by-burst basis, or else the performance loss for the weaker users would be very significant. Hence, both the MJB and PRB methods can resist the near-far effect. Finally, simulation results show that the proposed PRB scheme has an approximate BER performance, but with much reduced computational complexity, as compared to the optimal MJB one.
Extending Concurrent Pascal to Allow Dynamic Resource Management
Authors: A. Silberschatz
Venue: IEEE Transactions on Software Engineering (1977)

In Concurrent Pascal, the syntactic and semantic definition of the language prevents the inadvertent definition of a program that might violate the integrity of a shared data object. However, the language also does not allow the dynamic allocation of reusable resources among processes, and this restriction seems unnecessarily stingent. This paper proposes the addition to Concurrent Pascal of a new type of program component, to be called a resource manager. By this means, dynamic resource allocation can be accomplished both safely and efficiently. The notion that a process holds access rights to a resource is generalized to the notion that it holds capability rights, but the capability to atually make use of a resource is granted dynamically. The anonymity of dynamically allocatable resources is also guaranteed.
How Search can profit from Dynamic Taxonomies
Authors: Gerhard Rolletschek
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper explores in the form of a general overview how search applications can benefit from using dynamic taxonomies. It also examines the reverse process in which taxonomies profit from being used in search applications. Different ways of enriching taxonomies by virtue of experiences from search applications are discussed, as are different methods of deploying taxonomies in search applications, including general Web search, product search and local search. After introducing the concept of search in a broad sense that encompasses various ways of accessing information, several taxonomy applications are presented. A special emphasis is given to the proper treatment of terms (from an orthographic, morphologic and semantic point of view) given that today's predominant way of accessing information is to enter relatively small textual units.
Modeling Cooperative Problem Solving Process with Extended Alternating-time Temporal Logic
Authors: Zhengyuan Ning, Xianwei Lai, Shanli Hu, Qingqing Zhan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The paradigm example of social interaction is cooperative problem solving, in which a group of autonomous agents choose to work together to achieve a common goal. In order to improve existing work on developing formal computing model for cooperative problem solving in multi-agent systems, several efforts are made in this paper. Firstly, a new multi-agent cooperation logic called ATL-BDI designed in our previous work is enhanced so as to make it more suitable for modeling cooperative problem solving. Secondly, basing on ATL-BDI, the cooperative problem solving process is formally described. The corresponding new computing models of cooperation recognition, team formation, plan formation and execution are developed. The iteration of these steps is also well considered. Several important properties are gained and proved finally.
Almost Uniform Distributions for Computer Image Enhancement
Authors: E. L. Hall
Venue: IEEE Transactions on Computers (1974)

The use of a gray level transformation which transforms a given empirical distribution function of gray level values in an image into a uniform distribution has been used as an image enhancement as well as for a normalization procedure. This transformation produces a discrete variable whose empirical distribution might be expected to be approximately uniform since it is related to the well known distribution transformation. In this correspondence, an extension of the theorem is given which shows that the theorem "almost" holds for an "almost" continuous input distribution. The application of the discrete distribution transformation to computer image enhancement is considered.
A Multi-Layer Security Enabled Quality of Service (QoS) Management Architecture
Authors: Alimuddin Mohammad, Alice Chen, Guijun Wang, Changzhou Wang, Rodolfo Santiago
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Service-oriented architectures are dynamic, flexible and compositional in nature. Security and Quality of Service (QoS) management are two significant challenges for Service-Oriented-Architectures (SOA) in a multi-domain environment. We have researched and developed a SOA based QoS framework architecture and implemented a facility according to the architecture. This facility implementation consists of a set of QoS management services with XML-based policy driven resource management techniques, monitoring and diagnostics, and adaptation mechanisms. It is built on a publish/subscribe based middleware and has been successfully demonstrated in an enterprise testbed environment. We have expanded the QoS architecture to include QoS Security characteristics that incorporates the concept of Multi- Level Security (MLS). We call this expanded architecture a QoS-MLS architecture. This architecture addresses the security and QoS challenges in a coherent and integrated approach for enterprise SOA. In this paper we describe this QoS- MLS architecture which is the result of the integration of MLS into a QoS Management facility at the middleware layer. Keywords: Service Oriented Architecture (SOA), Multi-Layer Security (MLS), Quality of Service (QoS)
On multistage ranked set sampling for distribution and median estimation
Authors: Mohammad Fraiwan Al-Saleh, Monjed Hisham Samuh
Venue: Computational Statistics Data Analysis (2008)

A variation of ranked set sampling (RSS), multistage RSS (MSRSS), is investigated for the estimation of the distribution function and some of its quantiles, in particular the median. It is shown that this method is significantly more efficient than simple random sampling (SRS). The method becomes more and more effective as the number of stages r increases. Two estimators of the median based on MSRSS are proposed and compared to the sample median obtained by SRS.
Genetic Algorithm Based on Classification for the Traveling Salesman Problem
Authors: Zhiyi Lin, Yuanxiang Li, ZhangCan Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper, considering the characteristic of Traveling Salesman Problem (TSP), puts forward Genetic Algorithm Based on Classification (GABC). GABC classifies the individuals into different levels by their fitness. Each level with its respective operations generates new solutions in different numbers and accelerates the new solutions in high levels to approach the local minimum by accelerating operator. Furthermore, GABC adopts new selection strategy in each level. The results obtained show that GABC is an effective and robust method. Its performance outperforms some other techniques.
Sturm-Liouville problems with discontinuities at two points
Authors: M. Kadakal, O. Sh. Mukhtarov
Venue: Computers Mathematics with Applications (2007)

In this paper we extend some spectral properties of regular Sturm-Liouville problems to those which consist of a Sturm-Liouville equation with piecewise continuous potentials together with eigenparameter-dependent boundary conditions and four supplementary transmission conditions. By modifying some techniques of [C.T. Fulton, Two-point boundary value problems with eigenvalue parameter contained in the boundary conditions, Proc. Roy. Soc. Edinburgh Sect. A 77 (1977) 293-308; E. Tunc, O.Sh. Muhtarov, Fundamental solutions and eigenvalues of one boundary-value problem with transmission conditions, Appl. Math. Comput. 157 (2004) 347-355; O.Sh. Mukhtarov, E. Tunc, Eigenvalue problems for Sturm-Liouville equations with transmission conditions, Israel J. Math. 144 (2004) 367-380] and [O.Sh. Mukhtarov, M. Kadakal, F.S. Muhtarov, Eigenvalues and normalized eigenfunctions of discontinuous Sturm-Liouville problem with transmission conditions, Rep. Math. Phys. 54 (2004) 41-56], we give an operator-theoretic formulation for the considered problem and obtain asymptotic formulae for the eigenvalues and eigenfunctions.
Method for Discovering Actionable Rule
Authors: Heng-min Zhu, Wei-dong Huang, Hui-song Zheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

An important task for data mining is to discover interesting rules for the user. Interesting rules not only are novel to users, but also must be actionable to the user. A method to discover actionable rule is proposed in this paper. It adopts rule template to represent user's preference for actionable rule form. The concept of conformability measure of discovered rule relative to rule template is proposed. The factors which affect rule actionability are discussed and function to measure rule actionability is given. Experimental result shows that the method is effective.
Arabic Handwriting Recognition Competition
Authors: V. Margner, H. El Abed
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper describes the Arabic handwriting recognition competition held at ICDAR 2007. This second competition (the first was at ICDAR 2005) again uses the IFN/ENIT- database with Arabic handwritten Tunisian town names. Today, more than 54 research groups from universities, re- search centers, and industry are working with this database worldwide. This year, 8 groups with 14 systems are par- ticipating in the competition. The systems were tested on known data and on two datasets which are unknown to the participants. The systems are compared on the most impor- tant characteristic, the recognition rate. Additionally, the relative speed of the different systems were compared. A short description of the participating groups, their systems, and the results achieved are finally presented.
Conditions for the Equivalence of Synchronous and Asynchronous Systems
Authors: E. A. Akkoyunlu
Venue: IEEE Transactions on Software Engineering (1978)

Synchronous and asynchronous operation of software systems are defined. It is argued that certifying the correct operation of a system in the synchronous mode is significantly simpler than in the asynchronous mode. A series of compile-time and run-time restrictions for systems constructed in Concuirent Pascal are presented which assure equivalent operation in the synchronous and asynchronous modes.
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Authors: Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query is K Nearest Neighbor (KNN) query that facilitates sampling of monitored sensor data in correspondence with a given query location. Recently, itinerary-based KNN query processing techniques, that propagate queries and collect data along a pre-determined itinerary, have been developed concurrently [12] [14]. These research works demonstrate that itinerary-based KNN query processing algorithms are able to achieve better energy efficiency than other existing algorithms. However, how to derive itineraries based on different performance requirements remains a challenging problem. In this paper, we propose a new itinerary-based KNN query processing technique, called PCIKNN, that derives different itineraries aiming at optimizing two performance criteria, response latency and energy consumption. The performance of PCIKNN is analyzed mathematically and evaluated through extensive experiments. Experimental results show that PCIKNN has better performance and scalability than the state-of-the-art.
On the matching extendability of graphs in surfaces
Authors: R. E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer
Venue: Journal of Combinatorial Theory Series B (2008)

A graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n in G extends to a perfect matching. It is shown that (1) if a graph is embedded on a surface of Euler characteristic @g, and the number of vertices in G is large enough, the graph is not 4-extendable; (2) given g>0, there are infinitely many graphs of orientable genus g which are 3-extendable, and given g@?>=2, there are infinitely many graphs of non-orientable genus g@? which are 3-extendable; and (3) if G is a 5-connected triangulation with an even number of vertices which has genus g>0 and sufficiently large representativity, then it is 2-extendable.
CCARCH: Architecting Common Criteria Security Requirements
Authors: Jose Romero-Mariona, Hadar Ziv, Debra J. Richardson
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

As technology continues to evolve, so do different entities that threaten the security of this technology. We believe that in order to build dependable software security should be treated just as any other important aspect of a system; to do this we must emphasize it at the beginning of our development cycle and be able to carry these security requirements down the cycle. We focus on a technique known as the Common Criteria, which allows for the development of security requirements. We extend the capabilities of Common Criteria beyond the requirements phase, to allow us to take security requirements into further stages of the cycle. In this paper we describe CCARCH, a technique accompanied by a set of tools, that takes Common Criteria expressed security requirements to the architectural level. Our approach aids in making the usage of Common Criteria more beneficial and applicable.
Kernel-based Global Folley-Sammon Discriminate Analysis
Authors: Chunyu Zhang, Tongyan Qi, Mianshu Chen, Wei Liu, Bin Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Kernel trick is a useful method dealing with the nonlinearity of patterns' distribution, and widely used for non-linear pattern classification problem. Recently, many kernel-based Fisher discriminate methods were proposed, the features extracted by those methods are statistically uncorrelated, usually ineffectively when used in so called "small sample problem"(SSS), which exists in most FR tasks. To overcome this shortcoming, in this paper we present Kernel-based Global Folley-Sammon Discriminate Analysis (KGFS), it can be realized in three steps: firstly by combing kernel function, map data onto an implicit high-dimensional feature space, secondly construct orthogonal feature space there, finally calculate iterative global orthogonal discriminate vectors. Experiments have been done on ORL dataset. In terms of classification error rate performance, proposed kernel based method KGFS has a better performance than other three commonly used kernel-based methods, such as GDA, MGDA and KDDA.
A Generic Visual Critic Authoring Tool
Authors: Norhayati Mohd Ali
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Critic tools have been used for many domains, including design sketches, education, general engineering, and software design. The focus of this research is to develop a generic visual critic authoring framework embedded within an end user oriented domain specific visual language meta tool. This will allow tool critic support to be rapidly developed in parallel with the tools themselves.
On Block-Parallel Methods for Solving Linear Equations
Authors: Y. Wallach
Venue: IEEE Transactions on Computers (1980)

An MIMD-type parallel-processing system was introduced recently. Using an extended PL/I notation, algorithms for the Gauss-Seidel method and for back substitution are written for this system. Block execution is shown to result in higher speedups.