ppxscal/embedding_network huggingface dataset:
New models for region of interest reader classification analysis in chest radiographs
Authors: M. S. Pattichis, T. Cacoullos, Peter Soliz
Venue: Pattern Recognition (2009)

In several computer-aided diagnosis (CAD) applications of image processing, there is no sufficiently sensitive and specific method for determining what constitutes a normal versus an abnormal classification of a chest radiograph. In the case of lung nodule detection or in classifying the perfusion of pneumoconiosis, multiple radiograph readers (radiologists) are asked to examine and score specific regions of interest (ROIs). The readers provide size, shape and perfusion grades for the presence of opacities in each region and then use all the ROI grades to classify the lung as normal or abnormal. The combined grades from all readers are then used to arrive at a consensus normal or abnormal classification. In this paper, using area under the ROC curve, we evaluate new mathematical models that are based on mathematical statistics, logic functions, and several statistical classifiers to analyze reader performance in grading chest radiographs for pneumoconiosis as the first step toward applying this technique to early detection of nodules found in lung cancer. In pneumoconiosis, rounded opacities are on the order of 1-10mm in size, while lung nodules are often not diagnosed until they reach a size on the order of 1cm.
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Authors: Maurice Herlihy, Sergio Rajsbaum, Mark Tuttle
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present a unified, axiomatic approach to proving lower bounds for the k-set agreement problem in both synchronous and asynchronous message-passing models. The proof involves constructing the set of reachable states, proving that these states are highly connected, and then appealing to a well-known topological result that high connectivity implies that set agreement is impossible. We construct the set of reachable states in an iterative fashion using a round operator that we define, and our proof of connectivity is an inductive proof based on this iterative construction and simple properties of the round operator.
"Compute? No, Mr. Bond, I Expect You to Die!"
Authors: Charles Day
Venue: Computing in Science and Engineering (2009)

Columnist Charles Day describes the history of computing as presented in the James Bond movie series.
Committee machines for facial-gender recognition
Authors: Hazem M. Raafat, Ahmad S. Tolba, Ezzat Shaddad
Venue: International Journal of Hybrid Intelligent Systems (2009)

This paper presents a new approach for building a committee machine (LVQCM) that is based on learning vector quantization (LVQ) neural networks. The proposed committee machine was then applied to solve the problem of facial gender recognition. Design of individual classifiers is time consuming and results in inaccurate and unstable classifiers. Settling on the right design parameters of a classifier is a non-trivial task. To avoid the abovementioned problems, a committee machine is implemented. Experimental results based on Kuwait University and Stanford University face databases indicate that the performance of the proposed committee machine (99.02%) outperforms that of the best individual classifier used in that combination (93%). Majority voting is used for combining the individual decisions of a group of LVQ weak classifiers generated and trained under different conditions. The experimental results also show that LVQCM outperforms other recently published methods such as: the K-Means, 2$^{nd}$ weight, Mahalanobis, linear discriminant, local linear discriminant, closest match, and the closest diffusion match. The implemented algorithm is not restricted to LVQ neural network and could be applied to other tytpes of neural networks.
Key management for cipher system (LAM)
Authors: Panagiotis Margaronis, Emmanouil Antonidakis, Konstantinos Marinakis, Konstantinos Katsoylakis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper presents the idea of a new approach to the key management in the field of cryptography. This idea introduces a random key stream which could be given by Digital Video Broadcasting (DVB) and Digital Audio Broadcasting (DAB) technology to two different symmetric cryptosystems. The main objective of this paper is to provide the reader with an innovating view concerning the key management. A demonstration of the idea as well as a possible implementation will be presented in the following sections.
IT-Enabled Business Transformation - Insights from Japanese Used-Car Industry
Authors: Oh Jung Yun
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

This paper shows the empirical IT impact on an industrial level through 3 IT-enabled business transformation stages: The 'Operation Excellence stage', 'Value Innovation stage' and 'Value Creation stage'. Based on our study, we developed a number of testable propositions on: The more degree of business transformation gives the more range of potential benefit from adoption of IT, Information Technology accelerates the specialization of the market, On-Off’s networking will be more important and critical as IT development, Introduction of IT transforms market structure and promotes advent of new players.
Evaluation of a bounded high order upwind scheme for 3D incompressible free surface flow computations
Authors: V. G. Ferreira, F. A. Kurokawa, C. M. Oishi, M. K. Kaibara, A. Castelo, J. A. Cuminato
Venue: Mathematics and Computers in Simulation (2009)

In the context of normalized variable formulation (NVF) of Leonard and total variation diminishing (TVD) constraints of Harten, this paper presents an extension of a previous work by the authors for solving unsteady incompressible flow problems. The main contributions of the paper are threefold. First, it presents the results of the development and implementation of a bounded high order upwind adaptative QUICKEST scheme in the 3D robust code (Freeflow), for the numerical solution of the full incompressible Navier-Stokes equations. Second, it reports numerical simulation results for 1D shock tube problem, 2D impinging jet and 2D/3D broken dam flows. Furthermore, these results are compared with existing analytical and experimental data. And third, it presents the application of the numerical method for solving 3D free surface flow problems.
The MEB and CEB Static Analysis for CSP Specifications
Authors: Michael Leuschel, Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit
Venue: Logic-Based Program Synthesis and Transformation: 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers (2009)

This work presents a static analysis technique based on program slicing for CSP specifications. Given a particular event in a CSP specification, our technique allows us to know what parts of the specification must necessarily be executed before this event, and what parts of the specification could be executed before it in some execution. Our technique is based on a new data structure which extends the Synchronized Control Flow Graph (SCFG). We show that this new data structure improves the SCFG by taking into account the context in which processes are called and, thus, makes the slicing process more precise.
Compact Fundamental Matrix Computation
Authors: Kenichi Kanatani, Yasuyuki Sugaya
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likelihood (ML) principle, minimizing the reprojection error. The rank constraint is incorporated by the EFNS procedure. Although our algorithm produces the same solution as all existing ML-based methods, it is probably the most practical of all, being small and simple. By numerical experiments, we confirm that our algorithm behaves as expected.
Some thoughts on associative processing languages
Authors: William W. Patterson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Much effort has been expended in developing array and associative processors (AP's). The most notable of the former are Burroughs' ILLIAC IV and Honeywell's PEPE, while the present representative of the latter technology is the STARAN built by Goodyear Aerospace Corp. However, very little has been published on higher order languages which take advantage of the unique characteristics of these architectures. There is at least one effort to develop techniques which will extract the parallelism in ordinary FORTRAN code, as well as a number of efforts to formally describe the parallelism in algorithms. Examples are in References 2 and 3. It is true that many algorithms can be put into efficient parallel code using these techniques; however, there is a large body of problems which must be reexamined and recast into new algorithms which match the parallelism of the machine to the natural parallelism of the problem. These new algorithms will require a new language which gives the programmer the flexibility to use the features of the machine directly. The PFOR language developed for PEPE is probably the only existing language for an array processor, and some preliminary work for the RADC AP project is the only published attempt on AP languages. This paper will look at associative processing from the point of view of a programmer who has tried to write programs for an AP, and therefore will propose constructs which are convenient for the programmer and not necessarily for the compiler writer. They do, however stem from a reasonable knowledge of the basic architecture of the AP, and hence will tend to parallel it.
A SIMD optimization framework for retargetable compilers
Authors: Manuel Hohenauer, Felix Engel, Rainer Leupers, Gerd Ascheid, Heinrich Meyr
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2009)

Retargetable C compilers are currently widely used to quickly obtain compiler support for new embedded processors and to perform early processor architecture exploration. A partially inherent problem of the retargetable compilation approach, though, is the limited code quality as compared to hand-written compilers or assembly code due to the lack of dedicated optimizations techniques. This problem can be circumvented by designing flexible, retargetable code optimization techniques that apply to a certain range of target architectures. This article focuses on target machines with SIMD instruction support, a common feature in embedded processors for multimedia applications. However, SIMD optimization is known to be a difficult task since SIMD architectures are largely nonuniform, support only a limited set of data types and impose several memory alignment constraints. Additionally, such techniques require complicated loop transformations, which are tailored to the SIMD architecture in order to exhibit the necessary amount of parallelism in the code. Thus, integrating the SIMD optimization and the required loop transformations together in a single retargeting formalism is an ambitious challenge. In this article, we present an efficient and quickly retargetable SIMD code optimization framework that is integrated into an industrial retargetable C compiler. Experimental results for different processors demonstrate that the proposed technique applies to real-life target machines and that it produces code quality improvements close to the theoretical limit.
The design and implementation of an agent-based auction service
Authors: Adriana Dobriceanu, Laurentiu Biscu, Amelia Badica, Costin Badica
Venue: International Journal of Agent-Oriented Software Engineering (2009)

In this paper, we present the architecture, design and implementation of an agent-based service for automated auctions. The presentation covers the conceptual architecture, types of agents, agent communication and design and implementation issues. The experimental results to assess the performance of the service in terms of latency and throughput as functions of the number of auction participants and number of simultaneously active auctions are also included. The results confirmed that while the solution allows an increased level of flexibility and reusability as compared with existing approaches, it still suffers from performance and scalability problems that we plan to address in the near future.
On the accuracy of the rotation form in simulations of the Navier-Stokes equations
Authors: William Layton, Carolina C. Manica, Monika Neda, Maxim Olshanskii, Leo G. Rebholz
Venue: Journal of Computational Physics (2009)

The rotation form of the Navier-Stokes equations nonlinearity is commonly used in high Reynolds number flow simulations. It was pointed out by a few authors (and not widely known apparently) that it can also lead to a less accurate approximate solution than the usual u.@?u form. We give a different explanation of this effect related to (i) resolution of the Bernoulli pressure, and (ii) the scaling of the coupling between velocity and pressure error with respect to the Reynolds number. We show analytically that (i) the difference between the two nonlinearities is governed by the difference in the resolution of the Bernoulli and kinematic pressures, and (ii) a simple, linear grad-div stabilization ameliorates much of the bad scaling of the velocity error with respect to Re. The rotation form does have superior conservation properties to the alternatives and it appears to be amenable to more efficient preconditioners. Thus, the rotational form with grad-div stabilization is a promising method. We also give experiments that show bad velocity approximation is tied to poor pressure resolution in either form.
Consumer behaviour in the mobile telecommunications' market: The individual's adoption decision of innovative services
Authors: Ioanna D. Constantiou
Venue: Telematics and Informatics (2009)

Research in the adoption of innovative services in mobile communications markets has not offered a comprehensive explanation of how the individual makes a choice. This article proposes a theoretical framework for the analysis of the adoption decision of innovative mobile services such as mobile TV. The decision to adopt the service can be viewed as a choice based on two cognitive processes of reasoning and referencing, as postulated in behavioural decision making. The framework has both theoretical and practical value. From a theoretical perspective, it illustrates the manner in which referencing and reasoning influence the individual's decision to adopt innovative services in the mobile telecommunications market. From a practical perspective the framework offers a market analysis tool which can generate useful insights for the vendors.
Implementing SIP-based technology for management framework
Authors: Rong-Zuo Lin, Allen Liao, Han-Chieh Chao
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

As the development of network going on quickly, we are now speedy into the All IP era. However, more and more variety appliances have been proposed which will be in service for Smart Home, Campus Network, and etc. The efficient network management will be very demanding. SNMP, provided by IETF organization, is a standard management protocol which can be easily communicated and managed between different facilities of companies. Unfortunately, due to the great success of IPv4 and the slow deployment of IPv6 for the moment, most of the networks use the NAT skill to get enough IP for network service, which leads the SNMP encounter difficulty. In order to solve this problem, there were nonstandard methods launched one after another, but they always not only reduce the performance of the network, but also spend lots of time on the set-up of network devices. In addition, for the purpose of convenient, simple and fast management, the new skill should manage and search by names, and combine the on-line status presence method. This article advances and implements a new managing framework following the standard principles by adopting the SIMPLE message delivery standard based on SIP to define SNMP packet field, and accomplishing through the management of NAT and device Presence mechanism--to achieve the compatibility of existent SNMP standard.
MPIWiz: subgroup reproducible replay of mpi applications
Authors: Ruini Xue, Xuezheng Liu, Ming Wu, Zhenyu Guo, Wenguang Chen, Weimin Zheng, Zheng Zhang, Geoffrey Voelker
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has always been a particularly challenging task due to their high degree of concurrent execution and non-deterministic behavior. Deterministic replay is a potentially powerful technique for addressing these challenges, with existing MPI replay tools adopting either data-replay or order-replay approaches. Unfortunately, each approach has its tradeoffs. Data-replay generates substantial log sizes by recording every communication message. Order-replay generates small logs, but requires all processes to be replayed together. We believe that these drawbacks are the primary reasons that inhibit the wide adoption of deterministic replay as the critical enabler of cyclic debugging of MPI applications. This paper describes subgroup reproducible replay (SRR), a hybrid deterministic replay method that provides the benefits of both data-replay and order-replay while balancing their trade-offs. SRR divides all processes into disjoint groups. It records the contents of messages crossing group boundaries as in data-replay, but records just message orderings for communication within a group as in order-replay. In this way, SRR can exploit the communication locality of traffic patterns in MPI applications. During replay, developers can then replay each group individually. SRR reduces recording overhead by not recording intra-group communication, and reduces replay overhead by limiting the size of each replay group. Exposing these tradeoffs gives the user the necessary control for making deterministic replay practical for MPI applications. We have implemented a prototype, MPIWiz, to demonstrate and evaluate SRR. MPIWiz employs a replay framework that allows transparent binary instrumentation of both library and system calls. As a result, MPIWiz replays MPI applications with no source code modification and relinking, and handles non-determinism in both MPI and OS system calls. Our preliminary results show that MPIWiz can reduce recording overhead by over a factor of four relative to data-replay, yet without requiring the entire application to be replayed as in order-replay. Recording increases execution time by 27% while the application can be replayed in just 53% of its base execution time.
R-Capriccio: a capacity planning and anomaly detection tool for enterprise services with live workloads
Authors: Qi Zhang, Ludmila Cherkasova, Guy Mathews, Wayne Greene, Evgenia Smirni
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

As the complexity of IT systems increases, performance management and capacity planning become the largest and most difficult expenses to control. New methodologies and modeling techniques that explain large-system behavior and help predict their future performance are now needed to effectively tackle the emerging performance issues. With the multi-tier architecture paradigm becoming an industry standard for developing scalable client-server applications, it is important to design effective and accurate performance prediction models of multi-tier applications under an enterprise production environment and a real workload mix. To accurately answer performance questions for an existing production system with a real workload mix, we design and implement a new capacity planning and anomaly detection tool, called R-Capriccio, that is based on the following three components: i) a Workload Profiler that exploits locality in existing enterprise web workloads and extracts a small set of most popular, core client transactions responsible for the majority of client requests in the system; ii) a Regression-based Solver that is used for deriving the CPU demand of each core transaction on a given hardware; and iii) an Analytical Model that is based on a network of queues that models a multi-tier system. To validate R-Capriccio, we conduct a detailed case study using the access logs from two heterogeneous production servers that represent customized client accesses to a popular and actively used HP Open View Service Desk application.
Fractal scan IP core for the FPD gray scale controller
Authors: Xu Meihua, Ran Feng, Chen Zhangjin
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

This paper presents the design and logic implementation of the fractal scan IP core for the FPD gray scale controller based on the mathematical model of the optimal scan architecture. Through the exploration of the sub-space code sequences and bit code sequences for different gray levels, we deduce the general formulae for the sequences and propose the corresponding logic implementations. Moreover, the parameterized IP core for various gray levels, embedded in flat panel display scan controller, can efficiently increase the scan utilization and imaging quality. This research provides a new engineering way to solve a pressing problem of high resolution flat panel display technology.
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
Authors: Clemens Thielen, Sven O. Krumke
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We provide a general scheme for constructing monotone algorithms for a wide class $\mathcal{C}$ of scheduling problems Q|prec,r j |&gamma; on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation/competitive algorithms for the (simpler) scheduling problems P|prec,r j |&gamma; on identical machines and 1|prec,r j |&gamma; on a single machine and then generically constructs a monotone approximation/ competitive algorithm for the problem on related machines. Monotone algorithms are necessary and sufficient for the design of truthful scheduling mechanisms in the setting with selfish machines. The algorithms constructed by our scheme are among the first monotone algorithms for scheduling problems with precedence constraints. For example, we show that our scheme applies to the problems of minimizing the makespan or the weighted sum of completion times when the jobs have precedence constraints and/or release dates.
Feature selection for medical dataset using rough set theory
Authors: Yan Wang, Lizhuang Ma
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Rough set approach has been recognized to be one of the powerful tools in medical feature selection. Many feature selection methods based on rough set have been proposed, where numerous experimental results have demonstrated that these methods based on discernibility matrix are efficient. However, the high storage space and the time-consuming computation restrict its application. In this paper, we propose an efficient algorithm called as Feature Forest algorithm for generation of the reducts of a medical dataset. In the algorithm, the given dataset is transformed into a forest to form discernibility string that is the concatenation of some of features and the disjunctive normal form is computed to reduct features based on feature forest. In addition, experimental results on different datasets show that the algorithms of this paper can efficiently reduce storage cost and be computationally inexpensive.