ppxscal/embedding_network huggingface dataset:
Research on an Intelligent On-Line Negotiation System
Authors: Yulian Fei, Guangming Wang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With the rapid growth of electronic commerce, there is growing demand and great potential for online negotiation services. This paper focuses on the intelligence e-negotiation research based on web, and applies agent technique in business negotiation. Existing web based negotiation support systems separate the solution-driven negotiation and process-driven negotiation, this paper introduces an interactive multi-target negotiation model to solve this problem. Furthermore, by analyzing the logical structure and information flow of negotiation, the Intelligent Negotiation System On-Line (INSOL) is proved to be convincible.
NP predicates computable in the weakest level of the Grzegorczyck hierarchy
Authors: Cristian Grozea
Venue: Journal of Automata, Languages and Combinatorics (2004)

Let (εr)r∈N be the hierarchy of Grzegorczyk. Its weakest level, ε0 is indeed quite weak, as it doesn't even contains functions such as max(x, y) or x + y. In this paper we show that SAT ∈ ε0 by developing a technique which can be used to show the same result holds for other NP problems. Using this technique, we are able to show that also the Hamiltonian Cycle Problem is solvable in ε0.
Mutualism Promotes Diversity and Stability in a Simple Artificial Ecosystem
Authors: Elizaveta Pachepsky, Tim Taylor, Stephen Jones
Venue: Artificial Life (2002)

This work investigates the effect of ecological interactions between organisms on the evolutionary dynamics of a community. A spatially explicit, individual-based model is presented, in which organisms compete for space and resources. We investigated how introducing the potential for mutualistic relationships (where the presence of one type of organism stimulates the growth of another type, and vice versa) affected the evolutionary dynamics of the system. Without this potential, one or a small number of individual types of organisms dominated the simulated community from the onset. When mutualistic relationships were allowed, many persisting types arose, with new types appearing continually. Furthermore, we investigated how the stability of the community differed when mutualistic relationships were allowed and disallowed. Our results suggest that the existence of mutualistic relationships improved community stability.
Mobility Modeling for Two-Tier IntegratedWireless Multimedia Networks
Authors: Ahmed H. Zahran, Ben Liang
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper presents a novel mobility modeling approach for a two-tier integrated wireless system that accommodates the system complexity represented by the residencetime correlation between different access networks. Additionally, a novel session model is presented as an adapted version of the proposed mobility model. Furthermore, we develop an analytical framework using this session model to obtain several salient performance metrics such as network utilization times and handoff rates. Simulation results demonstrate that the proposed mobility model is substantially more accurate than existing modeling techniques, and that the proposed analytical framework provide tractable performance evaluation based on the new mobility model.
Statistical Machine Translation with Scarce Resources Using Morpho-syntactic Information
Authors: Sonja Nießen, Hermann Ney
Venue: Computational Linguistics (2004)

In statistical machine translation, correspondences between the words in the source and the target language are learned from parallel corpora, and often little or no linguistic knowledge is used to structure the underlying models. In particular, existing statistical systems for machine translation often treat different inflected forms of the same lemma as if they were independent of one another. The bilingual training data can be better exploited by explicitly taking into account the interdependencies of related inflected forms. We propose the construction of hierarchical lexicon models on the basis of equivalence classes of words. In addition, we introduce sentence-level restructuring transformations which aim at the assimilation of word order in related sentences. We have systematically investigated the amount of bilingual training data required to maintain an acceptable quality of machine translation. The combination of the suggested methods for improving translation quality in frameworks with scarce resources has been successfully tested: We were able to reduce the amount of bilingual training data to less than 10&percnt; of the original corpus, while losing only 1.6&percnt; in translation quality. The improvement of the translation results is demonstrated on two German-English corpora taken from the Verbmobil task and the Nespole! task.
A computer applications course: 1970-1979
Authors: Philip Sidel
Venue: ACM SIGSOC Bulletin (1979)

In Volume 2, No. 2 of this <u>Bulletin</u> (December 1970), I described the course I was conducting in Computer Applications for the Social Sciences. Now, over eight years later, I am still teaching that course. It is interesting to look at the changes in content and organization. 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
Dealing with contract violations: formalism and domain specific language
Authors: Guido Governatori, Zoran Milosevic
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

This paper presents a formal system for reasoning about violations of obligations in contracts. The system is based on the formalism for the representation of contrary-to-duty obligations. These are the obligations that take place when other obligations are violated as typically applied to penalties in contracts. The paper shows how this formalism can be mapped onto the key policy concepts of a contract speci- fication language. This language, called Business Contract Language (BCL) was previously developed to express contract conditions of relevance for run time contract monitoring. The aim of this mapping is to establish a formal underpinning for this key subset of BCL.
Multiprocessor Scheduling and Rescheduling with Use of Cellular Automata and Artificial Immune System Support
Authors: Anna Swiecicka Franciszek Seredynski Albert Y. Zomaya
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

The paper presents cellular automata (CA)-based multiprocessor scheduling system, in which an extraction of knowledge about scheduling process occurs and this knowledge is used while solving new instances of the scheduling problem. There are three modes of the scheduler: learning, normal operating, and reusing. In the learning mode, a genetic algorithm is used to discover CA rules suitable for solving instances of a scheduling problem. In the normal operating mode, discovered rules are able to find automatically, without a calculation of a cost function, an optimal or suboptimal solution of the scheduling problem for any initial allocation of program tasks in a multiprocessor system. In the third mode, previously discovered rules are reused with support of an artificial immune system (AIS) to solve new instances of the problem. We present a number of experimental results showing the performance of the CA-based scheduler.
Influence of Zoning on Whole Word Recognition
Authors: Nasser Sherkat
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents the investigations carried out in improving the performance of a holistic cursive word recogniser using approximating splines. The holistic cursive word recogniser and the spline based zone line extraction mechanism are described. A series of tests are carried out using 3600 word images from 18 writes and a 200 word lexicon to compare the performance of the histogram based zone extraction with that of the spline based approach and the results are presented. It is found that the spline based zone extraction significantly improves the recognition results. The future directions of the research for further improvement of recognition performance are presented.
A Technique for Modular Design of Self-Checking Carry-Select Adder
Authors: D. P. Vasudevan, P. K. Lala
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

The carry-select adders provide significant speed improvement over other types of adders. This paper proposes a new approach for constructing self-checking carry-select adders of arbitrary size. The scheme is illustrated with the implementation of a 2-bit carry select adder that can detect a pre-determined set of faults online. Adders of arbitrary size can be constructed by simply cascading the appropriate number of 2-bit adders. A range of adders from 4 bit to 128 bits was designed using this approach employing a 0.5µ CMOS technology. The area needed for implementing the self-checking adders is 16.07% to 20.67% more than that required in adders without built-in self-checking capability.
The Usage Model: A Structure for Richly Describing Product Usage during Design and Development
Authors: Erik Simmons
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

User-Centered Design plays an influential role in product differentiation, especially within competitive markets. In order for industrial designers and interaction designers to do their jobs effectively, a rich description of product usage and the resulting requirements is essential. Historically, product usage has been described in various ways, some more successful than others. Among the more common formats used to capture usage are use cases, scenarios, and concept-of-operations documents. Several years ago, the term "usage model" began to be used within Intel to describe product use in a stated context. While the concept of a usage model was appealing and intuitive, agreeing on its structure and content proved far more challenging. Recently, a usage model structure was established that contains three separate tiers: supporting data, overview, and usage details. This structure provides a common taxonomy across various teams and business units, allows reuse of usage model data where appropriate, and aids communication within and between product development teams. Far more than a simple collection of use cases or scenarios, the usage model provides a rich, deep picture of product usage that can be utilized by strategic planners, requirements engineers, industrial designers, architects, managers, and others throughout product planning, design, development, and validation.
Cryptographic alias e-mail addresses for privacy enforcement in business outsourcing
Authors: Masahisa Kawashima, Tsuyoshi Abe, Satoshi Minamoto, Tetsuya Nakagawa
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

This paper proposes a method of anonymizing e-mail addresses for privacy enforcement in business outsourcing. By means of a cryptographic encoding scheme, the method generates an alias address containing a tracking ID for traceability and revocation. This feature helps an enterprise identify leakage path and revoke a cluster of leaked alias addresses in case of an address leakage incident.
High bandwidth data dissemination for large-scale distributed systems
Authors: Dejan Manojlo Kostic
Venue:  (2005)

Built as logical networks on top of the Internet, overlay networks have recently emerged as a fundamental building block for evolving the network architecture. Sample uses include application-level multicast, scalable object location and routing, improving end-to-end path characteristics, service discovery, and increasing resistance to DoS attacks. This dissertation focuses on the multi-receiver data dissemination problem. Traditionally, researchers thought that this problem would be solved by multicasting data at the IP (network) level. Although IP multicast was unsuccessful for a variety of reasons, its tree-based distribution approach was carried over to overlays. I argue however, that trees have two fundamental limitations for data dissemination. First, since all data comes from a single parent, participants are forced to continuously expend bandwidth for probing in search of a parent with an acceptable level of bandwidth. Second, due to packet losses and failures, the bandwidth in an overlay tree is monotonically decreasing down the tree. In this dissertation, I describe Bullet, a data dissemination mesh that takes advantage of the computational and storage capabilities of end hosts to create a distribution structure where a node receives data in parallel from multiple peers. For the mesh to deliver improved bandwidth and reliability, we need to solve several key problems: (i) disseminating disjoint data over the mesh, (ii) locating missing content, (iii) finding who to peer with (peering strategy), (iv) retrieving data at the right rate from all peers (flow control), and (v) recovering from failures and adapting to dynamically changing network conditions. Additionally, the system should be self-adjusting and should have few user-adjustable parameter settings. I describe my approach to addressing all of these problems in a working, deployed system across the Internet. Bullet outperforms the state-of-the-art systems, including BitTorrent, by 25&ndash;70%, and exhibits strong performance and reliability in a range of deployment settings. In addition, I find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing.
Dynamic Adaptation of the Squid Web Cache with Arachne
Authors: Marc Segura-Devillechaise, Jean-Marc Menaud, Nicolas Loriant, Remi Douence, Mario Sudholt, Thomas Fritz, Egon Wuchner
Venue: IEEE Software (2006)

Networking software, and in particular popular Web caches such as Squid, is highly optimized for execution speed and therefore disregards several common software design principlesfor example, modularity. This is an important impediment to their adaptation to new requirements, such as extending an existing Web cache protocol or closing a security hole. Furthermore, such adaptations typically crosscut the applications' legacy code.The authors investigate the use of Arachne, a system for the aspect-oriented programming of C applications. They present three examples of adaptations of the Squid Web cache: correcting a security hole, introducing prefetching, and extending a protocol. These show that Arachne's expressive aspect language, especially its notion of sequence aspects, enables concise modularization of these adaptations, and that Arachne's dynamic weaver lets developers perform such adaptations without a perceptible performance overhead. This article is part of a special issue on aspect-oriented programming.
Traditional and asynchronous computer-assisted instruction in a community college remedial mathematics course: a mixed methods study of student success and perceptions
Authors: William Timpson
Venue:  (2005)

The purpose of this study was to increase understanding about the impact of instructional delivery method on students' final grades in a community college remedial mathematics course. The study included two parts, which were conducted simultaneously. The first part was quantitative and the second part was qualitative. In the first part of the study, the investigator used archived student data to analyze the relationship between instructional delivery method (traditional instruction vs. asynchronous computer-assisted instruction [CAI]), students' gender, students' age, and students' final course grades in Survey of Algebra and in a subsequent, college-level mathematics course (College Algebra). Results indicated that students who used traditional instruction had higher grades than students who used CAI; females had higher grades than males, regardless of type of instruction; and non-traditional age students had higher grades than traditional age students, regardless of type of instruction. In most cases, the differences were statistically significant when analyzed using t tests. Effect sizes ranged from small to medium-large. Results of an ANOVA indicated that although the main effects were significant and large, there were no significant interactions between the independent variables. The second part of the study was a qualitative exploration of students' experiences and perceptions using asynchronous CAI. The investigator conducted 12 one-on-one interviews. Students' experiences in and perceptions about taking Survey of Algebra using computerized instruction seemed to be based on the degree to which external variables (i.e., the structure and format of the course) were or were not compatible with students' personal characteristics, learning preferences, prior knowledge of the content, and aptitude for mathematics. Three major themes related to CAI were salient across all interviews&mdash;convenience, individualization, and support. Results of this study suggest that method of instruction can be a factor in student success in remedial mathematics courses. Traditional instruction was found through quantitative analysis to be the more effective method of instruction. However, qualitative analysis showed that some students had a strong preference for CAI and were successful in Survey of Algebra using CAI. There appear to be advantages to both methods of instruction.
Global Stability Results for the Weak Vector Variational Inequality
Authors: Y. H. Cheng, D. L. Zhu
Venue: Journal of Global Optimization (2005)

In this paper, we consider the global stability of solutions of a Weak Vector Variational Inequality in a finite-dimensional Euclidean space. Upper semi-continuity of the solution set mapping is established. And by a scalarization method, we derive a sufficient condition that guarantees the lower semi-continuity of the solution set mapping for the Weak Vector Variational Inequality
Modeling the ODP Computational Viewpoint with UML 2.0
Authors: Jose Raul Romero, Antonio Vallecillo
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The ODP computational viewpoint describes the functionality of a system and its environment in terms of a con- figuration of objects interacting at interfaces, independently of their distribution. Up until UML version 2.0, both the lack of precision in the UML definition and the semantic gap between the ODP concepts and the UML constructs hindered its application for ODP computational viewpoint modeling. With the advent of UML 2.0 the situation may have changed, because its semantics have been more precisely defined and it now incorporates a whole new set of concepts more apt for modeling the structure and behavior of distributed systems. In this paper we explore the bene- fits provided by the new extension mechanisms of UML and, more specifically, we present a UML profile for modeling the ODP computational viewpoint concepts. We also show a case study that illustrates how our proposal is applied to a multimedia distributed system.
Expected and Observed Changes to Architectural Parameters of Trabecular Bone with Aging — A Comparison of Measurement Techniques
Authors: A. Badiei, M. J. Bottema, N. L. Fazzalari
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

The fragility of trabecular bone depends not only on the amount of bone but also on its architecture. In order to assess fragility of bone, describe changes due to age, and monitor effect of disease or treatment, it is necessary to model the physical properties of trabecular bone architecture. An important feature of bone architecture is the degree of anisotropy (DA). Estimates of DA may be obtained from computed tomography data by characterizing orientation in images. Widely used image descriptors for estimating orientation in this setting include mean intercept length (MIL), star volume distribution (SVD), star length distribution (SLD), and line fraction deviation (LFD). In this study, estimates of DA computed via each of these image descriptors are compared on synthetic images for various combinations of trabecular thickness, separation and number. Estimates of DA are also computed for real images representing different stages of aging. It is found that estimates of DA vary substantially depending on the choice of image descriptor. In particular, the MIL tends to underestimate DA.
An Application of Fourier-Mellin Transform in Image Registration
Authors: Xiaoxin Guo, Zhiwen Xu, Yinan Lu, Yunjie Pang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Fourier-Mellin transform (FMT) is frequently used in content-based image retrieval and digital image watermarking. This paper extends the application of FMT into image registration and proposes an improved registration algorithm based on FMT for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm can eliminate the conversion from Cartesian to log-polar coordinates, avoid the process of interpolation required in the conversion, and obtain a more signi?cant improvement than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise.
Documentation for the user
Authors: Trevor Swanson, Kristopher L. Arheart
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

Providing information for users is an omnipresent problem in most computer service organizations. Documentation is continually produced to fill the information gap. There is a constant attempt to keep "old hands" aware of new systems as well as changes to vintage systems. At the same time, computer services must communicate with potential users to make them aware of how the computer might aid them. Quite often the result of this effort is a kaleidoscopic communication situation. The computer user is baffled by the bewildering array of information from computer services.To help solve some of the documentation problems, the Kansas State University (KSU) Computing Center implemented a three-level documentation system. Under this arrangement, a confusing array of material was organized into a manageable set of documents. First, let's take a look at some of the documentation problems; then we'll discuss the three-level approach.
On the development and management of computerized models
Authors: Paul F Roth, Saul I. Gass, Richard E. Nance
Venue: ACM SIGSIM Simulation Digest (1977)

The U.S. Government has recently identified the need for a body of guidlines and standards to improve the development and management of Federal computerized models. This need has most recently been advocated by a General Accounting Office Report to the Congress of August 1976. This paper is composed of two parts: the first describes the program undertaken by the Government to develop such standards; the second describes a particular research project conducted under the program which proposes to develop improved methodology for simulation model development.