ppxscal/embedding_network huggingface dataset:
Checking ownership and confinement: Research Articles
Authors: Alex Potanin, James Noble, Robert Biddle
Venue: Concurrency and Computation: Practice Experience (2004)

A number of proposals to manage aliasing in Java-like programming languages have been advanced over the last five years. It is not clear how practical these proposals are, that is, how well they relate to the kinds of programs currently written in Java-like languages. To address this problem, we analysed heap snapshots from a corpus of Java programs. Our results indicate that object-oriented programs do in fact exhibit symptoms of encapsulation in practice, and that proposed models of uniqueness, ownership, and confinement can usefully describe the aliasing structures of object-oriented programs. Understanding the kinds of aliasing present in programs should help us to design formalisms to make explicit the kinds of aliasing implicit in object-oriented programs. Copyright &copy; 2004 John Wiley & Sons, Ltd.
CHR grammars
Authors: Henning Christiansen
Venue: Theory and Practice of Logic Programming (2005)

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.
A Generic Component Framework for High Performance Locally Concurrent Computing Based on UML 2.0 Activities
Authors: Tim Schattkowsky, Alexander Forster
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Software support for Multiple hardware threads like the Pentium 4's Hyperthreading Technology or the upcoming multi-core desktop processors is required even for traditional single processor domains loke home and office systems. Although the modeling of concurrent systems is already quite advanced, the current engineering practice usually does not yield highly concurrent applications without significant extra efforts due to several limitations of most methods for concurrent systems design. Unlike other methods, we consider the problem as a deployment problem where the software components need to be deployed on different multiple execution units depending on the system configuration. To overcome this, we present a component model and design approach based on the execution semantics of UML2.0 Activities that enables the efficient design and construction of software applications with increased inherent concurrency and scalability for multi-processor platforms. The application of the approach and its benefits are demonstrated in a real world web server example.
The anatomy of SnakeT: a hierarchical clustering engine for web-page snippets
Authors: Paolo Ferragina, Antonio Gullì
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The purpose of a search engine is to retrieve from a given textual collection the documents deemed relevant for a user query. Typically a user query is modeled as a set of keywords, and a document is a Web page, a pdf file or whichever file can be parsed into a set of tokens (words). Documents are ranked in a flat list according to some measure of relevance to the user query. That list contains hyperlinks to the relevant documents, their titles, and also the so called (page or web) snippets, namely document excerpts allowing the user to understand if a document is indeed relevant without accessing it.
Maximum Split Clustering Under Connectivity Constraints
Authors: Mark Rooij, John C. Gower
Venue: Journal of Classification (2003)

Triadic distances t defined as functions of the Euclidean (dyadic) distances a1, a2, a3 between three points are studied. Special attention is paid to the contours of all points giving the same value of t when a3 is kept constant. These isocontours allow some general comments to be made about the suitability, or not, for practical investigations of certain definitions of triadic distance. We are especially interested in those definitions of triadic distance, designated as canonical, that have optimal properties. An appendix gives some results we have found useful.
Proxy-cache aware object bundling for web access acceleration
Authors: Chi-Hung Chi, HongGuang Wang, William Ku
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper, we address the acceleration of web page access through a novel proxy-cache aware object bundling technique. Richer content for a web page is always the result of increasing the number of embedded objects inside. However, due to the significant setup costs of a TCP connection, HTTP is known to be inefficient for transfers of small objects. As a result, request bundling techniques such as MGET and N-to-1 Bundle were proposed to eliminate the need for multiple requests by packing all associated embedded objects into a single bundle. However, these proposals all suffer from the lack of support from proxy caching. To address this problem, we firstly present the traffic characteristics of embedded object retrieval. This is then used as an argument upon which our proxy-cache aware PC-Bundle mechanism is built. The unique feature of our mechanism is that the advantages of all previously proposed bundle techniques can be achieved without any redundant object retrieval in the presence of proxy cache. Compared to previously proposed bundle requests such as N-to-1 Bundle, our PC-Bundle mechanism can achieve an improvement ranging from 21.2% to 34.8% for page latency reduction and 17.2% to 36.4% for page network traffic, which are very significant.
IT-based innovation in a digital economy: a social learning perspective
Authors: D. A. Wassenaar, C. P. Katsma
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

This paper argues that the existing notion of knowledge exchange and knowledge management is too static and mechanic. Building upon the SLC framework of Boisot and innovation theory we derive a model that is used to describe the implementation of Information Systems from a Knowledge Management (KM) perspective.We employ this model in three case studies of Enterprise System (ES) implementations. Enterprise Systems have been developing through the last decade from intra organizational systems (ERP) towards inter organizational information systems supporting both the internal supply chain as well as business processes over the borders of formal organizations. In that sense the later Enterprise Systems, including their best practices, can be seen as a specific knowledge container for e-business practices. The ES package is seen as a tangible software container element and an intangible content element of new knowledge (best practices) that has to be transferred from a source unit (ES vendor, ES consultant) to the destination unit.The analysis of our model shows it is well appropriate to characterize the typical learning experiences in the four cycles of ES implementations. In that sense it enhances the model of Markus & Tanis (2000). A typical trade off can be described between source and destination organization (Robey et all, 2000). We see an extra contribution of our model in a deepening of the four learning cycles. Each cycle has its own logic both in the cognitive as well as in the social perspective. We discern typical process/cycle problems within a cycle and transfer problems between the cycles. Carriers and barriers in the four cycles are identified and can help practitioners as well as scientists for being aware of the typical logic in each cycle.
Problems of satellite data calibration and thematic processing
Authors: U. Sultangazin, A. Terekhov, N. Muratova
Venue: Mathematics and Computers in Simulation (2004)

Calibration of remote sensing data with help of ground surveys is considered. This problem is discussed on the example of agricultural ecosystems productivity in the Northern Kazakhstan. The ground information is compared with satellite data for calibration and estimation of anticipated volumes of grain production.
Fast Exploration of Bus-Based On-Chip Communication Architectures
Authors: Sudeep Pasricha, Nikil Dutt, Mohamed Ben-Romdhane
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

As a result of improvements in process technology, more and more components are being integrated into a single System-on-Chip (SoC) design. Communication between these components is increasingly dominating critical system paths and frequently becomes the source of performance bottlenecks. It therefore becomes extremely important for designers to explore the communication space early in the design flow. Traditionally, pin-accurate Bus Cycle Accurate (PA-BCA) models were used for exploring the communication space. To speed up simulation, transaction based Bus Cycle Accurate (T-BCA) models have been proposed, which borrow concepts found in the Transaction Level Modeling (TLM) domain. More recently, the Cycle Count Accurate at Transaction Boundaries (CCATB) modeling abstraction was introduced for fast communication space exploration. In this paper, we describe the mechanisms that produce the speedup in CCATB models and demonstrate the effectiveness of the CCATB exploration approach with the aid of a case study involving an AMBA 2.0 based SoC subsystem used in the multimedia application domain. We also analyze how the achieved simulation speedup scales with design complexity and show that SoC designs modeled at the CCATB level simulate 120% faster than PA-BCA and 67% faster than T-BCA models on average.
Shape-Based Adult Image Detection
Authors: Qing-Fang Zheng, Wei Zeng, Gao Wen, Wei-Qiang Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper reports an investigation on adult images detection based on the shape features of skin regions. In order to accurately detect skin regions, we propose a skin detection method using multi-Bayes classifiers in the paper. Based on skin color detection results, shape features are extracted and fed into a boosted classifier to decide whether or not the skin regions represent a nude. We evaluate adult image detection performance using different boosted classifiers and different shape descriptors. Experimental results show that classification using boosted C4.5 classifier and combination of different shape descriptors outperforms other classification schemes.
Effects of reproduction equipment on interaction with a spatial audio interface
Authors: Georgios N. Marentakis, Stephen A. Brewster
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Spatial audio displays have been criticized because the use of headphones may isolate users from their real world audio environment. In this paper we study the effects of three types of audio reproduction equipment (standard headphones, bone-conductance headphones and monaural presentation using a single earphone) on time and accuracy during interaction with a deictic spatial audio display. Participants selected a target sound emitting from one of four different locations in the presence of distracters whilst wearing the different types of headphones. Target locations were marked with audio feedback. No significant differences were found for time and accuracy ratings between bone conductance and standard headphones. Monaural reproduction significantly slowed interaction. The results show that alternative reproduction equipment can be used to overcome user isolation from the natural audio environment.
eBag: a ubiquitous Web infrastructure for nomadic learning
Authors: Christina Brodersen, Bent G. Christensen, Kaj Grønbæk, Christian Dindler, Balasuthas Sundararajah
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

This paper describes the eBag infrastructure, which is a generic infrastructure inspired from work with school children who could benefit from a electronic schoolbag for collaborative handling of their digital material. The eBag infrastructure is utilizing the Context-aware HyCon framework and collaborative web services based on WebDAV. A ubiquitous login and logout mechanism has been built based on BlueTooth sensor networks. The eBag infrastructure has been tried out in field tests with school kids. In this paper we discuss experiences and design issues for ubiquitous Web integration in interactive school environments with multiple interactive whiteboards and workstations. This includes proposals for specialized and adaptive XLink structures for organizing school materials as well as issues in login/logout based on proximity of different display surfaces.
An Agent-Based Approach to Composite Mobile Web Services
Authors: Wassam Zahreddine, Qusay H. Mahmoud
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The ability to access web services over mobile devices would allow users to expand the capabilities of their appliance. Accessing several services to complete one goal can be cumbersome because now the user has to sift through several service providers and examine responses from each. This is inconvenient given the low bandwidth and high latency of wireless connections. This paper proposes an agent-based approach for composite mobile web services over mobile devices. Three methods for composition are discussed and compared.
Probabilistic Kernels for the Classification of Auto-Regressive Visual Processes
Authors: Antoni B. Chan, Nuno Vasconcelos
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a framework for the classification of visual processes that are best modeled with spatio-temporal auto-regressive models. The new framework combines the modeling power of a family of models known as dynamic textures and the generalization guarantees, for classification, of the support vector machine classifier. This combination is achieved by the derivation of a new probabilistic kernel based on the Kullback-Leibler divergence (KL) between Gauss-Markov processes. In particular, we derive the KL-kernel for dynamic textures in both 1) the image space, which describes both the motion and appearance components of the spatio-temporal process, and 2) the hidden state space, which describes the temporal component alone. Together, the two kernels cover a large variety of video classification problems, including the cases where classes can differ in both appearance and motion and the cases where appearance is similar for all classes and only motion is discriminant. Experimental evaluation on two databases shows that the new classifier achieves superior performance over existing solutions.
Adaptive Overlapped Declustering: A Highly Available Data-Placement Method Balancing Access Load and Space Utilization
Authors: Akitsugu Watanabe, Haruo Yokota
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper proposes a new data-placement method named Adaptive Overlapped Declustering, which can be applied to a parallel storage system using a value range partitioning-based distributed directory and primary-backup data replication, to improve the space utilization by balancing their access loads. The proposed method reduces data skews generated by data migration for balancing access load. While some data-placement methods capable of balancing access load or reducing data skew have been proposed, both requirements satisfied simultaneously. The proposed method also improves the reliability and availability of the system because it reduces recovery time for damaged backups after a disk failure. The method achieves this acceleration by reducing a large amount of network communications and disk I/O. Mathematical analysis shows the efficiency of space utilization under skewed access workloads. Queuing simulations demonstrated that the proposed method halves backup restoration time, compared with the traditional chained declustering method.
A Generic Attack on Checksumming-Based Software Tamper Resistance
Authors: Glenn Wurster, P. C. van Oorschot, Anil Somayaji
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

Self-checking software tamper resistance mechanisms employing checksums, including advanced systems as recently proposed by Chang and Atallah (2002) and Horne et al. (2002), have been promoted as an alternative to other software integrity verification techniques. Appealing aspects include the promise of being able to verify the integrity of software independent of the external support environment, as well as the ability to automatically integrate checksumming code during program compilation or linking. In this paper, we show that the rich functionality of many modern processors, including UltraSparc and x86-compatible processors, facilitates automated attacks which defeat such checksumming by self-checking programs.
Four scorers and seven years ago: the scoring method for MUC-6
Authors: Nancy Chinchor
Venue: Proceedings of the 6th conference on Message understanding (1995)

The MUC-6 scoring method is based on a two-step process of mapping an item generated by a system under evaluation (the "response") to the corresponding item in the human-generated answer key and then scoring the mapped items. The resulting scores are used for decision-making over the entire evaluation cycle, including refinement of the task definition based on interannotator comparisons, technology development using training data, validating answer keys, and benchmarking both system and human capabilities on the test data.
Precision Range Image Registration Using a Robust Surface Interpenetration Measure and Enhanced Genetic Algorithms
Authors: Luciano Silva, Olga R. P. Bellon, Kim L. Boyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

This paper addresses the range image registration problem for views having low overlap and which may include substantial noise. The current state of the art in range image registration is best represented by the well-known iterative closest point (ICP) algorithm and numerous variations on it. Although this method is effective in many domains, it nevertheless suffers from two key limitations: It requires prealignment of the range surfaces to a reasonable starting point and it is not robust to outliers arising either from noise or low surface overlap. This paper proposes a new approach that avoids these problems. To that end, there are two key, novel contributions in this work: a new, hybrid genetic algorithm (GA) technique, including hillclimbing and parallel-migration, combined with a new, robust evaluation metric based on surface interpenetration. Up to now, interpenetration has been evaluated only qualitatively; we define the first quantitative measure for it. Because they search in a space of transformations, GAs are capable of registering surfaces even when there is low overlap between them and without need for prealignment. The novel GA search algorithm we present offers much faster convergence than prior GA methods, while the new robust evaluation metric ensures more precise alignments, even in the presence of significant noise, than mean squared error or other well-known robust cost functions. The paper presents thorough experimental results to show the improvements realized by these two contributions.
Weakly Implicit Numerical Schemes for a Two-Fluid Model
Authors: Steinar Evje, Tore Flåtten
Venue: SIAM Journal on Scientific Computing (2005)

The aim of this paper is to construct semi-implicit numerical schemes for a two-phase (two-fluid) flow model, allowing for violation of the CFL criterion for sonic waves while maintaining a high level of accuracy and stability on volume fraction waves.By using an appropriate hybridization of a robust implicit flux and an upwind explicit flux, we obtain a class of first-order schemes, which we refer to as weakly implicit mixture flux (WIMF) methods. In particular, by using an advection upstream splitting method (AUSMD) type of upwind flux [S. Evje and T. Flåtten, J. Comput. Phys., 192 (2003), pp. 175--210], we obtain a scheme denoted as WIMF-AUSMD.We present several numerical simulations, all of them indicating that the CFL-stability of the WIMF-AUSMD scheme is governed by the velocity of the volume fraction waves and not the rapid sonic waves. Comparisons with an explicit Roe scheme indicate that the scheme presented in this paper is highly efficient, robust, and accurate on slow transients. By exploiting the possibility to take much larger time steps, it outperforms the Roe scheme in the resolution of the volume fraction wave for the classical water faucet problem. On the other hand, it is more diffusive on pressure waves.Although conservation of positivity for the masses is not proved, we demonstrate that a fix may be applied, making the scheme able to handle the transition to one-phase flow while maintaining a high level of accuracy on volume fraction fronts.
Comparative knowledge management: A pilot study of Chinese and American universities: Book Reviews
Authors: Qian Geng, Charles Townley, Kun Huang, Jing Zhang
Venue: Journal of the American Society for Information Science and Technology (2005)

Comparative study of knowledge management (KM) promises to lead to more effective knowledge use in all cultural environments. This pilot study compares KM priorities, needs, tools, and administrative structure components in large Chinese and American universities. General KM theory and literature related to KM in higher education are analyzed to develop the four components of the study. Comparative differences in KM practice at large Chinese and American universities are analyzed for each component. A correlation matrix reveals statistically significant co-variation among all but one of the study components. Four conclusions related to comparative KM and suggestions for future research are presented. &copy; 2005 Wiley Periodicals, Inc.
Multiple pattern associations for interpreting structural and functional characteristics of biomolecules
Authors: David K. Y. Chiu, Andrew K. C. Wong
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Pattern discovery from a data set can be intractable because both the detection and the interpretation of the patterns can be ill-posed and combinatorically explosive. This paper presents a knowledge exploratory method using multiple pattern associations to conjecture structural and functional characteristics of biomolecules. We first consider each site from an ensemble of aligned biomolecules as an attribute and the observed unit at the site as its value. Our method identifies those consistently observed attribute values whose associations with others deviate significantly from their null hypothesis. In addition, variables (representing molecular sites) with the detected attribute values as outcomes can be further analyzed. By integrating these associations, exploratory knowledge for interpreting the detected patterns could be discovered. During the interpretation phase, consistent and relevant descriptions of the data are searched. From the experiments using cytochrome c sequences, the discovered statistical patterns are found to be significant in relating to the location of a site with respect to its molecular structural characteristics and stability of functionality.