ppxscal/embedding_network huggingface dataset:
Image segmentation by three-level thresholding based on maximum fuzzy entropy and genetic algorithm
Authors: Wen-Bing Tao, Jin-Wen Tian, Jian Liu
Venue: Pattern Recognition Letters (2003)

In the paper, a three-level thresholding method for image segmentation is presented, based on probability partition, fuzzy partition and entropy theory. A new fuzzy entropy has been defined through probability analysis. The image is divided into three parts, namely, dark, gray and white part, whose member functions of the fuzzy region are Z-function and Π-function and S-function, respectively, while the width and attribute of the fuzzy region can be determined by maximizing fuzzy entropy. The procedure for finding the optimal combination of all the fuzzy parameters is implemented by a genetic algorithm with appropriate coding method so as to avoid useless chromosomes. The experiment results show that the proposed method gives good performance.
Universal synchronization scheme for distributed audio-video capture on heterogeneous computing platforms
Authors: Rainer Lienhart, Igor Kozintsev, Stefan Wehr
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We propose a universal synchronization scheme for distributed audio-video capture on heterogeneous computing devices such as laptops, tablets, PDAs, cellular phones, audio recorders, and camcorders. These devices typically possess sensors such as microphones and possibly cameras. In order to combine them wirelessly into a distributed sensing and computing system, it is necessary to provide relative time synchronization among the distributed sensors. In this work we propose a setup and an algorithm that provide synchronization between sampling times for a network of distributed multi-channel audio sensors connected to general purpose computing (GPC) platforms. Extensive experimental results on distributed acoustic Blind Source Separation (BSS) algorithms validate the performance of our synchronization scheme.
Automated data-driven discovery of motif-based protein function classifiers
Authors: Xiangyun Wang, Diane Schroeder, Drena Dobbs, Vasant G. Honavar
Venue: Information Sciences: an International Journal (2003)

This paper describes an approach to data-driven discovery of decision trees or rules for assigning protein sequences to functional families using sequence motifs. This method is able to capture regularities that can be described in terms of presence or absence of arbitrary combinations of motifs, A training set of peptidase sequences labeled with the corresponding MEROPS functional families or clans is used to automatically construct decision trees that capture regularities sufficient to assign the sequences to their respective functional families. The performance of the resulting decision tree classifiers is then evaluated on an independent test set. We compared the rules constructed using motifs generated by a multiple sequence alignment based motif discovery tool (MEME) with rules constructed using expert annotated PROSITE motifs (patterns and profiles). Our results indicate that the former provide a potentially powerful high throughput technique for constructing protein function classifiers when adequate training data are available. Examination of the generated rules in relation to known three-dimensional structures of members in the case of two families (MEROPS families C14 and M12) suggests that the proposed technique may be able to identify combinations of sequence motifs that characterize functionally significant three-dimensional structural features of proteins.
QoS Middleware Support for Pervasive Computing Applications
Authors: Behrooz Shirazi, Mohan Kumar, Byung Y. Sung
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Today, pervasive computing technologies are being developed to provide automated, real-time, continual, and unobtrusive user services in dynamic heterogeneous environments such as telemedicine, manufacturing, space endeavors, crisis management, and military. However, the full potential of pervasive computing cannot be realized without enablingmiddleware technologies -- henceforth referred to as "middleware services"; i.e., they provide services for high level applications. In this paper we introduce middleware services that are required to address the challenges related to adapting to dynamically changing situations, meeting communication QoS requirements, and achieving scalability in large-scalepervasive computing applications over heterogeneous network infrastructures. Our approach in developing middleware support for pervasive computing is based on the community computing concept, which provides us with a unified method to dynamically integrate themiddleware services with each other and with high level applications on a just-in-time basis. The proposed middleware services for pervasive computing are highly modular, lightweight, and easily deployable to meet the needs of pervasive computing applications in networked environments. In this paper we will describe our proposed QoS algorithms and techniques for synergistic integration of middleware services into pervasive computing applications. In addition, we propose new performance metrics and a benchmark suite approach to evaluate middleware services in pervasive computing. Finally, we present some early prototype results from our proof of concept implementation.
Architecture of Hydrological Telemetering Software Based on Web Services
Authors: Ping Ai, Zhi-jian Wang, Xiao-feng Zhou, Yuan-sheng Lou
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

The complex heterogeneity of hydrological telemetering system based on network results in the complexity of the software architecture of system, so it is very difficult to improve the software reusability and integrate several different systems. In order to solve these problems,following the principle of service-oriented architecture to analyses and describe the hydrological telemetering system (HydroTS), this paper establishes the architecture of HydroTS based on Web Services through analysis the basic features of system. Furthermore, based on the Web Services techniques, the paper presents the principles to classify the system into many business-independent services and deploy services according to control and data distribution. This method can use to build a system model, which is quite different from traditional methods. Therefore, Web Services technology can not only reduce the complexity of software and improve the software reusability, but also implement the dynamic application integration to decrease costs of system development and maintenance.
Content-based analysis for video from snooker broadcasts
Authors: H. Denman, N. Rea, A. Kokaram
Venue: Computer Vision and Image Understanding (2003)

This paper presents three new tools appropriate for content analysis of sports, applied to footage from snooker broadcasts in particular. The first tool is a new feature for parsing a sequence based on geometry without the need for deriving 3D information. The second tool allows events to be detected where an event is characterised by an object leaving the scene at a particular location. The final tool is a mechanism for summarising motion in a shot for use in a content-based summary. As a matter of course, the paper considers a number of enabling techniques such as the removal of irrelevant objects and object tracking using a particle filter. The paper shows that by exploiting context, a convincing summary can be made for snooker footage.
Writing about C++
Authors: Mark Ryan
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Since its beginnings ten years ago, C++ has grown from a specialty language used by a handful of researchers to a major development language. Today, C++ documentation has to describe a large, complex language to a varied audience. This paper describes some of the problems that face writers of C++ documentation.
A minimal and complete set of operators for the development of robust manifold mesh modelers
Authors: Ergun Akleman, Jianer Chen, Vinod Srinivasan
Venue: Graphical Models (2003)

In this paper, we identify a minimal and complete set of fundamental operators, which is necessary and sufficient for performing all homeomorphic and topological operations on 2- manifold mesh structures. Efficient algorithms are developed for the implementation of these operators. We also developed a set of powerful, user-friendly, and effective operators at the level of user-interface. Using these operators, we have developed a prototype system for robust, interactive, and user-friendly modeling of orientable 2-manifold meshes. Users of our system can perform a large set of homeomorphic and topological changes with these user-interface level operators. Our system is topologically robust in the sense that users will never create invalid 2-manifold mesh structure with these operators. In our system, the homeomorphic and topological surgery operations can be applied alternatively on 2-manifold meshes. With our system, users can blend surfaces, construct rinds, and open holes on these rind shapes. With our system, the shapes that look like solid, non-manifold, or 2-manifold with boundary can be manipulated. The system also provides automatic texture mapping during topology changes.
An agent-based approach to identification of prediction models
Authors: Tieju Ma, Yoshiteru Nakamori
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

This paper presents an agent-based approach to identification of prediction models in two-dimensional data spaces. A number of agents are sent to the two-dimensional data space that people want to investigate. At the micro-level, every agent tries to build a local linear model by competing with others, and then at the macro-level all surviving agents build the global model by cooperating with each other. And a genetic algorithm is introduced for improving the global model built by the agents. Two examples that apply this approach are given. The advantages of this approach are it does not need people to give a certain formula in advance; and most of time, it can give more precise prediction models than those given by traditional methods.
Ur,s(gl4)-symmetry for (r,s)-hypergeometric series
Authors: Michitomo Nishizawa
Venue: Journal of Computational and Applied Mathematics (2003)

Contiguous operators for a two-parameter analogue of hypergeometric series are constructed. These represent a two-parameter quantum enveloping algebra introduced by Takeuchi.
Adaptive Scheduling Techniques for Multimedia Computing in Hard Real-Time Systems
Authors: Jinhwan Kim, Namyun Kim, Bonggyou Lee
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

In this paper, we propose adaptive scheduling and bandwidth allocation techniques to efficiently integrate multimedia tasks for MPEG applications in hard real-time systems. The paper describes a server-based mechanism for assigning the CPU resource to hard real-time tasks and multimedia tasks, respectively. Especially for MPEG video applications, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task according to the priority. The primary purpose of these techniques is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks. The performance of the proposed scheduling techniques is compared with that of similar mechanisms through simulation experiments.
Optimum transmit range and capacity of mobile infostation networks
Authors: Wing Ho Yuen, Roy D. Yates
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

A mobile infostation network stipulates all transmissions to occur when nodes are in proximity. In this paper, the effect of transmit range on the capacity of four transmission strategies is studied. We show that a stipulated transmit range improves the capacity relative to the reference strategy with an unconstrained transmit range. This indicates an optimal trade-off exists between spatial transmission concurrency and spectral efficiency on individual links. The optimal number of neighbors is invariant to node density, and is between 0.6 to 1.2 for our transmission strategies. This result should be contrasted to a magic number of 6 to 8 neighbors for multihop networks, where the expected forward progress per hop is maximized. This reflects the different optimization criteria of mobile infostation and multihop ad hoc networks. In addition, the capacity per unit area increases linearly with node density. This is counter-intuitive but can be explained using a rescaling argument drawn from percolation theory.
Extraction of Features Using M-Band Wavelet Packet Frame and Their Neuro-Fuzzy Evaluation for Multitexture Segmentation
Authors: Mausumi Acharyya, Rajat K. De, Malay K. Kundu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--In this paper, we propose a scheme for segmentation of multitexture images. The methodology involves extraction of texture features using an overcomplete wavelet decomposition scheme called discrete M-band wavelet packet frame (DMbWPF). This is followed by the selection of important features using a neuro-fuzzy algorithm under unsupervised learning. A computationally efficient search procedure is developed for finding the optimal basis based on some maximum criterion of textural measures derived from the statistical parameters for each of the subbands. The superior discriminating capability of the extracted features for segmentation of various texture images over those obtained by several existing methods is established.
An Assmus&ndash;Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4
Authors: Dong-joon Shin, P. Vijay Kumar, Tor Helleseth
Venue: Designs, Codes and Cryptography (2004)

The complete weight enumerator of the Delsarte&ndash;Goethals code over Z4 is derived and an Assmus&ndash;Mattson-type approach at identifying t-designs in linear codes over Z4 is presented. The Assmus&ndash;Mattson-type approach, in conjunction with the complete weight enumerator are together used to show that the codewords of constant Hamming weight in both the Goethals code over Z4 as well as the Delsarte&ndash;Goethals code over Z4 yield 3-designs, possibly with repeated blocks.
Summary: ICSE workshop on dynamic analysis (WODA 2003)
Authors: Jonathan E. Cook, Michael D. Ernst
Venue: ACM SIGSOFT Software Engineering Notes (2003)

Dynamic analysis of software systems has long proven to be a practical approach to gain understanding of the operational behavior of the system. This workshop brought together researchers in the field of dynamic analysis to discuss the breadth of the field, order the field along logical dimensions, expose common issues and approaches, and stimulate synergistic collaborations among the participants.
Combining Polygonal and Subdivision Surface approaches to Modelling of Urban Environments
Authors: A. M. Day, D. B. Arnold, S. Havemann, D. Fellner
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The economic production and the interactive renderingof complete reconstructions of populated urban environmentsare technically dif£cult tasks. Specialized modellingtools, which exploit knowledge of the types of object beingmodelled by working in the application domain, can beused to create appealing virtual reconstructions quickly. Atthe same time, the structural information from the modellergives valuable hints to the renderer to determine ef£cient interactivedisplay strategies through the use of level-of-detailand culling techniques. Thus a modeller that knows the operatoris creating houses can use this information to simplifythe user interaction, guide the operator, and to createmodels that build in optimisations when attempting real-timerendering. In this paper we discuss the way in whichpolygonal and multi-resolution surface techniques can complementone another in the modelling of urban environments.We also draw more general conclusions which applyto other software systems that share the same objective.
Human + agent: creating recombinant information
Authors: Andruid Kerne, Vikram Sundaram, Jin Wang, Madhur Khandelwal, J. Michael Mistrot
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

combinFormation is a tool that enables browsing and collecting information elements in a generative space. By generative, we mean that the tool is an agent that automatically retrieves information elements and visually composes them. A combinFormation session presents a dynamic, evolving recombination of information elements from different sources. The elements are manipulable in the information space. Recombination is the process of taking previously unconnected elements, and combining them to create new configurations.One purpose of this space is to support the formation of ideas, through more and less focused processes of foraging. While ideas are forming, the criteria that underlie information foraging activities may not be well defined. Collecting the specific subset of related information elements is challenging. Cognitive scientists have established that combinations of images and textual elements are examples of preinventive structures that can lead to the emergence of new ideas. These preinventive structures often combine existing representations.Our program generates recombinant visualizations that develop interrelationships between the information elements. The generative visualization is based on a procedural model of the information, and the user's interests. The user model reflects interactions in which s/he explicitly expresses interest. The agent retrieves information based on the evolving model. The visual composition is also developed to emphasize the user's evolving sense of what is important. This involves solving problems in the dynamic visualization of dynamic, heterogeneous collections. In our novel interaction model, the human being shares control of the evolving information space with the agent. The user can express interest in information elements as they stream in, and design the visual space, using interactive tools. Expressions feed back through the model to drive the program's retrieval and visual composition decisions.
Product selection agents: a development framework and preliminary application
Authors: Dapeng Cui
Venue:  (2003)

This dissertation explores a new class of intelligent software agents called product selection agents (PSA) and proposes a business model based on the concept. A product selection agent is an intelligent software agent, coupled with comprehensive databases, that performs product selection and associated functions on behalf of its clients. This dissertation investigates properties these agents must have in order to fulfill functions suggested by the literature in consumer decision-making and by trends in e-commerce. We also provided rationale for the development of product selection agents. We present a new typology of decision scenarios explicitly for the world of e-commerce. In the typology, the most difficult decision scenario is to select products that are best for the client who lacks well-developed preferences and who does not have the ability to construct preferences prior to a decision. Through a series of experiments we show that the Support Vector Machine can be applied to overcome design barriers and fulfill the goals of the client. To illustrate the design principles, we discuss how to build an agent for the pharmaceutical industry, labeled Case 4, in the most difficult context. The PSA will help diabetics select glucose meters that best meet their needs, particularly as these needs change as a function of stage of diseases, life style, demographics, and the client's economic status. The agent will also serve physicians specializing in the treatment of diabetes, most of whom cannot keep current about products on the market, their functioning, their costs, and other aspects regarding the appropriateness of a given product or product bundle for a given patient. Further, because all participants in the industry share the agent through the Internet, they will be able to exchange information in real time, thus integrating the industry using the agent as infomediary.
The End of Science Revisited
Authors: John Horgan
Venue: Computer (2004)

Scientists need a certain degree of faith to bolster their confidence in the arduous quest for truth; lacking such faith, science would not have come so far so fast. But when researchers reflexively deny any evidence and arguments that challenge their faith, they violate the scientific spirit.Although we have grown up in a period of explosive scientific and technological progress, reflected by such measures as Moore's law, science--especially pure science might be entering an era of diminishing returns. Science itself tells us that there are limits to our knowledge.
A dynamic programming approach to the power supply net sizing problem
Authors: Reiner Kolla
Venue: Proceedings of the conference on European design automation (1990)

We present a simple dynamic programming approach to find minimum area sizings of power supply nets in VLSI circuits in time O((&Delta;A)2n), where n is the number of modules and &Delta;A is the difference between an upper bound of the area and the lower bound resulting from minimum feature size and electromigration constraints. In opposition to known algorithms from literature ([2,3,4]), this algorithm determines an integer solution and has time and space bounds which can be predicted before running the algorithm. Some heuristics for computing upper bounds and reducing time and space requirements as well as first experimental experiences are included.
A testing-based framework for programming contests
Authors: Steven K. Andrianoff, David B. Levine, Stephen D. Gewand, Greta A. Heissenberger
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

The traditional ACM programming contest [2,6] is often described as measuring the ability of students to solve problems and to translate those solutions to code. The judging mechanism imposes an additional burden: contestants must devise a sophisticated test suite to ensure that their submissions are successful. Students often have more trouble with this aspect of the contest than any other. This paper introduces the Corona Project, an Eclipse-based set of tools to facilitate testing of programming contest submissions.