ppxscal/embedding_network huggingface dataset:
Extending Dynamic Aspect Mining with Static Information
Authors: Silvia Breu
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

Aspect mining tries to identify crosscutting concerns in legacy systems and thus supports the refactoring into an aspect-oriented design. We briefly introduce DynAMiT, a dynamic aspect mining tool that detects crosscutting concerns based on tracing method executions. While the approach is generally fairly precise, further analysis revealed that some false positives were systematically caused by dynamic binding. Furthermore, some aspect candidates were blurred or not detected due to not-sufficient tracing mechanisms of method executions when using AspectJ¿s execution pointcuts for the trace generation. We enhanced the mining capabilities of DynAMiT by taking additional static type information into account and generating the traces using call pointcuts instead: In an initial case study with AnChoVis, a 1300 LOC Java program, the number of mined aspect candidates increased by a factor of three, while the number of false positives remained zero.
A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Authors: Cheng-Yuan Hoa, Yi-Cheng Chan, Yaw-Chung Chen
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of providing a fair bandwidth allocation to those flows that share congested link in a router. A new TCP-friendly routerbased AQM (active queue management) scheme, termed WARD, is proposed to approximate the fair queueing policy. WARD is a simple packet dropping algorithm with a random mechanism, and discriminates against the flows which transmit more packets than allowed. By doing this, it not only protects TCP connections from UDP flows, but also solves the problem of competing bandwidth among different TCP versions such as TCP Vegas and Reno. In addition, WARD works quite well for TCP flow isolation even with different round trip times. In other words, WARD improves the unfair bandwidth allocation properties. Furthermore, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead.
Multimodality as a Criterion for Feature Selection in Unsupervised Analysis of Gene Expression Data
Authors: Yi Li, Wing-Kin Sung, Lance D. Miller
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

One important way that gene expression data are often analysed in an unsupervised way is to cluster the samples without reference to any annotations about them. Before clustering, the data are often subjected to a feature selection preprocessing step, in which a subset of genes are chosen for further analysis. We examine the use of multimodality as a criterion for choosing genes in feature selection, and also propose a novel measure of pairwise dissimilarity to cluster the genes that have survived the preprocessing step. The resulting multiple gene subsets usually contain those that are more strongly correlated with the sample annotations of interest than those obtained through variance-based feature selection. Class discovery may be facilitated when gene expression data are analysed using the proposed method.
Enriching Multimedia Content Description for Broadcast Environments: From a Unified Metadata Model to a New Generation of Authoring Tool
Authors: Boris Rousseau, Laure Berti-Equille, Wilfried Jouve
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper we propose a novel approach for authoring a diversity of multimedia resources (audio, video, text, images, etc). We introduce a prototype authoring tool (called M-Tool) relying on a metadata model that unifies MPEG-21 and TV-Anytime descriptions to edit and enrich audiovisual contents with metadata. Additional innovative functionalities extending the M-Tool are also presented. This new generation of metadata authoring tools is designed and currently used for scenarios of TV and News broadcasting, and video on demand broadcasting in the framework of the IST Integrated European Project ENTHRONE.
On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks
Authors: Quanhong Wang, Glen Takahara, Hossam Hassanein, Kenan Xu
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we explore the relay node (RN) placement problem in a heterogeneous Wireless Sensor Network (WSN). The objective of the RN placement is to use a minimum number of additional RNs to enable the relaying of given traffic on existing nodes to the base station (BS) under the energy constraints. We assume RNs can adjust their transmission power according to the distance to the intended destination. To make best use of power adaptivity of RN, we propose two heuristic solutions, namely, Independent Placement with Direct Allocation (IPDA) and Collaborative Placement with Locally Optimal Allocation Decision (CPLOAD). Furthermore, a lower bound on the minimum number of additional RNs is provided. The effectiveness of our proposals is investigated through simulation using numerical examples.
An adaptive model of virtual enterprise based on dynamic web service composition
Authors: Bo Zhou, Zhi-jun He, Jing-fan Tang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With the development of web services related technologies, the enterprise business systems can be encapsulated through web services. The service oriented architecture can be adopted for the enterprise business processes. Specific interfaces are introduced between the web services of different enterprises for data exchanging to achieve the cross-enterprise systems integration. Different enterprises can be organized into virtual enterprise through web services to share resources and achieve win-win. This paper introduces an adaptive model of virtual enterprise based on dynamic composition of web services (DCWS-VE). A service execution plan will be dynamically built to aim at the target of the virtual enterprise through the composition of web services. The development and deployment of web services is separated to support the dynamically deploying and binding of the web service at run time. The members in the virtual enterprise will be located through the dynamic web service discovery based on DAML+OIL logic reasoning, and selected through the dynamic web services negotiation with multi- steps protocol to organize the virtual enterprise at run time. Electronic contract is adopted in the organizing process of virtual enterprise to achieve the stable running.
Design and Implementation of an Efficient Search Mechanism Based on the Hybrid P2P Model for Ubiquitous Computing Systems
Authors: Tsutomu Inaba, Takuro Okawa, Yoshitomo Murata, Hiroyuki Takizawa, Hiroaki Kobayashi
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

To realize ubiquitous computing using a huge number of computing resources on the Internet, this paper presents an effective computing resource search mechanism based on peer-to-peer (P2P) ad-hoc networking that finds appropriate resource providers for each resource user. The main idea of the proposed mechanism is to classify the attributes of computing resources into two groups: a static attribute group and a dynamic attribute group. The attributes classified into the static attribute group are managed in a centralized manner, while the attributes in the dynamic attribute group are managed in a decentralized manner. In resource searching, this hybrid-type resource management mechanism can limit the candidates based on the static attributes firsts, and then the appropriate resources can be searched according to the dynamic attributes only within the area restricted by the static attributes. Therefore, the mechanism can prevent the network traffic explosion due to the flodding search in native P2P systems. Performance evaluation is carried out theoretically and experimentally. The results of theoretical evaluation indicate that the proposed model is well-suited for the resource search required by the ubiquitous computing, compared with both a typical server-client model and a P2P-based model. Prototyping the proposed mechanism experimentally shows its feasibility.
Retrieval Failure and Recovery in Recommender Systems
Authors: David Mcsherry
Venue: Artificial Intelligence Review (2005)

In case-based reasoning (CBR) approaches to product recommendation, descriptions of the available products are stored in a case library and retrieved in response to a query representing the user's requirements. We present an approach to recovery from the retrieval failures that often occur when the user's requirements are treated as constraints that must be satisfied. Failure to retrieve a matching case triggers a recovery process in which the user is invited to select from a recovery set of relaxations (or sub-queries) of her query that are guaranteed to succeed. The suggested relaxations are ranked according to a simple measure of recovery cost defined in terms of the importance weights assigned to the query attributes. The recovery set for an unsuccessful query also serves as a guide to continued exploration of the product space when none of the cases initially recommended by the system is acceptable to the user
Generalized Performance Management of Multi-Class Real-Time Imprecise Data Services
Authors: Mehdi Amirijoo, Nicolas Chaufette, Jorgen Hansson, Sang H. Son, Svante Gunnarsson
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

The intricacy of real-time data service management increases mainly due to the emergence of applications operating in open and unpredictable environments, increases in software complexity, and need for performance guarantees. In this paper we propose an approach for managing the quality of service of real-time databases that provide imprecise and differentiated services, and that operate in unpredictable environments. Transactions are classified into service classes according to their level of importance. Transactions within each service class are further classified into subclasses based on their quality of service requirements. This way transactions are explicitly differentiated according to their importance and quality of service requests. The performance evaluation shows that during overloads the most important transactions are guaranteed to meet their deadlines and that reliable quality of service is provided even in the face of varying load and execution time estimation errors.
DWDM-RAM: enabling Grid services with dynamic optical networks
Authors: S. Figueira, S. Naiksatam, H. Cohen, D. Cutrell, P. Daspit, D. Gutierrez, D. B. Hoang
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Advances in Grid technology enable the deployment of data-intensive distributed applications, which require moving terabytes or even petabytes of data between data banks. The current underlying networks cannot provide dedicated links with adequate end-to-end sustained bandwidth to support the requirements of these Grid applications. DWDM-RAM is a novel service-oriented architecture, which harnesses the enormous bandwidth potential of optical networks and demonstrates their on-demand usage on the OMNInet. Preliminary experiments suggest that dynamic optical networks, such as the OMNInet, are the ideal option for transferring such massive amounts of data. DWDM-RAM incorporates an OGSI/OGSA compliant service interface and promotes greater convergence between dynamic optical networks and data intensive Grid computing.
Real-Time Animation of Complex Hairstyles
Authors: Pascal Volino, Nadia Magnenat-Thalmann
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

True real-time animation of complex hairstyles on animated characters is the goal of this work, and the challenge is to build a mechanical model of the hairstyle which is sufficiently fast for real-time performance while preserving the particular behavior of the hair medium and maintaining sufficient versatility for simulating any kind of complex hairstyles. Rather than building a complex mechanical model directly related to the structure of the hair strands, we take advantage of a volume free-form deformation scheme. We detail the construction of an efficient lattice mechanical deformation model which represents the volume behavior of the hair strands. The lattice is deformed as a particle system using state-of-the-art numerical methods, and animates the hairs using quadratic B-Spline interpolation. The hairstyle reacts to the body skin through collisions with a metaball-based approximation. The model is highly scalable and allows hairstyles of any complexity to be simulated in any rendering context with the appropriate trade off between accuracy and computation speed, fitting the need of Level-of-Detail optimization schemes.
A Synthetic Database to Assess Segmentation Algorithms
Authors: Luiz S. Oliveira, Alceu S. Jr. Britto, Robert Sabourin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we describe a synthetic database composed of 273,452 handwritten touching digits pairs to assess segmentation algorithms. It contains several different kinds of touching and it was generated by connecting 2,000 images of isolated digits extracted from the NIST SD19. In order to get a better insight on the proposed database and establish some parameters for further comparisons, we carried out experiments using four state-of-the-art segmentation algorithms.
With great reliability comes great responsibility: tradeoffs of run-time policy on high reliability systems
Authors: S. D. Kleban, J. R. Johnston, J. A. Ang, S. H. Clearwater
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In this paper we describe a simulation study to improve performance on a large highly utilized cluster at Sandia National Laboratories. The unique characteristic about the cluster is that there are very few constraints on job size. In particular, the run-time is limited only by system times which occur about every two weeks. The major contribution of this paper is that we quantify the difference in makespan between running a single long job and its equivalent in many shorter jobs. We find that running longer jobs is beneficial to the facility as a whole when the cycle-weighted makespans are considered and that running shorter jobs has an overall beneficial effect on the makespan for the jobs taken unweighted and for most users.
In the News
Authors: Laurianne McLaughlin Bart Massey
Venue: IEEE Software (2006)

What Microsoft's Identity Metasystem Means to DevelopersLaurianne McLaughlin (freelance writer)A multiplicity of identity technologies creates difficulties and complexities for both users and developers. Microsoft's proposed answer to this problem is an identity metasystem--a framework that lets varying identity technologies communicate and interoperate using common standards.Open Source and Government Systems: GOSCON 2005Bart Massey, Portland State UniversityThe First International Government Open Source Conference (GOSCON 2005) provided a forum to discuss issues of open source software in a government setting. This conference report highlights some of the key people and issues discussed at GOSCON 2005.
2D Conditional Random Fields for Web information extraction
Authors: Jun Zhu, Zaiqing Nie, Ji-Rong Wen, Bo Zhang, Wei-Ying Ma
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The Web contains an abundance of useful semistructured information about real world objects, and our empirical study shows that strong sequence characteristics exist for Web information about objects of the same type across different Web sites. Conditional Random Fields (CRFs) are the state of the art approaches taking the sequence characteristics to do better labeling. However, as the information on a Web page is two-dimensionally laid out, previous linear-chain CRFs have their limitations for Web information extraction. To better incorporate the two-dimensional neighborhood interactions, this paper presents a two-dimensional CRF model to automatically extract object information from the Web. We empirically compare the proposed model with existing linear-chain CRF models for product information extraction, and the results show the effectiveness of our model.
Replication for Adaptive Responsiveness in Service-Oriented Systems
Authors: Stephen S. Yau, Gaurav Goyal, Yisheng Yao
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

A major advantage of Service-Oriented Architecture (SOA) is the ability to enable rapid formation of large-scale distributed systems. A dominant factor for the success of service-oriented system is the responsiveness of services, i.e. the availability and timeliness of services when needed. As different levels of responsiveness are expected under various situations, a major limitation of most existing service-oriented systems is that they serve all requests in the order of their arrival. Hence, all clients receive the same level of responsiveness. In this paper, an approach to efficiently and transparently providing adaptive responsiveness is presented. This approach includes an extended SOA architecture with replication and situation-aware load balancing for enabling service providers to offer adaptive responsiveness to clients. Moreover, our approach provides adaptable system capacity at runtime which reduces the cost for service replications, such as energy consumption. Experimental results are also presented to demonstrate the advantages of our approach.
Efficient Pattern Discovery for Semistructured Data
Authors: Zhou Feng, Wynne Hsu, Mong Li Lee
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The process of discovering frequent patterns from large semistructured data repositories is one of the hardest categories of tree mining problems, since it involves the discovery of unordered embedded tree patterns. Existing work has focused primarily on the discovery of ordered, induced trees. This work proposes a divide-and-conquer algorithm called WTIMiner to discover the complete set of frequent unordered embedded subtrees. The algorithm successfully reduces the complexity of pattern matching and counting problem that a regular tree mining algorithm faces. Experimental results demonstrate the efficiency and scalability of WTIMiner in terms of both time and space.
The &para; key: nuisance or necessity?
Authors: Jonathan Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

Last year I wrote an article in with this title. To summarize it for those of you with short memories or recent memberships: text formatting people are used to text formatting programs which do everything in response to commands like <dpformat> /p .s 3; and they think such commands merely natural. 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
A QoS-Tunable Scheme for ATM Cell Scheduling Using Evolutionary Fuzzy System
Authors: Ju Hui Li, Meng Hiot Lim, Qi Cao
Venue: Applied Intelligence (2005)

In packet switching network such as asynchronous transfer mode (ATM), the switching characteristics is important in delivering the guaranteed QoS (Quality of Service) level of the network. Many methods have been developed to control cell flow for shared bandwidth. The first-in first-out (FIFO), static priority (SPR), dynamically weighted priority scheduling (DWPS) (T. Lizambri, F. Duran, and S. Wakid, 1999) and weighted fair queuing (WFQ) (R. Händel, M.N. Huber, and S. Schröder, c1998) are some of the schemes for managing the shared bandwidth. Due to the diversity of services supported in ATM network, it is typical for the traffic flow pattern to change dramatically. A common trait of these algorithms is that their mechanisms are fixed, and they cannot adapt efficiently for such traffic flow changes. In order to address this, we propose an evolutionary fuzzy system (EFS) scheme to do ATM cell scheduling. With EFS, the fuzzy switching algorithm can be adjusted to track the changes in the pattern of traffic flow in order to maintain the desired level of performance. The desired quality of service (QoS) performance level can be conveniently achieved by tuning the parameters of the fitness function.
On Foreground-Background Separation in Low Quality Color Document Images
Authors: Utpal x. Utpal Garain, Thierry Paquet, Laurent Heutte
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes an adaptive method for separation of foreground and background in low quality color document images. A connected component labelling is initially implemented to capture the spatially connected similar color pixels. Next, dominant background components are determined to divide the entire image is into number of grids each representing local uniformity in illumination, background, etc. Finally foreground parts are located using local information around them. Several color images of old historical documents including manuscripts of high importance are used in the experiment. Apart from a qualitative evaluation, results are quantitatively compared with one popular foreground/background separation technique.
An Elliptic Curve Trapdoor System
Authors: Edlyn Teske
Venue: Journal of Cryptology (2006)

We propose an elliptic curve trapdoor system which is of interest in key escrow applications. In this system, a pair (Es, Epb) of elliptic curves over F2161 is constructed with the following properties: (i) the Gaudry-Hess-Smart Weil descent attack reduces the elliptic curve discrete logarithm problem (ECDLP) in Es(F2161) to a hyperelliptic curve DLP in the Jacobian of a curve of genus 7 or 8, which is computationally feasible, but by far not trivial; (ii) Es is isogenous to Es; (iii) the best attack on the ECDLP in Es(F2161) is the parallelized Pollard rho method. The curve Es is used just as usual in elliptic curve cryptosystems. The curve Es is submitted to a trusted authority for the purpose of key escrow. The crucial difference from other key escrow scenarios is that the trusted authority has to invest a considerable amount of computation to compromise a user's private key, which makes applications such as widespread wire-tapping impossible.