ppxscal/embedding_network huggingface dataset:
Improving BER Using RD Code for Spectral Amplitude Coding Optical CDMA Network
Authors: Hilal Adnan Fadhil, S. A. Aljunid, R. Badlishah Ahmad
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A new code for spectral-amplitude coding optical code-division multiple-access system is proposed called Random diagonal (RD) code. This code is constructed using code segment and data segment. One of the important properties of this code is that the cross correlation at data segment is always zero, which means that Phase Intensity Induced Noise (PIIN) is reduced. For the performance analysis, the effects of phase-induced intensity noise, shot noise, and thermal noise are considered simultaneously. Bit-error rate (BER) performance is compared with Hadamard and Modified Frequency Hopping (MFH) codes. It is shown that the system using this new code matrices not only suppress PIIN, but also allows larger number of active users compare with other codes. Simulation results shown that using point to point transmission with three encoded channels, RD code has better BER performance than other codes, also its found that at 0 dbm PIIN noise are 10-10 and 10-11 for RD and MFH respectively.
Annotating images and image objects using a hierarchical dirichlet process model
Authors: Oksana Yakhnenko, Vasant Honavar
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

Many applications call for learning to label individual objects in an image where the only information available to the learner is a dataset of images with their associated captions, i.e., words that describe the image content without specifically labeling the individual objects. We address this problem using a multi-modal hierarchical Dirichlet process model (MoM-HDP) - a nonparametric Bayesian model which provides a generalization for multi-model latent Dirichlet allocation model (MoM-LDA) used for similar problems in the past. We apply this model for predicting labels of objects in images containing multiple objects. During training, the model has access to an un-segmented image and its caption, but not the labels for each object in the image. The trained model is used to predict the label for each region of interest in a segmented image. MoM-HDP generalizes a multi-modal latent Dirichlet allocation model in that it allows the number of components of the mixture model to adapt to the data. The model parameters are efficiently estimated using variational inference. Our experiments show that MoM-HDP performs just as well as or better than the MoM-LDA model (regardless the choice of the number of clusters in the MoM-LDA model).
Content and context for mobile television: Integrating trial, expert and user findings
Authors: Dimitri Schuurman, Lieven De Marez, Pieter Veevaete, Tom Evens
Venue: Telematics and Informatics (2009)

Mobile television brings together two contemporary social developments: enhanced end-user mobility and new forms of access to media content. DVB-H trial activities worldwide reveal the industry's belief in broadcast mobile television as 'the next big thing'. To date however, these trials are mostly technology-driven and tend to overlook the user. As the past has innumerably proven, end-user acceptance and success of new media innovations are highly dependent on content, as the end-user can be considered as rather technology-agnostic. Evidently, content - suited to the consumer's demands - is assumed to be a main key factor for the success of mobile television. In order to get a grip on the demands for innovative and possible killer-application content and to bypass the sometimes biased viewpoints from industry-funded research, we utilized a fourfold research design. We summarized the (scarce) literature regarding mobile TV, conducted a meta-analysis on user-studies from mobile TV-trials, surveyed a panel of 35 trial as well as non-trial mobile TV-experts and conducted a user study with 405 respondents. In this paper, we compare the views from these four sources regarding context (possible mobile peak times, usage duration and usage goals) and content for mobile TV. This comparison leaves us with a set of relevant concepts and a better understanding of different views and beliefs regarding mobile TV, which paves the way for a more user-centric approach.
An overview of application integration concepts
Authors: Irimia Roxana-Adina
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In the context of the explosive growth of the IT dispersion, the importance of enterprise integration has developed significantly. Enterprise integration takes a strategic and coordinated view of an organization's integration needs. Enterprise integration is suited where an organization's business requirements dictate the need for the real-time processing of complex business processes across different IT applications and parts of the enterprise. Enterprise integration solutions typically involve some form of integration broker that coordinates the flow of information from one IT application to another. Importantly, however, organizations should not underestimate the many technical and management challenges that need to be overcome in order to achieve enterprise integration success. Information technology has known a continuous expansion in terms of the sphere of applicability and use of the informational products, but also in the development of new business opportunities created by the transition to the digital economy. The enterprise integration can be defined as the strategic consideration of the process, methods, tools and technologies associated with achieving interoperability between IT applications both within and external to the enterprise to enable collaborative business processes. Importantly, enterprise integration is not purely about technology integration. Enterprise integration also includes a consideration of business processes that cut across various IT applications, and so provides the overarching basis for technology integration, taking into consideration the managerial and technical challenges that must be overcomes in order to achieve a full applications and processes integration.
Bayesian Nonlinear Principal Component Analysis Using Random Fields
Authors: Heng Lian
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We propose a novel model for nonlinear dimension reduction motivated by the probabilistic formulation of principal component analysis. Nonlinearity is achieved by specifying different transformation matrices at different locations of the latent space and smoothing the transformation using a Markov random field type prior. The computation is made feasible by the recent advances in sampling from von Mises-Fisher distributions. The computational properties of the algorithm are illustrated through simulations as well as an application to handwritten digits data.
The limits to IPR standardization policies as evidenced by strategic patenting in UMTS
Authors: Rudi Bekkers, Joel West
Venue: Telecommunications Policy (2009)

The impact of patents and patent royalties are a major concern of standards setting organizations. This study examines the patents filed in the standardization of UMTS, the third-generation mobile phone technology developed under sponsorship of the European Telecommunications Standards Institute (ETSI) and others, using a patent policy developed in response to issues faced in the earlier GSM (nee Group Special Mobile) standardization. After contrasting firm strategies and policy effectiveness between the GSM and UMTS efforts, the paper reviews the potential impact of potential changes to the ETSI IPR (intellectual property rights) policy.
Application Specific Routing Algorithms for Networks on Chip
Authors: Maurizio Palesi, Rickard Holsmark, Shashi Kumar, Vincenzo Catania
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

In this paper we present a methodology to develop efficient and deadlock free routing algorithms for Network-on-Chip (NoC) platforms which are specialized for an application or a set of concurrent applications. The proposed methodology, called Application Specific Routing Algorithm (APSRA), exploits the application specific information regarding pairs of cores which communicate and other pairs which never communicate in the NoC platform to maximize communication adaptivity and performance. The methodology also exploits the known information regarding concurrency/non-concurrency of communication transactions among cores for the same purpose. We demonstrate, through analysis of adaptivity as well as simulation based evaluation of latency and throughput, that algorithms produced by the proposed methodology give significantly higher performance as compared to other deadlock free algorithms for both homogeneous as well as heterogeneous 2D mesh topology NoC systems. For example, for homogeneous mesh NoC, APSRA results in approximately 30% less average delay as compared to Odd-Even algorithm just below saturation load. Similarly the saturation load point for APSRA is significantly higher as compared to other adaptive routing algorithms for both homogeneous and non-homogeneous mesh networks.
Pileus internet umbrella: tangible mobile interface of a lovely umbrella
Authors: Takashi Matsumoto, Sho Hashimoto
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Pileus Internet Umbrella is a tangible mobile interface using familiarity of an umbrella to expand user's real world activities and experiences. It has a large visual screen on the top surface, wireless Internet connection, a camera, and motion and location sensors for embodied interaction. In this paper, we report a design intention for user experiences created by Pileus. Pileus has been experimented with several users and it points out requirements of a design of sociability of the interaction.
Using an action research approach to design a telemedicine system for critical care: a reflection
Authors: Susan Hansen, Toni Robertson, Laurie Wilson, Ralph Hall
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper reflects on the Action Research approach adopted in the design of the ECHONET (EchoCardiographic Healthcare Online Networking Expertise in Tasmania) system --a telemedicine system developed by CSIRO (Commonwealth Scientific Industrial Research Organisation) Australia to facilitate the sharing of expertise and services between the Intensive Care Units (ICUs) of a major tertiary hospital and a remote hospital in Tasmania, Australia. The baseline study within this project has been used to evaluate the ways in which the Action Research approach influenced the project directions and its success, allowing the project team to better tailor the system to the clinicians' needs and deal with the unanticipated complications that are common in health projects.
Using simulation in the implementation of an outpatient procedure center
Authors: Todd R. Huschka, Bradly J Narr, Brian T. Denton, Adam C. Thompson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Creation of an Outpatient Procedure Center (OPC) is a complicated endeavor, requiring a detailed understanding of the resources available and the procedures to be performed. Miscalculation of resource allocation or patient flow through the area can result in the waste of expensive resources, patient dissatisfaction, and health care provider inefficiency. The use of discrete event simulation can assist in the design of an OPC with the ultimate goal of reducing resource waste and improving patient flow through the system. In this article we provide a case study of the application of a discrete event simulation model used to support analysis required for moving an existing group (interventional procedures for Pain Medicine) into a new area. This resulted in major changes to the group's practice and modified the new facility utilization.
Exploring adjacency in floorplanning
Authors: Jia Wang, Hai Zhou
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.
Optimization in Discovery of Compound Granules
Authors: Andrzej Jankowski, James F. Peters, Andrzej Skowron, Jaroslaw Stepaniuk
Venue: Fundamenta Informaticae (2008)

The problem considered in this paper is the evaluation of perception as a means of optimizing various tasks. The solution to this problem hearkens back to early research on rough set theory and approximation. For example, in 1982, Ewa Or&lstrok;owska observed that approximation spaces serve as a formal counterpart of perception. In this paper, the evaluation of perception is at the level of approximation spaces. The quality of an approximation space relative to a given approximated set of objects is a function of the description length of an approximation of the set of objects and the approximation quality of this set. In granular computing (GC), the focus is on discovering granules satisfying selected criteria. These criteria take inspiration from the minimal description length (MDL) principle proposed by Jorma Rissanen in 1983. In this paper, the role of approximation spaces in modeling compound granules satisfying such criteria is discussed. For example, in terms of approximation itself, this paper introduces an approach to function approximation in the context of a reinterpretation of the rough integral originally proposed by Zdzis&lstrok;aw Pawlak in 1993. We also discuss some other examples of compound granule discovery problems that are related to compound granules representing process models and models of interaction between processes or approximation of trajectories of processes. All such granules should be discovered from data and domain knowledge. The contribution of this article is a proposed solution approach to evaluating perception that provides a basis for optimizing various tasks related to discovery of compound granules representing rough integrals, process models, their interaction, or approximation of trajectories of discovered models of processes.
Efficient Content-Based Image Retrieval Based on Color Homogeneous Objects Segmentation and their Spatial Relationship Characterization
Authors: Youssef Chahir, Liming Chen
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper we introduce several techniques which characterize color homogeneous objects and their spatial relationships for a more precise and efficient content-based image searching. We first present a region growing technique for efficient color homogeneous objects segmentation, and then we extend the 2-D string to express spatial signatures for an accurate description of spatial relationships of objects within an image. Several optimizations, including dominant color histogram clustering, have also been proposed to an efficient search engine implementation. The experimental results that we have drawn so far show that our content-based image searching techniques give a high precision while keeping a very good recall rate.
Simulation of solid-fluid mixture flow using moving particle methods
Authors: Shuai Zhang, Shigeyuki Kuwabara, Takahito Suzuki, Yoshio Kawano, Koji Morita, Kenji Fukuda
Venue: Journal of Computational Physics (2009)

A new basic framework for solid-fluid mixture flow simulation was developed using moving particle methods. The interactions between solid and fluid were modeled by the finite volume particle (FVP) method. The distinct element method (DEM) together with a multi-time-step algorithm was introduced into the FVP method to calculate the effects of contact between solid bodies and between solid bodies and walls. The introduced DEM model was verified by experimental analyses for the collapse of multiple solid cylinder layers. The proposed algorithm using the optimized DEM model was then applied to a water dam breaking, involving multiple solid cylinder layers. A comparison between experiments and simulations demonstrated the DEM model introduced into the FVP method is effective in representing solid-fluid mixture flows reasonably well.
Visualized cognitive knowledge map integration for P2P networks
Authors: Fu-ren Lin, Jen-Hung Yu
Venue: Decision Support Systems (2009)

This study proposes a visualized cognitive knowledge map integration system, called VisCog, to facilitate knowledge management on P2P networks. By using the SOM (self-organized map)-like model, Egocentric SOM (ESOM), VisCog can merge the other peers' knowledge artifacts (e.g., documents) under a focal peer's knowledge structure and visually present the cognitive knowledge map of the P2P network. The experimental results from evaluating VisCog performance show that VisCog can retain an individual peer's knowledge structure while articulating with those of other peers to build its cognitive knowledge map.
A Robust Discriminative Term Weighting Based Linear Discriminant Method for Text Classification
Authors: Khurum Nazir Junejo, Asim Karim
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Text classification is widely used in applications ranging from e-mail filtering to review classification. Many of these applications demand that the classification method be efficient and robust, yet produce accurate categorizations by using the terms in the documents only. We present a supervised text classification method based on discriminative term weighting, discrimination information pooling, and linear discrimination. Terms in the documents are assigned weights according to the discrimination information they provide for one category over the others. These weights also serve to partition the terms into two sets. A linear opinion pool is adopted for combining the discrimination information provided by each set of terms yielding a two-dimensional feature space. Subsequently, a linear discriminant function is learned to categorize the documents in the feature space. We provide intuitive and empirical evidence of the robustness of our method with three term weighting strategies. Experimental results are presented for data sets from three different application areas. The results show that our method's accuracy is higher than other popular methods, especially when there is a distribution shift from training to testing sets. Moreover, our method is simple yet robust to different application domains and small training set sizes.
A Digital Image Denoising Method with Edge Preservation Using Dyadic Lifting Schemes
Authors: Teruya Minamoto, Satoshi Fujii
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper we proposed a new wavelet denoising method for digital images with edge preservation. Briefly stated, our method consists of a combination of the dyadic lifting schemes with the edge-preserving wavelet thresholding. The dyadic lifting schemes have free parameters which enable us to construct the filters having important image features. We describe how to determine these parameters and the denoising algorithm with edge preservation in detail. Some numerical experiments are presented, and we show that these parameters play an important role to denoise.
An immune-genetic algorithm for introduction planning of new products
Authors: Dingwei Wang, Richard Y. K. Fung, W. H. Ip
Venue: Computers and Industrial Engineering (2009)

The introduction planning problem of new products can be described as a semi-infinite programming model with infinite constraints. To solve complex constrained optimization problems, a new immune-genetic algorithm is proposed in this paper. In this approach, first of all, some antigens are randomly generated for the production and training of antibodies. Then, an efficient immune system with the capability to recognize self- and non-self-antigens is supported by these trained antibodies. The resulting immune system is built into genetic algorithms, and they can be used to identify and repair the illegal and infeasible chromosomes during the genetic iterations. The recommended algorithm can improve the performance of genetic algorithms particularly in complex constrained optimization problems. It has been achieved satisfactory results from the new product introduction problems.
KDD cup 2008 and the workshop on mining medical data
Authors: R. Bharat Rao, Oksana Yakhnenko, Balaji Krishnapuram
Venue: ACM SIGKDD Explorations Newsletter (2008)

In this report we summarize the KDD Cup 2008 task, which addressed a problem of early breast cancer detection. We describe the data and the challenges, the results and summarize the algorithms used by the winning teams. We also summarize the workshop on Mining Medical Data held in conjunction with SIGKDD on August 24, 2008 in Las Vegas, NV that brought together researchers working on various aspects of applying machine learning and data mining to challenging tasks in medical and health care domains.
A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources
Authors: Ewa Figielska
Venue: Computers and Industrial Engineering (2009)

In this paper, a heuristic is proposed for solving the problem of scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources at the first stage and a single machine at the second stage. Resource requirements are arbitrary integers. The availability of additional resources is limited at every moment. The objective is the minimization of makespan. The problem is NP-hard. The proposed heuristic combines column generation technique with a genetic algorithm (the heuristic algorithm HG) or a simulated annealing algorithm (the heuristic algorithm HS). The performance analysis is performed experimentally by comparing heuristic solutions to the lower bound on the optimal makespan. Results of the computational experiment show that both the heuristic algorithms yield good quality solutions using reasonable computation time and that HS outperforms HG for the most difficult problems.