ppxscal/embedding_network huggingface dataset:
The scalable modeling system: directive-based code parallelization for distributed and shared memory computers
Authors: M. Govett, L. Hart, T. Henderson, J. Middlecoff, D. Schaffer
Venue: Parallel Computing (2003)

A directive-based parallelization tool called the Scalable Modeling System (SMS) is described. The user inserts directives in the form of comments into existing Fortran code. SMS translates the code and directives into a parallel version that runs efficiently on shared and distributed memory high-performance computing platforms including the SGI Origin, IBM SP2, Cray T3E, Sun, and Alpha and Intel clusters. Twenty directives are available to support operations including array re-declarations, inter-process communications, loop translations, and parallel I/O operations. SMS also provides tools to support incremental parallelization and debugging that significantly reduces code parallelization time from months to weeks of effort. SMS is intended for applications using regular structured grids that are solved using finite difference approximation or spectral methods. It has been used to parallelize 10 atmospheric and oceanic models, but the tool is sufficiently general that it can be applied to other structured grids codes. Recent performance comparisons demonstrate that the Eta, Hybrid Coordinate Ocean model and Regional Ocean Modeling System model, parallelized using SMS, perform as well or better than their OpenMP or Message Passing Interface counterparts.
Transfer of information technology to the Arab world: a test of cultural influence modeling
Authors: Detmar W. Straub, Karen D. Loch, Carole E. Hill
Venue: Advanced topics in global information management (2003)

The complex societal beliefs and values of the Arab world provide a rich setting to examine the hypothesized influence of culture on information technology transfer (ITT). Two research questions arise in this context: (1) Do cultural beliefs and values affect the transference of information technology in the Arab world? and (2) Does contact with technologically advanced societies impact ITT and systems outcomes? The present study addresses these research questions by conceptualizing and testing a cultural influence model of ITT. In this model, cultural beliefs and values are one major construct while a counterbalancing variable is the external influence of technologically advanced societies. These constructs along with the variable "national IT development "form the conceptual basis for the model. This study is the second part of a program of research investigating ITT. The setting of the study was Arab society, which allowed us to test our "cultural influence" model in, perhaps, one of the more complex cultural and social systems in the world. The program of research took place in several phases. In the early phases, Arab-American businessmen and women as well as Arabs studying in American universities were studied. In the latter phases, the cross-disciplinary research team gathered primary data in the Arab cultures of Jordan, Egypt, Saudi Arabia, Lebanon, and the Sudan. Both quantitative and qualitative techniques were used to explore the phenomenon of ITT. This paper reports quantitative findings from the latter phase. Findings suggest that the model has explanatory power. Arab cultural beliefs were a very strong predictor of resistance to systems and thus ITT; technological culturation was also a factor. These results have implications for future theory-testing and for technology policy-setting by responsible Arab leaders. Additionally, there are implications for transnational firms and managers charged with introducing IT in foreign ports, subsidiaries, offices, and plants.
A High-Performance Distributed Algorithm for Mining Association Rules
Authors: Assaf Schuster, Ran Wolff, Dan Trock
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We present a new distributed association rule mining(D-ARM) algorithm that demonstrates superlinear speedupwith the number of computing nodes. The algorithm isthe first D-ARM algorithm to perform a single scan overthe database. As such, its performance is unmatched byany previous algorithm. Scale-up experiments over standard synthetic benchmarks demonstrate stable run time regardless of the number of computers. Theoretical analysisreveals a tighter bound on error probability than the oneshown in the corresponding sequential algorithm.
Data mining and cryptology
Authors: E. C. Laskari, G. C. Meletiou, D. K. Tasoulis, M. N. Vrahatis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This paper addresses the issue of mining encrypted data, in order to protect confidential information while permitting knowledge discovery. Common cryptographic algorithms are considered and their robustness against data mining algorithms is evaluated. Having identified robust cryptosystems, data are encrypted and well-known data mining techniques are applied on the encrypted data to produce classification rules which are then compared with those obtained from the initial nonencrypted databases.
A fresh look at low-power mobile computing
Authors: Michael Franz
Venue: Compilers and operating systems for low power (2003)

We challenge the apparent consensus that next-generation mobile devices must necessarily provide resource-intensive capabilities such as on-device Java implementations to support advanced applications. Instead, we propose an architecture that exploits the high "last mile" bandwidth in third generation wireless networks to enable the largest part of such applications to run inside a base station, effectively reducing the mobile device to a dumb terminal. We discuss some implications of this architecture, with respect to hand-off, confidentiality while roaming in potentially hostile networks, and the need for a server-transparent segmentation of applications into a computational and a user interface component.
A confluent λ-calculus with a catch/throw mechanism
Authors: Tristan Crolard
Venue: Journal of Functional Programming (1999)

We derive a confluent &lambda;-calculus with a catch&#002F;throw mechanism (called &lambda;ct-calculus) from Parigot's &lambda;&mu;-calculus. We also present several translations from one calculus into the other which are morphisms for the reduction. We use them to show that the &lambda;ct-calculus is a retract of &lambda;&mu;-calculus (these calculi are isomorphic if we consider only convertibility). As a by-product, we obtain the subject reduction property for the &lambda;ct-calculus, as well as the strong normalization for &lambda;ct-terms typable in the second order classical natural deduction.
Providing Efficient Video-on-Demand Service
Authors: Yuqi Hu, Huaiquan Zang, Renxiang Yan, Yuan Gao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

A new video transmission scheme called CMP (Client Multicast Patching) is proposed based on representative Multicast Patching [1] for proxy-based distributed VOD. When an appointed client plays a video, it is also acting as a server transmitting the partial video segments via multicast for latter requests in local network, therefore regional abundant network bandwidth is utilized instead of a remote server and backbone network bandwidth. The appointed client is not burdened with extra I/O bandwidth requirement and instantaneous service for client requests is provided. In addition, the CMP scheme is adaptive to video popularity. Our simulation study shows that significant network resource can be saved with the CMP scheme.
Finite difference heterogeneous multi-scale method for homogenization problems
Authors: Assyr Abdulle, E. Weinan
Venue: Journal of Computational Physics (2003)

In this paper, we propose a numerical method, the finite difference heterogeneous multi-scale method (FD-HMM), for solving multi-scale parabolic problems. Based on the framework introduced in [Commun. Math. Sci. 1 (1) 87], the numerical method relies on the use of two different schemes for the original equation, at different grid level which allows to give numerical results at a much lower cost than solving the original equations. We describe the strategy for constructing such a method, discuss generalization for cases with time dependency, random correlated coefficients, nonconservative form and implementation issues. Finally, the new method is illustrated with several test examples.
Tree-structured Partitioning Based on Splitting Histograms of Distances
Authors: Longin Jan Latecki, Rajagopal Venugopal, Marc Sobel, Steve Horvath
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose a novel clustering algorithm that is similar in spiritto classification trees. The data is recursively split using a criterionthat applies a discrete curve evolution method to the histogramof distances. The algorithm can be depicted throughtree diagrams with triple splits. Leaf nodes represent eitherclusters or sets of observations that can not yet be clearly assignedto a cluster. After constructing the tree, unclassified datapoints are mapped to their closest clusters. The algorithm hasseveral advantages. First, it deals effectively with observationsthat can not be unambiguously assigned to a cluster by allowinga "margin of error". Second, it automatically determinesthe number of clusters; apart from the margin of error the useronly needs to specify the minimal cluster size but not the numberof clusters. Third, it is linear with respect to the number ofdata points and thus suitable for very large data sets. Experimentsinvolving both simulated and real data from differentdomains show that the proposed method is effective and efficient.
Studying Balanced Allocations with Differential Equations
Authors: Michael Mitzenmacher
Venue: Combinatorics, Probability and Computing (1999)

Using differential equations, we examine the GREEDY algorithm studied by Azar, Broder, Karlin and Upfal for distributed load balancing [1]. This approach yields accurate estimates of the actual load distribution, provides insight into the exponential improvement GREEDY offers over simple random selection, and allows one to prove tight concentration theorems about the loads in a straightforward manner.
Using SVG as the rendering model for structured and graphically complex web material
Authors: Julius C. Mong, David F. Brailsford
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an attempt to create an approach that integrates the structural and display aspects of a Web document in a single XML-compliant envelope.Although the syntax of SVG is XML based, the semantics of the primitive graphic operations more closely resemble those of page description languages such as PostScript or PDF. The principal usage of SVG, so far, is for inserting complex graphic material into Web pages that are predominantly controlled via (X)HTML and CSS.The conversion of structured and unstructured PDF into SVG is discussed. It is found that unstructured PDF converts into pages of SVG with few problems, but difficulties arise when one attempts to map the structural components of a Tagged PDF into an XML skeleton underlying the corresponding SVG. These difficulties are not fundamentally syntactic; they arise largely because browsers are innately bound to (X)HTML/CSS as their default rendering model. Some suggestions are made for ways in which SVG could be more totally integrated into browser functionality, with the possibility that future browsers might be able to use SVG as their default rendering paradigm.
Approximate matching algorithms for music information retrieval using vocal input
Authors: Richard L. Kline, Ephraim P. Glinert
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these may best be searched by providing input queries in some musical form. For the average person, humming several notes of the desired melody is the most straightforward method for providing this input, but such input is very likely to contain several errors. Previously proposed implementations of so-called query-by-humming systems are effective only when the number of input errors is small. We conducted experiments which revealed that the expected error rate for user queries is much higher than existing algorithms can tolerate. We then developed algorithms based on approximate matching techniques which deliver much improved results when comparing error-filled vocal user queries against a music collection.
Law, learning and representation
Authors: Kevin D. Ashley, Edwina L. Rissland
Venue: Artificial Intelligence (2003)

In machine learning terms, reasoning in legal cases can be compared to a lazy learning approach in which courts defer deciding how to generalize beyond the prior cases until the facts of a new case are observed. The HYPO family of systems implements a "lazy" approach since they defer making arguments how to decide a problem until the programs have positioned a new problem with respect to similar past cases. In a kind of "reflective adjustment", they fit the new problem into a patchwork of past case decisions, comparing cases in order to reason about the legal significance of the relevant similarities and differences. Empirical evidence from diverse experiments shows that for purposes of teaching legal argumentation and performing legal information retrieval, HYPO-style systems' lazy learning approach and implementation of aspects of reflective adjustment can be very effective.
Improving the efficiency of the Bayesian network retrieval model by reducing relationships between terms
Authors: Luis M. de Campos, Juan M. Fernández-Luna, Juan F. Huete
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

The Bayesian Network Retrieval Model is able to represent the main (in)dependence relationships between the terms from a document collection by means of a specific type of Bayesian network, namely a polytree. However, although the learning and propagation algorithms designed for this topology are very efficient, in collections with a very large number of terms, these two tasks might be very time-consuming. This paper shows how by reducing the size of the polytree, which will only comprise one subset of terms which are selected according to their retrieval quality, the performance of the model is maintained, whereas the efforts needed to learn and later propagate in the model are considerably reduced. A method for selecting the best terms, based on their inverse document frequency and term discrimination value, is also presented.
Inhibiting Deception and Its Detection
Authors: Joey F. George, Kent Marett
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Computer-mediated communication is becoming ubiquitous in our networked society. Yet one aspect of human communication that is rarely explored in the context of computer-mediated communication is deception. Deception is common, yet communication research has shown that people perform little better than chance at successfully detecting it. Two different laboratory studies of deception and its detection in face-to-face groups, communicating either with electronic support or without it, are reported on here. In both studies, subjects were very poor at detecting deception, across media. Yet third parties who had not taken part in the group meetings were able to detect about half or more of the deceptive statements that appeared in the transcripts of the group meetings. A possible explanation explored here is the role of social facilitation and the inhibiting influence it may have on deception and on its detection.
Steganography in halftone images: conjugate error diffusion
Authors: Ming Sun Fu, Oscar C. Au
Venue: Signal Processing (2003)

In this paper, we propose a method called data hiding by conjugate error diffusion (DHCED) to hide an invisible binary visual pattern in two or more error diffused halftone images, which can be from the same or different multi-tone images. In DHCED, distortions of limited magnitude are added to the multi-tone image such that the pixel values of the various halftone images tend to be conjugate to each other. With the conjugate relationship, the dark regions of the hidden pattern would appear on the halftone images when they are overlaid. Simulation results show that the DHCED watermarked halftone images have good visual quality, and the hidden pattern is revealed with good contrast when the watermarked halftone images are overlaid. Even better contrast can be achieved when more than two watermarked halftone images are used.
A Policy Validation Framework for Enterprise Authorization Specification
Authors: Ramaswamy Chandramouli
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

The validation of enterprise authorizationspecification for conformance to enterprise securitypolicies requires an out-of-band framework in manysituations since the enforcing access control mechanismdoes not provide this feature. In this paper we describeone such framework. The framework uses XML to encodethe enterprise authorization specification, XML Schemato specify the underlying access control model (which inour case is the Role-based Access control Model (RBAC))and Schematron language to encode the policyconstraints. The conformance of the XML-encodedenterprise authorization specification to the structure ofthe RBAC model (specified through XML Schema) as wellas the policy constaints (specified through Schematron)are verified through a Schematron Validator tool.
An information push-delivery system design for personal information service on the internet
Authors: Chen-Tung Chen, Wei-Shen Tai
Venue: Information Processing and Management: an International Journal (2003)

As Web-related techniques and equipment grow, the Internet has become popular as a major channel for providing a wide variety of information. However, users face the serious problem of information overload when acquiring increasing amounts of information from the Internet. This problem is one of the most important issues in providing information services to meet users' requirements in an electronic commerce environment. In this paper, we propose an information push-delivery system, which applies fuzzy information retrieval and fuzzy similarity measurement to avoid the information overload problem. This proposed system is helpful for users to acquire suitable information from the Internet. An empirical investigation of the proposed system is implemented in this study. The results show that the degree of satisfaction for the received information for all participants was as high as 71%, indicating that the proposed system can effectively provide correct and interesting information for users.
Generic image classification using visual knowledge on the web
Authors: Keiji Yanai
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we describe a generic image classification system with an automatic knowledge acquisition mechanism from the World-Wide Web. Due to the recent spread of digital imaging devices, the demand for image recognition of various kinds of real world scenes becomes greater. For realizing it, visual knowledge on various kinds of scenes is required. Then, we propose gathering visual knowledge on real world scenes for generic image classification from the World-Wide Web. Our system gathers a large number of images from the Web automatically and makes use of them as training images for generic image classification. It consists of three modules, which are an image-gathering module, an image-learning module and an image classification module. The image-gathering module gathers images related to given class keywords from the Web automatically. The learning module extracts image features from gathered images and associates them with each class. The image classification module classifies an unknown image into one of the classes corresponding to the class keywords by using the association between image features and classes. In the experiments, we achieved a classification rate 44.6% for generic images by using images gathered from the World-Wide Web automatically as training images.
Improving Real-Time System Con.guration via a QoS-Aware CORBA Component Model
Authors: Nanbor Wang, Christopher Gill
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

A fundamental tension exists in systems research and practice between (1) hiding extraneous details to simplify the system programming model, and (2) revealing crucial details to allow better customization to particular application requirements, data characteristics, or other constraints. For many modern systems, such as distributed real-time and embedded (DRE) systems and multimedia applications, this tension is even stronger: the correctness of the system depends not only on functional behavior (e.g., correctness of interfaces and the algorithms behind them) but also on quality of service (QoS) properties such as CPU speeds, frame rates, and end-to-end timeliness requirements. Satisfying both the functional and QoS requirements of modern applications running in various run-time environments requires programming models that can allow selective visibility and (re)con.gurability of key details in both the application and the services it uses.Although prior research and practice has focused on decoupling system properties from the application logic to facilitate modification at different points in the system lifecycle, some system properties cross-cut both (1) multiple layers (application and supporting infrastructure) and (2) multiple configuration phases in the system lifecycle. To date, there has been little support for configuring such cross-cutting concerns in a systematic and standardizedway across different kinds of applications. This has resulted historically in laborious and ad hoc hand-customization of systems to meet real-world constraints, especially for DRE systems.However, the convergence of model-integrated computing with component-oriented middleware in the DRE middleware research community offers a new opportunity for automated coordination of system modifications at different layers and at different points in the system lifecycle, to meet application requirements end-to-end. We are extending the Component-Integrated ACE ORB (CIAO), to provide a unified system configuration capability that can be leveraged by higher-level modeling tools.This paper provides two main contributions to the state of the art in component middleware for model integrated computing in DRE systems. First, we present an argument based on a representative real-world example from the avionics mission computing domain, that multiple points of coordination in the CORBA Component Model (CCM), i.e., componentpackaging, assembly and deployment, are needed to assure feasibility and increase performance at run-time. Second, we summarize key lessons learned for configuring QoS properties such as event dependencies, rates of execution, and feasibility of deadlines, and describe which of the alternative configuration points in CCM are most appropriate in our example under different design considerations.