ppxscal/embedding_network huggingface dataset:
Small-scale plasticity in thin Cu and Al films
Authors: Gerhard Dehm, T. John Balk, Hervais Edongué, Eduard Arzt
Venue: Microelectronic Engineering (2003)

Flow stresses in thin metal films significantly exceed the flow stresses of their bulk counterparts. In order to identify the underlying deformation mechanisms and correlate them with microstructure, we analysed epitaxial and polycrystalline Cu and Al thin films. The films (100-2000 nm thickness) were magnetron sputtered on (0001) α--Al2O3 single crystals or on nitrided and oxidised (001) Si substrates. For epitaxial films, the flow stress measurements, which were obtained from substrate-curvature tests, agree with predictions from a dislocation-based model [1,2], whereas for polycrystalline films the stresses measured for film thicknesses down to 400 nm are much higher than predicted. However, thinner films reveal a plateau in room temperature flow stress. This behavior, as well as the stress-temperature evolution of the various films will be discussed in terms of existing theories for plasticity in thin metal films, and under consideration of recent in situ transmission electron microscopy studies.
Efficient Key Assignment Scheme for Mobile Agent Systems
Authors: Wai-Meng Chew, Chi-Hung Chi, Tie-Yan Li
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Agent security is always a key concern to many mobile agent systems such as distributedintrusion detection systems (DIDS), where an attacker might turn to the mobile agent directory server if he fails to locate the critical IDS hosts/agents. Previous work on mobile agent security (e.g. Volker and Mehrdad's scheme [20]) often suffers from large code size of the agent and the high computational cost. In this paper, we would like to address these two issues with a new RSA-based key assignment scheme. Both the details of the scheme and its implementation are given. Our analysis shows that not only the above two issues are improved significantly, but the scheme also provides agent's adaptability through dynamic key management and access control strategy.
Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph
Authors: Dmitry Panchenko
Venue: Random Structures Algorithms (2004)

Using Talagrand's concentration inequality on the discrete cube {0, 1}m we show that given a real-valued function Z(x) on {0, 1}m that satisfies certain monotonicity conditions one can control the deviations of Z(x) above its median by a local Lipschitz norm of Z at the point x. As one application, we obtain a deviation inequality for the number of k-cycles in a random graph.
User modeling for adaptive visualization systems
Authors: G. O. Domik, B. Gutkauf
Venue: Proceedings of the conference on Visualization '94 (1994)

Meaningful scientific visualizations benefit the interpretation of scientific data, concepts and processes. To ensure meaningful visualizations, the visualization system needs to adapt to desires, disabilities and abilities of the user, interpretation aim, resources (hardware, software) available, and the form and content of the data to be visualized. We suggest to describe these characteristics by four models: user model, problem domain/task model, resource model and data model. This paper makes suggestions for the generation of a user model as a basis for an adaptive visualization system.We propose to extract information about the user by involving the user in interactive computer tests and games. Relevant abilities tested are color preception, color memory, color ranking, mental rotation, and fine motor coordination.
Pt-based metallization of PMOS devices for a compatible monolithic integration of semiconducting/Yba2Cu3O7-&#x03B4; superconducting devices on Silicon
Authors: G. Huot, L. Méchin, D. Bloyet
Venue: Microelectronic Engineering (2003)

Mo, Pt, Pt/Mo and Pt/Ti thin films have been deposited onto Si and SiO2 substrates by RF sputtering and annealed in the YBa2Cu3O7-δ (YBCO) growth conditions. The effect of annealing on the sheet resistance of unpatterned layers was measured. A Pt-based multilayered metallization for the PMOS devices was proposed and tested for a compatible monolithic integration of semiconducting devices and YBCO sensors on the same silicon substrate. The best results were obtained with a Pt/Ti/Mo-silicide structure showing 0.472 Ω interconnect sheet resistivity and 2 × 10-4 Ω cm2 specific contact resistivity after annealing for 60 min at 700 °C in 0.5 mbar O2 pressure.
A monte carlo-based simulation tool for modeling x-ray computed tomography physics: application to electron beam ct
Authors: Christopher Hyde Cagnon
Venue:  (2003)

Purpose. The CT image is a representation of the patient's anatomy as measured in terms of such physical characteristics as density, electron density, and atomic number. The process of sampling the patient's molecular composition with x-ray is subject to varied physical effects that violate the assumptions behind CT imaging and degrade the ability of the image data to accurately quantify the tissues of the body. We sought to develop a Monte Carlo based modeling tool capable of simulating a CT scanner at full clinical resolution. Selective control of specific physical effects would allow us to assess their impact on the reconstructed CT image. Methods materials. A Monte Carlo radiation transport code (MCNP4b) is used to track photons in an Electron Beam CT geometry, through simulated geometric and anthropomorphic phantoms, to a detector array for final reconstruction into images. The native code was modified to incorporate a phase space model of the X-Ray source and a unique two dimensional photon tally necessary to track all source and detector positions for reconstruction. A series of validation steps was conducted to establish the performance of our virtual simulation tool in terms of image noise, energy sensitivity, and selective control of scatter and beam hardening. Final validation was performed through comparison of simulated images against actual scans of a test phantom. Then, simulations were performed of an ideal, non-existent scenario: CT image reconstructions performed in the absence of scatter. Results. Progressive experimental steps demonstrated that our modeling tool behaved in a predictable fashion. Final validation of simulation against actual scans showed no statistical difference in reconstructed images. Simulations with scatter removed from our virtual scanner showed significant improvement over normal scatter images. Conclusion. Creation of a Monte Carlo based virtual CT allows us to simulate actual scan geometry as well as a variety of patient and scanner physical conditions that can impact the CT image. Such a tool could be used to generate image corrections or as a CT design tool. The accuracy of the tool is limited only by the level of detail of the created model and the absolute number of Monte Carlo particle histories run.
D-cluster formation and routing in mobile ad hoc networks
Authors: Alan Dewayne Amis
Venue:  (2003)

A mobile ad hoc network may be logically represented as a set of clusters. The clusterheads form a dominating set, and can be used to perform a variety of functions for nodes in their cluster like channels access, routing, etc. Previous heuristics restricted themselves to 1-hop clusters and were sequential in nature. This paper generalizes 1-hop clustering to a d-hop clustering problem. The value of d, a constant, is a parameter of the heuristic and governs the size of the clusters. First, we present a distributed and concurrent heuristic which allows all nodes to form d-clusters in a wireless mobile ad hoc network. When the heuristic terminates, a node either becomes a clusterhead, or is at most d wireless hops away from its clusterhead. An inherent characteristic of the heuristic is that it tries to generate clusters that are roughly the same size, thereby evenly distributing the load on the clusterheads (load-balancing). The heuristic also tends to re-elect existing clusterheads even when the network configuration changes (stability). This helps to reduce the communication overhead associated with transitions from old clusterheads to new clusterheads. The heuristic can be run either at regular intervals, or whenever the network configuration changes. Next, we propose a load-balancing heuristic that allows all nodes in the network to become clusterheads in time. Thus, the heuristic is fair and stable. Then we present a multi-hop routing protocol to be used with this clustering heuristic. Simulation experiments demonstrate that the proposed heuristic generates exactly the same number of clusterheads as [7], in fewer rounds of messages: O( d) rounds for the proposed heuristic compared to O( n) time slots for [7], where n is the number of nodes in the network.
Detection of PLA multiple crosspoint faults
Authors: M. Ambanelli, M. Favalli, P. Olivo, B. Riccó
Venue: Proceedings of the conference on European design automation (1991)

An original approach to fault simulation of crosspoint faults in PLAs that goes beyond the normal assumption of single defects is presented: such a method, using concepts derived from critical path backtracing, makes use of the minimum set of information needed for exact, complete analysis without treating each fault individually. Experimental results are also presented to show the importance of multiple faults in common PLAs as well as to discuss the simulator performance.
Implementation of a proactive load sharing scheme
Authors: R. Anane, R. J. Anthony
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper presents a proactive approach to load sharing and describes the architecture of a scheme, Concert, based on this approach. A proactive approach is characterized by a shift of emphasis from reacting to load imbalance to avoiding its occurrence. In contrast, in a reactive load sharing scheme, activity is triggered when a processing node is either overloaded or underloaded. The main drawback of this approach is that a load imbalance is allowed to develop before costly corrective action is taken. Concert is a load sharing scheme for loosely-coupled distributed systems. Under this scheme, load and task behaviour information is collected and cached in advance of when it is needed. Concert uses Linux as a platform for development. Implemented partially in kernel space and partially in user space, it achieves transparency to users and applications whilst keeping the extent of kernel modifications to a minimum. Non-preemptive task transfers are used exclusively, motivated by lower complexity, lower overheads and faster transfers. The goal is to minimize the average response-time of tasks. Concert is compared with other schemes by considering the level of transparency it provides with respect to users, tasks and the underlying operating system.
Implementation challenges for a K-12 computer science curriculum
Authors: Allen Tucker, Dennis McCowan, Fadi Deek, Chris Stephenson, Jill Jones, Anita Verno
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This special session will report on the work of the ACM K-12 Computer Science Curriculum Committee, which recently completed the design of a K-12 model curriculum [1]. This session is a follow-up to our special session at SIGCSE 2003, which presented the first draft of that curriculum design. This session differs from that one by emphasizing the next steps that must be taken to implement the recommendations in the model.
Generating rules for incremental maintenance of XML view of relational data
Authors: Vânia Maria Ponte Vidal, Marco Antonio Casanova, Valdiana da Silva Araujo
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

This work addresses the problem of incremental maintenance of XML views defined on top of relational data. In order to incrementally maintain a XML view, event-condition-rules should be specified for the relational source. Such rules are responsible for correctly modifying the XML view content in order to reflect changes made to the base source.This work proposes an approach where incremental view maintenance rules are derived from view correspondence assertions, which specify relationships between the view schema and the base source schema. The adoption of correspondence assertions also facilitates the task of formally proving that the derived rules correctly maintain the view.
Visualizing object oriented software in three dimensions
Authors: Colin Ware, David Hui, Glenn Franck
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

There is increasing evidence that it is possible to perceive and understand increasingly complex information systems if they are displayed as graphical objects in a three dimensional space. Object-oriented software provides an interesting test case - there is a natural mapping from software objects to visual objects. In this paper we explore two areas. 1) Information perception: we are running controlled experiments to determine empirically if our initial premise is valid; how much more (or less) can be understood in 3D than in 2D? 2) Layout: our strategy is to combine partially automatic layout with manual layout. This paper presents a brief overview of the project, the software architecture and some preliminary empirical results.
The Effects of Effort and Intrinsic Motivation on Risky Choice
Authors: Ran Kivetz
Venue: Marketing Science (2003)

People often need to trade off between the probability and magnitude of the rewards that they could earn for investing effort. The present paper proposes that the conjunction of two simple assumptions (relating effort-induced reward expectations to prospect theory's value function) provides a parsimonious theory that predicts that the nature of the required effort will have a systematic effect on such trade-offs. Using the case of frequency (or loyalty) programs, a series of five studies involving both real and hypothetical choices demonstrated that (a) the presence (as opposed to absence) of effort requirements enhances the preference for sure-small rewards over large-uncertain rewards; (b) the preference for reward certainty is attenuated when the effort activity is intrinsically motivating; and (c) continuously increasing the effort level leads to an inverted-U effect on the preference for sure-small over largeuncertain rewards. The studies also employ process measures and examine the mechanisms underlying the impact of the effort stream on the trade-off between the certainty and magnitude of rewards. The final section discusses the theoretical implications of this research as well as the practical implications with respect to frequency programs and other types of incentive systems.
Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities
Authors: Edward Ianovsky, Joseph Kreimer
Venue: Mathematics and Computers in Simulation (2003)

We present optimality conditions for real-time multiserver system with large number of identical servers (e.g. unmanned air vehicles, machine controllers, etc.) and two non-identical channels (e.g. surveillance regions, assembly lines, etc.) working under maximum load regime with limited maintenance facilities. Real-time systems are responsible for operations management of increasingly sensitive applications, particularly those in which failures to satisfy temporal restrictions can lead to serious or even dangerous consequences. Optimization of these systems is very important. We calculate limiting values of system availability and its loss penalty function and show how to obtain optimal assignment probabilities which optimize (maximize and minimize, respectively) these Performance measures.
Point/Counterpoint
Authors: Eric S. Raymond, David G. Messerschmitt
Venue: IEEE Software (2004)

Is open source a vital step in moving software engineering from art to science? Or does it fail to meet the needs of nonprogrammer users and organizations? These authors debate where open source is, where it's going, and whether it can deliver what's promised.
Objects: visualization of behavior and state
Authors: Wanda Dann, Toby Dragon, Stephen Cooper, Kevin Dietzler, Kathleen Ryan, Randy Pausch
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Animated program visualization can be used to support innovative instructional methods for teaching beginners about objects, their behavior, and state. In this paper, we present a discussion of methods that define object behavior and character (class)-level state variables that track state changes for 3D animated objects in small virtual worlds. We have found that character-level methods provide a means to demonstrate inheritance. Examples of worlds and program code used in instructional materials are provided.
Improving Network System Security with Function Extraction Technology for Automated Calculation of Program Behavior
Authors: Mark G. Pleszkoch, Richard C. Linger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Malicious attacks on systems are a threat to business, government, and defense. Many attacks exploit system behavior unknown to the developers who created it. In today's state of art, software engineers have no practical means to determine how a sizable program will behave in all circumstances of use. This sobering reality lies at the heart of many problems in security and survivability. If full behavior is unknown, so too are embedded errors, vulnerabilities, and malicious code. This paper describes function-theoretic foundations for automated calculation of full program behavior. These foundations treat program control structures as mathematical functions or relations. The function, or behavior, of control structures can be abstracted in a stepwise process into procedure-free expressions that specify their net functional effects. Problems of computability and complexities of languagesemantics appear to have engineering solutions. Automated behavior calculation will add rigor to security and survivability engineering.
Generalized path-finding algorithms on semirings and the fuzzy shortest path problem
Authors: A. Boulmakoul
Venue: Journal of Computational and Applied Mathematics (2004)

A new dioïd structure (ωk;,⊕, ⊗, ε, e) is proposed to solve a path-finding problem in a fuzzy graph. This algebraic structure is adapted precisely to solve the problem of the K-best fuzzy shortest paths. We demonstrate that the generalized Gauss-Seidel's algorithm always converges for the solving of the K-best fuzzy shortest paths problem on a valued fuzzy graph without cycles of negative weight. This work starts a safe extension of the path algebra paradigm to valued fuzzy graphs for the shortest path-finding problem.
Formal approaches for specifying, enforcing, and verifying security policies
Authors: Abdullah Ali Al-Qahtani
Venue:  (2003)

Each organization or company, having its own purposes and goals for its projects, needs to establish security policies for various reasons: information protection, regulations, contracts, and legal issues. The process of establishing security policies is more important than the document itself and the purpose of these policies is to ensure that the final result actually provides a secure service. Most approaches for enforcing and verifying security policies fall short of the goal due to the use of informal specifications that might lead to ambiguity, inconsistency, and incompleteness. Due to the ambiguity and imprecision of informal specification, it is difficult to verify the correctness of the system. This research presents a framework for formally specifying, enforcing, and verifying security policies. A security policy is specified as predicate logic formulas on a set of executions based on grouping finite sets of classes, entities, relations, atomic predicate formulas, and some auxiliary elements that help to build predicate formulas. The enforcement approach is called Security State Machines (SSMs), and it helps to formally enforce and verify computer security polices. Using Security State Machines is a flexible technique that can enforce a collection of security policies. They have a set of states and rules for making transitions from one state to another. The transitions between states are directed by the actual policy being enforced. The enforcement technique works by allowing any execution that satisfies the security policy and terminating any execution that violates it. Security policies enforced by SSMs can be verified using different models. In this research we use one of the famous models of verification called CTL model checking. Model checking is one of the recent methods of formal verification that has been applied in computer security, specifically in network protocols verification, to discover the security flaws. CTL model checking allows us to formally examine the properties of existing and novel security architectures through relatively simple methods that allow a high degree of automation.
Wireless technologies for data acquisition systems
Authors: Sakari Junnila, Jarkko Niittylahti
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper surveys currently available wireless technologies and considers their suitability for a six channel medical (BCG/ECG) measurement system. The main requirements for the wireless technology suitable for this application are capability to transmit data stream up to 60 kbps, low-power consumption, and low-interference to and from other devices.
SIED: Software Implemented Error Detection
Authors: B. Nicolescu, Y. Savaria, R. Velazco
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents a new error detection technique called Software Implemented Error Detection (SIED). The proposed method is based on a new control check flow scheme combined with software redundancy. The distinctive advantage of the SIED approach overother fault tolerance techniques is the fault coverage. SIED is able to cope with faults affecting data and the program control flow. By applying the proposed approach on several benchmark programs, we evaluate the error detection capabilities by means of several fault injection experiments. Experimental results underline very good error detection capabilities for the obtained hardened version of selected benchmark programs.
From the Editors: Say Every Word on Every Slide
Authors: Francis Sullivan
Venue: Computing in Science and Engineering (2004)

Although PowerPoint is very far from being the kind of tool of choice for preparing and presenting scientific talks and, although working around the ad hoc constraints it imposes on its mass market can be pretty difficult, the software's shortcomings are not, I think, the real problem. My opinion is that we are the problem.
Towards implementation of a nickel silicide process for CMOS technologies
Authors: C. Lavoie, F. M. d'Heurle, C. Detavernier, C. Cabral,  Jr.
Venue: Microelectronic Engineering (2003)

In this paper, we review some of the advantages and disadvantages of nickel silicide as a material for the electrical contacts to the source, drain and gate of current and future CMOS devices. We first present some of the limitations imposed on the current cobalt silicide process because of the constant scaling, of the introduction of new substrate geometries (i.e. thin silicon on insulator) and of the modifications to the substrate material (i.e. SiGe). We then discuss the advantages of NiSi and for each of the CoSi2 limitations, we point out why Ni is believed to be superior from the point of view of material properties, miscibility of phases and formation mechanisms. Discussion follows on the expected limitations of NiSi and some of the possible solutions to palliate these limitations.