ppxscal/embedding_network huggingface dataset:
Theme creation for digital collections
Authors: Xia Lin, Jiexun Li, Xiaohua Zhou
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

This paper presents an approach for integrating multiple sources of semantics for the creating metadata. A new framework is proposed to define topics and themes with both manually and automatically generated terms. The automatically generated terms include: terms from a semantic analysis of the collections and terms from previous user's queries. An interface is developed to facilitate the creation and use of such topics and themes for metadata creation. The framework and the interface promote human-computer collaboration in metadata creation. Several principles underlying such approach are also discussed.
A priori and a posteriori error analyses in the study of viscoelastic problems
Authors: J. R. Fernández, P. Hild
Venue: Journal of Computational and Applied Mathematics (2009)

In this work, the numerical approximation of a viscoelastic problem is studied. A fully discrete scheme is introduced by using the finite element method to approximate the spatial variable and an Euler scheme to discretize time derivatives. Then, two numerical analyses are presented. First, a priori estimates are proved from which the linear convergence of the algorithm is derived under suitable regularity conditions. Secondly, an a posteriori error analysis is provided extending some preliminary results obtained in the study of the heat equation. Upper and lower error bounds are obtained.
Orb
Authors: Joe Takayama
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

"Orb" is an algorithmic animation piece consisting of a collection of decorative objects. Gilded ornamental patterns on the surface of the objects were rendered as procedural bump textures generated with metaballs. Specifically, an original metaball algorithm that performs a threshold-detection process for all metaballs was used in this work. The algorithm can generate complicated and unexpected forms in which the curves of each metaball emerge partially. Metaballs with regular polygonal density distribution such as triangular or hexagonal were also used.
A note on the Bayes factor in a semiparametric regression model
Authors: Taeryon Choi, Jaeyong Lee, Anindya Roy
Venue: Journal of Multivariate Analysis (2009)

In this paper, we consider a semiparametric regression model where the unknown regression function is the sum of parametric and nonparametric parts. The parametric part is a finite-dimensional multiple regression function whereas the nonparametric part is represented by an infinite series of orthogonal basis. In this model, we investigate the large sample property of the Bayes factor for testing the parametric null model against the semiparametric alternative model. Under some conditions on the prior and design matrix, we identify the analytic form of the Bayes factor and show that the Bayes factor is consistent, i.e. converges to infinity in probability under the parametric null model, while converges to zero under the semiparametric alternative, as the sample size increases.
IAM: An Effective and Robust Protocol for P2P Live Streaming System
Authors: Hongfang Guo, Yusong Lin, Zongmin Wang
Venue: International Journal of Distributed Sensor Networks (2009)

The phenomenal success and popularity of peer-to-peer (p2p) streaming over the last decade took many providers, researchers, as well as the mass, by surprise. It would become the dominant type of traffic over the Internet in the very near future. The released Windows Vista contains its own P2P networking system. Though P2P streaming has become one of the most attractive network applications, it is still awaiting some technological breakthroughs. P2P streaming faces very different challenges from other P2P applications, such as file download. In live P2P streaming, the stringent real-time performance requirement in terms of bandwidth and latency is one of the challenges it faces. In addition, frequent joining and leaving of the autonomous end-hosts have more significant impact on the system performance. So the churn problem and reconstruction due to uncertainty are key challenges of P2P streaming. A number of solutions were proposed which did not take all the factors into account. This paper presents IAM (IP Address Matching), a novel protocol for P2P live streaming system. For overlay structure, neighbor selection algorithm-FAMM (Forward Address Maximum Matching), which allows the peer choose the close peers as neighbors, is proposed. In this mechanism peer selects neighbors by matching IP address in regular expression. IP address is assigned by area basically, so the closer the peers are, the more the same bits of IP address they have. Peer chooses the first m (m > 0) peers whose IP address has same bits with it as the neighbors. Meanwhile, the latency is generally low. FAMM just likes the DHT routing. As managing peer failures and proper recovery are of critical importance for a robust P2P streaming system, a new peer exception mechanism is also proposed which is the other central issue of the IAM. According to the different error information which the peer receives, it detects the departure or failure of the neighbor intelligently and recovers from an unstable state promptly. To evaluate the performance of the IAM, we have conducted extensive simulations and real-network experiment. The results indicate that IAM shortens the latency and is robust to the dynamic peers. It achieves superior comprehensive performance over Random scheme. It is proved effective in the real-network environment, and the latency of recovery is shortened significantly which is only 25% of that with the usual mechanism, as well.
A Conversation with Van Jacobson
Authors: John Stanik
Venue: Queue (2009)

The TCP/IP pioneer discusses the promise of content-centric networking with BBN chief scientist Craig Partridge.
Movable cameras enhance social telepresence in media spaces
Authors: Hideyuki Nakanishi, Yuki Murakami, Kei Kato
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Media space is a promising but still immature technology to connect distributed sites. We developed a simple additional function that moved a remote camera forward when a local user approached a display so that the approach was amplified by a remote person's expanding image accompanied by motion parallax. We conducted an experiment in which we observed that a movable camera enhanced social telepresence, which is the feeling of facing a remote person in the same room. Despite the camera's movement, subjects believed that the camera did not move and a zoom-in function expanded the image. Surprisingly, a zoom-in camera that expanded the image as the movable camera did, however, was ineffective probably because of a lack of motion parallax. Although we explained nothing about the camera, most subjects noticed that their walking caused the view's expansion. If a remote person initiated the camera's movement, social telepresence could not be enhanced.
Minimizing the normalized sum of square for workload deviations on m parallel processors
Authors: Johnny C. Ho, Tzu-Liang (Bill) Tseng, Alex J. Ruiz-Torres, Francisco J. López
Venue: Computers and Industrial Engineering (2009)

In many organizations, it is desirable to distribute workload as equally as possible among a group of employees or machines. This paper proposes a performance measure, that we call the Normalized Sum of Square for Workload Deviations (NSSWD), and studies the problem of how to schedule a set of n jobs on m parallel identical processors in order to minimize the NSSWD. The NSSWD criterion is relevant where uniformity of wear to machines or of workload to employees is desirable. An algorithm, called Workload Balancing (WB), is proposed for solving this problem. Moreover, we perform a simulation experiment to evaluate WB against several well-known heuristics in the literature. Lastly, we discuss the computational results obtained from the simulation experiment.
Web Cost Estimation and Productivity Benchmarking
Authors: Emilia Mendes
Venue: Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno, Italy, Revised Tutorial Lectures (2009)

Web cost estimation models and productivity analysis reports help project managers allocate resources more adequately, control costs, schedule and improve current practices, leading to projects that are finished on time and within budget. Therefore this chapter has two main objectives. The first is to introduce the concepts related to Web cost estimation Web applications' sizing and present a case study where a real Web cost model is built; the second is to introduce the concepts of productivity measurement benchmarking, and to also present a case study on productivity benchmarking.
A HDWT-based reversible data hiding method
Authors: Yung-Kuan Chan, Wen-Tang Chen, Shyr-Shen Yu, Yu-An Ho, Chwei-Shyong Tsai, Yen-Ping Chu
Venue: Journal of Systems and Software (2009)

This paper presents a reversible data hiding method which provides a high payload and a high stego-image quality. The proposed method transforms a spatial domain cover image into a frequency domain image using the Haar digital wavelet transform (HDWT) method, compresses the coefficients of the high frequency band by the Huffman (or arithmetic) coding method, and then embeds the compression data and the secret data in the high frequency band. Since the high frequency band incorporates less energy than other bands of an image, it can be exploited to carry secret data. Furthermore, the proposed method utilizes the Huffman (or arithmetic) coding method to recover the cover image without any distortion. The proposed method is simple and the experimental results show that the designed method can give a high hiding capacity with a high quality of stego-image.
Specifying and Monitoring Interactions and Commitments in Open Business Processes
Authors: William N. Robinson, Sandeep Purao
Venue: IEEE Software (2009)

Business processes are increasingly complex and open because they rely on services that are distributed geographically and across organizations. So, they're prone to several points of failure. Monitoring, therefore, remains an important concern. A new approach specifies and monitors interactions among heterogeneous services by tracking their commitments. This approach extends recent research that views business process design as a composition of interaction protocols. It specifies and monitors policies and commitments as a way to monitor service-level agreements and recover from process failures.
Opportunistic overlays: efficient content delivery in mobile ad hoc networks
Authors: Yuan Chen, Karsten Schwan
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Current content-based publish/subscribe systems assume network environments with stable nodes and network topologies. For mobile environments, one resulting problem is a mismatch between static broker topologies and dynamic underlying network topologies. This mismatch will result in inefficiencies in event delivery, especially in mobile ad hoc networks where nodes frequently change their locations. This paper presents a novel middleware approach termed opportunistic overlays, and its dynamically reconfigurable support framework to address such inefficiencies introduced by node mobility in publish/subscribe systems. The opportunistic overlay approach dynamically adapts event dissemination structures (i.e., broker overlays) to changes in physical network topology, in nodes' physical locations, and in network node behaviors, with the goal of optimizing end-to-end delays in event delivery. Runtime adaptations include the dynamic construction of broker overlay networks and changes of mobile clients' assignments to brokers. Experimental results demonstrate that the opportunistic overlay approach is practically applicable and that the performance advantages attained from the use of opportunistic overlays can be substantial.
On the state of IP spoofing defense
Authors: Toby Ehrenkranz, Jun Li
Venue: ACM Transactions on Internet Technology (TOIT) (2009)

IP source address spoofing has plagued the Internet for many years. Attackers spoof source addresses to mount attacks and redirect blame. Researchers have proposed many mechanisms to defend against spoofing, with varying levels of success. With the defense mechanisms available today, where do we stand&quest; How do the various defense mechanisms compare&quest; This article first looks into the current state of IP spoofing, then thoroughly surveys the current state of IP spoofing defense. It evaluates data from the Spoofer Project, and describes and analyzes host-based defense methods, router-based defense methods, and their combinations. It further analyzes what obstacles stand in the way of deploying those modern solutions and what areas require further research.
Proto-reduct Fusion Based Relevance Feedback in CBIR
Authors: Samar Zutshi, Campbell Wilson, Bala Srinivasan
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper proposes two related RF methods for use in CBIR. These two methods are based on a general classificatory analysis based framework for RF in CBMR that considers RF independently from retrieval. The proposed methods show how the user's information need expressed as a set of "proto-reducts'' can be used as the basis of a re-weighting technique that can improve subsequent retrieval The performance of the proposed methods is studied on two image collections with different characteristics and compared against an existing RF method.
Representing Clifford Algebra into OMDOC semantic format
Authors: Ratish Shrestha, Michael Watts,  Jr., Wendy Zhang, Kuo-pao Yang
Venue: Journal of Computing Sciences in Colleges (2009)

This paper describes about converting mathematical expressions from the Clifford Algebra textbook into Open Math Document (OMDoc) format. OMDoc is used to define mathematical theorems and semantics of mathematical objects and present the mathematical theorem in XML format over the Internet. OMDoc is an extension of OpenMath standard. The content dictionaries of OMDoc provide semantics to a rich set of mathematical expressions. OMDoc allows defining our own set of content dictionaries and symbols to express any mathematical expressions. Clifford's geometric algebra, one of the mathematical theorems applied in Physics, is defined by a set of axioms that explain the definitions and identities of mathematical properties. In this paper, several mathematical expressions of Geometric Algebra are presented into OMDoc format. This research initiates OMDoc approach in the Physics field and will continue defining symbols that are not yet defined in the content dictionaries of OpenMath in the future.
Hadamard product of certain meromorphic starlike and convex functions
Authors: R. M. El-Ashwah, M. K. Aouf
Venue: Computers Mathematics with Applications (2009)

In this paper, the authors establish certain results concerning the Hadamard product for two classes related to starlike and convex univalent meromorphic functions of order @a and type @b with positive coefficients.
Computer assisted instruction comes of age in a public school system
Authors: William M. Richardson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

During the late 1960's a number of public schools began experimenting with the development and use of computer-assisted and computer-managed instruction. Funding for these public school projects was provided primarily by Title III of the Elementary and Secondary Education Act of 1965, or other sources of federal funds. Due to the reduced availability of federal funding, few new public school CAI projects have been initiated since 1970. It is, however, very encouraging to analyze the results of the few active public schools CAI projects. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A location-ID sensitive key establishment scheme in static wireless sensor networks
Authors: Li Chen, Chia-Chang Hsu, Chin-Laung Lei
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Sensor networks are usually consist of thousands of resource-limited nodes and are deployed in a designated area without any fixed infrastructure. While the establishment of the pairwise keys between any pair of adjacent nodes to build a secure link remains the main concern in the design of key management protocols, malicious attacks aim at routing information, exhaust node's resource, and compromised secrets can misdirect the data flow or denial the network service with relatively small effort. Many mission-critic sensor network applications demand an effective, light, and flexible algorithm yet robust under attacks. Based on the LEAP+ scheme, we propose an improved LEAP+ by adding location information into the key establishment phase. By identifying the correctness of the id-location pair, our scheme effectively limits the Sybil attack and mitigates the damage of HELLO flood attack and node cloning attack. We furthermore propose an authentication phase in our scheme to defend possible replay attacks. The analysis shows that our scheme is more robust than LEAP+ with only minor increase of computation overhead.
Current issues in electronic mail: heralding a new era
Authors: Walter Ulrich
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Electronic mail is a quick, convenient, and low-cost way to handle people-to-people communications. Each form of electronic mail---computer message systems, communicating word processors, facsimile, and voice mail---is successfully serving organizations and individuals. The ultimate integration of these forms of electronic mail will be far more useful functionally than each one taken independently. This paper discusses the integration of electronic mail and introduces three companion papers; the four together make up the 1983 session on electronic mail.
New embedded control system for enzymatic hydrolysis
Authors: J. Dolinay, P. Dostálek, V. Vašek, K. Kolomazník, D. Janáčová
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

This paper describes implementation of new computer system for measurement and control of laboratory system for recycling chromium from tannery waste. The laboratory is used for verification and further research of unique chromium-recycling technology based on enzymatic hydrolysis developed at our institute. As the original control equipment reached the end of its service life, it was decided to rebuild the technology with modern means of automatic control. This paper briefly introduces the whole system and then focuses on the control structure of the most important part of the technology. The process of implementing new computer control system from choosing the devices to final activation of the system is described, including the problems faced along the way and the means used to solve them.
Computer-aided evaluation of neuroblastoma on whole-slide histology images: Classifying grade of neuroblastic differentiation
Authors: J. Kong, O. Sertel, H. Shimada, K. L. Boyer, J. H. Saltz, M. N. Gurcan
Venue: Pattern Recognition (2009)

Neuroblastoma (NB) is one of the most frequently occurring cancerous tumors in children. The current grading evaluations for patients with this disease require pathologists to identify certain morphological characteristics with microscopic examinations of tumor tissues. Thanks to the advent of modern digital scanners, it is now feasible to scan cross-section tissue specimens and acquire whole-slide digital images. As a result, computerized analysis of these images can generate key quantifiable parameters and assist pathologists with grading evaluations. In this study, image analysis techniques are applied to histological images of haematoxylin and eosin (H&E) stained slides for identifying image regions associated with different pathological components. Texture features derived from segmented components of tissues are extracted and processed by an automated classifier group trained with sample images with different grades of neuroblastic differentiation in a multi-resolution framework. The trained classification system is tested on 33 whole-slide tumor images. The resulting whole-slide classification accuracy produced by the computerized system is 87.88%. Therefore, the developed system is a promising tool to facilitate grading whole-slide images of NB biopsies with high throughput.
Discrete rate simulation using linear programming
Authors: Cecile Damiron, Anthony Nastasi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Discrete Rate Simulation (DRS) is a modeling methodology that uses event based logic to simulate linear continuous processes and hybrid systems. These systems are concerned with the movement and routing of flow. DRS has multiple advantages. Compared to continuous flow modeling, DRS minimizes the number of simulation calculations and posts events exactly when the model changes state. Compared to discrete event modeling, DRS makes the creation of hybrid models completely transparent. Finally, DRS provides advanced methods for routing flow. In DRS the challenging part is to accurately calculate the movement of flow. This paper describes how we identified DRS as a global optimization problem and how we used linear programming (LP) algorithms to perform the required calculations. The use of LP provides global oversight and is a major improvement for DRS. The result is an advanced, intuitive, robust and flexible method for simulating the movement of flow.
Improved GuoTao Algorithm for Unconstrained Optimization Problems
Authors: Ziyi Chen, Lishan Kang, Lijun Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper presents an improved GuoTao algorithm for solving unconstrained optimization problems. The algorithm combines the multi-parent crossover operator of GuoTao algorithm with two local search operators. The first local search operator is a simplified Hooke-Jeeves algorithm which can find near-optimal solutions near the start point within reasonable computational time. And the second local search operator is a powell algorithm which can find the local optimal solution near the start point. The multi-parent crossover operator can enables individual to draw closer to each local optimal solution, thus the population will be divided into subpopulations automatically, meanwhile, the first local search operator is adopted to gain near-optimal solution in each subpopulation. As a result, the promising areas are gained quickly which decrease useless search greatly. At last, the second local search operator is adopted to find the global optimal solution only from those promising areas.Numerical experiments using a suite of test functions, which are widely studied in the field of evolutionary computation, show that the proposed algorithm is superior to GuoTao algorithm for solving unconstrained optimization problems with high dimensionality.