ppxscal/embedding_network huggingface dataset:
Some convergence results for a class of nonlinear phase-field evolution equations
Authors: Giulio Schimperna
Venue:  (1999)

Two heat diffusion problems in the framework of the parabolic phase-field model are presented, the first related to a single isotropic fluid and the other describing the heat transmission between two regions occupied by different substances; some existence and uniqueness results are briefly recalled. Then, an asymptotic study of the problems is carried out as the phase-field equation collapses to an energy balance relation of Stefan type, in the first case in the whole domain, and in the second in only one of the considered regions. In both cases, a convergence result for the solutions is proved; particularly interesting seems the transmission case, where, in order to avoid the arising of compatibility conditions at the interface, it has been necessary to rewrite the problem in terms of graph convergence of abstract maximal monotone operators. EMAIL:: schimper@dragon.ian.pv.cnr.it KEYWORDS:: Phase-field models, abstract subdifferential operators, evolution equations, graph convergence
VLSI Mesh Routing Systems
Authors: Charles M. Flaig
Venue:  (1987)

No abstact available.
Statistical Thermodynamics of Protein Folding: Comparison of a Mean-Field Theory with Monte Carlo Simulations
Authors: Ming Hao, Harold A. Scheraga
Venue:  (1994)

A comparative study of protein folding with an analytical theory and computer simulations, respectively, is reported. The theory is based on an improved mean-field formalism which, in addition to the usual mean-field approximations, takes into account the distributions of energies in the subsets of conformational states. Sequence-specific properties of proteins are parameterized in the theory by two sets of variables, one for the energetics of mean-field interactions and one for the distribution of energies. Simulations are carried out on model polypeptides with different sequences, with different chain lengths, and with different interaction potentials, ranging from strong biases towards certain local chain states (bond angles and torsional angles) to complete absence of local conformational preferences. Theoretical analysis of the simulation results for the model polypeptides reveals three different types of behavior in the folding transition from the statistical coiled state to the compact globular state; these include a cooperative two-state transition, a continuous folding, and a glass-like transition. It is found that, with the fitted theoretical parameters which are specific for each polypeptide under a different potential, the mean-fields theory can describe the thermodynamic properties and folding behavior of the different polypeptides accurately. By comparing the theoretical descriptions with simulation results, we verify the basic assumptions of the theory and, thereby, obtain new insights about the folding transitions of proteins. It is found that the cooperativity of the first-order folding transition of the model polypeptides is determined mainly by long-range interactions, in particular the dipolar orientation; the local interactions (e.g. bond-angle and torsion-angle potentials) have only a marginal effect on the cooperative characteristic of the folding, but have a large impact on the difference in energy between the folded lowest-energy structure and the unfolded conformations of a protein.
Condition Numbers of Random Triangular Matrices
Authors: D. Viswanath, L. N. Trefethen
Venue:  (1996)

\begin{abstract} Let $L_n$ be a lower triangular matrix of dimension $n$ each of whose nonzero entries is an independent $N(0,1)$ variable, \ie, a random normal variable of mean $0$ and variance $1$. It is shown that $\kn$, the 2-norm condition number of $L_n$, satisfies \begin{equation*} \sqrt[n]{\kn} \rightarrow 2 \:\:\: \text{\it almost surely} \end{equation*} as $n\rightarrow\infty$. This exponential growth of $\kn$ with $n$ is in striking contrast to the linear growth of the condition numbers of random {\it dense} matrices with $n$ that is already known. This phenomenon is not due to small entries on the diagonal (\ie, small eigenvalues) of $L_n$. Indeed, it is shown that a lower triangular matrix of dimension $n$ whose diagonal entries are fixed at $1$ with the subdiagonal entries taken as independent $N(0,1)$ variables is also exponentially ill-conditioned with the 2-norm condition number $\kn$ of such a matrix satisfying \begin{equation*} \sqrt[n]{\kn}\rightarrow 1.305683410\ldots \:\:\:\text{\it almost surely} \end{equation*} as $n\rightarrow\infty$. A similar pair of results about complex random triangular matrices is established. The results for real triangular matrices are generalized to triangular matrices with entries from any symmetric, strictly stable distribution. \end{abstract}
Voltage Comparator Circuits for Multiple-Valued CMOS Logic
Authors: Yongjian Brandon Guo, K. Wayne Current
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A new voltage-mode comparator circuit for use in CMOS multiple-valued logic circuits is introduced.Existing comparator circuits for this application use static current or clocking and thus consume static power or clocking power.In order to reduce these power requirements, we have examined static circuit designs that eliminate DC current paths when the inputs and outputs are at logical values.Elimination of DC current paths requires increased circuit complexity, layout area, and signal delay.This paper proposes comparator circuits that use static logic circuits and thus require no static current and no static (DC) power.HSPICE simulations of these circuits using model parameter values for a 0.35-?m n-well CMOS technology and a 3.3-volt power supply show that each of these comparator circuits consumes static power on the order of nWs.Simulations with the model parameter values for the thick-oxide (5-volt) option of the 0.35-?m technology and for a 1.2-?m (5-volt) CMOS technology are also presented.These power levels are consistent with those of standard binary CMOS logic circuits in the same technologies.
Grids for the Internet and Other Digital Media
Authors: Veruschka Gotz
Venue:  (2002)

:Grids are the organizing principle behind every successful piece of graphic design. You've seen chaotic, unstructured, poorly sign-posted websites, which leave us lost in an unmanageable jumble of information overload. A noted international designer and typographer encourages screen-based designers to establish an efficient hierarchy of information with clear layouts, proving how good design can generate visual logic. A well thought out grid system for the screens thereby allows the screen designer to create order, so that the users can easily orient themselves and find information. Includes successful examples of onscreen grids from leading international companies such as Adidas, Lufthansa, Jaguar, Daimler Chrysler, and Veuve Clicquot.
THE CYPRUS CRISIS: a multilateral bargaining simulation
Authors: Stephen M. Shellman, Kürşad Turan
Venue: Simulation and Gaming (2003)

Using Kolb's experimental learning model as a blueprint, the authors devise an active learning simulation to introduce students to general theories and concepts of international relations. Besides encompassing abstract theories and concepts, the simulation facilitates the development of critical and analytical thinking skills. Students research real political actors' roles and actively participate in managing an acute crisis in Cyprus. During the crisis, students must evaluate options, make binding decisions, and negotiate deals with one another. The authors find that students embrace the opportunity to learn in a fun, stimulating environment and learn more as a result.
Interactive Multiagent Reinforcement Learning with Motivation Rules
Authors: Tomohiro Yamaguchi, Ryo Marukawa
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents a new framework of multiagent reinforcement learning to acquirecooperative behaviors by generating and coordinating each learning goal interactivelyamong agents.One of the main goals of Artificial Intelligence is to realize an intelligentagent that behaves autonomously by its sense of values.Reinforcement learning (RL) is themajor learning mechanism for the agent to adapt itself to various situations of an unknownenvironment flexibly.However, in a multiagent system environment that has mutualdependency among agents, it is difficult for a human to setup suitable learning goals foreach agent, besides the existent framework of RL that aims for egoistic optimality of eachagent is inadequate.Therefore, it requires the active and interactive learning mechanism togenerate and coordinate each learning goal among agents.To realize this, first we propose totreat each learning goal as reinforcement signals (RS) that can be communicated amongagents.Second we introduce motivation rules to integrate RS communicated among agentsinto a reward value for RL of an agent.Then we define cooperative rewards as learninggoals with mutual dependency.Learning experiments for two agents with variousmotivation rules are performed. Experimental results show that several combinations ofmotivation rules are converged to cooperative behaviors.
Very weak zero one law for random graphs with order and random binary functions
Authors: Saharon Shelah
Venue:  (1995)

Let G(>,n,p) denote the usual random graph G(n,p) on a totally ordered set of n vertices. (We naturally think of the vertex set as 1,...,n with the usual >). We will fix p=1/2 for definiteness. Let L(>) denote the first order language with predicates equality (x=y), adjacency (x~y) and less than (x > y). For any sentence A in L(>) let f(n)=f(A,n) denote the probability that the random G(>,n,p) has property A. It is known that there are A for which f(n) does not converge. Here we show what is called "a very weak zero-one law" Theorem: For every A in language L(>) lim [f(A,n+1)-f(A,n)] = 0. Note, as an extreme example, that this implies the nonexistence of a sentence A holding with probability 1-o(1) when n is even and with probability o(1) when n is odd. In section 2 we give the proof, based on a circuit complexity result. In Section 3 we prove that result, which is very close to the now classic theorem that parity cannot given by an AC^0 circuit. In Section 4 we give a very weak zero-one law for random two-place functions. The proof is very similar, the random function theorem being perhaps of more interest to logicians, the random graph theorem to discrete mathematicians.
Multilayer VLSI Layout for Interconnection Networks
Authors: Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz Parhami
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about (L/2)2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a factor of about L/2, leading to considerably lower cost and/or higher performance. The proposed layouts for k-ary n-cubes, hypercubes, butterfly networks, cube-connected cycles (CCC), folded hypercubes, generalized hypercubes, k-ary n-cube cluster-c, hierarchical hypercube networks, reduced hyper-cubes, hierarchical swap networks, and indirect swap net-works, are the best layouts reported for these networks thus far and are optimal within a small constant factor under both the Thompson model and the multilayer grid model. All of our layouts are optimally scalable in that we can allow each network node to occupy the largest possible area (e.g., o(N/L2) for hypercubes) without increasing the leading constant of the layout area, volume, or maximum wire length.
Syntax-Directed Translation of Concurrent Programs into Self-Timed Circuits
Authors: Steven M. Burns, Alain J. Martin
Venue:  (1988)

No abstract available.
Efficient commit protocols for the tree of processes model of distributed transactions
Authors: C. Mohan, B. Lindsay
Venue: ACM SIGOPS Operating Systems Review (1985)

This paper describes two efficient distributed transaction commit protocols, the Presumed Abort (PA) and Presumed Commit (PC) protocols, which have been implemented in the distributed data base system R* [DSHLM82, LHMWY83]. PA and PC are extensions of the well-known two-phase (2P) commit protocol [Gray78, Lamp80, LSGGL80]. PA is optimized for read-only transactions and a class of multi-site update transactions, and PC is optimized for other classes of multi-site update transactions. The optimizations result in reduced inter-site message traffic and log writes, and, consequently, a better response time for such transactions. We derive the new protocols in a step-wise fashion by modifying the 2P protocol.
The bias of lag window estimators of the fractional difference parameter
Authors: R. L. Hunt, M. S. Peiris, N. C. Weber
Venue: The Korean Journal of Computational Applied Mathematics (2003)

An approximation for the bias in lag window estimators of the degree of differencing in fractionally integrated time series models is derived. The expression obtained is compared with the observed bias from simulations for various windows.
Highly Reliable Component-Based Software Development by Using Algebraic Behavioral Specification
Authors: Michihiro Matsumoto, Kokichi Futatsugi
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

Component-based software development in which software is developed by combining components and connectors has gained in popularity, because it can increase software productivity. To increase software productivity, components must be reused. However, to do so, we must select software architecture. We propose (1) new software architecture tree architecture. A special class of algebraic behavioral specification projection-style behavioral specification represents it. Recently, even component-based enterprise systems have developed. So, the importance of the technologies how to develop highly reliable component-based software has increased. We propose these technologies by using projection-style behavioral specification. One is (2) the technology that assures high reliability of connectors. Another is (3) the technology that assures consistency of software family evolution. The advantages of these technologies are that these can be automated.
Proceedings of the Sixth International Web Content Caching and Distribution Workshop (WCW''01)
Authors: Azer Bestavros, Michael Rabinovich
Venue:  (2001)

Abstract The International Web Content Caching and Distribution Workshop (WCW) is a premiere technical meeting for researchers and practitioners interested in all aspects of content caching, distribution and delivery on the Internet. This year''s meeting will be held on the Boston University Campus and will build on the successes of the five previous WCW meetings. This technical report includes all the technical papers presented at WCW''01.
Understanding the Psychology of Internet Behaviour: Virtual Worlds, Real Lives
Authors: Adam N. Joinson
Venue:  (2002)

:The Internet is transforming business, education, perhaps even ourselves. In this timely text Adam Joinson provides a clear, engaging and lively summary of the psychology of the Internet, while at the same time drawing lessons from previous technologies as diverse as the early telephone, telegraph and even radio hams. Mixing anecdote with findings from psychological studies, this book provides a clear, compelling and insightful vision of the psychology of the Internet, as well as the implications for the design of future technologies. It is an invaluable resource for anyone studying Internet behaviour or interested in their own or others' online behavior.
Third-Party Registrars' Audits - for Better Or for Worse?
Authors: R. Bamford, W. Deibler
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Reviews the potential impact of third-party standards audits on a software organization's ability to respond to changing requirements. The authors focus on the responsibility of the auditee's management to ensure that the registrar's audit presents a balanced view of the auditee's position with respect to a standard. Ineffective audits and undeserved certification waste time and money. An ineffective audit has the potential to undermine carefully nurtured cultural attitudes about quality, standards, procedures and audits. At worst, an ineffective audit can obscure problems and divert a software organization from addressing real problems that adversely affect customer satisfaction, the quality of products and services, the efficiency of processes and the business viability of the organization. Drawing on their experience with ISO 9000 in software engineering, the authors discuss actual problems encountered and suggest techniques for ensuring that third-party audits are effective for ensuring that major nonconformities identify serious problems. One of the most prevalent examples is the apparent over-emphasis on document control. Lack of document control is a legitimate major problem. Up to 70% of ISO registrations are initially denied because of document control problems. It would, however, be of substantially more value to the auditee for a skilled auditor to discover that, for example, the process for creating and maintaining requirements documents is missing. While the authors' examples are drawn from ISO 9001 registration audits, the principles, problems and remedies they recommend translate into any standards environment.
From Early to Late Formal Requirements: A Process-Control Case Study
Authors: Eric Dubois, Michael Petit, Eric Yu
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

In this paper, we consider three distinct and connected modelling activities at the Requirements Engineering (RE) level. Within the context of reactive systems, we suggest how these three activities can be supported by the use of appropriate formal languages, namely Kaos, Albert and Timed Automata. The i* framework is used for linking the various formal models and for providing a ``high level'' model in terms of which organizational issues are captured. A small process control example is used to illustrate the proposed approach.
An efficient high-order algorithm for solving systems of 3-D reaction-diffusion equations
Authors: Yuanxian Gu, Wenyuan Liao, Jianping Zhu
Venue: Journal of Computational and Applied Mathematics (2003)

We discuss an efficient higher order finite difference algorithm for solving systems of 3-D reaction-diffusion equations with nonlinear reaction terms. The algorithm is fourth-order accurate in both the temporal and spatial dimensions. It requires only a regular seven-point difference stencil similar to that used in the standard second-order algorithms, such as the Crank-Nicolson algorithm. Numerical examples are presented to demonstrate the efficiency and accuracy of the new algorithm.
Trading Replication Consistency for Performance and Availability: an Adaptive Approach
Authors: Chi Zhang, Zheng Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Replication system is one of the most fundamental buildingblocks of wide-area applications. Due to the inevitabledependencies on wide-area communication, trade-off betweenperformance, availability and replication consistencyis often a necessity. While a number of proposals havebeen made to provide a tunable consistency bound betweenstrong and weak extremes, many of them rely on a staticallyspecified enforcement across replicas. This approach, whileeasy to implement, neglects the dynamic contexts withinwhich replicas are operating, delivering sub-optimal performanceand/or system availability.In this paper, we analyze the problem of optimal performance/availability for a given consistency level under heterogeneousworkload and network condition. We prove severaloptimization rules for different goals. Based on theseresults, we developed an adaptive update window protocolin which consistency enforcement across replicas is self-tunedto achieve optimal performance/availability. A prototypesystem, FRACS, is built and evaluated in this paper.The experiment results demonstrate significant advantagesof adaptation over static approach for a variety of workloads.
Effect of bifurcation on the semi-active optimal control problem
Authors: L. G. Crespo, J. Q. Sun
Venue: Communications in Nonlinear Science and Numerical Simulation (2002)

For nonlinear dynamic systems near bifurcation, the basins of attraction of fixed points as well as the steady-state responses can change considerably with a small variation of the bifurcating parameter. This paper studies the effect of bifurcation on the semi-active optimal control problem with fixed final state by using the cell mapping method. A system parameter is taken as the control. The admissible control values considered encompass a bifurcation point of the system. Global changes in the optimal control solution for different targets are studied. Saddle node, supercritical pitchfork and subcritical Hopf bifurcations are considered in the examples. It has been found that the global topology of the optimal control solution is strongly dependent on the state of the target.
Scattered subsets
Authors: Emanuele Munarini, Norma Zagaglia Salvi
Venue: Discrete Mathematics (2003)

We study combinatorial properties of the species of scattered subsets in the case of linearly ordered sets and in the case of cycles. In particular, we study the numbers of such subsets which turn out to be a generalization of Fibonacci and Lucas numbers. We also determine a generalization of the Cassini's identity. Finally, we define a q-analog of such numbers and we prove some q-analog identities.
Digital Photography: 99 Easy Tips To Make You Look Like A Pro!
Authors: Ken Milburn
Venue:  (2002)

:Extend the capabilities of your digital camera with 99 thoroughly explained helpful pointers. Organized into easy-to-navigate chapters, this handy resource will help you fully utilize your camera's features, perform digital darkroom magic, and manage, print, and publish your images on the Web. Learn photographic techniques such as lighting problem shadows, taking extreme close-ups, capturing motion, and more. Plus -- supplement your photographic expeditions with darkroom tricks and magic, including correcting the color and brightness of your images, sharpening the focus, and eliminating imperfections. Read this book and discover why digital photography is fast becoming the leading method of capturing life's most important moments.
The Optimal Axial Interval in Estimating Depth from Defocus
Authors: Yoav Y. Schechner, Nahum Kiryati
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We analyze the effect of perturbations on the estimation of Depth from Defocus (DFD) implemented by changing the focus setting (e.g., axially moving the sensor). The analysis yields the optimal change of focus setting, and the spatial frequencies for which estimation is most robust. For stable estimation at all spatial frequencies, the change in focus setting should be less than twice the depth of field. For the most robust estimation in the highest spatial frequencies the axial interval should be equal to the depth of field.