ppxscal/embedding_network huggingface dataset:
A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
Authors: Arindam Banerjee, Inderjit Dhillon, Joydeep Ghosh, Srujana Merugu, Dharmendra S. Modha
Venue: The Journal of Machine Learning Research (2007)

Co-clustering, or simultaneous clustering of rows and columns of a two-dimensional data matrix, is rapidly becoming a powerful data analysis technique. Co-clustering has enjoyed wide success in varied application domains such as text clustering, gene-microarray analysis, natural language processing and image, speech and video analysis. In this paper, we introduce a partitional co-clustering formulation that is driven by the search for a good matrix approximation---every co-clustering is associated with an approximation of the original data matrix and the quality of co-clustering is determined by the approximation error. We allow the approximation error to be measured using a large class of loss functions called Bregman divergences that include squared Euclidean distance and KL-divergence as special cases. In addition, we permit multiple structurally different co-clustering schemes that preserve various linear statistics of the original data matrix. To accomplish the above tasks, we introduce a new minimum Bregman information (MBI) principle that simultaneously generalizes the maximum entropy and standard least squares principles, and leads to a matrix approximation that is optimal among all generalized additive models in a certain natural parameter space. Analysis based on this principle yields an elegant meta algorithm, special cases of which include most previously known alternate minimization based clustering algorithms such as kmeans and co-clustering algorithms such as information theoretic (Dhillon et al., 2003b) and minimum sum-squared residue co-clustering (Cho et al., 2004). To demonstrate the generality and flexibility of our co-clustering framework, we provide examples and empirical evidence on a variety of problem domains and also describe novel co-clustering applications such as missing value prediction and compression of categorical data matrices.
A formal modeling platform for composing web services
Authors: Yu-Liang Chi, Hsun-Ming Lee
Venue: Expert Systems with Applications: An International Journal (2008)

Building a robust service composition is increasingly problematic as large scales of Web service operations can now be possibly achieved through the Internet. This article proposes an effective composing platform based on a formal modeling language. In particular, Petri Nets patterns are developed for enhancing service composition modeling, workflow quality measurement and scripting productivity. By providing a visual editing module, this platform allows business application developers to exploit its composing capabilities without much requiring design time or skills.
Progressive optimization in action
Authors: Vijayshankar Raman, Volker Markl, David Simmen, Guy Lohman, Hamid Pirahesh
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardinalities estimated during optimization prove to be significantly incorrect. POP works by carefully calculating validity ranges for each plan operator under which the overall plan can be optimal. POP then instruments the query plan with checkpoints that validate at runtime that cardinalities do lie within validity ranges, and re-optimizes the query otherwise. In this demonstration we showcase POP implemented for a research prototype version of IBM's DB2 DBMS, using a mix of real-world and synthetic benchmark databases and workloads. For selected queries of the workload we display the query plans with validity ranges as well as the placement of the various kinds of CHECK operators using the DB2 graphical plan explain tool. We also execute the queries, showing how and where re-optimization is triggered through the CHECK operators, the new plan generated upon re-optimization, and the extent to which previously computed intermediate results are reused.
Ball Position and Motion Reconstruction from Blur in a Single Perspective Image
Authors: Giacomo Boracchi, Vincenzo Caglioti, Alessandro Giusti
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We consider the problem of localizing a moving ball from a single calibrated perspective image; after showing that ordinary algorithms fail in analyzing motion blurred scenes, we describe a theoretically-sound model for the blurred image of a ball. Then, we present an algorithm capable of recovering both the ball 3D position and its velocity. The algorithm is experimentally validated both on real and synthetic images.
A Quality of Service Support Module (QASM) for a Wireless Multi-Segment Integrated 3G Network
Authors: Paolo Dini, Francesco Delli Priscoli
Venue: Wireless Personal Communications: An International Journal (2007)

Deployment of IP multimedia services with guaranteed Quality of Service (QoS) is a primary requirement for Beyond 3G (B3G) systems. In this paper we propose a new architecture to support Internet QoS-sensitive services (e.g., video-conferencing, voice over IP, interactive gaming), thus providing users with end-to-end QoS guarantees. In particular, the paper discloses a new hybrid Intserv/Diffserv scheme for handling IP packets and an interworking procedure with the RSVP protocol which allows to support QoS over an integrated, multi-segment network. Such scheme is implemented by means of a suitable Quality of service Support Module (QASM). Advantages and drawbacks of QASM are discussed and the impact on both system architecture and Multi-Mode Mobile Terminal is investigated. Performance evaluations, carried out via computer simulations, confirm the effectiveness of the proposed solution.
Path Planning Based on Double-Layer Genetic Algorithm
Authors: Jin Lu, Dongyong Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.
Multiple Mice Tracking using a Combination of Particle Filter and K-Means
Authors: Wesley Nunes Goncalves, Joao Bosco Oliveira Monteiro, Valguima Odakura
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

This paper presents a new approach to multiple objects tracking that combines particle filters and k-means. The approach has been tested under an important real world situation, related to pharmacological development, which has also proved to serve as an interesting ground-truth dataset provider for the evaluation of tracking algorithms. The obtained results are then compared to other models. The promising results of these experiments are presented.
A New Evolutionary Algorithm for the Bi-objective Minimum Spanning Tree
Authors: Daniel A. M. Rocha, Elizabeth F. G. Goldbarg, Marco C. Goldbarg
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Combinatorial optimization problems with multiple objectives are, in general, more realistic representations of practical situations than their counterparts with a single-objective. The bi-objective minimum spanning tree problem is an NP-hard problem with applications in network design. In this paper a transgenetic algorithm is applied to this problem. A computational experiment compares the proposed approach with a memetic algorithm. The comparison of the algorithms is done with basis on three indicators and statistical tests.
Dynamic Power Management based on Wavelet Neural Network in Wireless Sensor Networks
Authors: Yan Shen, Bing Guo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

One of the most important constraints in wireless sensor networks is the energy efficiency problem. To maximize the wireless sensor networks lifetime after the sensor nodes deployment, Dynamic Power Management (DPM) should be carefully taken into account in wireless sensor networks. The goal of DPM is to reduce power dissipation by putting the sensor node into different states. In this paper, a new method of DPM based on wavelet neural networks is proposed to conserve energy. There are two salient aspects to this approach. First, the next event's time which is a non-stationary series is predicted as accurate as possible by wavelet neural networks. Nodes in deeper sleep states consume lower energy while asleep, but incur a longer delay and higher energy cost to awaken. Second, the nodes state in which lie wireless sensor network should lie is decided through the predictable time associated with the threshold time, residual power. The simulation results show that the energy consumption is significantly reduced and the whole lifetime of the wireless sensor networks is greatly prolonged through the proposed method.
A Survey of Software Engineering Practice: Tools, Methods, and Results
Authors: L. L. Beck
Venue: IEEE Transactions on Software Engineering (1983)

The results of a survey of software development practice are reported and analyzed. The problems encountered in various phases of the software life cycle are measured and correlated with characteristics of the responding installations. The use and acceptance of the term "software engineer" is investigated, and the functions and background of persons identified as software engineers are reported. The usage of a wide variety of software engineerilng tools and methods is measured; conclusions are drawn concerning the usefulness of these techniques.
Visual Composition of Distributed Component Systems
Authors: Hans Albrecht Schmid, Christian Baranowski, Marco Pfeifer
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Component composition has been over a decade a concept that supplements classical reference-based programming, but does not replace it to a larger extent. Though a new generation of component languages like ArchJava has pushed forwards composition from subcomponents, these languages fall back into class-based programming of methods when Java program code is to be written e.g. as a filter among subcomponents. To allow for a seamless composition process, we have developed the component language CompJava that introduces component fragments and plugs as means for composing a component both from subcomponents and structured units of code. In parallel, we have extended UML 2 component diagrams by the newly introduced concepts. This allows visualizing the compositional structure of components in order to better understand and communicate it. A graphical editor, called CompJava Designer, allows constructing relatively complex and distributed component systems by a seamless visual composition process.
LMI-based fuzzy controller design with minimum upper bound input energy and state variance constraints for discrete fuzzy stochastic systems
Authors: Wen-Jer Chang, Chong-Cheng Shing
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

In this paper, a fuzzy controller design problem is considered for the discrete-time Takagi-Sugeno (T-S) fuzzy stochastic systems. The main purpose of this paper is to provide a systematic fuzzy controller design procedure for the discrete-time nonlinear stochastic systems, which are modeled by the T-S type fuzzy systems. A methodology is developed to find the discrete-time fuzzy controllers for minimizing upper bound control input energy and achieving state variance constraints for discrete-time T-S fuzzy stochastic systems. It is shown that the present approach can be used to solve the linear feedback control gains for each rule of the T-S fuzzy controllers using the Linear Matrix Inequality (LMI) technique. Finally, we apply the proposed controller design method to control a truck-trailer system to show the utility of the present approach.
Cultural differences and design methods for user experience research: Dutch and Korean participants compared
Authors: Jung-Joo Lee, Kun-Pyo Lee
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

As business competition globalizes, understanding user experience from various cultures plays a crucial role in design process. However, because most user research methods were developed in Western area, one may question if the expected result can be obtained when applying them to totally different culture. The paper explores cultural effects on the feedback collected in the process and result of user experience research conducted in two countries, the Netherlands and Korea. We presumed four factors which influence user research process: spontaneity of participation, uncertainty avoidance, tendency of problem criticism, and attitude within a group. After the two sets of user research in two countries, actual differences of results were revealed. Consequently, guidelines of user experience research in Korea were suggested based on discovered differences.
Unsupervised clustering of over-the-counter healthcare products into product categories
Authors: Garrick L. Wallstrom, William R. Hogan
Venue: Journal of Biomedical Informatics (2007)

A general problem in biosurveillance is finding appropriate aggregates of elemental data to monitor for the detection of disease outbreaks. We developed an unsupervised clustering algorithm for aggregating over-the-counter healthcare (OTC) products into categories. This algorithm employs MCMC over hundreds of parameters in a Bayesian model to place products into clusters. Despite the high dimensionality, it still performs fast on hundreds of time series. The procedure was able to uncover a clinically significant distinction between OTC products intended for the treatment of allergy and OTC products intended for the treatment of cough, cold, and influenza symptoms.
Text Line Detection in Unconstrained Handwritten Documents Using a Block-Based Hough Transform Approach
Authors: G. Louloudis, B. Gatos, C. Halatsis
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we present a new text line detection method for unconstrained handwritten documents. The proposed technique is based on a strategy that consists of three distinct steps. The first step includes image binarization and enhancement, connected component extraction and average character height estimation. In the second step, a block-based Hough transform is used for the detection of potential text lines while a third step is used to correct possible splitting, to detect text lines that the previous step did not reveal and, finally, to separate vertically connected characters and assign them to text lines. The performance evaluation of the proposed approach is based on a consistent and concrete evaluation methodology.
An Effective and Practical Classifier Fusion Strategy for Improving Handwritten Character Recognition
Authors: Q. Fu, X. Ding, T. Li, C. Liu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we propose a classifier fusion strategy which trains MQDF (Modified Quadratic Discriminant Functions) classifiers using cascade structure and combines classifiers on the measurement level to improve handwritten character recognition performance. The generalized confidence is introduced to compute recognition score, and the maximum rule based fusion is applied. The proposed fusion strategy is practical and effective. Its performance is evaluated by handwritten Chinese character recognition experiments on different databases. Experimental results show that the proposed algorithm achieves at least 10% reduction on classification error, and even higher 24% classification error reduction on bad quality samples.
Simple Monte Carlo and the Metropolis algorithm
Authors: Peter Mathé, Erich Novak
Venue: Journal of Complexity (2007)

We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the non-normalized density function. We are interested in analyzing the integration error of optimal algorithms (or the complexity of the problem) with emphasis on the variability of the weight function. For a corresponding large class of problem instances we show that the complexity grows linearly in the variability, and the simple Monte Carlo method provides an almost optimal algorithm. Under additional geometric restrictions (mainly log-concavity) for the density functions, we establish that a suitable adaptive local Metropolis algorithm is almost optimal and outperforms any non-adaptive algorithm.
Refinement of a Tool to Assess the Data Quality in Web Portals
Authors: Angelica Caro, Coral Calero, Juan Enriquez de Salamanca, Mario Piattini
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The Internet is now firmly established as an environment for the administration, exchange and publication of data. To support this, a great variety of Web applications have appeared, among these web portals. Numerous users worldwide make use of Web portals to obtain information for different purposes. These users, or data consumers, need to ensure that this information is suitable for the use to which they wish to put it. PDQM (Portal Data Quality Model) is a model for the assessment of portal data quality. It has been implemented in the PoDQA tool (Portal Data Quality Assessment tool), which can be accessed at http://podqa.webportalquality.com. In this paper we present the various refinements that it has been necessary to make in order to obtain a tool which is stable and able to make accurate and efficient calculations of the elements needed to assess the quality of the data of a web portal.
Energy optimization in wireless broadcasting through power control
Authors: Adarsh Sridhar, Anthony Ephremides
Venue: Ad Hoc Networks (2008)

We consider the problem of optimally controlling transmission power in a time-slotted wireless broadcast network. Fixed-length packets and AWGN channels are considered, and a simple ARQ scheme (Send-and-Wait) is used for error control. Packets are retransmitted until a minimum QoS requirement is met for each packet. Transmission powers are chosen from a finite set depending on the number of nodes that have received the packet successfully. The goal is to minimize the total energy expended for each successful packet transmission. The system is studied when the transmitter chooses between two distinct powers, and the results are then extended to multiple powers. It is observed that the optimal policy is always of the separation type. Also, the effect of varying the QoS requirement on the energy and service time is studied.
Problems of Designing Supersystems with Dynamic Architectures
Authors: S. I. Kartashev
Venue: IEEE Transactions on Computers (1980)

This paper considers basic concepts of designing a Supersystem with dynamic architecture.
Development of P300 Detection Algorithm for Brain Computer Interface in Single Trial
Authors: Hiroyuki Ishita, Motoki Sakai, Ji'nei Watanabe, Wenxi Chen, Daming Wei
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposed a combinational method to estimate and discriminate the P300 component. The Kalman filter and the wavelet transformation were used to estimate the P300 component and PCA and three discrimination meth- ods; linear discrimination analysis, Mahalanobis distance, and Bayes' theorem, were used to discriminate the esti- mated P300 from single trial. The results show the effec- tiveness of the combinational technique in discrimination. The combination of wavelet transformation and a linear discrimination analysis can perform discrimination in the highest accuracy and the fastest processing speed. KEYWORD: ERP, P300, Kalman filter, Wavelet transfor- mation, Linear discrimination analysis, Mahalanobis dis- tance, Bayes' theorem
Control Computations and the Design of Loop Control Structures
Authors: T. W. Pratt
Venue: IEEE Transactions on Software Engineering (1978)

The control computation for a loop in a program is that part of the program concerned with the initialization, incrementation, and testing of the variables that determine the flow of control into, through, and out of the loop. The elements of loop control computations are idenified and their role in structuring our understanding of loops is analyzed. It is argued, through examples drawn from a Pascal compiler, that the intelligibility of a loop is closely tied to the accessibility and intelligibility of the loop control computation. It is further argued, from an analysis of all the loops in this compiler, that most loop control computations fail in a few standard patterns, mostly concerned with the sequential processing of elements of data structures. In light of these results, common loop control statements are critiqued. It appears that better loop control structures than the while, repeat-until, and similar statement structures are possible and desirable, and some proposals for better structures are given.
IGES Model Comparison System: A Tool for Tsting and Validating IGES Processors
Authors: H. Grabowski, R. Glatz
Venue: IEEE Computer Graphics and Applications (1987)

The IGES Model Comparison System (IMCOS) is the first test tool to allow an easy and automatic semantic comparison of CAD models represented in IGES format. By systematically analyzing and comparing entity data and structures of generated and exchanged IGES models, it detects loss of information and functionality resulting from model exchange via IGES processors. IMCOS was designed and implemented as a tabledriven IGES processor to allow external control of the comparison process and full coverage of the current version of IGES (Version 3.0) and future versions. This article presents the basic concepts of IMCOS. The great interest in and discussion of IMCOS have shown the importance of such a test tool. IMCOS may be used as one of several test tools within an overall IGES verification program.
Abstracting Modern FCCMs To Provide a Single Interface to Architectural Resources
Authors: Graham Schelle, Dirk Grunwald
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Mainstream processor architectures and field programmable custom computing machines (FCCMs) are colliding towards a heterogeneous System on Chip architecture. This is apparent from Intel and AMD efforts to create new chip architectures with various processing cores focusing on DSP, networking, and graphics. From the embedded processor research, System on Chips connected by Network on Chips have allowed scalable architectures with a variety of processing cores connected by an onchip network. In this paper we examine several scheduling and allocation policies that can be utilized across Network on Chip architectures regardless of the processing cores onchip. By abstracting characteristics of the processing cores with various scheduling data structures, any heterogeneous System on a Chip can be allocated and scheduled dynamically.