ppxscal/embedding_network huggingface dataset:
Wearable Key: Device for Personalizing nearby Environment
Authors: Nobuyuki Matsushita, Shigeru Tajima, Yuji Ayatsuka, Jun Rekimoto
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper describes a system that allows users who obtain a ¿wearable ID key¿ to personalize dynamically ubiquitous computers by simply touching them. We call the concept of providing personalized service by touch ¿Active Personalization¿. For active personalization, users only have to wear a digital key and do not have to carry around other computers. When users touch ubiquitous computers with their wearable key, the keyholes of the ubiquitous computers recognize their IDs and can personalize the computers. We developed a new network technology between keys and keyholes that enables digital information to be carried through a person's body based on a near-field technology we call TouchNet.
A Stateless QoS Signaling Protocol for the Internet
Authors: Michael Welzl
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

We describe a simple protocol that enhances the communication between end nodes and ¿the network¿. Other than the majority of QoS signaling systems, it achieves scalability by avoiding per-flow state. We also show how it can be used to decrease an adaptive multimedia application's packet loss ratio.
Special Edition Using Macromedia Fireworks MX
Authors: Jeffrey Bardzell, Mark Haynes
Venue:  (2002)

:Special Edition Using Macromedia Fireworks MX is the only book you'll need on Fireworks MX. This hands-on complete reference is packed with tutorials; you can go through the book from front to back or go straight to the information you need to complete a particular task. Jeffrey Bardzell, the co-founder of phireworx.com, demystifies the process of working in Fireworks MX. The user-friendly design and organization includes compelling art and shows you how to really take advantage of the many special effects and filters. Bardzell also packs the book with coverage of Dreamweaver, Flash, and Director integration. He covers usability and interface design in an extended section on building and exporting interactive page designs. He illustrates how to use Fireworks as part of an efficient collaborative workflow, with several chapters loaded with tips, strategies, and ideas on working efficiently with small and large teams.
Inexact Rayleigh quotient-type methods for subspace tracking
Authors: Valeria Simoncini, Lars Elden
Venue:  (1999)

We are interested in the computation of the $s$ largest or smallest eigenvalues and corresponding eigenvectors of a Hermitian positive definite matrix $A \in \CC^{n \times n}$, assuming that good approximations of the wanted eigenpairs are already available and that $s\ll n$, as is the case in applications such as signal processing and structural mechanics. We analyze efficient implementations of inexact Rayleigh quotient--type methods, which involve the approximate solution of a linear system at each iteration. We show that for $s=1$ the inexact version of the classical Rayleigh quotient iteration is mathematically equivalent to more recent approaches which employ projected equations. Generalizations to the case $s<1$ are also discussed. Ad--hoc preconditioning strategies are proposed to make the computation efficient for unfavorable spectral distributions. Results of numerical experiments on two significant examples are reported.
A Probabilistically Correct Leader Election Protocol for Large Groups
Authors: Indranil Gupta, Robbert van Renesse, Kenneth P. Birman
Venue:  (2000)

This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characterized by probabilistic failure rates of processes and message deliveries. The protocol trades correctness for scale, that is, it provides very good probabilistic guarantees on correct termination in the sense of the classical specification of the election problem, and of generating a constant number of messages, both independent of group size. After formally specifying the probabilistic properties, we describe the protocol in detail. Our subsequent mathematical analysis provides probabilistic bounds on the complexity of the protocol. Finally, the results of simulation show that the performance of the protocol is satisfactory.
Design of a High Speed Packet Routing Switch Utilizing Transputers
Authors: Christopher Ward, Saqib A. Khan
Venue:  (1992)

A high speed Transputer based packet routing switch to model a satellite node is described with an emphasis on the mechanics used. The node will form part of a test-bed used to study characterstics of a low altitude multiple satellite (LAMS) network. Each node is modelled using a Host PC and five Transputers which communicate with other nodes through laser-crosslinks and are designed in accordance with the International Standards Organization''s (ISO) Open Systems Interconnection (OSI) 7 layered network model. Communications are full-duplex and expected to be between 1-5Mbits/sec. Each node requires four external channels through which it communicates with other nodes. These channels receive NPDUs (Network layer Protocol Data Units) and either accept these packets or route them to the next node. The Transputer network has been designed so that dynamic routing table loading can be performed. The simulation is expected to behave as a M/M/1 queueing model. Internal threads will be used to report queue lengths and throughput. Four extra TRAMs will be connected to the external links to model external nodes and will contain a "monitor" process which gathers statistics on mean delay, number of packets accepted, etc.
The ESA Software Engineering Standards: Past, Present and Future
Authors: M. Jones, Mortensen, J. Fairclough
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

The European Space Agency (ESA) has had a set of software engineering standards which have been in force since 1984 and have undergone two revisions since that time. These standards were written by a group called the Board for Software Standardisation and Control (BSSC). This paper describes the role of the BSSC and gives a brief outline of the ESA software engineering standards (PSS-05-0), including recent work on a version of the standards for use in small projects, the so-called PSS-05 "lite". The results of work on the comparison of the ESA software engineering standards with software-related ISO standards such as ISO 9001/9000-3 and ISO 12207 are summarised. Work in progress is discussed, notably the production of a guide to applying PSS-05-0 in projects using object-oriented methods and coding standards for a number of programming languages. The outlook for the future is discussed. This discussion includes new standards coming from the European Cooperation for Space Standardisation (ECSS) as well as covering some other topical issues.
Fast Collect in the absence of contention
Authors: Burkhard Englert, Eli Gafni
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a processor updates its cell and then reads in any order all the other cells. Our simple implementation of Fast Collect uses some Multi-Writer, Multi-Reader (MWMR) variables and one local boolean per processor, such that eventually, in the absence of contention, i.e. if only a single processor repeatedly performs collect, the amortized cost per each collect is a constant. At the example of Disk Paxos we show, how Fast Collect can be used as a building block in wait-free algorithms.
Automatic Functional Vector Generation Using the Interacting FSM Model
Authors: Chia-Chih Yen
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Abstraction: While the coverage-driven design validation is getting popular, it would be more convenient for users to have an automatic generator that can generate the input patterns to satisfy the coverage requirements. The symbolic techniques can be used to generate the desired input patterns easily for a specific state transition in a FSM. However, it is not practical for real designs because the memory requirement is often unmanageable. In this paper, we propose an automatic pattern generation engine that can overcome the memory issues for large circuits. It can generate all possible input combinations or notify that such cases will never happen for any specific state transitions. Because we can reasonably partition the HDL designs into the interacting FSM model, the peak memory requirement can be significantly reduced by using the "divide and conquer" strategy for those small FSMs. The experimental results show that we can indeed generate the required input patterns with reasonable memory requirement for the designs with thousands of registers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
Authors: Tian He, John A. Stankovic, Chenyang Lu, Tarek Abdelzaher
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper, we present a real-time communicationprotocol for sensor networks, called SPEED. The protocolprovides three types of real-time communication services,namely, real-time unicast, real-time area-multicast andreal-time area-anycast. SPEED is specifically tailored to bea stateless, localized algorithm with minimal control overhead.End-to-end soft real-time communication is achievedby maintaining a desired delivery speed across the sensornetwork through a novel combination of feedback controland non-deterministic geographic forwarding. SPEED is ahighly efficient and scalable protocol for sensor networkswhere the resources of each node are scarce. Theoreticalanalysis, simulation experiments and a real implementationon Berkeley motes are provided to validate our claims.
Hybrid nets with variable parameters: a novel approach to fast learning under backpropagation
Authors: Jun Han, C. Moraga
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

This paper presents a novel approach under regular backpropagation. We introduce hybrid neural nets that have different activation functions for different layers in fully connected feed forward neural nets. We change the parameters of activation functions in hidden layers and output layer to accelerate the learning speed and to reduce the oscillation respectively. Results on the two-spirals benchmark are presented which are better than any results under backpropagation feed forward nets using monotone activation functions published previously.
Design of a Communication System Capable of Supporting Real-Time RPC
Authors: Junghoon Lee
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper proposes and analyzes a communication mechanism capable of supporting real-time RPC(Remote Procedure Call) which is based on request-acknowledgment-reply semantic. As an enhanced protocol of TDMA-implemented Ethernet, the proposed CS(Communication System) dynamically schedules RPC-related messages according to their attributes, making a network schedule be easily combined with a server schedule. As RPC schedule produced by combining server schedule and communication schedule can obviate the waste computation time at the server, more real-time RPC requests can meet their timing constraints. Simulation result shows that the RPC over the proposed CS outperforms those over token bus and TDMA on the various network parameters, such as RPC arrival time, service time and slack.
Independence Results about Context-Free Languages and Lower Bounds
Authors: Juris Hartmanis
Venue:  (1984)

We show that for any axiomatizable, sound formal system F there exist instances of natural problems about context-free languages, lower bounds of computations and P versus NP that are not provable in F for any recursive representqation of these problems. Most previous independence results in computer science have been proven for specific representations of the problems, by exploiting the ``opaqueness'''' of Turing machine names. Our results rely on the complexity of the logical structure of the problem and yield independence results which do not depend on the representations of problems. We show, for example, that there exists a non-regular context-free language $L_{o}$ such that for no cf-grammar $G, L(G) = L_{o}$, it is provable in F that ``L(G) is not regular''''. We also show, among other results P and NP, that there exists a recursive oracle A such that $NP^{A} \neq P^{A}$, and that this fact is not provable in F for any recursive representation of A. The difference of what is and is not provable in F is well illustrated by questions about polynomial time isomorphisms (p-isomorphisms) of NP complete sets. We show that for every NP complete set, L, there is a representation of L by a non-deterministic polynomial time machine for which we can prove that L is NP complete. Furthermore if L is p-isomorphic to SAT then this is also provable in F for some representation of L. On the other hand, if there exist NP complete sets not p-isomorphic to SAT then there exists an NP complete set L for which, independent of its representation, there is no proof in F that L is or is not p-isomorphic to SAT.
The Real World Virtual Models
Authors: Andrey A. Sholomitskij, Sergey G. Dzhura
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The principles and technology of creation of the real world virtual models are examined in the paper. It is done on the example of open cast mining (OCM) modeling. The most advanced and quickly developed 3D-models and their stereoscopic presentation are emphasized. Theimplementation is done within the context of object oriented design in the automated system of the OCM survey support.
Computer simulations in solid-state NMR. III. powder averaging
Authors: Mattias Edén
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

As the final part in a series of articles on numerical simulations in solid-state NMR (Concepts Magn Reson 17A: 117-154, 2003 and Concepts Magn Reson Part A 18A: 1-23, 2003), aspects of simulations of NMR responses from powders are discussed. The underlying equations for powder averaging are derived, and it is demonstrated how powder averages may be estimated numerically. Orientational symmetry in solid-state NMR is summarized and exploited to achieve more efficient calculations. Explicit computer code in C/C++ is given for simulation of NMR spectra from powders containing (1) two homonuclear spins-1/2 in a static sample and (2) a heteronuclear two spin-1/2 system under magic-angle-spinning conditions.
Solving Geometric Constraints by a Graph-Constructive Approach
Authors: Brahim Hamid, Adel Moussaoui
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A geometric constraint solver is a major component of recent CAD systems. Graph constructive solvers are stemming from graph theory. In this paper, we describe a 2D constraint-based modeller that uses a graph constructive approach to solve systems of geometric constraints. The graph-based approach provides means for developing sound and efficient algorithms. We present a linear algorithm that solves a large subset of the rule and compass constructive problems. Methods for handling over- and under-constrained schemes are also given.
Self-Adaptive Masking Method for Automatic Shape Recognition and Motion Correction of Thallium-201 Myocardial Perfusion SPECT Imaging
Authors: K. Dong, M. H. N. Tabrizi, A. Movahed
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In this paper, we introduce a new self-adaptive masking method for shape detection of low Signal to Noise Ratio (SNR) images to improve the tracking capabilities of the motion correction in nuclear cardiac imaging. The method is developed using two-dimensional fast Fourier transform, ideal filtering in the frequency domain, recursive thresholding, and region recognition. This method is independent of the correlation between the contexts of the planar images and has a good tolerance for low SNR images. In addition, it is robust under the circumstances of significant abrupt motion of the object.
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles
Authors: Gyula Karolyi, Gabor Tardos
Venue:  (1995)

In certain families of hypergraphs the transversal number is bounded by some function of the packing number. In this paper we study hypergraphs related to multiple intervals and axis-parallel rectangles, respectively. Essential improvements of former established upper bounds are presented here. We explore the close connection between the two problems at issue.
Peak Power Minimization Through Datapath Scheduling
Authors: Saraju P. Mohanty, N. Ranganathan, Sunil K. Chappidi
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In this paper, we describe new integer linear programming models and algorithms for datapath schedulingthat aim at minimizing peak power while maintainingperformance. The first algorithm, MVDFC combines bothmultiple supply voltages and dynamic frequency clockingfor peak power reduction, while the second algorithm,MVMC explores multiple supply voltages and multicycling.The algorithms use the number and type of differentfunctional units at different operating voltages as theresource constraints. The effectiveness of the proposedscheduling algorithms is studied by estimating the peakpower consumption and the power delay product (PDP) ofthe datapath circuit being synthesised. The algorithms havebeen applied to various high level synthesis benchmarkcircuits under different resource constraints. Experimentalresults show that for the MVDFC, under various resourceconstraints using two supply voltage levels (5:0V,3:3V),average peak power reduction around 75% and averagePDP reduction of 60% can be obtained. For the MVMCscheme, average peak power reduction is around 36%and average PDP reduction is 20% for similar resourceconstraints.
The Center Function on Trees
Authors: McMorris F. R., Roberts Fred S., Wang Chi
Venue:  (2000)

When $(X, d)$ is a finite metric space and $\pi = (x_1 , \ldots, x_k ) \in X^k$, a central element for $\pi$ is an element $x$ of $X$ for which max$\{ d(x, x_i ): i = 1 ,\ldots ,k\}$ is minimum. The function that returns the set of all central elements for any tuple $\pi$ is called the center function on $X$. In this note, the center function on finite trees is characterized.
Robust State Sharing for Wide Area Distributed Applications
Authors: Brad Topol, Mustaque Ahamad, John T. Stasko
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

In this article, we present the Mocha wide area computing infrastructure we are currently developing. Mocha provides support for robust shared objects on heterogeneous platforms, and utilizes advanced distributed shared memory techniques for maintaining consistency of shared objects that are replicated at multiple nodes to improve performance. In addition, our system handles failures that we feel will be common in wide area environments. We have used an approach that makes use of multiple communication protocols to improve the efficiency of shared object state transfers in Mocha. We also provide an empirical evaluation of our prototype implementation for local area, wide area, and home service networks and present a sample home service application that has been programmed with the system.
Decision-Support Workload Characteristics on a Clustered Database Server from the OS Perspective
Authors: Yanyong Zhang, Jianyong Zhang, Anand Sivasubramaniam, Chun Liu, Hubertus Franke
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

A range of database services are being offered onclusters of workstations today to meet the demandingneeds of applications with voluminous datasets,high computational and I/O requirements and alarge number of users. The underlying database engineruns on cost-effective off-the-shelf hardwareand software components that may not really betailored/tuned for these applications. At the sametime, many of these databases have legacy codesthat may not be easy to modulate based on theevolving capabilities and limitations of clusters. Anindepth understanding of the interaction betweenthese database engines and the underlying operatingsystem (OS) can identify a set of characteristicsthat would be extremely valuable for future researchon systems support for these environments.To our knowledge, there is no prior work that hasembarked on such a characterization for a clustereddatabase server.Using IBM DB2 Universal Database (UDB) ExtendedEnterprise Edition (EEE) V7.2 Trial versionand TPC-H like decision support queries, this paperstudies numerous issues by evaluating performanceon an off-the-shelf Pentium/Linux clusterconnected by Myrinet. These include detailed performanceprofiles of all kernel activities, as well asqualitative and quantitative insights on the interactionbetween the database engine and the operatingsystem.
Viewpoints on Improving the Standards Making Process: Document Factory or Consensus Management?
Authors: L. Emmet, R. Adelard
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Emerging standards and guidelines need to be timely and reflect the requirements of the industrial sector they are designed to support. However, often, the delay between the identification of a need for a standard and its eventual release is too long. There is a need for increased understanding of the sources of delay and deadlock within the standards process. In this paper we describe an application of PERE (Process Evaluation in Requirements Engineering) to the standards process. PERE provides an integrated process analysis that identifies improvement opportunities by considering process weaknesses and protections from both mechanistic and human factors viewpoints. The resulting analysis identified both classical resource allocation problems and also specific problems concerning the construction and management of consensus within a typical standards making body. A number of process improvement opportunities are identified that could be implemented to improve the standards process. We conclude that consensus problems are the real barrier to timely standards production. Ironically the present trend for more distributed working and electronic support (via e-mail etc.) may make the document factory aspect of standards production more efficient at the expense of consensus building.
Core Concepts of Information Systems Auditing, 1st Edition, 1 edition
Authors: James E. Hunton
Venue:  (2003)

:This book illustrates the important concepts, standards, and frameworks associated with IT auditing. It is also a "how to" book for anyone interested in pursuing a career in this field or for financial auditors who recognize the need to better understand IT auditing. The book takes a risk approach to IT audit, and covers in detail the risks associated with IS deployment, IS operations, networks and telecommunications, and e-business.