ppxscal/embedding_network huggingface dataset:
Reduction rules for YAWL workflows with cancellation regions and OR-joins
Authors: M. T. Wynn, H. M. W. Verbeek, W. M. P. van der Aalst, A. H. M. ter Hofstede, D. Edmond
Venue: Information and Software Technology (2009)

As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.
SIMO: An adaptable simulation framework for multiscale forest resource data
Authors: Jussi Rasinmäki, Antti Mäkinen, Jouni Kalliovirta
Venue: Computers and Electronics in Agriculture (2009)

Forest management planning is facing new objectives and diversified data sources. To succeed in the new context, a forest management planning framework should support integration of the new goals, knowledge, and technology as well as embrace multiple scales. The aim of the SIMO framework is to develop a hierarchical, extendable simulation and optimization framework for forest management planning. Current implementation includes a forest growth and yield simulator which is adaptable with respect to the components of a simulation; data, growth and operation models that modify the data, and the control structures between the data and the models. The simulation framework components implemented in XML include the hierarchical structures for data and simulation descriptions, and an extendable model base. To achieve flexibility and reusability, the components are connected through a common ontology, again defined in XML. The article includes two use cases demonstrating the adaptability of the simulation framework, which is available as open source software.
A fast hybrid time-synchronous/event approach to parallel discrete event simulation of queuing networks
Authors: Hyungwook Park, Paul A. Fishwick
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The trend in computing architectures has been toward multi-core central processing units (CPUs) and graphics processing units (GPUs). An affordable and highly parallelizable GPU is practical example of Single Instruction, Multiple Data (SIMD) architectures oriented toward stream processing. While the GPU architectures and languages are fairly easily employed for inherently time-synchronous based simulation models, it is less clear if or how one might employ them for queuing model simulation, which has an asynchronous behavior. We have derived a two-step process that allows SIMD-style simulation on queuing networks, by initially performing SIMD computation over a cluster and following this research with a GPU experiment. The two-step process simulates approximate time events synchronously and then reduces the error in output statistics by compensating for it based on error analysis trends. We present our findings to show that, while the outputs are approximate, one may obtain reasonably accurate summary statistics quickly.
A WLAN planning proposal through computational intelligence and genetic algorithms hybrid approach
Authors: Jasmine P. L. Araújo, Josiane C. Rodrigues, Simone G. Fraiha, Hermínio Gomes, Gervásio P. S. Cavalcante, Carlos R. L. Francês
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper proposes a WLAN planning strategy through the use of computational intelligence and genetic algorithm. A measurement technique was used to collect data from a real WLAN network. Metrics like power, distance, delay, jitter, packet loss, throughput and PMOS were analysed through the use of bayesian networks. Finally, to optimize the QoS parameters a genetic algorithm was applied to find the best distance from the AP to support the QoS ITU-T recommendations.
Exciton spectroscopy on single CdSe/ZnSe quantum dot photodiodes
Authors: S. Michaelis de Vasconcellos, A. Pawlis, C. Arens, M. Panfilova, A. Zrenner, D. Schikora, K. Lischka
Venue: Microelectronics Journal (2009)

We have investigated the properties of neutral and charged excitons in single CdSe/ZnSe QD photodiodes by @m-photoluminescence spectroscopy. By applying a bias voltage, we have been able to control the number of electrons in a single QD by shifting the energy levels of the QD with respect to the Fermi level in the back contact. Also the quantum-confined Stark effect was observed as a function of the applied electric field.
Guest Column: correlation bounds for polynomials over {0 1}
Authors: Emanuele Viola
Venue: ACM SIGACT News (2009)

This article is a unified treatment of the state-of-the-art on the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0 1 }. It discusses long-standing results and recent developments, related proof techniques, and connections with pseudorandom generators. It also suggests several research directions.
Biosequence Analysis in PRISM
Authors: Ole Torp Lassen
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this work, we consider probabilistic models that can infer biological information solely from biological sequences such as DNA. Traditionally, computational models for biological sequence analysis have been implemented in a wide variety of procedural and object oriented programming languages [1]. Models implemented using stochastic logic programming (SLP [2,3,4]) instead, may draw upon the benefits of increased expressive power, conciseness and compositionality. It does, however, pose a big challenge to design efficient SLP models. 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
Fast buffering for optimizing worst slack and resource consumption in repeater trees
Authors: Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

We present a very fast algorithm for buffering repeater trees. We scan a given preliminary topology in a bottom-up fashion and insert buffers and inverters, respecting the parities of the sinks. Information obtained by preprocessing allows for very fast decisions. To bound the number of shielding repeaters, they are only used where necessary to maximize the worst slack. Furthermore, instead of using a fixed set of repeater positions, they are computed on the fly based on the already buffered subtrees. Another key feature of our algorithm is that we modify the preliminary topology while buffering in order to avoid parallel wires or too many inverters. Experimental results on industrial designs illustrate the speed, quality, practicality, and flexibility of our procedure. In particular, we buffer about 100,000 repeater trees per minute and obtain results that are close to the theoretical optimum in several respects.
Clothfighters
Authors: Simon Pabst
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

"Clothfighters" was produced by students of audio-visual media at the Stuttgart Media University (HdM), in cooperation with the WSI-GRIS, Universit&auml;t T&uuml;bingen. The idea of this short animation was to work with and test an Autodesk Maya plug-in for cloth simulation developed at the GRIS. The shape of the characters should only be defined by the clothes they were wearing; the actual geometries of their bodies were to be invisible.
Research on GIS Spatial Database Based on Grid Computing
Authors: Xiaosheng Liu, Xiaobin Huang, Zhiyong Zhao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In order to use GIS spatial database better and resolve the lack of the heterogeneous data sharing which exists in traditional GIS spatial database, firstly the paper introduces the Grid and GIS spatial databases. Secondly, the paper improves the design of the middleware which integrates the grid GIS space database. On the basis of it, it has carried on the integration and the function design of grid GIS space database. At last, it has carried on an experiment under isomerism grid environment. The result indicates that the grid GIS spatial database can solve the problem of data management, data sharing and magnanimous data storage well under the isomerism environment. So this method has good practicality, which can be applied in GIS widely.
High-Precision Discrete Convolution Algorithm Based on Moments
Authors: Jianguo Liu, Zhenbing Liu, Guoyou Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Convolution is an important and useful operation in the fields of digital signal processing. In this paper, based on the previous work of performing discrete Fourier transform (DFT) via linear sums of discrete moments, we have made development to eliminate multiplications in discrete Fourier transforms by performing appropriate bit operations and shift operations in binary system, which can be implemented by integer additions of fixed points; then using the convolution theorem with the DFT, we compute the convolution with two DFTs, a point-by-point product, and an inverse DFT. Our algorithm involves fewer multiplications and can deal with arbitrary length signals.
The Theory and Practice of Bilingual Teaching in "Object-Oriented Software Engineering"
Authors: Zheng Wei, Zhang Tao, Chau Hau-Ming Lewis, Fang-Fang Duan
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, we describe the main courses of object-oriented software engineering, analyze the necessity of bilingual teaching and explain in detail the teaching plan and strategy of object-oriented software engineering. Finally, we, summarize the advantages and disadvantages of this bilingual teaching course. We conclude that practice has proved the worth of bilingual teaching in object-oriented software engineering.
Using sub-sampled Bragg grating en/decoder to achieve 2.5Gbps 60km OCDM transmission experiment
Authors: Tao PU, Lin Lu, Xiangfei Chen
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we proposed sub-sampled Bragg grating (S-SBG) method to make OCDMA en/decoder. compare the different between TPS, EPS and S-SBG in spectrum and performance. EPS-SSFBG OCDMA en/decoders were experimentally demonstrated. 2.5Gbps OCDMA experiment is shown to achieve 60km error free transmission using 31-chip S-SBG en/decoder and threshold adjustable receiver.
Topology-aware navigation in large networks
Authors: Tomer Moscovich, Fanny Chevalier, Nathalie Henry, Emmanuel Pietriga, Jean-Daniel Fekete
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Applications supporting navigation in large networks are used every days by millions of people. They include road map navigators, flight route visualization systems, and network visualization systems using node-link diagrams. These applications currently provide generic interaction methods for navigation: pan-and-zoom and sometimes bird's eye views. This article explores the idea of exploiting the connection information provided by the network to help navigate these large spaces. We visually augment two traditional navigation methods, and develop two special-purpose techniques. The first new technique, called "Link Sliding", provides guided panning when continuously dragging along a visible link. The second technique, called "Bring & Go", brings adjacent nodes nearby when pointing to a node. We compare the performance of these techniques in both an adjacency exploration task and a node revisiting task. This comparison illustrates the various advantages of content-aware network navigation techniques. A significant speed advantage is found for the Bring & Go technique over other methods.
An Improvement on Competitive Learning Neural Network By LBG Vector Quantization
Authors: G. Basil, J. Jiang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper presents an integration of a competitive learning neural network with LBG vector quantization for image compression. While LBG works in an off-line style in which the code-book is not updated until all the training blocks are classified, and basic competitive learning neural networks suffer from an under-utilization problem, new design is conducted in this paper to exploit these two schemes and to propose a new LBG competitive learning neural network. Experiments carried out on image compression show that the proposed neural network significantly outperforms the conventional LBG algorithm in a number of different settings in terms of reconstructed image quality, compression performance and time consumed.
Lossless Data Hiding Scheme Based on Adjacent Pixel Difference
Authors: Zhuo Li, Xiaoping Chen, Xuezeng Pan, Xianting Zeng
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This paper proposes a lossless data hiding scheme with high embedding capacity, which can recover the original image without any distortion after the hidden data have been extracted. In this scheme, difference value of the adjacent pixels is calculated first. After adjusting the difference slightly, we can increase (decrease) it by 1 or maintain it intact to embed information into the cover image. Experimental results show that the average embedding capacity can be up to 0.91bpp (bit per pixel) while the PSNR stays larger than 30dB. Compared with some existing known lossless data hiding schemes, the proposed method provides higher embedding capacity and lower image degradation. Moreover, the presented algorithm is quite simple and the execution time is rather short.
Factoring and Testing Primes in Small Space
Authors: Viliam Geffert, Dana Pardubská
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We discuss how much space is sufficient to decide whether a unary number n is a prime. We show that O(log log n) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. That is, un-Primes is in pebble-DSPACE(log log n) and also in accept-ASPACE(log log n), where un-primes={1 n :n is a prime}. Moreover, if the given n is composite, such machines are able to find a divisor of n. Since O(log log n) space is too small to write down a divisor which might require &Omega;(log n) bits, the witness divisor is indicated by the input head position at the moment when the machine halts.
Certificate-Based Signatures: New Definitions and a Generic Construction from Certificateless Signatures
Authors: Wei Wu, Yi Mu, Willy Susilo, Xinyi Huang
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Certificate-based encryption was introduced in Eurocrypt'03 to solve the certificate management problem in public key encryption. Recently, this idea has been extended to certificate-based signatures. To date, several new schemes and security models of certificate-based signatures have been proposed. In this paper, we first introduce a new security model of certificate-based signatures. Our model is not only more elaborated when compared with the existing ones, but also defines several new types of adversaries in certificate-based signatures. We then investigate the relationship between certificate-based signatures and certificateless signatures, by proposing a generic construction of certificate-based signatures from certificateless signatures. Our generic construction is secure (in the random oracle model) under the security model defined in this paper, assuming the underlying certificateless signatures satisfying certain security notions.
Design and implementation of a Click-Search interface for web browsing using cellular phones
Authors: Daijiro Komaki, Kenji Ohnishi, Yuki Arase, Takahiro Hara, Gen Hattori, Shojiro Nishio
Venue: International Journal of Web and Grid Services (2009)

It has become common to search for information on the web using cellular phones. However, since cellular phones only have numerical keys for inputting characters, users have to conduct laborious operations to input a keyword for a web search. In our previous work, we assumed information devices equipped with pointing devices and proposed a Click-Search method that enables users to perform a keyword search simply by pointing to and clicking on the desired word on a web page. This approach might be effective for web searches using cellular phones. However, since many cellular phones only have a direction pad as a pointing device, users still have to conduct laborious operations using the pad to move a pointer and point to a word. To solve this problem, we propose a Click-Search interface for cellular phone users that uses an expanding circle to select a word for a search. Using this interface, users can specify a keyword simply by pushing a few buttons.
A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
Authors: Eddie Davis, Marianthi Ierapetritou
Venue: Journal of Global Optimization (2009)

In this paper a new methodology is developed for the solution of mixed-integer nonlinear programs under uncertainty whose problem formulation is complicated by both noisy variables and black-box functions representing a lack of model equations. A branch-and-bound framework is employed to handle the integer complexity whereby the solution to the relaxed nonlinear program subproblem at each node is obtained using both global and local information. Global information is obtained using kriging models which are used to identify promising neighborhoods for local search. Response surface methodology (RSM) is then employed whereby local models are sequentially optimized to refine the problem's lower and upper bounds. This work extends the capabilities of a previously developed kriging-response surface method enabling a wider class of problems to be addressed containing integer decisions and black box models. The proposed algorithm is applied to several small process synthesis examples and its effectiveness is evaluated in terms of the number of function calls required, number of times the global optimum is attained, and computational time.
Future optical ISL characteristics from the perspective of large commercial constellations
Authors: Philip R. Horkin, Keith A. Olds
Venue: Space Communications (1998)

The birth of large LEO constellations dedicated to personal communications in the past few years has created formidable new tasks for the space industry. Systems such as the IRIDIUM$^{\scriptsize{\circledR}}$ Program, Globalstar$^{\scriptsize{\circledR}}$, and Odyssey$^{\scriptsize{\mathrm{TM}}}$ challenge the long standing paradigm on how to design, build, and launch satellites. A second generation of big LEOs is now being planned to offer broadband services for Internet access, cellular backhaul, videoconferencing and distance learning. Systems such as Teledesic$^{\scriptsize{\mathrm{TM}}}$ and M-Star are planned to make extensive use of inter-satellite links. Until now, these crosslinks have been implemented using RF technology, but as the data rate of these systems increases, serious consideration must be given to the use of optical inter-satellite links. Much has been discussed in the media over the past years about the relative merits of both optical and RF approaches. This paper avoids this debate, and examines the reasons that RF technology currently dominates inter-satellite links. The cost of existing optical terminals for space has is measured in the millions to tens of millions of dollars. These figures often compare to the total on-orbit cost of the satellites in commercial constellations. Clearly, a significant paradigm shift will be required in order for producers of optical ISLs to realize a business from these commercial satellite programs. This paper discusses both the technical and programmatic requirements of terminals for such systems in order to provide the industry a better understanding of upcoming needs and constraints essential for their success.
Brief paper: Synthesis of phase-lead/lag compensators with complete information on gain and phase margins
Authors: De-Jin Wang
Venue: Automatica (Journal of IFAC) (2009)

This work provides a new approach for phase-lead/lag compensators to achieve the desired specifications of gain and phase margins for all-pole stable plants with time-delay. The stabilizing regions of lead/lag compensators are first determined in terms of a graphical stability criterion. These regions are drawn graphically, not to be calculated mathematically. Then, by defining appropriate functions relative to the requirements of gain and phase margins, the curves in the stabilizing regions satisfying the pre-specified gain and phase margins can be drawn, which gives the complete information on gain and phase margins. Illustrative examples are given to show the design procedure and to compare our method with other existing tuning rules.
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Authors: Nikolaos Liveris, Hai Zhou, Prithviraj Banerjee
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackles the problem of retiming and resynthesis equivalence checking on a pair of circuits. For this purpose we define the Complete-k-Distinguishability (C-k-D) property for any natural number k based on C-1-D. We show how the equivalence checking problem can be simplified if the circuits satisfy this property and prove that the method is complete for any number of retiming and resynthesis steps. We also provide a way to enforce C-k-D on the circuits without restricting the optimization power of retiming and resynthesis or increasing their complexity. Experimental results demonstrate that enforcing C-k-D property can speed up the verification process.