ppxscal/embedding_network huggingface dataset:
Component-based Development of MILLS: A Case Study in the development of an Inter-library Loan Software System
Authors: Naresh Kumar Agarwal, Danny C. C. Poo, Teo Keng Yong
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Component-based Software Development (CBSD) is based on the idea of developing software systems by selecting appropriate off-the-shelf components and integrating them under a specified architecture. Such an approach prevents a software developer from having to reinvent the wheel, reduces software development cost and time, and promotes flexibility and maintainability. In this paper, we describe the application of CBSD in developing a system for automated inter-library loans between the libraries of two major universities of Singapore. Currently, inter-library loan (ILL) is a cumbersome and manual process. Our system helps promote resource-sharing and interoperability and reduces the difficulties involved in the current manual loan system between libraries. Specifically, we describe the CBSD approach, present the design and implementation of the MILLS (Managing Inter-library Loan Services) system, and describe how MILLS was developed taking the CBSD approach into consideration. The lessons learnt from this case should be of value to software developers.
Exploiting "The World is Flat" Syndrome in Digital Photo Collections for Contextual Metadata
Authors: William Ku
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

According to Thomas L. Friedman, the world has become "flat" with collaboration among individuals in most if not all aspects of life becoming reality. The Internet is the backbone of this phenomenon as we are beginning to see collaborative efforts in the domain of digital photos, generating additional contextual information that could be used for image search and retrieval. In addition, photos are usually part of collections and this association would also provide additional contextual information. However, not much work has been done to provide structural exploitation of these additional contextual information and this paper presents some concepts on how to do so.
A Service Mediator Based Information System: Service-Oriented Federated Multiple Document Management
Authors: Luiz Russo, Sam Chung
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

The primary goal of this research is to propose a novel approach for developing a federated information system of document management applications, which we call SoDOCM (Service-Oriented Document Management) system. The SoDOCM system is a mediator-based federated Information System that is designed and developed based upon the four-level service schema architecture concept, which is a variant of the five-level schema architecture for Federated Database Systems. By modeling the fivelevel schema architecture in terms of service-oriented computing paradigm, four-level service schema architecture is proposed as the central concept for integrating heterogeneous multiple document managements systems. Three different service types such as atomic, simple, and composite services are employed to make the heterogeneous multi-document management system interoperable since standard interfaces and interaction protocols of web services can be supported in a loosely coupled fashion. Representation schemes for schemata at each level are defined by using XML based web services and schema description languages. Several functions such as service request, discovery, composition, publishing, and invocation are proposed and implemented for the mapping between different schema levels.
Instant 3Descatter
Authors: Tali Treibitz, Yoav Y. Schechner
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Imaging in scattering media such as fog and water is important but challenging. Images suffer from poor visibility due to backscattering and signal attenuation. Most prior methods for visibility improvement use active illumination scanners (structured and gated), which are slow and cumbersome. On the other hand, natural illumination is inapplicable to dark environments. The current paper counters these deficiencies. We study the formation of images under wide field (non-scanning) artificial illumination. We discovered some characteristics of backscattered light empirically. Based on these, the paper presents a visibility recovery approach which also yields a rough estimate of the 3D scene structure. The method is simple and requires compact hardware, using active wide field polarized illumination. Two images of the scene are instantly taken, with different states of a camera-mounted polarizer. A recovery algorithm then follows. We demonstrate the approach in underwater field experiments.
The effects of base ratio and conceptual structure on accuracy in multiplicative situations
Authors: Reality S. Canty, Susan R. Goldman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

We examined the effects of base ratio and conceptual structure on accuracy in multiplicative situations. Forty-eight 3rd and 5th graders solved 36 problems that varied in base ratio and conceptual structure. ANOVA results indicated that conceptual structure made a greater impact on accuracy than did the size of the base ratio. The effect of structural constraint on accuracy supports the call for deeper conceptual instruction and learning in mathematics education.
Who's got game (theory)?
Authors: Walter Bender
Venue:  (2005)

Many players enjoy the challenge of outwitting computer opponents in strategy games. Devising strategies to defeat a computer opponent may enhance certain cognitive skills (e.g., analysis, evaluation, planning). This thesis takes a constructionist approach to gaming, hypothesizing that players may learn more about strategic planning by building their own computer opponents and then playing them to understand how their strategic theories play out in real experiments. I have developed a graphic toolkit for designing strategy games and computer opponents. The goal is to help students learn the underlying mathematical and computer science theories used to win these games. The tools have been designed to eliminate the overhead of using conventional programming languages to build games and focus students on the pedagogical issues of designing and understanding game theory algorithms. I describe the tools as well as initial evaluations of their effectiveness with populations of teenage students. Teenagers in this study posed their own problems, in the form of games they designed, and then hypothesized about winning strategies. Of their own volition, most teenagers iterated on their strategic designs, reformulated problems and hypotheses, isolated variables, and informed next generation versions of this tool with astute suggestions. The toolkit designed for this thesis has a low floor, making it easy for people to quickly start playing with mathematical concepts, and a high ceiling for sophisticated exploration. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Arabic OCR Based on Image Invariants
Authors: Abdullah I. Al-Shoshan
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Optical character recognition (OCR) is an area of interest for converting hard copies of written information, as in faxed or scanned documents. In this paper, we compare two common image invariant methods in OCR, the invariant central moments (NCM) and the normalized Fourier descriptors (NFD) of the character. These methods are insensitive to image variances such as shifting, scaling, or rotation. To ensure the efficiency of the proposed algorithms, some examples and simulation are done. We will also show by means of examples that when using the NCM the recognition rate decreases when the image coordinates ratio is changed.
A cognitively based simulation of academic science
Authors: Isaac Naveh, Ron Sun
Venue: Computational Mathematical Organization Theory (2006)

The models used in social simulation to date have mostly been very simplistic cognitively, with little attention paid to the details of individual cognition. This work proposes a more cognitively realistic approach to social simulation. It begins with a model created by Gilbert (1997) for capturing the growth of academic science. Gilbert's model, which was equation-based, is replaced here by an agent-based model, with the cognitive architecture CLARION providing greater cognitive realism. Using this cognitive agent model, results comparable to previous simulations and to human data are obtained. It is found that while different cognitive settings may affect the aggregate number of scientific articles produced, they do not generally lead to different distributions of number of articles per author. The paper concludes with a discussion of the correspondence between the model and the constructivist view of academic science. It is argued that using more cognitively realistic models in simulations may lead to novel insights.
Explore New Profiting Method for TV Based on P2P Streaming Media Technology
Authors: Jing Tang, Can Yang, Xinxin Chen
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Looking back on the transition of the profiting mode in internal broadcasting and television industry, the paper mainly analyzes the basic framework and applying prospect of a web living broadcast system based on p2p mode. The system is comprised of four parts: directory server, channel information server, publishing server and client-end program. With the system, traditional TV station media can easily their programs on Internet by configuring one or two servers, which spends just a little cost. At last, we look in a new profiting mode, which is based on the new-generation P2 P-IPTV platform for TV stations.
Agent-based Dis-graph Planning Algorithm for Web Service Composition
Authors: Jian Feng Zhang, Ryszard Kowalczyk
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In agent-based planning for service composition, a single agent may not have access to all services required to fulfill a given goal. Cooperation among multiple agents, each of whom has a limited set of services, can increase the chance of generating a valid/effective composition. However, agents may be reluctant to reveal their services to other agents during cooperation due to the concerns to privacy, security, and difficulty of a heavy communication overhead. In this paper we present a distributed algorithm that allows agents to cooperate and form a composition in such a situation. This algorithm can be viewed as a distributed extension of the reputed centralized planning paradigm, i.e. Graph planning + CSP. We adapt classical planning graph to distributed planning graph, represent the graph in distributed CSP (DisCSP) instead of CSP, and solve the DisCSP with distributed search algorithm. All agents have equal authority and no centralized coordinator is required in the whole process.
Picture Collage
Authors: Jingdong Wang, Long Quan, Jian Sun, Xiaoou Tang, Heung-Yeung Shum
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper, we address a novel problem of automatically creating a picture collage from a group of images. Picture collage is a kind of visual image summary - to arrange all input images on a given canvas, allowing overlay, to maximize visible visual information. We formulate the picture collage creation problem in a Bayesian framework. The salient regions of each image are firstly extracted and represented as a set of weighted rectangles. Then, the image arrangement is formulated as a Maximum a Posterior (MAP) problem such that the output picture collage shows as many visible salient regions (without being overlaid by others) from all images as possible. Moreover, a very efficientMarkov chain Monte Carlo (MCMC) method is designed for the optimization. Applications to desktop image browsing and image search result summarization demonstrate the effectiveness of our approach.
3rd Intl. ICSE workshop on software engineering for automotive systems
Authors: Martin Rappl, Alexander Pretschner, Christian Salzmann, Thomas Stauner
Venue: ACM SIGSOFT Software Engineering Notes (2006)

This workshop summary outlines the main results of the one-day International Workshop on Software Engineering for Automotive Systems [5], held in conjunction with the 28th International Conference on Software Engineering (ICSE'06). In the sequel, a brief overview of the presented papers is given and the most interesting discussions are highlighted.
Asymptotic analysis of the lattice Boltzmann equation
Authors: Michael Junk, Axel Klar, Li-Shi Luo
Venue: Journal of Computational Physics (2005)

In this article we analyze the lattice Boltzmann equation (LBE) by using the asymptotic expansion technique. We first relate the LBE to the finite discrete-velocity model (FDVM) of the Boltzmann equation with the diffusive scaling. The analysis of this model directly leads to the incompressible Navier-Stokes equations, as opposed to the compressible Navier-Stokes equations obtained by the Chapman-Enskog analysis with convective scaling. We also apply the asymptotic analysis directly to the fully discrete LBE, as opposed to the usual practice of analyzing a continuous equation obtained through the Taylor-expansion of the LBE. This leads to a consistency analysis which provides order-by-order information about the numerical solution of the LBE. The asymptotic technique enables us to analyze the structure of the leading order errors and the accuracy of numerically derived quantities, such as vorticity. It also justifies the use of Richardson's extrapolation method. As an example, a two-dimensional Taylor-vortex flow is used to validate our analysis. The numerical results agree very well with our analytic predictions.
Slicing and characterizing typical-case behavior for component-based embedded systems
Authors: Margarida F. Jacome
Venue:  (2006)

This dissertation addresses the problem of assisting a designer to characterize typical-case behavior in support of early, system-level decisions during codesign of component-based embedded systems. A source code description of system behavior is assembled from a configuration of components whose behavior is expressed using a hardware description language, such as Verilog, or a programming language, such as C. Specifically, solutions are proposed to the problems of (1) navigating, understanding, and exploring a lengthy, complex hardware-software source code specification, and (2) interactively identifying a characterization of typical-case behavior in such a source code specification. The proposed solution to the first problem extends a form of source code analysis called program slicing to enable examination of a combined hardware-software source code specification. A slice is a subset of source code that affects the computation at a specific point in the source code specification. Extensions to graph-based slicing are proposed to model, both, a partial system specification, and the behavior implemented in hardware and software components, focusing on interactions across the hardware-software boundary. An algorithm to compute a context-sensitive, inter-process slice is proposed. This extended form of slicing for codesign is especially helpful when an embedded system designer needs to identify a subset of a combined source code specification for subsequent detailed analysis. The proposed solution to the second problem is an evaluation scenario, which is a set of control-flows specified on an underlying flow graph representation of the source code. A notation is proposed to annotate the flow graphs, as well as an interactive algorithm to assist a designer to specify the control-flows. The evaluation scenario is useful in that it identifies paths that correspond to typical-case behavior, as distinguished from worst-case (or best-case) behavioral paths identified in traditional static analysis approaches. The first key contribution, slicing for codesign, proposes a novel set of dependence relationships to model hardware and software, as well as a context-sensitive slicing algorithm with precision enhancements for certain inter-process dependences. The second key contribution, the evaluation scenario, proposes a notation and interactive specification algorithm that characterizes typical-case behavior based on a static analysis of source code.
Managing XML Documents with Time Certification using Database
Authors: Mingqiang Chen, Masatoshi Yoshikawa
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We propose a method to store XML document with time certification into relational database. We take into account update of XML document. The proposal database stores necessary information to generate XML document with time specifiication at a certain time. The relational database schema and XML generation algorithm are described.
Registration of Cortical Connectivity Matrices
Authors: Pascal Cathier, Jean-Francois Mangin
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a novel formulation of the comparison of the neuroanatomy of different individuals. We propose to take into consideration and compare cortical connectivities, i.e. connections between different areas of the cortical surface through neural axon fiber bundles, as inferred from diffusion magnetic resonance volumes. Matching of cortical connectivity is a novel concept that could potentially open the way to many applications and research interests that motivate this work, such as the possible link between cortical connectivity and the appearance of sulci during morphogenesis, the study of causal relationships between functional areas in neurofunctional studies, or the relationship between cortical connectivity and different kinds of populations or diseases. This novel approach still lacks good understanding and mathematical modeling due to poor knowledge of human axon fiber anatomy. Our approach is a conservative one and consists in minimizing a robust distance between cortical connectivity matrices, while at the same time drastically simplifying the problem by imposing matrix entry pairings to stem from realistic spatial configurations, restricted to lie in a finite dimensional deformation space. The whole process is embedded in a multiresolution framework to improve both robustness of the match and computational load.
The Scalability of Heterogeneous Dispatcher-Based Web Server Load Balancing Architecture
Authors: Tsang-Long Pao, Jian-Bo Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The dispatcher-based web server load balancing architecture can improve the performance of popular web servers. When the backend servers have different computational power, the system must use the real-time loading information as the decision making criteria. In this paper, we proposed a dispatcher architecture that uses the remaining capacity of each backend servers to decide the most appropriate server. In addition to improve the performance, the system can also use the remaining capacity algorithm to reduce the cost when the web side does not have frequent burst request. For example, the course registration ticket reservation systems have burst requests only several times a year. The proposed architecture can use the remaining capacity of other servers such DNS or MAIL server to share the load in the burst request period. The simulation results show that using the remaining capacity of both DNS and MAIL server can achieve similar performance compared to using another dedicated web server.
Scheduling sleeping nodes in high density cluster-based sensor networks
Authors: Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney
Venue: Mobile Networks and Applications (2005)

In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of the proposed LDS scheme. The performance of the LDS scheme is compared with that of the conventional Randomized Scheduling (RS) scheme. It is shown that the LDS scheme yields more energy savings while maintaining a similar sensing coverage as the RS scheme for sensor clusters. Therefore, the LDS scheme results in a longer network lifetime than the RS scheme.
CRUTCH: An Integration Framework forWeb Service and MAS
Authors: Zhiyong Feng, Qiming Cheng, Fei Zhao
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper proposed a novel software evolution methodology CRUTCH that can rapidly integrate partners' web services into internal agentified legacy system running on JADE. CRUTCH achieves this goal in two ways. On one hand, CRUTCH provides an architecture view that extends the standard FIPA's agent platform with a web service finder agent named WSFinder; on the other hand, CRUTCH developed a package and a XML schema of web service find criteria, providing a configurable way for WSAgent ( agents who invoke external web service ) development. The simplified developing process can successfully alleviate the developer's pain and rapidly make the enterprise qualified for the competitive and cooperative business environment.
Automatic Video Annotation by Mining Speech Transcripts
Authors: Atulya Velivelli, Thomas S. Huang
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We describe a model for automatic prediction of text annotations for video data. The speech transcripts of videos, are clustered using an aspect model and keywords are extracted based on aspect distribution. Thus we capture the semantic information available in the video data. This technique for automatic keyword vocabulary construction makes the labelling of video data a very easy task. We then build a video shot vocabulary by utilizing both static images and motion cues. We use a maximum entropy criterion to learn the conditional exponential model by defining constraint features over the shot vocabulary, keyword vocabulary combinations. Our method uses a maximum a posteriori estimate of exponential model to predict the annotations. We evaluate the ability of our model to predict annotations, in terms of mean negative log-likelihood and retrieval performance on the test set. A comparison of exponential model with baseline methods indicates that the results are encouraging.