ppxscal/embedding_network huggingface dataset:
The MODEL/IMAGES2 system: an application of computer graphics and three-dimensional geometric modeling to the jet impingement problem
Authors: W. R. Winfrey, S. R. Ricketts
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The design of a nuclear power plant requires the consideration of many abnormal conditions, including the effects of a fluid jet emerging from a postulated break in a high-pressure pipe and striking other plant components. This paper describes the computer graphics and three-dimensional modeling system, MODEL/IMAGES2, which has been used successfully to automate the solution of the jet impingement problem. The MODEL program is used to construct the targets, using modeling techniques such as stacking of graphic primitives, set operations, and coordinate operations. The IMAGES2 program constructs a model of the fluid jet, determines the target struck, and computes the impinged areas. The MODEL/IMAGES2 system has reduced the man-hours required for analysis and improved the accuracy and reliability of the results.
Note: Restricted set addition: The exceptional case of the Erdős--Heilbronn conjecture
Authors: Gyula Károlyi
Venue: Journal of Combinatorial Theory Series A (2009)

Let A=|A|+|B|-2, then at least |A|+|B|-2 different residue classes can be represented as a+b, where a@?A, b@?B and a
Using hierarchies to support non-visual access to relational diagrams
Authors: Oussama Metatla, Nick Bryan-Kinns, Tony Stockman
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

This paper describes an approach to support non-visual exploration of graphically represented information. We used a hierarchical structure to organize the information encoded in a relational diagram and designed two alternative audio-only interfaces for presenting the hierarchy, each employing different levels of verbosity. We report on an experimental study that assessed the viability of our proposed approach as well as the efficiency and learnability of each interface. Our results show that the relational information encoded in a diagram could be non-visually navigated and explored through a hierarchy, and that substituting verbal descriptions of parts of such information with nonverbal sounds significantly improve performance without compromising comprehension.
Numerical algorithms for parallel computers
Authors: David K. Stevenson
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Numerical methods are generally judged on their ability to produce a reasonably accurate answer in a reasonable amount of time. This paper deals with the latter criterion in the context of non-standard architectures---namely vector and array processors. These architectures owe their very existence to the demands for more computing power than is available on conventional, sequential computers, so speed and efficiency are especially relevant in this area.
Simulation-based, optimized scheduling of limited bar-benders over multiple building sites
Authors: Hoi-Ching Lam, Ming Lu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In the construction industry, a specialist subcontractor manages a taskforce of single-skilled laborers to work on multiple construction sites, aiming to minimize the total cost and stay profitable and competitive. This paper presents a simulation-based approach to assist the subcontractor in scheduling the application of limited laborer resources to handle jobs over multiple concurring sites. Factoring in technological constraints, repetitive building cycles, alternative method options, and the limited quantity of skilled laborers, we resort to computer power (including simulation and optimization algorithms resulting from recent research) in search of the best combination of construction methods at individual sites along with the optimum size of labor force, aimed to find the least cost for completing the jobs at all sites. A case study of bar-bender scheduling over three sites by use of an in-house computer tool results in the optimum method combinations, the optimum crew size, and the optimum resource schedule.
Reliability mathematics analysis on traction substation operation
Authors: Hongsheng Su
Venue: WSEAS Transactions on Mathematics (2008)

In electrified railway traction power supply systems, the operational qualities and reliabilities of the main traction transformer loop is higher, but ones of bus output units is comparatively low. The traction transformer loop still works when output loops are in failure, and the output loop interrupts working when the main transformer is in failure, and only has residual life when restoring working, the connection formation between them is in series. Traditional reliability analysis methods let their lifetime follow exponential distribution, and reliability is investigated based on the minimal path sets, which lead to a comparatively rough result, consequently. According to Markov theory, in this paper the main loop life is considered as mixed Erlang distribution with order n, and the output unit life follows generic distribution. As compared with conventional series systems, the acquired results are proved to be reliable and sound.
A Continuous d-Step Conjecture for Polytopes
Authors: Antoine Deza, Tam&#x00e1;s Terlaky, Yuriy Zinchenko
Venue: Discrete Computational Geometry (2009)

The curvature of a polytope, defined as the largest possible total curvature of the associated central path, can be regarded as a continuous analogue of its diameter. We prove an analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytopes defined by 2d inequalities and for all d, then the order of the curvature is less that the number of inequalities for all polytopes.
TYPO3 Extension Development: Developer's guide to creating feature rich extensions using the TYPO3 API
Authors: Dmitry Dulepov
Venue:  (2008)

This is the first book in English to cover TYPO3 extension development in detail. The author is a member of the TYPO3 core team and developer of many popular TYPO3 extensions. Both novice and experienced TYPO3 programmers can use this book to build the extension they need, following best practices, and saving a lot of time that would otherwise have been spent pouring though the documentation. This book is for PHP developers who want to develop a TYPO3 extension. It assumes the reader has experience with PHP, XML, and HTML. No prior knowledge about TYPO3 extension programming or the TYPO3 API is presumed.
Support vector classification of proteomic profile spectra based on feature extraction with the bi-orthogonal discrete wavelet transform
Authors: Frank-Michael Schleif, Mathias Lindemann, Mario Diaz, Peter Maa&#x00df;, Jens Decker, Thomas Elssner, Michael Kuhn, Herbert Thiele
Venue: Computing and Visualization in Science (2009)

Automatic classification of high-resolution mass spectrometry data has increasing potential to support physicians in diagnosis of diseases like cancer. The proteomic data exhibit variations among different disease states. A precise and reliable classification of mass spectra is essential for a successful diagnosis and treatment. The underlying process to obtain such reliable classification results is a crucial point. In this paper such a method is explained and a corresponding semi automatic parameterization procedure is derived. Thereby a simple straightforward classification procedure to assign mass spectra to a particular disease state is derived. The method is based on an initial preprocessing stage of the whole set of spectra followed by the bi-orthogonal discrete wavelet transform (DWT) for feature extraction. The approximation coefficients calculated from the scaling function exhibit a high peak pattern matching property and feature a denoising of the spectrum. The discriminating coefficients, selected by the Kolmogorov&#x2013;Smirnov test are finally used as features for training and testing a support vector machine with both a linear and a radial basis kernel. For comparison the peak areas obtained with the it ClinProt-System 1 [33] were analyzed using the same support vector machines. The introduced approach was evaluated on clinical MALDI-MS data sets with two classes each originating from cancer studies. The cross validated error rates using the wavelet coefficients where better than those obtained from the peak areas2.
MotionCast: on the capacity and delay tradeoffs
Authors: Chenhui Hu, Xinbing Wang, Feng Wu
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according to an independently and identically distributed (i.i.d.) pattern and each desires to send packets to k distinctive destinations, we compare the capacity and delay in two transmission protocols: one uses 2-hop relay algorithm without redundancy, the other adopts the scheme of redundant packets transmissions to improve delay while at the expense of the capacity. In addition, we obtain the maximum capacity and the minimum delay under certain constraints. We find that the per-node capacity and delay for 2-hop algorithm without redundancy are Θ(1/k) and Θ(nlog k), respectively; and for 2-hop algorithm with redundancy they are Ω(1/(k√nlog k)) and Θ(√nlog k), respectively. The capacity of the 2-hop relay algorithm without redundancy is better than the multicast capacity of static networks developed in [3] as long as k is strictly less than n in an order sense; while when k=Θ(n), mobility does not increase capacity anymore. The ratio between delay and capacity satisfies delay/rate ≥ O(nklog k) for these two protocols, which is smaller than that of directly extending the fundamental tradeoff for unicast established in [1] to multicast, i.e., O(nk2).
SPECjvm2008 Performance Characterization
Authors: Kumar Shiv, Kingsum Chow, Yanping Wang, Dmitry Petrochenko
Venue: Proceedings of the 2009 SPEC Benchmark Workshop on Computer Performance Evaluation and Benchmarking (2009)

SPECjvm2008 is a new multi-threaded Java benchmark from SPEC and it replaces the aging single threaded SPECjvm98. The benchmark is intended to address several shortcomings of the earlier workloads in SPECjvm98 by replacing DB, Chart, Javac; removing Jess, adding XML, Serial, Crypto, in-cache and out-cache versions of Scimark workloads. It is targeted for measuring the performance of both JVM and hardware systems. In this paper we describe the salient features of SPECjvm2008. We then take a first look at the performance of this benchmark on current multi-core platforms and study the sensitivity of the components of the workload to basic architectural aspects such as the number of processor cores, the processor frequency, cache and memory sub-system. We focus our study on understanding how the behavior of this workload compares with other standard Java benchmarks, SPECjbb2005 and SPECjAppServer2004, both in components of the software stack that the workloads touch as well as in the aspects of the platform that they exercise and draw conclusion on the usefulness of SPECjvm2008 for practitioners of JVM and hardware performance analysis.
Design of Intelligent Traffic Light Controller Based on VHDL
Authors: Shi Shuo, Hongli Tian, Yandong Zhai
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

According to the different branches of city’s intersections and the traffic flow at different times, the program of intelligent traffic light controller based on VHDL is given and simulated by QuartusⅡ by using hierarchical design thought. The simulation results show that the intelligent traffic light controller can realize the transition of 2-phase, 3-phase and 4-phase based on actual situations. The adaptability and applicability of the system can be strengthened by changing the phase.
Dispersion effects in active mode-locked fiber lasers
Authors: Huy Quoc Lam, Y. D. Gong, P. Shum, Songnian Fu, Le Nguyen Binh, Ming Tang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we present a detailed study on the dispersion effects in active mode-locked fiber lasers. By including fiber dispersion effect in a laser model, we find that the dispersion causes the pulse broadened and chirped. Moreover, not only the pulse position but also the lasing spectrum is shifted when the modulation frequency is detuned in dispersion cavity active mode-locked fiber lasers. The shifting of the spectrum towards faster/slower wavelength compensates for the delay/advance of the pulse when detuning and thus increases the locking range of the laser. This result can be applied to improve the stability of the laser against environmental perturbation.
Caching content-based queries for robust and efficient image retrieval
Authors: Fabrizio Falchi, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fausto Rabitti
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency issues. In this paper we investigate the possibility of caching the answers to content-based image retrieval queries in metric space, with the aim of reducing the average cost of query processing, and boosting the overall system throughput. Our proposal exploits the similarity between the query object and the cache content, and allows the cache to return approximate answers with acceptable quality guarantee even if the query processed has never been encountered in the past. Moreover, since popular images that are likely to be used as query have several near-duplicate versions, we show that our caching algorithm is robust, and does not suffer of cache pollution problems due to near-duplicate query objects. We report on very promising results obtained with a collection of one million high-quality digital photos. We show that it is worth pursuing caching strategies also in similarity search systems, since the proposed caching techniques can have a significant impact on performance, like caching on text queries has been proven effective for traditional Web search engines.
Going with the flow: parameterized verification using message flows
Authors: Murali Talupur, Mark R. Tuttle
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

A message flow is a sequence of messages sent among processors during the execution of a protocol, usually illustrated with something like a message sequence chart. Protocol designers use message flows to describe and reason about their protocols. We show how to derive high-quality invariants from message flows and use these invariants to accelerate a state-of-the-art method for parameterized protocol verification called the CMP method. The CMP method works by iteratively strengthening and abstracting a protocol. The labor-intensive portion of the method is finding the protocol invariants needed for each iteration. We provide a new analysis of the CMP method proving it works with any sound abstraction procedure. This facilitates the use of a new abstraction procedure tailored to our protocol invariants in the CMP method. Our experience is that message-flow derived invariants get to the heart of protocol correctness in the sense that only couple of additional invariants are needed for the CMP method to converge.
In-situ Quantification of 3D Scene Complexity
Authors: Ioan Marius Bilasco, Rafael Lozano Espinosa, Hervé Martin
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

This work explores the quantification of the complexity of 3D scenes using frame rate evaluation. Viewpoints are dynamically generated and binded to the target scene in order to reproduce real user actions inside the scene. The SAI technology is used in order to record the observed frame rate. Several evaluation patterns are considered: examine an object, look at the center of the scene, look around a given point. This kind of information is very important because it shows 3D authors, if a specific 3D scene can be played adequately or not for a range of browsers. Indeed, this measure could be used to indicate whether adaptation techniques are to be considered before deploying a scene in a specific context. Authors can also yield interesting results for the designers. Low framerates and hence high complexity in regions that lack of interest for target users imply possible design faults.
Sacred imagery in techno-spiritual design
Authors: Susan P. Wyche, Kelly E. Caine, Benjamin K. Davison, Shwetak N. Patel, Michael Arteaga, Rebecca E. Grinter
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Despite increased knowledge about how Information and Communications Technologies (ICTs) are used to support religious and spiritual practices, designers know little about how to design technologies for faith-related purposes. Our research suggests incorporating sacred imagery into techno-spiritual applications can be useful in guiding development. We illustrate this through the design and evaluation of a mobile phone application developed to support Islamic prayer practices. Our contribution is to show how religious imagery can be used in the design of applications that go beyond the provision of functionality to connect people to the experience of religion.
Equivalent circuit of an aperture coupled patch antenna for beam control applications
Authors: Naima Amar Touhami, Lorena Cabria de Juan, José Ángel García García, Constantino Pérez Vega, Antonio Tazón Puente, Mohamed Boussouis
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

An exhaustive study of different equivalent circuits of an aperture coupled patch permits to develop a suitable circuit model. The vast majority of these models are able to reproduce the antenna behaviour around the first resonance frequency, but the proposed equivalent circuit is also capable of duplicating the radiator input impedance in the two next harmonics. Over such model, one approach has been carried out for beamsteering purposes: a Left-Handed (LH) structure has been introduced at the patch input to obtain two variable operating bands. The agreement shown in the results obtained using the proposed circuit structure, electromagnetic simulations and experimental measurements validates the model.
Striping for Interactive Video: Is it Worth it?
Authors: Martin Reisslein, Keith W. Ross, Subin Shrestha
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We study the design of interactive video servers that store videos on disk arrays. In order to avoid the hot--spot problem in video servers it is conventional wisdom to stripe the videos over the disk array using Fine Grained Striping or Coarse Grained Striping techniques. Striping, however, increases the seek and rotational overhead, thereby reducing the throughput of the disk array.Our results indicate that the decrease in throughput is substantial when interactive delays are constrained to be less than 1 second. We show that both a high degree of interactivity and high throughput are achieved by using a narrow striping width and replicating the videos according to the users' request pattern. Specifically, we find that striping over two disks gives the highest throughput when a tight 1 second constraint on interactive delays is imposed.We also demonstrate that localized placement (i.e., no striping at all) performs nearly as well when a good estimate of the user request pattern is available.
RT database for visualization of windows PLC RT process control by the REX control system
Authors: Ondrej Krejcar, Jindrich Cernohorsky, Petr Konarik, Robert Frischer
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Paper deals with industrial realization of feedback control of demanding applications on their control, control algorithms and visualization via RT database together with design, implementation and real time control from MATLAB/Simulink Environment. Paper shows direct connection and implementation way of designed control schemas of prepared applications to an industrial WinPLC. Described is a way to produce a permanent solution in control applications that are fully prepared, designed and implemented directly from MATLAB/Simulink to the target control platform. As a part, the mentioned solution is using a multiplatform control system REX as a bridge between MATLAB and target platforms. These methods allow minimizing costs of development of control of applications, because it produces target permanent realizations in comparison to classical development methods that usually need expensive real time measurement cards and produce only one purpose development solution. As next benefit the application is created for visualization the data from RT database during the measurement and control process. This last benefit produce an interesting data from real control process to give a next reason to use of WinCon solution.
Path layout on tree networks: bounds in different label switching models
Authors: Anat Bremler-Barr, Leah Epstein
Venue: Nordic Journal of Computing (2007)

Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new label switching protocol standardized recently by the IETF. Path layout is essentially the problem of reducing the size of the label table in a router. The size is equivalent to the number of different paths that pass through the router, or start from it. A reduction in the size can be achieved by choosing a relatively small number of paths, from which a larger set is composed using concatenation. In this paper we deal with three variants of the Path Layout Problem according to the special characteristics of paths in three label switching protocols, MPLS, ATM and TRAINET. We focus on tree networks, and show an algorithm which finds label tables of small size, while permitting concatenation of at most k paths. We prove that this algorithm gives worst case tight bounds (up to constant factor) for all three models. The bounds are given as a function of the size of the tree, and the maximum degree.