ppxscal/embedding_network huggingface dataset:
PHP and MySQL for Dynamic Web Sites: Visual QuickPro Guide (2nd Edition) (Visual QuickPro Guides)
Authors: Larry Ullman
Venue:  (2005)

ï¾ It hasn't taken Web developers long to discover that when it comes to creating dynamic, database-driven Web sites, MySQL and PHP provide a winning open source combination. Add this book to the mix, and there's no limit to the powerful, interactive Web sites that users can create. With step-by-step instructions, complete scripts, and expert tips to guide readers, veteran author and database designer Larry Ullman gets right down to business: After grounding readers with separate discussions of first the scripting language (PHP) and then the database program (MySQL), he goes onï¾ to cover security, sessions and cookies, and using additional Web tools,ï¾ with several sections devoted to creating sample applications. This guide is indispensable for Web designers who want to replace their static sites with something more dynamic. The companion Web site includes source code, support forums, and extra tutorials. In addition to being updated for the most recent releases of MySQL and PHP,ï¾ this new edition offers 25% new material, including updated examples for improved clarity and comprehension and new installation instructions for PHP, MySQL, and other related technologies.ï¾
A Haptic Enabled Multimodal Pre-operative Planner for Hip Arthroplasty
Authors: S. Imboden, M. Petrone, P. Quadrani, C. Zannoni, R. Mayoral, G. J. Clapworthy, D. Testi, M. Viceconti, D. Neiberg, N. G. Tsagarakis, D. G. Caldwell
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper introduces the Multisense idea, with a special reference to the use of Haptics in the medical field and, in particular, in the planning of total hip replacement surgery. We emphasise the integration of different modalities and the capability of the multimodal system to gather and register data coming from different sources.
Fabrication of step and flash imprint lithography templates using a variable shaped-beam exposure tool
Authors: William J. Dauksher, David Mancini, Kevin Nordquist, Douglas J. Resnick, Peter Hudek, Dirk Beyer, Tim Groves, Olaf Fortagne
Venue: Microelectronic Engineering (2004)

If imprint lithography is to be considered as a viable method for fabricating high density silicon-based circuits, an infrastructure must be established that is capable of supplying users with 1X templates. It is critical, therefore, that tools are available that can expose, inspect, and repair these templates. The purpose of this work is to present initial step and flash imprint lithography template results using a shaped-beam system. A Leica SB350 MW was used to expose ZEP 7000 resist. The SB350 is a variable shaped-beam tool with 50 kV electron optics. A Motorola template pattern transfer process was used to obtain final images in the template. Trenches as small as 33 nm were resolved, as were 44 nm holes. Further improvements may be possible by increasing the operating voltage to 100 kV, and further increasing the e-beam system line edge acuity.
A digital design automation course for logic designers
Authors: W. M. vanCleemput
Venue: ACM SIGDA Newsletter (1978)

This paper describes a course which is being offered to graduate students at Stanford University as well as to practicing logic designers from industry. The main purpose of this course is to familiarize logic designers with the current state-of-the-art of digital design automation.
A secure ad-hoc routing approach using localized self-healing communities
Authors: Jiejun Kong, Xiaoyang Hong, Yunjung Yi, Joon-Sang Park, Jun Liu, Mario Gerla
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protocol compliant. For instance, since packet loss is common in mobile wireless networks, the adversary can exploit this fact by hiding its malicious intents using compliant packet losses that appear to be caused by environmental reasons.In this paper we study two routing attacks that use non-cooperative network members and disguised packet losses to deplete ad hoc network resources and to reduce ad hoc routing performance. These two routing attacks have not been fully addressed in previous research. We propose the design of "self-healing community" to counter these two attacks. Our design exploits the redundancy in deployment which is typical of most ad hoc networks; Namely, it counters non-cooperative attacks using the probabilistic presence of nearby cooperative network members.To realize the new paradigm, we devise localized simple schemes to (re-)configure self-healing communities in spite of random node mobility. We develop a general analytic model to prove the effectiveness of our design. Then we implement our secure ad hoc routing protocols in simulation to verify the cost and overhead incurred by maintaining the communities. Our study confirms that the community-based security is a cost-effective strategy to make off-the-shelf ad hoc routing protocols secure.
An Applying Aspect-Oriented Concept to Sequential Logic Design
Authors: Petcharat Burapathana, Proadpran Pitsatorn, Boonchai Sowanwanichkul
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Because of rapid hardware design's evolution, hardware circuits are more complex. Hardware designer would not spend too much time to produce the circuits. One of hardware designers' problems is redesigning of circuit occurring when specifications were changed. The existing research proves that object-oriented concept can be applied efficiently in hardware design covering both combinational and sequential logic circuits. Aspect-oriented is a new paradigm in software development. It can solve some problems such as crosscutting concerns where object oriented concept cannot. This paper proposes the idea that aspect-oriented concept can be implemented to the sequential logic circuit resulting in reducing time in hardware design process.
Time-Multiplexed Test Data Decompression Architecture for Core-Based SoCs with Improved Utilization of Tester Channels
Authors: Adam B. Kinsman, Nicola Nicolici
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

In this paper we first observe that the required amount of compressed test data transferred from the tester to the embedded cores in a system-on-a-chip (SOC) varies significantly during the testing process. This motivates a new approach to test data compression, mainly applicable to core-based SOCs, based on time-multiplexing the tester channels through which the on-chip decompressors will receive compressed test data only when necessary. The distinguishing advantage of this approach is that it is suitable for concurrent testing of multiple cores in an SOC and not only will the volume of test data be reduced but also the tester channel utilization will be increased.
Developing multiparty conferencing services for the NGN: towards a service creation framework
Authors: Gavin Byrne, Declan Barber
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In this paper, we present a methodology, for the creation of conferencing services for the Next Generation Network (NGN). We adopt a top-down design approach using a set of application design requirements and design goals to make design decisions. The service creation process within this methodology consists of first conceptualising a service in a generic network independent service description, then taking this service description and identifying suitable network protocols which follow our design requirements, creating an abstract class diagram, and finally identifying a suitable technology to implement the service. To demonstrate our methodology we will design a simple multi-party conferencing service. From this we will identify Java as a potentially catalytic technology in the development and execution of applications and services for the NGN and suggest that the Session Initiation Protocol (SIP) is the most appropriate internet signalling protocol to support conferencing services. This methodology as been derived as a result of work currently being carried out on an applied research project in ITB which is concerned with the development of a real-time collaboration service which allows multiple distributed scientists to graphically analyse a common set of data obtained from mobile sensors in a virtual conference environment.
An interior-point method for solving box-constrained underdetermined nonlinear systems
Authors: J. B. Francisco, N. Krejić, J. M. Martínez
Venue: Journal of Computational and Applied Mathematics (2005)

A method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear systems with bounds is modified and extended to cope with the underdetermined case. The algorithm produces a sequence of interior iterates and is based on globalization techniques due to Coleman and Li. Global and local convergence results are proved and numerical experiments are presented.
Pan: A High-Level Configuration Language
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

The computational requirements for the new Large Hadron Collider are enormous: 5-8 PetaBytes of data generated annually with analysis requiring 10 more PetaBytes of disk storage and the equivalent of 200,000 of today's fastest PC processors. This will be a very large and complex computing system, with about two thirds of the computing capacity installed in "regional computing centres" across Europe, America, and Asia.Implemented as a global computational grid, the goal of integrating the large geographically distributed computing fabrics presents challenges in many areas, including: distributed scientific applications; computational grid middleware, automated computer system management; high performance networking; object database management; security; global grid operations.This paper describes our approach to one of these challenges: the configuration management of a large number of machines, be they nodes in large clusters or desktops in large organizations.
4th international workshop on scenarios and state machines: models, algorithms and tools (SCESM'05)
Authors: Yves Bontemps, Alexander Egyed
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
UTSAF: A Multi-Agent-Based Software Bridge for Interoperability between Distributed Military and Commercial Gaming Simulation
Authors: Phongsak Prasithsangaree, Joseph Manojlovich, Stephen Hughes, Mike Lewis
Venue: Simulation (2004)

Rapid advances in consumer electronics have led to the anomaly that consumer off-the-shelf gaming hardware and software provide better interactive graphics than military and other specialized systems costing orders of magnitude more. UTSAF (Unreal Tournament Semi-Automated Force) is bridging software written to take advantage of the power of gaming systems by allowing them to participate in distributed simulations with military simulators. UTSAF illustrates the use of multiagent technology to flexibly interconnect otherwise incompatible systems. This article describes an architectural approach for rapidly constructing middleware by taking advantage of built-in capabilities for processing, communication, and interoperation that a multiagent infrastructure provides. Several software agents based on Reusable Environment for Task-Structured Intelligent Networked Agents (RETSINAs) are used to support interoperability between military simulation nodes based on distributed interactive simulation and Unreal game simulators. Using a multiagent system, UTSAF can be expanded to support several network environments and interact with other agent-based software.
Aspect language features for concern coverage profiling
Authors: Hridesh Rajan, Kevin Sullivan
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

In program profiling to assess test set adequacy, a challenge is to select code to be included in the assessment. Current mechanisms are coarse-grained; biased to dominant modularizations; require tedious, error-prone manual selection; and leave tester intent implicit in inputs to testing tools. Aspect-oriented constructs promise to improving testing in two ways: by improving our ability to select the code to include in adequacy criteria, and by documenting selection intentions in declarative form in the code itself. One problem is that current join point models do not reveal program behavior in enough detail to support white-box coverage analysis. Our contribution is the formulation, prototyping, and evaluation of a language-and-tool-based approach to white-box coverage adequacy analysis that we call concern coverage. We develop and evaluate one instance of the general idea in which branches, in particular, are exposed as join points to support branch coverage analysis of crosscutting concerns. Our results are consistent with the claim that the idea has the potential to improve test coverage analysis.
Smart Devices and Soft Controllers
Authors: Craig W. Thompson
Venue: IEEE Internet Computing (2005)

What if things (initially devices, but maybe things in general, including pets, places, and even abstractions) were smarter, easier to use, could diagnose their own problems, present different interfaces to different people, and communicate with each other--all seamlessly, without our having to learn much to install, use, or repair them? Could it be we are wasting a lot of time accommodating our devices while they should be accommodating us?
DA STANDARDS ACTIVITIES:: Summary: Standard Package Position Papers VHDL Model Standards Group
Authors: Lisa Asher
Venue: ACM SIGDA Newsletter (1988)

The following are abridged versions of position papers being used by the IEEE/DASS in developing the IEEE VHDL standard. These were supplied by Jim Armstrong who is Chairman of the VHDL Model Subgroup. Complete versions of the papers and minutes of the IEEE VHDL Subgroup are archived at the IEEE Computer Society. For further information call Rick Cain at 202-371-0101. I believe that sometime in the fall of 89 Design and Test will publish a special issue on the VHDL standard based on the final resolutions of the DASS. Special thanks to J. W. Smith for help in obtaining this material. 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
Five years of product line engineering in a small company
Authors: Martin Verlage, Thomas Kiesgen
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In 1999, a new team at MARKET MAKER Software AG began to develop a software product line for managing and displaying stock market data and financial market news. The basic idea was to use web technology in all applications for delivering services to customers. It soon turned out that the company had to change both the processes and the organization. This report summarizes the changes made and the lessons learned over the past five years, when the product line idea was introduced into a small company which faced the pressure to quickly market the first product line instances.
Hardware-based simulation and collision detection for large particle systems
Authors: A. Kolb, L. Latta, C. Rezk-Salama
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2004)

Particle systems have long been recognized as an essential building block for detail-rich and lively visual environments. Current implementations can handle up to 10,000 particles in real-time simulations and are mostly limited by the transfer of particle data from the main processor to the graphics hardware (GPU) for rendering.This paper introduces a full GPU implementation using fragment shaders of both the simulation and rendering of a dynamically-growing particle system. Such an implementation can render up to 1 million particles in real-time on recent hardware. The massively parallel simulation handles collision detection and reaction of particles with objects for arbitrary shape. The collision detection is based on depth maps that represent the outer shape of an object. The depth maps store distance values and normal vectors for collision reaction. Using a special texture-based indexing technique to represent normal vectors, standard 8-bit textures can be used to describe the complete depth map data. Alternately, several depth maps can be stored in one floating point texture.In addition, a GPU-based parallel sorting algorithm is introduced that can be used to perform a depth sorting of the particles for correct alpha blending.
Increasing design space of the instruction queue with tag coding
Authors: Junwei Zhou, Andrew Mason
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The instruction queue is a critical component and performance bottleneck in superscalar microprocessors. Conventional designs use physical register identifiers to wake up instructions. This paper proposes decoupling the tags for instruction wakeup from the tags for physical register access, thus increasing the design space of the instruction queue by encoding its operand tags. Two coding methods have been developed. One uses a linear code to increase the Hamming distance between tags, reducing the tag match delay by more than 50% and achieving 12% improvement in the total wakeup/select delay for TSMC 0.18mm technology at 1.8v. The second method uses one-hot code to encode the operand tag, removing the tag OR and tag read operations from the wakeup/select loop. For a 32-entry instruction queue, 15% reduction in the wakeup/select loop has been achieved. Furthermore, one-hot code also removes the dissipation-on-mismatch in the wakeup logic, significantly reducing the dynamic power consumption of the instruction queue.
Microprogrammed interval arithmetic
Authors: R. E. Moore
Venue: ACM SIGNUM Newsletter (1980)

Computational methods using interval arithmetic allow the computer to provide rigorous error bounds along with approximate solutions for a wide and growing class of computational problems. A recent survey [1] lists over 700 references. The implementation of interval arithmetic using subroutine calls is inefficient - typically 10 to 100 times slower than floating-point arithmetic [2]. By microprogramming interval arithmetic, we can reduce this factor to around 2. This can be done by a user who has a machine with a writable control store or, better still, by a manufacturer into the read-only control store.
Confidence measure and rejection based on correctness probability of recognition candidates
Authors: Norihide Kitaoka, Ichiro Akahori, Seiichi Nakagawa
Venue: Systems and Computers in Japan (2004)

We propose a confidence measure expressing the correctness probability of recognition candidates, to be applied to a speech dialog system using a dialog strategy based on the degree of confidence of speech recognition candidates. We assume a function expressing the correctness probability of the feature parameters associated with the recognition candidate, and its parameters are estimated by using the square error of the correct (1) and incorrect (0) data as the evaluation function. For two feature quantities, namely, the likelihood ratio of the recognized word and syllable-concatenated model, and the variance of the syllable duration inside a word, the correctness probability can be expressed by a sigmoid function. The correctness probability can also be expressed for a combination of these two feature parameters. Rejection experiments involving evaluation of the degree of discrimination between the correct and incorrect data show that the degree of discrimination is higher when the two feature parameters are combined than when they are used individually. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 91&ndash;103, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20046
Time-Varying Competition
Authors: K. Sudhir, Pradeep K. Chintagunta, Vrinda Kadiyali
Venue: Marketing Science (2005)

Normative models typically suggest that prices rise in periods of high demand and cost. However, in many markets, prices fall when demand or costs rise. This inconsistency occurs because the normative models assume that competitive intensity does not change with demand and cost conditions over time. We therefore introduce the notion oftime-varying competition by suggesting that it is important not only to account for thedirect effect of demand and cost on prices (e.g., higher demand means higher prices), but also theindirect effect of demand and cost changes on competition (e.g., higher demand could cause more competition and, hence, lower prices).We develop a general, unified framework to empirically model the direct and indirect effects of demand and cost shifts on pricing in differentiated product markets. Our approach allows us to measure the indirect effect of multiple demand and cost drivers on competitive intensity and test predictions from alternative theories of repeated games. The empirical application is to the U.S. photographic film industry, where there are two main players, Kodak and Fuji.We find that the indirect effects are highly significant and comparable in magnitude to the direct effects. Competitive intensity is greater in periods of high demand and lower cost and is moderated by whether demand or costs are expected to grow or decline. Interestingly, we find asymmetries in the competitive responses of Kodak and Fuji. While Kodak is sensitive to demand factors, Fuji is sensitive to costs. Our results suggest that market characteristics such as observability of competitor prices can be an important determinant of how competitive intensity is affected by demand and cost conditions.
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
Venue: Networks (2004)

We study the problem of computing minimum-cost paths through a time-varying network, in which the travel time and travel cost of each arc are known functions of one's departure time along the arc. For some problem instances, the ability to wait at nodes may allow for less costly paths through the network. When waiting is allowed, it is constrained by a &lpar;potentially time-varying&rpar; waiting policy that describes the length of time one may wait and the cost of waiting at every node. In discrete time, time-dependent shortest path problems with waiting constraints can be optimally solved by straightforward dynamic programming algorithms; however, for some waiting policies these algorithms can be computationally impractical. In this article, we survey several broad classes of waiting policies and show how techniques for speeding up dynamic programming can be effectively applied to obtain practical algorithms for these different problem variants. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;1&rpar;, 41&ndash;46 2004
Gridjam
Authors: Jack Ox
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In this paper Ox will continue the story of the 21st Century Virtual Color Organ™. At C&C4 (2002)[7] she told of the performance of Clarence Barlow's "Im Januar am Nil" and also the early concept of "Gridjam". She showed an early model of one of the Gridjam sounds which had been created at Loughborough University. This paper will trace the development of the project through the last two years of both the music and the visualized sounds.