ppxscal/embedding_network huggingface dataset:
A Shape Representation for Planar Curves by Shape Signature Harmonic Embedding
Authors: Sang-Mook Lee, A. Lynn Abbott, Neil A. Clark, Philip A. Araman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely dependent on specified boundary values and can be obtained from Poisson's integral formula. We derive a discrete version of Poisson's formula and assess its harmonic properties. Various shape signatures can be used as boundary values, whereas only the corresponding Fourier descriptors are needed for the framework. The proposed approach is similar to a scale space representation but exhibits greater generality by accommodating using any type of shape signature. In addition, it is robust to noise and computationally efficient, and it is guaranteed to have a unique solution. In this paper, we demonstrate that the approach has strong potential for shape representation and matching applications.
Alarm Implementation of a HMI(Human Machine Interface) for a Proton Linear Accelerator
Authors: HyunMi Choi, YoungGi Song, InSeok Hong, YongSub Cho
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

The control system of the PEFP proton linear accelerator has to read and write thousands of signals. A large science facility such as a PEFP Accelerator has to be secure, accurate, rapid and easily expandable. We need to find a way to design a consistent control system that satisfies the above requirements. We conclude that EPICS is a suitable tool which can be used to develop a control system for an accelerator device. The vacuum control system of the Proton Linear Accelerator periodically displays the status of the system to check the vacuum device in a real time to establish whether it monitors the vacuum data normally or not. This control system uses a database record which contains its current alarm status and the corresponding severity for a status. In this paper, the vacuum control system of the PEFP is summarized and the development of an alarm module is presented.
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
Authors: David A. Bryan, Bruce B. Lowekamp, Cullen Jennings
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

Voice over IP (VoIP) and Instant Messaging (IM) systems to date have either followed a client-server model or have required the use of clients that do not follow any VoIP or IM standard. We present SOSIMPLEa fully decentralized, P2P, standards-based approach to communications. By building on the existing SIP/SIMPLE infrastructure for VoIP and IM, we support reuse of clients, network infrastructure, and open-source protocol stacks designed using current standards. By avoiding traditional centralized architectures, SOSIMPLE addresses corporate privacy concerns, eliminates dependency on constant Internet connectivity, and supports ad hoc groups. SOSIMPLE implements a DHT overlay based on Chord[24] using SIP messages, replicating location information for reliability. The DHT is used only for lookups, with actual communication passing directly between clients. We discuss important issues for security and authentication, as well as adaptations of conventional P2P routing for the social networks typical of personal communications. We are testing a prototype implementation of SOSIMPLE and anticipate a public release in the near future.
Discrete event simulation in supply chain planing and inventory control at Freescale Semiconductor, Inc.
Authors: Douglas J. Morrice, Richard A. Valdez, Jack P. Chida,  Jr., Missan Eido
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The supply chain of Freescale Semiconductor from fabrication through final test and delivery was modeled and analyzed using discrete event simulation in Arena. Freescale starts products in manufacturing based on a make-to-order and make-to-stock master production schedule. Since customer lead time is often less than the supply chain cycle time, Freescale maintains strategic safety stock throughout the supply chain and as finished goods inventory. Manufacturing entry rate is determined by the amount of product in WIP and inventory. Our analysis concentrates on the relationship between on-time delivery in the major supply chain segments and on-time delivery to the customer in an environment of significant inventory and WIP level changes. The goal is to predict the effect of internal on-time delivery, inventory and WIP changes on the customer order fulfillment service level. In our analysis, we evaluate supply chain production and inventory control policies and the impact of lead time reductions.
Applying the various optimal solution search methods to multiple sequence alignments and performance evaluation
Authors: Makoto Koshino, Hiroaki Murata, Masatoshi Shirayama, Haruhiko Kimura
Venue: Systems and Computers in Japan (2006)

In this paper, we applied various optimal solution search methods from the field of artificial intelligence to multiple sequence alignment, which is a basic problem of sequence analysis in the field of bioinformatics, to conduct performance evaluation experiments. The techniques applied were A&ast;, Enhanced A&ast;, Iterative Deepening A&ast; (IDA &ast;), Recursive Best First Search (RBFS), MREC, and Partial Expansion A&ast; (PEA &ast;). Although MREC had been considered ineffective for the 15-puzzle since it could only reduce the number of states by a mere 1&percnt; compared with A&ast; (IDA &ast;), the results of the performance evaluation experiments showed that extension factor (EF-1&alpha;) multiple sequence alignment, which could previously be solved for only up to 8 sequences, could be solved successfully by MREC for up to 11 sequences, and that MREC could be executed quickly and with little memory. Experimental results using the Benchmark Alignment dataBASE (BAliBASE) show that MREC obtained the optimal solution the fastest and using the least amount of memory among the currently available techniques. &copy; 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(11): 1&ndash;10, 2006; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20519
Quality-of-Control Management in Overloaded Real-Time Systems
Authors: Giorgio Buttazzo, Manel Velasco, Pau Marti
Venue: IEEE Transactions on Computers (2007)

Transient overload conditions may cause unpredictable performance degradations in computer controlled systems if not properly handled. To prevent such problems, a common technique adopted in periodic task systems is to reduce the workload by enlarging activation periods. In a digital controller, however, the variation applied on the task period also affects the control law, which needs to be recomputed for the new activation rate. If computing a new control law requires too much time to be performed at runtime, a set of controllers has to be designed offline for different rates and the system has to switch to the proper controller in the presence of an overload condition. In this paper, we present a method for reducing the number of controllers to be designed offline, while still guaranteeing a given control performance. The proposed approach has been integrated with the elastic scheduling theory to promptly react to overload conditions. The effectiveness of the proposed approach has been verified through extensive simulation experiments performed on an inverted pendulum. In addition, the method has been implemented on a real inverted pendulum. Experimental results and implementation issues are reported and discussed.
Optimal neuronal tuning for finite stimulus spaces
Authors: W. Michael Brown, Alex Bäcker
Venue: Neural Computation (2006)

The efficiency of neuronal encoding in sensory and motor systems has been proposed as a first principle governing response properties within the central nervous system. We present a continuation of a theoretical study presented by Zhang and Sejnowski, where the influence of neuronal tuning properties on encoding accuracy is analyzed using information theory. When a finite stimulus space is considered, we show that the encoding accuracy improves with narrow tuning for one-and two-dimensional stimuli. For three dimensions and higher, there is an optimal tuning width.
A dynamic-sized nonblocking work stealing deque
Authors: Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit
Venue: Distributed Computing (2006)

The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (hencheforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of choice in both industry and academia. This highly efficient scheme is based on a collection of array-based double-ended queues (deques) with low cost synchronization among local and stealing processes. Unfortunately, the algorithm's synchronization protocol is strongly based on the use of fixed size arrays, which are prone to overflows, especially in the multiprogrammed environments for which they are designed. This is a significant drawback since, apart from memory inefficiency, it means that the size of the deque must be tailored to accommodate the effects of the hard-to-predict level of multiprogramming, and the implementation must include an expensive and application-specific overflow mechanism.This paper presents the first dynamic memory work-stealing algorithm. It is based on a novel way of building non-blocking dynamic-sized work stealing deques by detecting synchronization conflicts based on "pointer-crossing" rather than "gaps between indexes" as in the original ABP algorithm. As we show, the new algorithm dramatically increases robustness and memory efficiency, while causing applications no observable performance penalty. We therefore believe it can replace array-based ABP work stealing deques, eliminating the need for application-specific overflow mechanisms.
Army-Backed Flexible Display Effort: A Symbol of Public-Private Partnership
Authors: Greg Goth
Venue: IEEE Pervasive Computing (2006)

The promise of pervasive military networks featuring devices issued to each soldier or sailor has circulated for some time. These individuals would have rugged, lightweight displays that roll or fold up that they could use to access crucial and perhaps life-saving information in real time. Contributing to an interesting "big picture" for this technology, the defense sector along with academic research and manufacturing interests have collaborated comprehensively to establish a viable mass-market foundation for flexible displays. Drawing on decades of experience in which military users have broken in new technology, the US government and industry consortia have invested in facilities to provide the Army with flexible display prototypes while also developing key manufacturing processes that will make flexible displays commercially viable.
Science in the Developing World: Running Twice as Fast?
Authors: Leonardo C. Ribeiro, Ricardo M. Ruiz, Eduardo M. Albuquerque, Americo T. Bernardes
Venue: Computing in Science and Engineering (2006)

Physicists are increasingly interested in studying the behavior of financial markets; likewise, researchers have applied statistical physics tools to study economic development in--and interactions among--various countries. We recently introduced a model that creates an artificial world economy of countries, each of which has a population with scientific and technological capabilities. The model's main goal is to probe the underlying mechanisms responsible for the interactions among science, technology, and development. So far, it has shown a strong correlation between economic development and scientific and technological production.
A CoMFA study of COX-2 inhibitors with receptor based alignment
Authors: Prasanna A. Datar, Evans C. Coutinho
Venue: Journal of Molecular Graphics (2004)

A diverse set of 53 cyclooxygenase-2 (COX-2) inhibitors which were aligned in two different ways were subjected to CoMFA analysis. The first method of alignment of the molecules was based on the binding information sourced from the crystallographic study, from which CoMFA Model 1 was derived. The second mode of alignment was generated by docking the inhibitors in the binding pocket using the DOCK and AFFINITY suite of programs; this gave a second model. The CoMFA Model 2 was slightly better than Model 1 in terms of the statistical parameters r2 and q2. The two models could predict very well the activity of a test set of diverse molecules, with a predictive r2 of 0.593 and 0.768, respectively. Besides the QSAR results, the docking studies give a deep insight into the H-bonding interactions between the inhibitors and residues in the active site of the enzyme, which can be exploited in designing better inhibitors. Useful ideas on activity improvement could be gleaned from these models.
Discovering significant rules
Authors: Geoffrey I. Webb
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed that seek to avoid false discoveries. However, while all provide useful solutions to aspects of this problem, none provides a generic solution that is both flexible enough to accommodate varying definitions of true and false discoveries and powerful enough to provide strict control over the risk of false discoveries. This paper presents generic techniques that allow definitions of true and false discoveries to be specified in terms of arbitrary statistical hypothesis tests and which provide strict control over the experiment wise risk of false discoveries.
User-level transactional programming in Haskell
Authors: Peter Thiemann
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Correct handling of concurrently accessed external resources is a demanding problem in programming. The standard approaches rely on database transactions or concurrency mechanisms like locks. The paper considers two such resources, global variables and databases, and defines transactional APIs for them in Haskell. The APIs provide a novel flavor of user-level transactions which are particularly suitable in the context of web-based systems. This suitability is demonstrated by providing a second implementation in the context of WASH, a Haskell-based Web programming system. The underlying implementation framework works for both kinds of resources and can serve as a blueprint for further implementations of user-level transactions. The Haskell type system provides an encapsulation of the transactional scope that avoids unintended breakage of the transactional guarantees.
Capturing and Using the Operational Semantics of Large Distributed Systems: Sharing Common Application Requirements in Virtual Organisations
Authors: Nickolas J. G. Falkner, Paul D. Coddington, Andrew L. Wendelborn
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Organisations may wish to use a standards-defined distributed system in a global sense but also have a requirement for non-standard local behaviour. This reflects the production of, and desire to use, organisational knowledge developed over time. The efficient and effective management of this knowledge can be a deciding factor in an organisation's success or failure. Virtual organisations, where members share a problem-solving purpose rather than a location-based or formal organisation, have no formal bodies to manage change requests and may be restricted in how they can apply their knowledge. These organisations are also the most likely to seek divergent local behaviour since their locale is formed by the members' desire to solve a particular problem and this problem-based approach may lead to user requirements that exist only in that virtual organisation. We describe a method for capturing and representing operational semantics so that global and local behaviour can co-exist without leading to operational impairment in either sphere. The approach applies to virtual and traditional organisations equally well as both entities can use it to integrate their local knowledge and requirements into a much larger framework and, potentially, share these with their collaborators. We illustrate our approach with reference to our implementation of an ontologically enhanced Domain Name System (DNS) server.
A Grid Service for Pattern Extraction from Mass Spectrometry Data
Authors: Mario Cannataro, Pierangelo Veltri
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The paper presents a Grid Service allowing to detect and extract the longest common sub-spectrum among a set of mass spectrometry spectra data. The service is based on a novel pattern extraction algorithm named LCSS (Longest Common Spectra SubString) that adapts a very popular string matching technique based on Suffix Trees to spectra data. The core of the algorithm and a first performance evaluation of the related Grid Service are discussed.
Neural Systems for Visual Orienting and Their Relationships to Spatial Working Memory
Authors: Maurizio Corbetta, J. Michelle Kincade, Gordon L. Shulman
Venue: Journal of Cognitive Neuroscience (2002)

We investigated neural correlates of human visual orienting using event-related functional magnetic resonance imaging (fMRI). When subjects voluntarily directed attention to a peripheral location, we recorded robust and sustained signals uniquely from the intraparietal sulcus (IPs) and superior frontal cortex (near the frontal eye field, FEF). In the ventral IPs and FEF only, the blood oxygen level dependent signal was modulated by the direction of attention. The IPs and FEF also maintained the most sustained level of activation during a 7-sec delay, when subjects maintained attention at the peripheral cued location (working memory). Therefore, the IPs and FEF form a dorsal network that controls the endogenous allocation and maintenance of visuospatial attention. A separate right hemisphere network was activated by the detection of targets at unattended locations. Activation was largely independent of the target's location (visual field). This network included among other regions the right temporo-parietal junction and the inferior frontal gyrus. We propose that this cortical network is important for reorienting to sensory events.
Simulation-based optimization using simulated annealing with confidence interval
Authors: Talal M. Alkhamis, Mohamed A. Ahmed
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be evaluated only through Monte Carlo simulations. In the proposed variant of SA, the Metropolis criterion depends on whether the objective function values indicate statistically significant difference at each iteration. The differences between objective function values are considered to be statistically significant based on confidence intervals associated with these values. Unlike the original SA, our method uses a constant temperature. We show that the configuration that has been visited most often in the first m iterations converges almost surely to a global optimizer.
Measures of international collaboration in scientific literature: part I
Authors: Abraham Bookstein, Henk Moed, Moshe Yitzahki
Venue: Information Processing and Management: an International Journal (2006)

Research evaluating models of scientific productivity require coherent metrics that quantify various key relations among papers as revealed by patterns of citation. This paper focuses on the various conceptual problems inherent in measuring the degree to which papers tend to cite other papers written by authors of the same nationality. We suggest that measures can be given a degree of assurance of coherence by being based on mathematical models describing the citation process. A number of such models are developed.
A Real-Time Study of 802.11b and 802.11g
Authors: Victor Clincy, Ajay Sitaram, David Odaibo, Garima Sogarwal
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In recent past, there has been a tremendous increase in the study and implementation of wireless technologies. The idea of wireless networks started with the 802.11 standards that soon became popular with the wireless LAN, called Wi-Fi. The increase usage of Wi- Fi-enabled laptops, PDA's and other devices is a clear indicator of Wi-Fi's widespread acceptance. Wi-Fi is a conglomeration of standards, out of which the three main standards are 802.11b, 802.11a and 802.11g. Two of the standards, 802.11b and 802.11g, have interoperable characteristics; while the other, 802.11a, operates on a completely different frequency and hence lacks such interoperability. The objective of this paper is to study the performance of 802.11b and 802.11g standards in real-time while implementing an actual file transfer. The specific performance factors studied were protocol congestion, bandwidth and latency.
Some recent advances in the process world view
Authors: Robert G. Sargent
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We discuss a modification of the process world view, a graphical modeling representation language for the modified process world view called Control Flow Graphs (CFGs), an extension to CFGs called Hierarchical Control Flow Graph (HCFG) Models, and a simulation system that uses HCFG Models called HiMASS.
A Logistics Service Differentiation Decision Model Based on Service Level
Authors: Juan Xu, Zhixue Liu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper sets up a decision-made process model of logistics service differentiation based on market segments and customer demands analysis and elaborates the design of logistics service differentiation and the total cost service analysis. Especially, this paper provides a method of cost-service tradeoffs through the determination of the lowest demand quantity, which is determined by the quota relations among the income, the unit logistics cost and the demand quantity on a certain service level.
Analysis and enhancement of planning and scheduling applications in a distributed simulation testbed
Authors: Nirupam Julka, Peter Lendermann, Chin Soon Chong, Long-Foong "Mike" Liow
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Planning and scheduling applications and operations simulation models jointly represent the manufacturing activities of an enterprise. This paper relates to a framework that enables integration of both into a unified model and allows improvement of their performance with discrete event simulation (DES) technology. The High Level Architecture, which is the IEEE standard for interoperability of simulations, forms the backbone of this framework in which business applications can be re-used with operations simulation models to generate an integrated simulation model. This enables a company to optimise not only operational processes such as shop floor or warehouse operations but also business processes such as planning, order management and scheduling through simulation using the same software infrastructure. A case study to demonstrate the feasibility of this framework is included and ongoing work on implementation of this framework in an industrial environment is presented.