ppxscal/embedding_network huggingface dataset:
Multi-class support vector machine for classification of the ultrasonic images of supraspinatus
Authors: Ming-Huwi Horng
Venue: Expert Systems with Applications: An International Journal (2009)

This article proposes an effort to apply the multi-class support vector machine classifiers to classify the supraspinatus image into different disease groups that are normal, tendon inflammation, calcific tendonitis and supraspinatus tear. The supraspinatus tendon is often involved in the above-mentioned disease groups. Four different texture analysis methods - texture feature coding method, gray-level co-occurrence matrix, fractal dimension evaluation and texture spectrum - are used to extract features of tissue characteristic in the ultrasonic supraspinatus images. The mutual information criterion is adopted to select the powerful features from ones generated from the above-mentioned four texture analysis methods in the training stage, meanwhile, the five implementations of multi-class support vector machine classifiers are also designed to discriminate each image into one of the four disease groups in the classification stage. In experiments, the most commonly used performance measures including sensitivity, specificity, classification accuracy and false-negative rate are applied to evaluate the classification of the five implantations of multi-class support vector machines. In addition, the receiver operating characteristics analysis is also used to analyze the classification capability. The present results demonstrate that the implementation of multi-class fuzzy support vector machine can achieve 90% classification accuracy, and performance measures of this implementation are significantly superior to the others.
Fair resource sharing in hierarchical virtual organizations for global grids
Authors: Kyong Hoon Kim, Rajkumar Buyya
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

In global Grid computing, users and resource providers organize various Virtual Organizations (VOs) to share resources and services. A VO organizes other sub-VOs for the purpose of achieving the VO goal, which forms hierarchical VO environments. Resource providers and VOs agree upon VO resource sharing policies, such as resource sharing amount. Thus, users in lower-layer VOs can access resources in higher-layer VOs to accomplish their common goals. In this paper, we deal with fair resource allocation problem in hierarchical VOs, so that an appropriate proportion of a VO resource for each lower-layer VO is analyzed. In addition, we provide a resource allocation scheme based on these predefined proportions. Simulation results show that the proposed approach gives better fairness as well as performance compared with other schemes.
A standard session protocol for open systems interconnection (OSI)
Authors: Charles E. Young
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Protocol and service standards governing the session layer of the seven-layer reference model for OSI are expected to be finalized in 1983. These standards are being developed jointly by the International Organization for Standardization (ISO) and the International Telegraph and Telephone Consultative Committee (CCITT) groups, and will have wide applicability in data communications. Their basic characteristics and the open issues now being resolved are described. A status update on this fast-moving project will be presented at NCC '83.
A novel BIST approach for testing input/output buffers in FPGAs
Authors: Chen Lei, Zhang Zhi Quan, Wen Zhi Ping
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

A novel Built-In Self-Test (BIST) approach to test the configurable Input/Output buffers in Xilinx Virtex series FPGAs using Hard Macro has been proposed in this paper. The proposed approach can completely detects single and multiple stuck-at gate-level faults as well as associated routing resources in I/O buffers. The proposed BIST architecture has been successfully implemented and verified on Xilinx Virtex series FPGA. Only total of eight configurations are required to completely built-in self test of the I/O buffers in Virtex series FPGA.
FIUT: A new method for mining frequent itemsets
Authors: Yuh-Jiuan Tsay, Tain-Jung Hsu, Jing-Rung Yu
Venue: Information Sciences: an International Journal (2009)

This paper proposes an efficient method, the frequent items ultrametric trees (FIUT), for mining frequent itemsets in a database. FIUT uses a special frequent items ultrametric tree (FIU-tree) structure to enhance its efficiency in obtaining frequent itemsets. Compared to related work, FIUT has four major advantages. First, it minimizes I/O overhead by scanning the database only twice. Second, the FIU-tree is an improved way to partition a database, which results from clustering transactions, and significantly reduces the search space. Third, only frequent items in each transaction are inserted as nodes into the FIU-tree for compressed storage. Finally, all frequent itemsets are generated by checking the leaves of each FIU-tree, without traversing the tree recursively, which significantly reduces computing time. FIUT was compared with FP-growth, a well-known and widely used algorithm, and the simulation results showed that the FIUT outperforms the FP-growth. In addition, further extensions of this approach and their implications are discussed.
Arrowsmith two-node search interface: A tutorial on finding meaningful links between two disparate sets of articles in MEDLINE
Authors: Neil R. Smalheiser, Vetle I. Torvik, Wei Zhou
Venue: Computer Methods and Programs in Biomedicine (2009)

The Arrowsmith two-node search is a strategy that is designed to assist biomedical investigators in formulating and assessing scientific hypotheses. More generally, it allows users to identify biologically meaningful links between any two sets of articles A and C in PubMed, even when these share no articles or authors in common and represent disparate topics or disciplines. The key idea is to relate the two sets of articles via title words and phrases (B-terms) that they share. We have created a free, public web-based version of the two-node search tool (http://arrowsmith.psych.uic.edu), have described its development and implementation, and have presented analyses of individual two-node searches. In this paper, we provide an updated tutorial intended for end-users, that covers the use of the tool for a variety of potential scientific use case scenarios. For example, one can assess a recent experimental, clinical or epidemiologic finding that connects two disparate fields of inquiry-identifying likely mechanisms to explain the finding, and choosing promising follow-up lines of investigation. Alternatively, one can assess whether the existing scientific literature lends indirect support to a hypothesis posed by the user that has not yet been investigated. One can also employ two-node searches to search for novel hypotheses. Arrowsmith provides a service that cannot be carried out feasibly via standard PubMed searches or by other available text mining tools.
Fabrication: a tangible link between computer science and creativity
Authors: Susan L. Reiser, Rebecca F. Bruce
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

In this paper, we describe our CS0 course, 3D Modeling and Fabrication, that includes a service-learning CNC milling project as a high tech hook to interest students, both our own and middle school students, in computer science and engineering. Among the CS0 learning outcomes achieved through the design and fabrication projects are computer literacy, writing-across-the curriculum, and development of problem-solving skills such as quantitative reasoning and critical thinking. This course is situated in the Integrated Liberal Studies program at University of North Carolina at Asheville. It can be offered as part of any general education program to fulfill a computer literacy or writing-across-the-curriculum requirement. Taking an idea and nurturing it from a concept to a model, to a series of working drawings, and then to a three-dimensional prototype is exciting and fun, and leaves a tangible reminder of the creativity inherent in computer science.
Localization of the mobile agent using indirect Kalman filter in distributed sensor networks
Authors: Ji-Wook Kwon, Mun-Soo Park, Dongkyoung Chwa
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper proposes a localization algorithm for mobile agents in sensor networks using the data fusion method based on indirect Kalman filter. The fusion method of an inertial navigation sensor and sensor nodes data is used to acquire the correct position information. Since indirect Kalman filter is used for estimation of the mobile agent position, the position of the mobile agent can be estimated even when the sensor node cannot work or data acquired from the network are not reliable. Because measurement errors are used for estimation, its implementation is easy. Finally, a sequence of simulations is carried out to confirm the performance of the proposed localization algorithm.
A combined observer and filter based approach for the determination of unknown parameters
Authors: Klaus Robenack, Pranay Goel
Venue: International Journal of Systems Science (2009)

We consider the simultaneous reconstruction of the state vector and unknown parameters for a special class of non-linear parameter-dependent systems. The approach suggested here consists of two stages. First, the state is reconstructed by a reduced order unknown input observer. Second, this observer is augmented by a filter to obtain the desired parameter. The design procedure is straightforward and may be used for an online estimation of the unknown parameter. In contrast to previous work on adaptive systems, we do not require a persistence of excitation. The approach is illustrated on two non-linear cell models.
Toward an MP Model of Non-Photochemical Quenching
Authors: Vincenzo Manca, Roberto Pagliarini, Simone Zorzan
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

In this paper we apply the formalism of metabolic P systems for modeling an important phenomenon of photochemical organisms, which determines the plants accommodation to the environmental light. By using some experimental data of this phenomenon, we determine an MP system which discovers, in a specific simplified case, the regulation mechanism underling the non photochemical quenching phenomenon and reproduces, with a good approximation, the observed behavior of the natural system.
Optimizing the stack size of recursive functions
Authors: Stefan Schaeckeler, Weijia Shang
Venue: Computer Languages, Systems and Structures (2009)

For memory constrained environments, optimization for program size is often as important as, if not more important than, optimization for execution speed. Commonly, compilers try to reduce the code segment but neglect the stack segment, although the stack can significantly grow during the execution of recursive functions because a separate activation record is required for each recursive call. If a formal parameter or local variable is dead at all recursive calls, then it can be declared global so that only one instance exists independent of the recursion depth. We found that in 70% of our benchmark functions, it is possible to reduce the stack size by declaring formal parameters and local variables global. Often, live ranges of formal parameters and local variables can be split at recursive calls through program transformations. These splitting transformations allowed us to further optimize the stack size of all our benchmark functions. If all formal parameters and local variables can be declared global, then such functions may be transformable into iterations. This was possible for all such benchmark functions.
Easier, Simpler, Faster: Systems Strategy for Lean IT
Authors: Jean Cunningham, Duane Jones
Venue:  (2007)

For your lean transformation to be successful, your IT system must support it! To enhance and sustain its lean journey, a company must implement information systems that fully support and enhance the lean initiative. In Easier, Simpler, Faster: Systems Strategy for Lean IT, Jean Cunningham and Duane Jones introduce a case study of an actual lean implementation involving an IT system of a mid-size manufacturer, highlighting the IT issues that they faced during their lean transformation. This compelling book fully explains: What your company should do in regard to information systems as it implements lean. The changes that will be required in the information system to make it a partner with, rather than a barrier to, your company becoming a lean manufacturer and ultimately a lean enterprise. The opportunities that will arise for the information systems team to eliminate waste and apply lean principles in its own operations. This book will provide you with a broader vision as well as a path to what a lean system environment will look like for your company.
A complexity tradeoff in ranking-function termination proofs
Authors: Amir M. Ben-Amram
Venue: Acta Informatica (2009)

To prove that a program terminates, we can employ a ranking function argument, where program states are ranked so that every transition decreases the rank. Alternatively, we can use a set of ranking functions with the property that every cycle in the program&#x2019;s flow-chart can be ranked with one of the functions. This &#x201c;local&#x201d; approach has gained interest recently on the grounds that local ranking functions would be simpler and easier to find. The current study is aimed at better understanding the tradeoffs involved, in a precise quantitative sense. We concentrate on a convenient setting, the Size-Change Termination framework (SCT). In SCT, programs are replaced by an abstraction whose termination is decidable. Moreover, sufficient classes of ranking functions (both global and local) are known. Our results show a tradeoff: either exponentially many local functions of certain simple forms, or an exponentially complex global function may be required for proving termination.
Parameter reference immutability: formal definition, inference tool, and comparison
Authors: Shay Artzi, Adam Kieżun, Jaime Quinonez, Michael D. Ernst
Venue: Automated Software Engineering (2009)

Knowing which method parameters may be mutated during a method's execution is useful for many software engineering tasks. A parameter reference is immutable if it cannot be used to modify the state of its referent object during the method's execution. We formally define this notion, in a core object-oriented language. Having the formal definition enables determining correctness and accuracy of tools approximating this definition and unbiased comparison of analyses and tools that approximate similar definitions.We present Pidasa, a tool for classifying parameter reference immutability. Pidasa combines several lightweight, scalable analyses in stages, with each stage refining the overall result. The resulting analysis is scalable and combines the strengths of its component analyses. As one of the component analyses, we present a novel dynamic mutability analysis and show how its results can be improved by random input generation. Experimental results on programs of up to 185 kLOC show that, compared to previous approaches, Pidasa increases both run-time performance and overall accuracy of immutability inference.
Teaching Virtual Reality to undergraduates: tutorial presentation
Authors: Daniel Cliburn, Michael Doherty
Venue: Journal of Computing Sciences in Colleges (2009)

Virtual Reality (VR) is a contemporary area of research with many exciting applications in simulation and training. The National Academy of Engineering recently named "Enhance Virtual Reality" as one of fourteen "Grand Challenges for Engineering", and many students find the subject to be exciting and engaging. However, VR receives little or no attention in most undergraduate Computer Science programs. This tutorial will have two objectives. The first will be to introduce attendees to the field of VR through several freely available online lesson modules, and attendees will be shown how the modules are actually being integrated into a variety of existing courses. The second tutorial objective will be to demonstrate and describe the setup of two immersive stereo display systems: a Head-Mounted Display (HMD) unit and a stereo display wall.
Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults
Authors: A. V. Lobanov
Venue: Automation and Remote Control (2009)

Consideration was given to the key definitions, notions, and models that may be useful for transient-fault-tolerant and fault-tolerant computing in the unmanned multimachine computer systems having many interconnected autonomous computers without shared memory and centralized control organ and operating with high degree of computational parallelism, that is, executing on different computers simultaneously various tasks which interchange their information. These computations should establish reliable results under byzantine faults and controllable degradation of the system at detection of faults.
Digital Television and Banking Inclusion in Brazil: Alternatives to Access Technologies
Authors: Rivaldo Guedes Corrêa Jr., Paulo R. L. Gondim
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

One of the main challenges of the Brazilian Government for the next 10 years will be the banking inclusion of the poorest portion of the population, which has a monthly family income of less than $200 Dollars. Only 25% of the economically active population have a bank account and 15%are digitally included. On the other hand more than 90% of Brazilian people have a TV, and only 12% are connected to the internet. These aspects have lead to the use of digital television as an innovative and effective way for banking inclusion, thus significantly improving statistics related to digital and social inclusion, allowing many people to be able to get micro credit programs and enjoy more benefits of been citizens. The Brazilian Digital Television System recently developed and established in some cities, would offer interactivity capabilities, thus promoting a progressive alteration of paradigm in the relationship involved between the user and the television system. For an adequate implantation of interactive applications, the use of several options available as last mile technologies for the return channel needs to be evaluated. Emphasizing the needs and specific characteristics of T-banking for people not connected to the internet, this article aims at discussing several possibilities of access technologies,involving power line communications, cellular networks, xDS Land others, for the sake of adequate communication when using the return channel of digital television system.
Using a Taxonomy to Rationalize Multimedia Development
Authors: Rachelle S. Heller, C. Dianne Martin
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A Multimedia Taxonomy is proposed to provide a conceptual framework for multimedia based upon various media attributes. The taxonomy is expressed as a three-dimensional framework made up of fifteen different attributes related to the type, expression and context of using different media. The value of the taxonomy as a tool for the research, design and evaluation of multimedia systems is discussed. Examples of how the taxonomy has been used as a tool at various stages of multimedia development and evaluation are described.
A Framework for Adaptive Resource Management in a Multimedia Operating System
Authors: Don Oliver Amanze Oparah
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In order to support the diverse mix of multimedia applications being developed, recent research has focussed on providing the Quality of Service (QoS) required by such applications. One example of such work in the end-system is the Nemesis operating system which is used as a basis for the work described in this paper and which provides the basic mechanisms and infrastructure needed to give out meaningful QoS guarantees to applications. However there is still a need for a resource management system on top of the low-level QoS mechanisms to co-ordinate the allocation of QoS guarantees for limited physical resources amongst the user's applications.This paper presents a resource management system which dynamically balances the allocation of QoS guarantees for end-system resources amongst applications in such a way as to maximise, at any given point in time, the user's perceived utility as specified via user-defined resource allocation policies.
Small-world Model Based Clustering Division Scheme in Wireless Sensor Network
Authors: Xiucai Ye, Li Xu, Liwei Lin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Clustering is an effective approach to enhance performance in large-scale wireless sensor networks. SMCA (Small-world Model Based Clustering Algorithm), a new clustering algorithm for wireless sensor networks is proposed in this paper, with high clustering coefficient and fault-tolerant properties. SMCA selectively remove some links in a virtual way by the analysis of the edges' clustering coefficient and incorporate the limitations of the average hop counts and the number of nodes in each cluster. We analyze the gain in energy reduction in the form of average hop count reduction under the clustering algorithm, and conducted extensive simulations to validate our analysis. Simulation results show that our clustering mechanism not only balances the energy consumption, prolong the network lifetime, but also improve the network robustness, it clearly improve the network lifetime over LEACH and HEED for p=0.8, both the time until the first node dies and the time until the last node dies.
An equivalence relation on a set of words of finite length
Authors: Yotsanan Meemark, Tassawee Thitipak
Venue: European Journal of Combinatorics (2009)

In this work, we study several equivalence relations associated to some partitions of sets of finite words. We have results on words over finite fields extending the work of Bacher [R. Bacher, SL2(k) and a subset of words over k, Europ. J. Combinatorics 23 (2002) 141-147]. Cardinalities of its equivalence classes and explicit relationships between two words are determined. Moreover, we deal with words of finite length over the ring where N is a positive integer. We have arithmetic results parallel to Bacher's.