ppxscal/embedding_network huggingface dataset:
Band-to-band tunneling related effects in a thin MOS structure
Authors: M. I. Vexler, A. F. Shulekin, D. Grgec, I. V. Grekhov, B. Meinerzhagen
Venue: Microelectronic Engineering (2004)

The effect of band-to-band tunneling (BBT) on the behaviour of MOS structures doped to 1018-1019 cm-3 with an 2-3 nm oxide is studied theoretically. The BBT is shown to supply the minority carriers toward the Si/SiO2 interface. This effect can support the inversion layer in the non-equilibrium and modify the I-V and C-V curves. The experimental data on MOS diodes, supporting the theory, are also presented.
Evaluation and Visualization of Stress and Strain on Soft Biological Tissues in Contact
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper addresses evaluation and visualization ofstress and strain on soft biological tissues in contact.Given three-dimensional models of reconstructed organsfrom magnetic resonance images (MRI), we use anAnatomy-based kinematical model combined with a softtissues model to represent their shape and behavior.Then, we compute resulting distribution of stress andstrain on deforming surface when motion is simulated.The computed stress and strain are then effectivelyvisualized using an interactive animation framework.Experimental results are illustrated in the case of the hipjoint cartilage.
Characterization Theorem of Lattice Implication Algebras
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper we show the characterization theoremof lattice implication algebras. The algebras arepresented by Xu ([5]) in 1993. Our theorem meansthat the class of all lattice implication algebras coincideswith the class of all bounded commutative BCKalgebras.Hence lattices implication algebras are categoricallyequivalent to MV-algebras and to Wajsbergalgebras.
Reducing Hard Handover Overhead in Future All-IP Wireless Access Networks
Authors: M. A. O. Barry, H. S. Al-Raweshidy
Venue: BT Technology Journal (2004)

In host-based routing (HBR) domains such as cellular IP, handover can be executed implicitly via path update packets from the new location of the mobile host (MH). The direction of the flow of packets destined to the MH is diverted at the crossover node (CoN), thereby reducing to a minimum the handover delay and associated packet loss. As the depth of the network increases so does the path update time to the CoN. To reduce the handover overhead, an architectural extension is proposed to the path update process, by adding a multi-homed base-station (MHOBS) at certain points in the wireless access network where the path update delay becomes severe. Two scenarios are investigated. The first scenario is one in which the old and new paths to the MH are equal in length or symmetrical, the second, when the paths are unequal, or asymmetrical.
Uniform Description of Calculi for All t-Norm Logics
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

A t-norm logic L_* is the logic of a standard algebra[0,1]_* = (\left[ {0,1} \right],_{ * ,}\to ^ *,0) for*being a continuous t-normand \to=^ * The notion of canonical t-algebraintroduced by Haniková [12] and Esteva-Godo-Montagna[9], the sets-as-signs approach to many-valued tableau systemsby Hähnle [10], and finite-valued reduction techniques[2, 3] allow to describe in a uniform way co-NP calculi forall t-norm logics.
Scaling All-to-All Multicast on Fat-tree Networks
Authors: Sameer Kumar, Laxmikant V. Kale
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we study the all-to-all multicast operation.Strategies for all-to-all multicast need to be different forsmall and large messages. For small messages, the majorissue is the minimization of software overhead, where asfor large messages, the issue is network contention. Manymodern large parallel computers use the fat-tree interconnectiontopology. We therefore analyze network contentionon fat-tree networks and develop strategies to optimize collectivemulticast using known contention free communicationschedules on fat-tree networks in the design of twonovel strategies. We evaluate performance of these strategieswith up to 256 nodes (1024 processors) on an alphacluster. We present schemes that perform well when a contiguouschunk of nodes is not available. For large messages,many of our strategies have two times better throughputthan native MPI. We also demonstrate that the softwareoverhead of a collective operation is a small fraction of thetotal completion time in the presence of the communicationco-processor. We therefore compare the performance of thestudied strategies using both metrics (i) Completion time,and (ii) Computation overhead.
Using Virtual Organizations Membership System with EDG's Grid Security and Database Access
Authors: Marko Niinimaki, John White, Wim Som de Cerff, Joni Hahkala, Tapio Niemi, Mikko Pitkanen
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper describes the European Data Grid's (EDG's) java security system and Spitfire database access system giving special emphasis on the virtual organization technologies. These technologies create a feasible framework for authentication and authorization in distributed Grid applications. A virtual organization (VO) is a collection of people in the same administrative domain. A user can belong to many virtual organizations and have a different role (user, client, administrator,..) in each of them. An authorization of a user to different services within a VO is based on the user's identity and a service called a Virtual Organization Membership Service (VOMS) that maps these identities with roles. The user proves his identity over the internet using authentication process. The user normally authenticates using his credentials, which comprise of a certificate chain and a private key. In Grid systems, the user usually authenticates using proxy credentials that are derived from the actual credentials. The proxy credentials comprise of the user's certificate chain added with a proxy certificate and a proxy private key. In the proxy creation process, the user's VO information, including groups and roles, is included into the proxy certificate. In order to use these proxy certificates with VO information we have created an authorization system and to demonstrate the usage we have extended the functionality Spitfire, a relational database front end. This involves assigning the user a database role (read, write, update..) based on the VO information in his certificate. There is also a GUI for configuring the authorization service. The earth observation team's database access for ozone profile validation is used here as an example of an application.
Client-centered energy savings for concurrent HTTP connections
Authors: Haijin Yan, Rupa Krishnan, Scott A. Watterson, David K. Lowenthal
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

In mobile devices, the wireless network interface card (WNIC) consumes a significant portion of overall system energy. One way to reduce energy consumed by a WNIC is to transition it to a lower-power sleep mode when data is not being received or transmitted.This paper investigates client-centered techniques for saving energy during web browsing. The basic idea is that the client predicts when packets will arrive, keeping the WNIC in high-power mode only when necessary. This is challenging because web browsing generally results in concurrent HTTP connections. To handle this, we maintain the state of each open connection on the client and then transition the WNIC to sleep mode when no connection is receiving data. Our technique is compatible with standard TCP and does not rely on any assistance from the server, a proxy, or IEEE 802.11b power-saving mode (PSM). Our technique combines the performance of regular TCP with nearly all the energy-saving of PSM during web downloads, and we save more energy than PSM during client think times. Results show that over an entire web browsing session (downloads and think times), our scheme saves up to 21% energy compared to PSM and incurs less than a 1% increase in transmission time compared to regular TCP.
The first 10th Smarandache symmetric numbers
Authors: Muneer Jebreel
Venue: Smarandache Notions Journal (2004)

In this article, we present some important observations of the first 10th Smarandache Symmetric Numbers (exclude the second number i.e. 11), and the relationship of squaring.
Linear Inequalities for Rank 3 Geometric Lattices
Authors: Kathryn L. Nyman
Venue: Discrete Computational Geometry (2004)

The flag Whitney numbers (also referred to as the flag f-numbers) of a geometric lattice count the number of chains of the lattice with elements having specified ranks. We give a collection of inequalities which imply all the linear inequalities satisfied by the flag Whitney numbers of rank 3 geometric lattices. We further describe the smallest closed convex set containing the flag Whitney numbers of rank 3 geometric lattices as well as the smallest closed convex set containing the flag Whitney numbers of those lattices corresponding to oriented matroids.
Situation-based Message Rating in Information Logistics and its Applicability in Collaboration Scenarios
Authors: Ulrich Meissen, Stefan Pfennigschmidt, Tjark Wahnfried, Kurt Sandkuhl
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The aim of information logistics is to reduce information overflow by utilizing the paradigm of a demand-oriented information supply. In this paper we focus on asynchronous message-based communication processes in collaborative environments. Our main task in this context is the assessment of messages with respect to the situations of the receiver. This paper presents a new general approach to estimate the information value of free text messages (e-mail, fax, etc.). Our measure for information value is based upon relevance between a message and different situations as well as time- and situation-dependent utility and acceptance functions. The approach has been tested using the MeLog system implemented at Fraunhofer ISST. We use a scenario from the automotive industry to demonstrate its general applicability. Finally, we focus on the application potentials of our approach in cooperative environments where the efficiency of information and communication processes is of crucial importance.
On Smarandache repunit N numbers
Authors: Jason Earls
Venue: Smarandache Notions Journal (2004)

We define three new sets of numbers somewhat similar to Repunit numbers [1] and the Smarandache Unary numbers[2], which we call Smarandache Repunit N (SRN) numbers. We report primes, properties, conjectures and open questions concerning SRN numbers. Some subsidiary sequences are given along the way.
Is a picture worth a thousand words?: an evaluation of information awareness displays
Authors: Christopher Plaue, Todd Miller, John Stasko
Venue: Proceedings of Graphics Interface 2004 (2004)

What makes a peripheral or ambient display more effective at presenting awareness information than another? Presently, little is known in this regard and techniques for evaluating these types of displays are just beginning to be developed. In this article, we focus on one aspect of a peripheral display's effectiveness---its ability to communicate information at a glance. We conducted an evaluation of the InfoCanvas, a peripheral display that conveys awareness information graphically as a form of information art, by assessing how well people recall information when it is presented for a brief period of time. We compare performance of the InfoCanvas to two other electronic information displays, a Web portal style and a text-based display, when each display was viewed for a short period of time. We found that participants noted and recalled significantly more information when presented by the InfoCanvas than by either of the other displays despite having to learn the additional graphical representations employed by the InfoCanvas.
The Alexandroff Dimension of Quotients of R2
Authors: Petra Wiederhold, Richard G. Wilson
Venue: Discrete Computational Geometry (2004)

We generalize results of our previous paper, showing that the minimal grid of a fenestration of the plane, whose elements are open discs with frontiers which are Jordan curves, has Alexandroff dimension 2. We give examples to show why this condition on the frontier is required and that the methods employed here are not applicable in higher dimensions.
An expression model for graphical command languages
Authors: Dan R. Olsen, Norman Badler
Venue: ACM SIGACT News (1983)

A unified command model for interactive systems is presented based on the expression syntax of PASCAL-like languages. The relationships between command specification and feedback as they relate to command structure are reviewed for both continuous and discrete interactions. The advantages of a discrete prefix command structure are presented in relationship to the PASCAL expression mechanism.The procedure mechanism of PASCAL-like languages is presented as a basis for graphical command specifications. The advantages of such a model are discussed in terms of borrowed knowledge from compiler construction and user familiarity. The automatic generation of interactive systems from such a model is discussed.An extended example of how procedure declarations can serve as the basis for interactive command definition is given. It is shown how menu-driven systems can be automatically generated from such a description. It is also shown how by extending the procedure declaration it is possible to support iconic identifiers, function buttons and locater and valuator type devices.The role of data types in such a command model is explored in depth. The notion of using a typed data value as a pick identifier is presented. It is shown how such typed identifiers can be integrated into the command model to provide automatic error checking and resolution of ambiguous pointing.
Diverse Firewall Design
Authors: Alex X. Liu, Mohamed G. Gouda
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Firewalls are safety-critical systems that secure most privatenetworks. An error in a firewall either leaks secret informationfrom its network or disrupts legitimate communicationbetween its network and the rest of the Internet. Howto design a correct firewall is therefore an important issue.In this paper, we propose the method of diverse firewall design,which is inspired by the well-known method of designdiversity for building fault-tolerant software. Our methodconsists of two phases: a design phase and a comparisonphase. In the design phase, the same requirement specificationof a firewall is given to multiple teams who proceed independentlyto design different versions of the firewall. Inthe comparison phase, the resulting multiple versions arecompared with each other to find out all the discrepanciesbetween them, then each discrepancy is further investigatedand a correction is applied if necessary. The technicalchallenge in the method of diverse firewall design is howto discover all the discrepancies between two given firewalls.We present a series of three efficient algorithms forsolving this problem: (1) a construction algorithm for constructingan equivalent ordered firewall decision diagramfrom a sequence of rules, (2) a shaping algorithm for transformingtwo ordered firewall decision diagrams to becomesemi-isomorphic without changing their semantics, and (3)a comparison algorithm for detecting all the discrepanciesbetween two semi-isomorphic firewall decision diagrams.
Interactive image-based exploded view diagrams
Authors: Wilmot Li, Maneesh Agrawala, David Salesin
Venue: Proceedings of Graphics Interface 2004 (2004)

We present a system for creating interactive exploded view diagrams using 2D images as input. This image-based approach enables us to directly support arbitrary rendering styles, eliminates the need for building 3D models, and allows us to leverage the abundance of existing static diagrams of complex objects. We have developed a set of semi-automatic authoring tools for quickly creating layered diagrams that allow the user to specify how the parts of an object expand, collapse, and occlude one another. We also present a viewing system that lets users dynamically filter the information presented in the diagram by directly expanding and collapsing the exploded view and searching for individual parts. Our results demonstrate that a simple 2.5D diagram representation is powerful enough to enable a useful set of interactions and that, with the right authoring tools, effective interactive diagrams in this format can be created from existing static illustrations with a small amount of effort.
Analysis of Tree-Shaped Transactions in Distributed Real-Time Systems
Authors: Ola Redell
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

A worst case response time analysis exploitingprecedence constraints between fixed priority scheduledtasks in tree-shaped transactions is presented. Thealgorithm extends existing methods for analysis of lineartransactions allowing a wider range of systems, in whichtasks may trigger more than one succeeding task on theircompletion, i.e. the transactions form trees. It alsoimproves existing methods, producing tighter responsetime bounds for tasks in both linear and tree-shapedtransactions. The improvement is due to better exploitationof the precedence relations between tasks, which alsomakes the analysis faster than earlier. Simulation resultsshow a significant reduction of estimated worst caseresponse times when compared to earlier analysis methodsfor both linear and tree-shaped transactions. Suchimprovement leads to less pessimistic schedulability testsfor distributed fixed priority scheduled systems.
Resource space model, its design method and applications
Authors: Hai Zhuge
Venue: Journal of Systems and Software (2004)

A resource space model (RSM) is a model for specifying, sharing and managing versatile Web resources with a universal resource view. A normal resource space is a semantic coordinate system with independent coordinates and mutual-orthogonal axes. This paper first introduces the main viewpoint and basic content of the RSM, and then proposes a four-step method for designing the logical-level resource spaces: resource analysis, top-down resource partition, design two-dimensional resource spaces, and join between resource spaces. Design strategies and tools include: reference model, analogy and abstraction strategy, resource dictionary, independency checking tool, and orthogonality checking tool. The study on using the RSM to manage relational tables shows that the RSM is also suitable for managing structured resources. Applications show that the RSM together with the proposed development method is an applicable solution to realize normal and effective management of versatile web resources. Comparisons show the differences between the proposed model and the relational data model.
Optimality Conditions for Nonconvex Multistate Control Problems in the Coefficients
Authors: Juan Casado-Díaz, José D. Martín-Gómez, Julio Couce-Calvo
Venue: SIAM Journal on Control and Optimization (2004)

The purpose of this paper is to attain some optimality conditions for the identification of a diffusion matrix (material) under several restrictions. Assuming that the set of such diffusion matrices is closed for the H-convergence, we give a method to obtain admissible directions which applies to a not-necessarily convex control set. Our results permit obtaining the diffusion matrix from the state functions.
Smarandache concatenated magic squares
Authors: Muneer Jebreel Karama
Venue: Smarandache Notions Journal (2004)

In this article, I present the results of investigation of Smarandache Concatenate Magic Squares formed from the magic squares, and report some conjectures.
Hybrid analysis: static & dynamic memory reference analysis
Authors: Silvius Rus, Lawrence Rauchwerger, Jay Hoeflinger
Venue: International Journal of Parallel Programming (2003)

We present a novel Hybrid Analysis technology which can efficiently and seamlessly integrate all static and run-time analysis of memory references into a single framework that is capable of performing all data dependence analysis and can generate necessary information for most associated memory related optimizations. We use HA to perform automatic parallelization by extracting run-time assertions from any loop and generating appropriate run-time tests that range from a low cost scalar comparison to a full, reference by reference run-time analysis. Moreover we can order the run-time tests in increasing order of complexity (overhead) and thus risk the minimum necessary overhead. We accomplish this by both extending compile time IP analysis techniques and by incorporating speculative run-time techniques when necessary. Our solution is to bridge "free" compile time techniques with exhaustive run-time techniques through a continuum of simple to complex solutions. We have implemented our framework in the Polaris compiler by introducing an innovative intermediate representation called RT_LMAD and a run-time library that can operate on it. Based on the experimental results obtained to date we hope to automatically parallelize most and possibly all PERFECT codes, a significant accomplishment.
Cryptographic technology: fifteen year forecast
Authors: Whitfield Diffie
Venue: ACM SIGACT News (1982)

This paper examines the forces driving public development of cryptography today and projects the course of the field over the next fifteen years with attention to the possible influence of government regulation.This paper was prepared, under contractual arrangements to CRC Systems, in support of the Commerce Department (National Telecommunications and Information Administration, Special Projects Office) response to a White House Office of Science and Technology Policy request that the secretaries of the Departments of Commerce and Defense propose a national policy on cryptography.
Knowledge-based fault localization in debugging: preliminary draft
Authors: Robert L. Sedlmeyer, William B. Thompson, Paul E. Johnson
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Fault localization in program debugging is the process of identifying program statements which cause anomalous behaviour. We have developed a prototype, knowledge-based model of the fault localization process. Novel features of the model include multiple localization tactics and a recognition-based mechanism for program abstraction. An explicit division of knowledge from the applications, programming and language domains facilitate model tuning within as well as across applications domains. We describe model structure and performance for a class of faults associated with master file update programs. We foresee applications of the model as an initial cognitive theory of expertise in fault localization and as a partially automated debugging tool.