ppxscal/embedding_network huggingface dataset:
Authenticating Binary Text Documents Using a Localising OMAC Watermark Robust to Printing and Scanning
Authors: C. Culnane, H. Treharne, A. T. Ho
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

In this paper we propose a new authentication and localisation scheme to produce a watermark which can be embedded in a limited capacity binary text document and that will work in a print and scan environment. The scheme utilises Message Authentication Codes (MAC), specifically OMACs, which create a cryptographic fixed-length summary of a document. An OMAC must be truncated to a form part of our watermark and is used during authentication. The remainder of the watermark is used during localisation. We have created over 2,000,000 watermarks in controlled experiments to evaluate their ability to authenticate a document and localise any changes. In addition, we have embedded an authenticating watermark into seven different documents and authenticated them after printing and scanning.
The DYONIPOS innovation framework: research and practice hand in hand
Authors: Josef Makolm, Silke Weiß, Doris Ipsmiller
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

That e-Government can be innovative, adequate implementation structures must be developed. First what is needed and what should be implemented must be defined respectively. If this is clear, who is responsible for the implementation and who is affected by the innovation must be defined respectively. In this paper we will present the DYONIPOS Innovation Framework which is mainly based on cooperation of science and practice, the integration of all effected stakeholders in the development process and which is also based on a holistic view of the problem. The DYONIPOS innovation framework should contribute to successful and contemporary implementation user-friendly e-Government applications. In the first section, the current research methods in the domain of e-Government are shortly addressed. Furthermore the wish of experts for more cooperation between research, economy and administration is expressed. Through this joint venture the visions in the domain of e-Government should be implemented. The "Open Innovation" approach which has already provided innovations in the free economy is described and critically questioned in the second subchapter. In the third subchapter the "stakeholder integration" as well as the "holistic approach" are addressed. Through these two methods, many e-Government projects could already be successfully finished. In the forth section, the research and use-case project are introduced. The objective of the DYONIPOS project is the implementation of an assistant which supports the knowledge workers proactively in their daily work. In section five the DYONIPOS innovation framework is described. The DYONIPOS Innovation Framework has already proven its applicability through the successful implementation of the user-friendly prototype DYONIPOS.
Assessing students' value for science & math education: What's valuable about computer science? conference workshop
Authors: Bruce Callen, Charles Allen, Don Deeds, Scott Sigman, Mark Wood
Venue: Journal of Computing Sciences in Colleges (2009)

For students to be truly literate in math and science they must value the nature and processes of these disciplines. Otherwise, their education will have little life-long impact. With extensive participation from Missouri State University faculty and students, we developed the Math and Science Value Inventories to measure the importance of these areas in students' lives. Our database strongly supports our four-component model: students value math or science if these subjects have interest and utility for them, if they care about academic achievement in these areas, and if they find the costs reasonable. Data show that value can be affected by instruction, and we believe our model has strong implications for gauging instructional effectiveness at all levels and in all disciplines. Our existing instruments are aimed at general education students, and we are developing on-line versions of these tools and new instruments for measuring the value STEM students place on math and science.
Safely composing security protocols
Authors: Véronique Cortier, Stéphanie Delaune
Venue: Formal Methods in System Design (2009)

Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol in the presence of an active attacker that may block, intercept and send new messages. However even when a protocol has been proved secure, there is absolutely no guarantee if the protocol is executed in an environment where other protocols are executed, possibly sharing some common keys like public keys or long-term symmetric keys.In this paper, we show that security of protocols can be easily composed. More precisely, we show that whenever a protocol is secure, it remains secure even in an environment where arbitrary protocols satisfying a reasonable (syntactic) condition are executed. This result holds for a large class of security properties that encompasses secrecy and various formulations of authentication.
Multidimensional cluster stability analysis from a Brazilian Bradyrhizobium sp. RFLP/PCR data set
Authors: S. T. Milagre, C. D. Maciel, A. A. Shinoda, M. Hungria, J. R. B. Almeida
Venue: Journal of Computational and Applied Mathematics (2009)

The taxonomy of the N"2-fixing bacteria belonging to the genus Bradyrhizobium is still poorly refined, mainly due to conflicting results obtained by the analysis of the phenotypic and genotypic properties. This paper presents an application of a method aiming at the identification of possible new clusters within a Brazilian collection of 119 Bradyrhizobium strains showing phenotypic characteristics of B. japonicum and B. elkanii. The stability was studied as a function of the number of restriction enzymes used in the RFLP-PCR analysis of three ribosomal regions with three restriction enzymes per region. The method proposed here uses clustering algorithms with distances calculated by average-linkage clustering. Introducing perturbations using sub-sampling techniques makes the stability analysis. The method showed efficacy in the grouping of the species B. japonicum and B. elkanii. Furthermore, two new clusters were clearly defined, indicating possible new species, and sub-clusters within each detected cluster.
Enabling ubiquitous patient monitoring: Model, decision protocols, opportunities and challenges
Authors: Sweta Sneha, Upkar Varshney
Venue: Decision Support Systems (2009)

Healthcare costs in the US are approximately 15% of GNP and are anticipated to reach 17% of GNP in the near future. Management of chronic diseases via technology based ubiquitous patient monitoring services has been widely proposed as a viable option for economizing healthcare resources, and providing efficient, quality healthcare. The process of ubiquitous patient monitoring is information intensive, the information generated is not only fragmented but also spans multiple processes, artifacts, parameters, and decision criteria. The current study explores the complexities associated with the process of ubiquitous patient monitoring and the enabling technologies. The key contribution is a framework that captures the complex processes, the parameters involved, and the decision criteria for ubiquitous patient monitoring. The decision protocols and enabling technologies supporting the processes are detailed in the study along with the opportunities and challenges of ubiquitous patient monitoring. A conceptual model of ubiquitous patient monitoring is developed by leveraging the proposed framework and is validated by a usage scenario. Finally, the implications of future research and contributions of the current research are discussed.
The future of CAM systems
Authors: M. Eugene Merchant
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

A recent Delphi-type forecast of the future of manufacturing carried out by the International Institution for Production Engineering Research (CIRP) resulted in 94 forecast events on which good consensus was obtained. Of these, 24, or over one-fourth, strongly indicated that the computer-integrated automatic factory would be a full-blown reality well before the end of this century. The three key events which summarize this aspect of that forecast are as follows: 1. By 1980 (median), a computer software system for full automation and optimization of all steps in the manufacturing of a part will be developed and in wide use. 2. By 1985 (median), full on-line automation and optimization of complete manufacturing plants, controlled by a central computer, will be a reality. 3. By 1990 (median), more than 50 percent of the machine tools produced will not have a "stand-alone" use, but will be part of a versatile manufacturing system, featuring automatic part handling between stations, and being controlled from a central process computer.
Fast Rendering Algorithm of Underwater Optical Effect
Authors: Bo Qin, Lina Cui, Cui Xie
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Underwater optical effect simulation is an important component of simulating underwater scene. This paper will present a fast rendering algorithm of underwater optical effect based on Iwasak′s method. It simplifies the illumination volume to reduce the light calculation and uses the Gouraud shading method to render each side of every illumination volume. The experiments show that it can reduce the CPU calculation time and increase the rendering speed. The rendering results get a higher frame-rate with better quality.
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
Authors: Daniel Raible, Henning Fernau
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: Given a graph G(V,E) a set P &sube; V is a power dominating set if every vertex is observed after we have applied the next two rules exhaustively. First, a vertex is observed if v &epsilon; P or it has a neighbor in P. Secondly, if an observed vertex has exactly one unobserved neighbor u, then also u will be observed as well. We show that Power Dominating Set remains $\mathcal{NP}$-hard on cubic graphs. We designed an algorithm solving this problem in time $\mathcal{O}^*(1.7548^n)$ on general graphs. To achieve this we have used a new notion of search trees called reference search trees providing non-local pointers.
One-Pass EAP-AKA Authentication in 3G-WLAN Integrated Networks
Authors: Christoforos Ntantogian, Christos Xenakis
Venue: Wireless Personal Communications: An International Journal (2009)

The incorporation of Wireless Local Area Networks (WLANs) within the third generation (3G) networks materializes the next generation of mobile/wireless systems, named 3G-WLANs integrated networks. This paper proposes an improved authentication procedure for the 3G-WLANs integrated networks that enables a WLAN user to get access to the 3G packet switched services or to the public Internet through the 3G public land mobile network. The proposed procedure reduces significantly the authentication overhead compared to the legacy one, without compromising the provided security services. A security analysis of the proposed authentication procedure is elaborated that ensures the correctness of the authentication procedure, the provision of advanced security services and the elimination of possible attacks that may threaten the proposed authentication procedure. In addition, an energy cost analysis is carried out that compares the energy consumption induced by the legacy and the proposed authentication procedures. Finally, a communication cost analysis is provided that estimates the cost improvement of the proposed over the legacy authentication procedure.
Towards Self-management in Service-Oriented Computing with Modes
Authors: Howard Foster, Sebastian Uchitel, Jeff Kramer, Jeff Magee
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

A self-managed system is both self-assembling and self-healing. Service-oriented Computing (SoC) architectures, such as a Web Services Architecture (WS-A)illustrate a highly distributed, potentially dynamic,domain for component configurations. We propose the use of component architecture "modes" to facilitate the self-management of services within a SoC environment. A mode abstracts a set of services that are composed to complete a given task. Our approach, named "SelfSoC" includes designing and implementing key parts of a self-managed system specifically aimed at supporting a dynamic services architecture. We extend Darwin component models, Alloy constraint models and distributed system management policies to specify the mode architectures. We also propose the generation of dynamic orchestrations for service compositions to coordinate different modes of an automotive services platform.
Algorithmic approach to studying models of multirate systems with queues
Authors: Che Soong Kim, L. A. Ponomarenko, A. Z. Melikov
Venue: Cybernetics and Systems Analysis (2009)

Models of multirate systems that handle narrowband and broadband calls are investigated. Narrowband calls are serviced by a single channel, whereas m > 1 channels are required simultaneously for broadband calls. When the necessary number of idle channels is absent, broadband calls are queued but narrowband calls are not buffered and are accepted only if the number of idle channels is larger than a given threshold. An algorithmic approach is proposed to the calculation of service quality indices for such models, and results of numerical experiments are presented.
Model Checking Concurrent Programs
Authors: Aarti Gupta
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

With the growth of multi-core processing and concurrent programming in modern computing systems, there is a great need to develop effective verification techniques for concurrent programs. Static analysis techniques have been shown effective for finding data races, but suffer from a general problem of too many false alarms. Dynamic techniques like testing have also shown promise, but provide limited coverage over the state space including all possible thread interleavings. Model checking alone cannot scale. However, it works better in combination with these techniques, with the potential of finding real error traces on one hand and better coverage on the other. In this talk, I will describe our recent advances in concurrent dataflow analysis, symbolic model checking with partial order reduction, and dynamic techniques for verifying concurrent programs. These techniques have been implemented in a unified verification platform, currently targeted at multi-threaded C programs. I will also report on our experiences on some challenging examples from the public domain and the industry.
I-Fuzzy equivalence relations and I-fuzzy partitions
Authors: Balasubramaniam Jayaram, Radko Mesiar
Venue: Information Sciences: an International Journal (2009)

A T-fuzzy equivalence relation is a fuzzy binary relation on a set X which is reflexive, symmetric and T-transitive for a t-norm T. Recently, Mesiar et al. [R. Mesiar, B. Reusch, H. Thiele, Fuzzy equivalence relations and fuzzy partitions, J. Multi-Valued Logic Soft Comput. 12 (2006) 167-181] have generalised the t-norm T to any general conjunctor C and investigated the minimal assumptions required on such operations, called duality fitting conjunctors, such that the fuzzification of the equivalence relation admits any value from the unit interval and also the one-one correspondence between the fuzzy equivalence relations and fuzzy partitions is preserved. In this work, we conduct a similar study by employing a related form of C-transitivity, viz., I-transitivity, where I is an implicator. We show that although every I-fuzzy equivalence relation can be shown to be a C-fuzzy equivalence relation, there exist C-fuzzy equivalence relations that are not I-fuzzy equivalence relations and hence these concepts are not equivalent. Most importantly, we show that the class of duality fitting implicators I is much richer than the residuals of the duality fitting conjunctors in the study of Mesiar et al. We also show that the I-fuzzy partitions have a ''constant-wise'' structure.
A methodology for minimizing maintenance costs
Authors: Linda Brice, John Connell
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Research conducted in the case study of a large applications system shows that the two primary causes of high maintenance costs are 1. The frequency of user-requested changes to software 2. The psychological complexity of the software A "tool kit" is suggested that, when applied to the design of new systems or rewrites, will 1. Produce systems that users are less likely to need changed 2. Contribute to the reduction of psychological complexity of code, making it easier to change when necessary The tool kit is easy to use, can be applied to large or small systems in any language on any equipment, and requires no purchase of hardware or software.
Distributed processing with iAPX 186 microprocessor systems
Authors: Tony Zingale
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

In most early computer systems, large central computers, minicomputers, or microcomputers were used to perform all the necessary data processing activities in the system. The overall performance of the entire system was limited by the ability of the central CPU to bring in data, process it, and output it in some usable format. This often resulted in large data input/output bottlenecks in I/O-intensive applications where the CPU time required to service I/O functions left little time for data processing. The obvious result is a slow, nonoptimum data processing system. Now many applications are moving in the direction of simpler and easier-to-use distributed systems, where a central CPU delegates some of the processing tasks to distributed processing subsystems. Not only are costs lower with the distributed system approach, but the time needed to implement such systems is substantially less. For example, a network transaction processing system can now use numerous automatic tellers to process data at a variety of dispersed geographic locations. The tellers, or distributed nodes, can then collect, process, output, and eventually pass on necessary information to the central host computer, located at some detached location, without burdening the central computer with handling each simple transaction. The host becomes involved with an individual node only when the intelligent node requires the timely interaction. The heart of a distributed node itself must be an intelligent processing device capable of handling all the processing and I/O requirements needed by the node. The iAPX 186 is a new highly integrated 16-bit microprocessor. It combines 10 of the most common microprocessor system components onto one. The 80186 is essentially a 16-bit CPU board integrated onto a single silicon chip. By combining a limited number of peripheral support components with memory together with an iAPX 186, one can achieve a condensed, cost-effective system on one board, making the 80186 an optimal microprocessor for distributed processing nodes. This high level of integration is accomplished through an advanced HMOS II silicon gate technology. For the first time it provides a system cost saving significantly greater than that of the previous 16-bit microprocessor design alternatives. The 80186, an upgrade from the industry standard iAPX 86 and 88, offers two to three times the system throughput of a standard iAPX 86. The iAPX 186 adds 10 new instruction types to optimize existing iAPX 86 or 88 application code or streamline new iAPX 186 application code. All these hardware and software attributes make distributed processing with iAPX 186 systems a cost-effective, easy 16-bit microprocessor solution.
Mixed Reality Humans: Evaluating Behavior, Usability, and Acceptability
Authors: Aaron Kotranza, Benjamin Lok, Adeline Deladisma, Carla M. Pugh, D. Scott Lind
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

This paper presents Mixed Reality Humans (MRHs), a new type of embodied agent enabling touch-driven communication. Affording touch between human and agent allows MRHs to simulate interpersonal scenarios in which touch is crucial. Two studies provide initial evaluation of user behavior with a MRH patient and the usability and acceptability of a MRH patient for practice and evaluation of medical students' clinical skills. In Study I (n=8) it was observed that students treated MRHs as social actors more than students in prior interactions with virtual human patients (n=27), and used interpersonal touch to comfort and reassure the MRH patient similarly to prior interactions with human patients (n=76). In the within-subjects Study II (n=11), medical students performed a clinical breast exam on each of a MRH and human patient. Participants performed equivalent exams with the MRH and human patients, demonstrating the usability of MRHs to evaluate students' exam skills. The acceptability of the MRH patient for practicing exam skills was high as students rated the experience as believable and educationally beneficial. Acceptability was improved from Study I to Study II due to an increase in the MRH's visual realism, demonstrating that visual realism is critical for simulation of specific interpersonal scenarios.
De2m: a solution for analyzing supply chain
Authors: María de los Milagros Gutiérrez, Horacio P. Leone
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Nowadays, the incremental use of component-based simulation presents a new challenge to overcome. So, the researchers and software developers are putting attention to solve problems as interoperability and reuse of components. In the supply chain context, this simulation paradigm is very valuable because allows us to develop independent models and then interconnect them using middleware software such as HLA, CORBA among other. However, the interoperability of these simulation components is a mayor problem to overcome. In this paper, we present an environment to analyze supply chain using this paradigm. We propose to use the SCOR model as roles that the component can play in conjunction with an Ontology base on SCOR. The modules are developed using DEVS formalism and HLA as middleware.
Brief paper: Adaptive motion coordination: Using relative velocity feedback to track a reference velocity
Authors: He Bai, Murat Arcak, John T. Wen
Venue: Automatica (Journal of IFAC) (2009)

We study a coordination problem where the objective is to steer a group of agents to a formation that translates with a prescribed reference velocity. In Bai et al. [Bai, H., Arcak, M., & Wen, J. (2008). Adaptive design for reference velocity recovery in motion coordination. Systems and Control Letters, 57(8), 602-610.] we considered the situation where the reference velocity information is available only to a leader, and developed a decentralized adaptive design that uses relative position feedback. Although Bai et al. (please see above reference) guaranteed the desired formation, it did not ensure tracking of the reference velocity with the exception of special cases. We now propose a new adaptive redesign that guarantees tracking of the reference velocity by incorporating relative velocity feedback in addition to relative position feedback.