ppxscal/embedding_network huggingface dataset:
Finding Representative Set from Massive Data
Authors: Feng Pan, Wei Wang, Anthony K. H. Tung, Jiong Yang
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and computers. In this project, we propose a new model for identifying representative set from a large database. A representative set is a special subset of the original dataset, which has three main characteristics: It is significantly smaller in size compared to the original dataset. It captures the most information from the original dataset compared to other subsets of the same size. It has low redundancy among the representatives it contains. We use information-theoretic measures such as mutual information and relative entropy to measure the representativeness of the representative set. We first design a greedy algorithm and then present a heuristic algorithm that delivers much better performance. We run experiments on two real datasets and evaluate the effectiveness of our representative set in terms of coverage and accuracy. The experiments show that our representative set attains expected characteristics and captures information more efficiently.
"RAD SIM"
Authors: Robert O. Harvey
Venue: ACM SIGSIM Simulation Digest (1979)

"RAD SIM" is a GPSS model developed to simulate Radiology Room utilization. The model provides reports that facilitate the interaction of the management consultant and the appropriate client. The simulation methodology provides the users with the ability to respond to "what if" questions, and to test changes to the Radiology operating system without implementing the modifications.The model requires data to be collected on patient arrivals, procedure scheduling criteria, and radiology room capabilities. Output from the model reports individual room utilization and waiting lines. Other statistical information is provided in the simulation report."RAD SIM" has been used in a number of consulting engagements with major success. Radiologist and consultant interface has proved to be quite beneficial for the long-term success of systems changes. 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
Viewing Low Contrast, High Dynamic Range Images with MUSCLE
Authors: Robert Whatmough
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper describes a novel method for enhancing an image for display when it has faint detail, high dynamic range or uneven illumination. The method processes grey-scale images by extracting local detail at several scales, equalising the contrast for each scale then averaging the results. It is extended to colour images through the use of an appropriate colour space. Problems caused by quantisation, noise, compression artefacts and coloured haze are considered and treated. The results are widely applicable to surveillance, medical and consumer digital camera imagery.
Reducing Design Verification Cycle Time through Testbench Redundancy
Authors: Aman Kokrady, Theo J. Powell, S. Ramakrishnan
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Design flows for modern-day System-on-Chip (SoC) designs focus on reducing the design cycle time, but not on design verification time. Nearly 70% of SoC design cycle time is consumed by design verification [10]. Most functional verification happens through simulation. This paper proposes a technique by which the simulation times of time consuming verification steps can be reduced. The proposed technique exploits the testbench redundancy during functional simulations to reduce simulation time. We demonstrate how the testbench redundancy can be exploited to gain valuable cycle time during memory BIST simulations.
Towards an Aspect-Oriented Agile Requirements Approach
Authors: Joao Araujo, Joao Carlos Ribeiro
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The success of the application of agile software development approaches on building evolvable systems depends on how efficiently the changeable requirements are elicited and structured by software engineers. Current agile methods provide suitable approaches to define requirements of such systems in a systematic and simple way. Nevertheless, the crosscutting nature of some requirements is not dealt with by these approaches. Aspect-Oriented Requirements Engineering tackles the problem of crosscutting requirements, and its concepts can be used to address this problem in the context of agile software development. This work describes how aspects could be integrated to an agile software development approach at requirements level.
Input encoding method for identifying transcription start sites in RNA polymerase II promoters by neural networks
Authors: L. S. Ho, J. C. Rajapakse
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

We present a novel approach to encode inputs to neural networks for the recognition of transcription start sites in RNA polymerase II promoter regions. The approach is based on Markov models that represent TATA-box and Inr transcription binding sites, characterizing a promoter. The Markovian parameters are used as inputs to three neural networks which learn potential distant relationships between the nucleotides at promoter regions. Such an approach allows for incorporating the biological contextual information of the promoter sites into neural network systems and implementing higher-order Markov models of the promoters. Our experiments on a human promoter data set, available at [19], showed an increased correlation coefficient rate of 0.69 on average, which is better than the earlier reported best rate of 0.65 by NNPP 2.1 method.
Towards Making Agent UML Practical: A Textual Notation and a Tool
Authors: Michael Winikoff
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Design notations play an important role in designing software. Agent UML (AUML), which extends the widelyused UML notation, has proposed a number of notations for modelling agent systems. Arguably the most influential of the AUML notations has been the sequence diagram for defining interaction patterns between agents. However, AUML is not precisely and formally defined, and there is very little in the way of tool support available. In this paper we describe initial steps at resolving these two issues: we precisely define the syntax of (a subset of) AUML by using a textual notation, and we describe a tool that takes a textual AUML protocol and automatically generates the standard graphical rendition.
OpenSPACE: An Open Service Provisioning and Consuming Environment for Grid Computing
Authors: Hailong Sun, Liang Zhong, Jinpeng Huai, Yunhao Liu
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Our key project, CROWN (China Research and Development Environment Over Wide-area Network), aims to empower in-depth integration of resources and cooperation of researchers nationwide and worldwide using grid technologies. It adopts service oriented architecture. Current service grids do not consider the separation of services and underlying resources, potentially causing low job processing efficiency and resource utilization. In this paper, we propose a novel architecture for grid systems, called Open Service Provisioning and Consuming Environment (OpenSPACE). OpenSPACE is adopted by CROWN and is evaluated by prototype implementation based on real applications.
Agent-based Computing for Enterprise Collaboration - Services and Agents
Authors: Federico Bergenti, Giacomo Cabri
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The third "Agent-based Computing for Enterprise Collaboration" workshop at WETICE aimed at bringing together researcher in the field of collaboration supported by software agents. This paper briefly discusses the content of the papers as presented by the participating authors. Moreover, there is a summary of the main issues of the concluding panel discussions.
Improving data cache performance with integrated use of split caches, victim cache and stream buffers
Authors: Afrin Naz, Mehran Rezaei, Krishna Kavi, Philip Sweany
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

In our prior work we explored a cache organization providing architectural support for distinguishing between memory references that exhibit spatial and temporal locality and mapping them to separate caches.That work showed that using separate (data) caches for indexed or stream data and scalar data items could lead to substantial improvements in terms of cache misses. In addition, such a separation allowed for the design of caches that could be tailored to meet the properties exhibited by different data items.In this paper, we investigate the interaction between three established methods: split cache, victim cache and stream buffer. Since significant amounts of compulsory and conflict misses are avoided, the size of each cache (i.e., array and scalar), as well as the combined cache capacity can be reduced. Our results show that on average 55% reduction in miss rates over the base configuration.
Context-sensitive Access Control Model and Implementation
Authors: Weili Han, Junjing Zhang, Xiaobo Yao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Context is a key factor in making make access control decision in modern information system. But a formal context model is needed to guide research of implementation of Context-sensitive Access Control (CSAC) model. This paper formally defines a Context-sensitive Access Control, which consists of extendible context model, authorization policy model, request model, authorization algorithm, revoke algorithm, access control decision algorithm, and so on. Then the paper introduces some related algorithms and CSAC implementation. Finally, the paper introduces an access control service for enterprise applications which centralizes all access control functions into one service.
Efficient Content Location Based On Interest-Cluster in Peer-to-Peer System
Authors: Xi Tong, Dalu Zhang, Zhe Yang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Content location is a challenging problem in decentralized peer-to-peer systems. And queryflooding algorithm in Gnutella system suffers from poor scalability and considerable network overhead. Currently, based on the Small-world pattern in the P2P system, a piggyback algorithm called interestbased shortcuts gets a relatively better performance. However, we believe it could be improved and become even more efficient, and a cluster-based algorithm is put forward. The main concern of our algorithm is to narrow the search scope in content location. Resource shortcuts are grouped into clusters according to their contents, and resource queries are only searched in related shortcut clusters, so that the search efficiency is guaranteed and the network bandwidth is saved. In our experiment, cluster-based algorithm uses only 40% shortcuts roughly, compared with the former algorithm, and the same success rate is achieved. At the end, we refer the relationship between clusterbased algorithm and Semantic Overlay Networks, which is a potential kind of overlay in the future.
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Authors: Peter Filter, Hana Kubatova
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of faults should be detected by the pseudo-random phase, to reduce the number of faults to be covered in the deterministic one. We study the properties of different pseudo-random pattern generators. Their successfulness in fault covering strictly depends on the tested circuit. We examine properties of LFSRs and cellular automata. Four methods enhancing the pseudo-random fault coverage have been proposed. Then we propose a universal method to efficiently compute test weights. The observations are documented on some of the standard ISCAS benchmarks and the final BIST circuitry is synthesized using the Column-Matching method.
A Wireless MAC Protocol Using Implicit Pipelining
Authors: Xue Yang, Nitin H. Vaidya
Venue: IEEE Transactions on Mobile Computing (2006)

In distributed multiple access control protocols, two categories of overhead are usually associated with contention resolution. One is channel idle overhead, where all contending stations are waiting to transmit. Another is collision overhead, which occurs when multiple contending stations attempt to transmit simultaneously. Either idle overhead or collision overhead being large, contention resolution algorithm would be inefficient. Prior research work tries to minimize both the idle and the collision overheads using various methods. In this paper, we propose to apply "pipelining” techniques to the design of multiple access control protocol so that channel idle overhead could be (partially) hidden and the collision overhead could be reduced. While the concept of pipelined scheduling can be applied to various MAC protocol designs in general, in this paper, we focus on its application to IEEE 802.11 DCF. In particular, an implicitly pipelined dual-stage contention resolution MAC protocol (named DSCR) is proposed. With IEEE 802.11, the efficiency of contention resolution degrades dramatically with the increasing load due to high probability of collision. Using the implicit pipelining technique, DSCR hides the majority of channel idle time and reduces the collision probability, hence, improves channel utilization, average access delay, and access energy cost over 802.11 significantly both in wireless LANs and in multihop networks. The simulation results, as well as some analysis, are presented to demonstrate the effectiveness of DSCR.
NCTUns network simulation and emulation for wireless resource management: Research Articles
Authors: Shie-Yuan Wang, Yi-Bing Lin
Venue: Wireless Communications Mobile Computing (2005)

This paper describes NCTUns, an innovative network simulator and emulator for wireless and mobile networks. Effects of various radio resource management and quality of service (QoS) schemes on higher-layer protocols and real-world applications can be easily studied using NCTUns. In this paper, we elaborate on NCTUns simulation methodology, architecture, design, functionalities, performance, and applications. NCTUns simulation for wireless ad hoc, sensor, inter-vehicle communication networks, GPRS cellular networks, and wireless mesh networks are also illustrated. More details about this tool can be found in . Copyright &copy; 2005 John Wiley & Sons, Ltd.
A computer simulation model for medical school planning
Authors: Robert Austin Milch, Narain D. Bhatia
Venue: ACM SIGSIM Simulation Digest (1977)

Management and management accounting concepts and practices---which at an earlier time were of interest to only a few medical school administrators and to still fewer medical school faculty members---have suddenly taken on urgent proportions for many, perhaps even most, American medical schools. Faced with an unhappy combination of increasing demands for ever-broadening public service and public accountability on the one hand, and of an inflation economy with steadily escalating scarcities of manpower, materials, time and, especially, financial resources on the other, medical school faculties and administrators all too frequently now find themselves in the distinctly unenviable position of having to make complex policy and operating decisions of a nature and scope never before required.
Boxology of NBA and TA: A Basis for Understanding Software Architecture
Authors: Andrew J. Malton, Richard C. Holt
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Box-and-arrow diagrams seem inevitable for presentation of software architecture; however, the term "boxology" often mocks their over-use, especially when informal. We introduce in this paper a formal boxology to serve as a semantic domain for graph-based software architecture representation languages: the Nested Boxes and Arrows (NBA) model. NBA graphs use commonly-adopted features of structure diagrams for software: boxes for objects, arrows for relations, attributes for values, and a containment hierarchy. NBA graphs are visualized using a number of conventions, and are transmitted in exchange languages such as GXL and TA. The NBA model is formalized as typed graphs with attributes and an identified spanning tree (containment). Meta-modeling is defined and formalized by schemas, which are also NBA graphs. The universal schema is defined. A number of tools have been developed to query, manipulate and visualize NBA graphs.
Multimedia Enlightenment: Transcendent Experiences with the Help of Technology
Authors: Michael J. McGandy
Venue: IEEE MultiMedia (2006)

We may not often consider how the video we transport and display will contribute to, if not actually define, our environment. What if video became a primary means for facilitating experiences? Here, Michael McGandy writes about Bill Viola, who is among the first and certainly among the leading video artists. Viola's workits content, vibrancy, and scalecreates whole environments and rich user experiences with a sophisticated technology that's nevertheless well hidden. His work represents the perfect marriage of art and cutting-edge technology to facilitate the exploration of innermost reality.
Web Query Automatic Expansion Based on Tolerance Rough Set
Authors: Gaoxiang Yi, Heping Hu
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Much effort has been made to provide tools for searching information on the Web. As a result, many web search engines are available for user to utilize the rich web resources. However, due to the enormous size of the Web and low precision of user queries, results returned from present web search engines are not always satisfactory. One approach to resolve this problem is by expanding the query using "correlated" terms. In this paper, a method for expansion query based on tolerance rough set is presented, which made use of the term co-occurrence to enrich description of Web query. Experiments on the proposal approach were performed. The precision comparison between the proposal system and the well-known Web search engine --Google on a collection of 5,000 web pages was presented. As a result, improvement of the results precision was achieved by using tolerance classes.
The Capacity and Non-Simultaneously Multicommodity Flow Problem in Wide Area Network and Data Flow Management
Authors: Abdulhakim F. Zantuti
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper presents the formulation of the capacity and non-simultaneously multicommodity flow assignment problem in the wide area computer network and data flow management. The problem consists in selection of non-simultaneously multicommodity flow routes and channel capacities in order to minimize the average delay per packet subject to budget constraint.
Middleware for protocol-based coordination in dynamic networks
Authors: Kurt Schelfthout, Danny Weyns, Tom Holvoet
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

Pervasive and ad hoc computing applications are frequently deployed in dynamic networks. Due to mobility of the computing nodes, their unreliability, or a limited communication range, at any time a node may enter or leave an interaction between a group of application components. Middleware approaches have been proposed to deal with these dynamics, by supporting the dissemination (or gathering) of information in dynamic networks. In our experience however, applications frequently need to execute a complete protocol to coordinate. Existing middleware can then be used as a discovery mechanism, but offers no support for handling the protocol itself. This paper presents a middleware model that enables an easier implementation of distributed protocols that need to take into account the continuously changing context in the dynamic network. It uses roles as a first order abstraction, handles the distributed instantiation of roles in an interaction session, and maintains the session as nodes in the mobile network move. We describe our experience with applying the middleware in a case study on a system of automatic guided vehicles.
Chemical mechanical polishing of polycarbonate and poly methyl methacrylate substrates
Authors: Z. W. Zhong, Z. F. Wang, B. M. P. Zirajutheen
Venue: Microelectronic Engineering (2005)

In recent years, polymeric materials such as polycarbonate (PC) and poly methyl methacrylate (PMMA) are replacing silicon as major substrates in microfluidic system fabrication due to the outstanding features like low cost and good chemical resistance. In this study, chemical mechanical polishing (CMP) of PC and PMMA substrates was investigated. First, four types of slurry were tested. Then, the slurry producing relatively high material removal rate (MRR) and low surface roughness was chosen, and experiments were designed and carried out to investigate the effects of key process parameters. The experimental results show impacts of key CMP process parameters on MRR and surface finish of PC and PMMA substrates. An increase in head load or table speed would cause an increase in surface roughness heights and MRR. The surface quality of the polymers after CMP appeared to be acceptable for most of microelectromechanical system applications as the process conditions were restrained within the process window.
A New Support Vector Machine for Multi-class Classification
Authors: Yingjie Tian, Zhiquan Qi
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Support Vector Machines (SVMs) for classification - in short SVC - have been shown to be promising classification tools in many real-world problems. How to effectively extend binary SVC to multi-class classification is still an on-going research issue. In this article, instead of solving quadratic programming (QP) in Algorithm K-SVCR and Algorithm v-K-SVCR, a linear programming (LP) problem is introduced in our algorithm. This leads to a new algorithm for multi-class problem, K-class Linear programming Support Vector Classification-Regression(K-LSVCR). Numerical experiments on artificial data sets and benchmark data sets show that the proposed method is almost as efficient asK-SVCR and v-K-SVCR, while considerably faster than them.
The product structure of fuzzy rough sets on a group and the rough T-fuzzy group
Authors: Jiang Jiashang, Wu Congxin, Chen Degang
Venue: Information Sciences: an International Journal (2005)

In this paper we study the product structures of rough fuzzy sets on a group, we also propose the notions of T-rough fuzzy subgroups in a group with respect to a T-fuzzy normal subgroup and study their properties.