ppxscal/embedding_network huggingface dataset:
Asynchronous PRAMs are (almost) as good as synchronous PRAMs
Authors: C. Martel, R. Subramonian, A. Part
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A PRAM (parallel random-access-machine) model that allows processors to have arbitrary asynchronous behavior is introduced. The main result shows that any n-processor CRCW (concurrent-read, concurrent-write) PRAM program can be simulated on an asynchronous CRCW PRAM using O(n) expected work per parallel step and up to n/log n log*n asynchronous processors. It is shown that a synchronization primitive for n parallel instructions can be computed using O(n) expected work by a system of asynchronous processors. Since a special case of asynchronous behavior is a fail-stop error, the simulation technique described above can convert any PRAM program into a PRAM program that is resistant to all fail-stop errors and has the same expected work as the original program.
On the Use of Rough Sets for Artefact Extraction from EEG Datasets
Authors: Kenneth Revett
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

High-density electroencephalography produces large volumes of data. The analysis of EEG data is confounded by the existed of a number of different artefacts such as eye blink and, muscle movement which impede the analysis of the data. Typically, artefacts are removed by visual inspection an arduous task for high-density recordings. In addition, different researchers use Consistency across different laboratories is often difficult, and in addition, the task has to be repeated for each study. An automated method for artefact identification and removal would be a very useful tool for data processing in this domain. In this study, rough sets is employed as a means of automating artefact identification and removal within the context of EEG analysis using the EEGLAB analysis system. The results from this preliminary study indicate that artefacts can be identified and removed with approximately 85% accuracy.
A watermarking system based on complementary quantization
Authors: Ching-Tang Hsieh, Yeh-Kuang Wu
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Blind watermarking utilized the quantization table to embed the watermark by adding or subtracting a quantized constant value. When the watermarked image processes malicious manipulations the constant quantization table is not robust. In this paper, a new adaptive and duplicate quantized blind watermarking system is proposed to attend higher transparency. We use an adaptive quantization table to advance the robustness according to the properties of the human visual system and just noticeable distortion. And the error-correcting based watermarking will have the property that corrects errors of the extracted watermark automatically. A multiresolution watermarking based on the wavelet transformation is selected and therefore it can resist the destruction of image processing. In our experiments, the results show that the robustness and transparency of the adaptive watermarking is much better than the traditional one.
Auto-update: a concept for automatic downloading of web content to a mobile device
Authors: Elina Vartiainen, Virpi Roto, Andrei Popescu
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Internet content is increasingly available for mobile users. Mobile devices are capable of delivering not only full Web pages but also other Web content such as podcasts and RSS feeds. Today, cost, speed of data transfer, and network coverage are among the biggest remaining concerns for mobile Web users. It would be useful to have the interesting content readily available on the device when the user wants to access it. Battery and memory limitations together with the cost of data transfer require delicate content prefetching, as loading content carelessly could result in overloading of device resources and a huge phone bill. This article introduces an Auto-update concept that lets the users control the costs and the mobile device resources by means of high level profiles that hide underlying complexity from the users. We tested the usefulness of the Auto-update prototype in a smallscale field study, and the results indicate that Auto-update is especially useful for prefetching feeds.
A randomized time-space tradeoff of O/spl tilde/(mR/spl circ/) for USTCON
Authors: U. Feige
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We present a randomized time space tradeoff of O/spl tilde/(mR/spl circ/) for undirected S-T-connectivity, where R/spl circ/ /spl Sigma//sub /spl upsi//spl epsiv/V/ 1/d/sub /spl upsi// is the virtual resistance of the graph. This solves an open question of Broder et al. (1989) (implicit also in Aleliunas et al. (1979)) who asked whether a tradeoff of O/spl tilde/(mn) is achievable, and also improves upon a tradeoff of O/spl tilde/(mn/d/sub min/) conjectured by Barnes and Feige (1993). Our algorithm is a modification of the Broder et al. algorithm. In passing, we also improve a result from Barnes and Feige regarding the rate at which a random walk discovers new vertices in a graph.
Exact image reconstruction from a limited number of projections
Authors: A. L. Kesidis, N. Papamarkos
Venue: Journal of Visual Communication and Image Representation (2008)

A new method for the exact reconstruction of any gray-scale image from its projections is proposed. The original image is projected into several view angles and the projection samples are stored in an accumulator array. In order to reconstruct the image, the accumulator array is considered as an accumulation of sinusoidal contributions each one corresponding to a certain pixel of the original image. The proposed method defines conditions for the necessary number of projections and the density of ray samples on the projection axis. These conditions insure that, for each pixel, there is at least one sample in the accumulator array where only this particular pixel contributes. This characteristic projection sample is used during the reconstruction phase to determine the coordinates and the gray-scale value of the corresponding image pixel. A variation of the method is also proposed where the reconstruction is performed using a limited number of projection samples in certain view angles. Specifically, the number of necessary samples equals at most the overall number of pixels in the original image. This approach leads to a significant reduction of memory and processing time requirements since it provides exact image reconstruction using one projection sample per pixel.
Multispectral image segmentation by a multichannel watershed-based approach
Authors: P. Li, X. Xiao
Venue: International Journal of Remote Sensing (2007)

Watershed transformation in mathematical morphology is a powerful morphological tool for image segmentation that is usually defined for greyscale images and applied to the gradient magnitude of an image. This paper presents an extension of the watershed algorithm for multispectral image segmentation. A vector-based morphological approach is proposed to compute gradient magnitude from multispectral imagery, which is then input into watershed transformation for image segmentation. The gradient magnitude is obtained at multiple scales. After an automatic elimination of local irrelevant minima, a watershed transformation is applied to segment the image. The segmentation results were evaluated and compared with other multispectral image segmentation methods, in terms of visual inspection, and object-based image classification using high resolution multispectral images. The experimental results indicate that the proposed method can produce accurate segmentation results and higher classification accuracy, if the scales and contrast parameter are appropriately selected in the gradient computation and subsequent local minima elimination. The proposed method shows encouraging results and can be used for segmentation of high resolution multispectral imagery and object based classification.
Browsing databases with constraint hierarchies
Authors: Levent V. Orman
Venue: Electronic Commerce Research (2008)

Electronic markets rely on database technology for efficient search for products, services, customers, and trading partners. Yet, database technology was not designed to build electronic markets, and it often fails to fully support market search activities. Market search often requires browsing and incremental search, attribute and constraint tradeoffs, approximate matches, and incorporation of user and task characteristics into searches. None of these requirements are supported directly by the database technology. Three major extensions to database technology are proposed to effectively support electronic markets. First, incremental search techniques are proposed to allow users to browse databases, and to move from solution to solution by following attribute and constraint tradeoffs. These techniques require systems to have some knowledge of similarity, distance, direction, and tradeoffs. Second, typing and stereotyping techniques are introduced to allow users to relate task and user characteristics to product attributes. These techniques require integration of typing systems with database searches. Third, a comprehensive search strategy is developed that combines incremental search and stereotyping techniques by utilizing product, task, and user ontologies.
Generating Semantic 3D Models of Underground Infrastructure
Authors: Erick Mendez, Gerhard Schall, Sven Havemann, Sebastian Junghanns, Dieter Fellner, Dieter Schmalstieg
Venue: IEEE Computer Graphics and Applications (2008)

By combining two previously unrelated techniques—semantic markup in a scene-graph and generative modeling—a new framework retains semantic information until late in the rendering pipeline. This is a crucial prerequisite for achieving enhanced visualization effects and interactive behavior that doesn't compromise interactive frame rates. The proposed system creates interactive 3D visualizations from 2D geospatial databases in the domain of utility companies' underground infrastructure, creating urban models based on the companies' real-world data. The system encodes the 3D models in a scene-graph that mixes visual models with semantic markup that interactively filters and styles the models. The actual graphics primitives are generated on the fly by scripts that are attached to the scene-graph nodes.
An interactive procedure for multiobjective optimization
Authors: Inès Ben Jaafar, Khaled Ghédira
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The majority of approaches for finding best compromise solutions to multiobjective optimization problems (MOP) make use of the Pareto optimality concept. However, in modeling real world problems, we often encounter MOP with large Pareto optimal alternatives to choose from. This paper introduces the concept of a-efficiency, which provides a notion that is stronger than Pareto optimality and allows setting up a preference ordering amongst various alternatives that are Pareto optimal. If the user still has to process quite a large number of alternatives, we propose to arrange them using an interactive approach based on a plurality voting procedure. This interactive procedure is based on a binary preference relation to rank the solutions set. However, for more flexibility this interactive procedure is extended exploiting fuzzy preference relation.
A new numerical algorithm for the Abel equation of the second kind
Authors: Coskun Guler
Venue: International Journal of Computer Mathematics (2007)

An algorithm based on the Taylor matrix method is proposed and applied to the non-linear Abel equation of the second kind. A Padé approximation of the problem is also obtained. The results are compared and tabulated.
Internet Traffic Modeling with Lévy Flights
Authors: György Terdik, Tibor Gyires
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Measurements of local and wide-area network traffic in the 90’s established the relation between burstiness and self-similarity of network traffic. Several papers demonstrated that the widely used Poisson based models could not be applied for the past decade’s network traffic. If the traffic had been a Poisson process, the traffic’s burst lengths would have been smoothed by averaging over a long time scale contradicting with the observations of the past decade’s traffic characteristics. Poisson models were abandoned as unsuitable characterizations of network traffic. Recent papers have questioned the direct applicability of these results in networks of the new century. Some authors of these papers demand the revision of previous assumptions on the Poisson traffic models. They argue that as newer and newer network technologies are implemented and the amount of Internet traffic grows exponentially, the burstiness of network traffic might cancel out due to the huge number of aggregated traffic flows. Some results are based on analyses of high-speed Internet backbone links and other traffic traces. We analyzed the same traffic traces and applied novel methods to characterize them in terms of packet interarrival time. We demonstrate that the series of interarrival times is still close to a self-similar process.
Cooperative debugging with five hundred million test cases
Authors: Ben Liblit
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

The resources available for testing and verifying software are always limited, and through sheer numbers an application's user community will uncover many flaws not caught during development. The Cooperative Bug Isolation Project (CBI) marshals large user communities into a massive distributed debugging army to help programmers find and fix problems that appear after deployment. Dynamic instrumentation based on sparse random sampling provides our raw data; statistical machine learning techniques mine this data for critical bug predictors; static program analysis places bug predictors back in context of the program under study. We discuss CBI's dynamic, statistical, and static views of postdeployment debugging and show how these three different approaches join together to help improve software quality in an imperfect world.
Key Aspects of Software Release Planning in Industry
Authors: Markus Lindgren, Rikard Land, Christer Norström, Anders Wall
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Software release planning is the process of deciding what to include in future release(s) of a product. Basically the problem can be seen as a company-wide optimization problem involving many stakeholders where the goal is to maximize utilization of the often limited resources of a company and turn them into business benefit. Saliu and Ruhe have proposed a set of key aspects for release planning methods, of which only a subset have been validated in industry. In this paper we use the Saliu and Ruhe key aspects as a starting point for identifying key aspects of release planning. To do this we have performed a multiple case study involving 7 international industrial companies, all producers of software intensive products. Our contribution is 1) a more strict meaning of a release planning key aspect, 2) validation of some of the aspects proposed by Saliu and Ruhe, and 3) an extension of the key aspects. We also capture state-of-the-practice for release planning in industry.
High-Speed Implementations of Block Cipher ARIA Using Graphics Processing Units
Authors: Yongjin Yeom, Yongkuk Cho, Moti Yung
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The power of graphics processing unit (GPU) has been increasing rapidly more than that of CPU. It is not surprising that many software libraries were developed which enable us to use the power of GPU for general computations especially in parallel data processing. In this paper, we propose implementations of the standard block cipher ARIA of Korea using OpenGL and CUDA libraries on GPU. Since ARIA was announced only 4 years ago, there is no hardware solution yet providing high-speed encryption with ARIA. We make use of GPU as a parallel processors with several grid structures and optimize the encryption speed and the occupancy of shared-memory. As a result, when ARIA is running on GeForce 8800GTS using CUDA library, the speed of the encryption reaches up to 4.8 Gbps which is the fastest implementation of ARIA known to public.
An infinite family of biprimitive semisymmetric graphs
Authors: Shao-Fei Du, Dragan Marusi&cbreve;
Venue: Journal of Graph Theory (1999)

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimitive, if its automorphism group acts primitively on each part. In this article, a classification of biprimitive semisymmetric graphs arising from the action of the group PSL(2, p), p &equiv; &plusmn;1 (mod 8) a prime, acting on cosets of S4 is given, resulting in several new infinite families of biprimitive semisymmetric graphs. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 217&ndash;228, 1999 The work was done during author's postdoctorship at IMFM, University of Ljubljana.
M/M/∞ queues in semi-Markovian random environment
Authors: B. D'Auria
Venue: Queueing Systems: Theory and Applications (2008)

In this paper we investigate an M/M/¿ queue whose parameters depend on an external random environment that we assume to be a semi-Markovian process with finite state space. For this model we show a recursive formula that allows to compute all the factorial moments for the number of customers in the system in steady state. The used technique is based on the calculation of the raw moments of the measure of a bidimensional random set. Finally the case when the random environment has only two states is deeper analyzed. We obtain an explicit formula to compute the above mentioned factorial moments when at least one of the two states has sojourn time exponentially distributed.
Correction of segmented lung boundary for inclusion of pleural nodules and pulmonary vessels in chest CT images
Authors: Yeny Yim, Helen Hong
Venue: Computers in Biology and Medicine (2008)

We propose a new curvature-based method for correcting the segmented lung boundary. Our method consists of the following steps. First, the lungs are extracted from chest CT images by the automatic segmentation method. Second, the segmented lung contours are corrected by lung smoothing in each axial slice. Our scan line search provides an efficient contour tracing and curvature calculation. Finally, the smoothed lung contours are corrected by 3D VOI refinement. This increases the smoothness in the z-axis without distortion of the lung boundary. Experimental results show that our method effectively incorporates the pleural nodules and pulmonary vessels into the segmentation results.
Nano-scale patterning using the roll typed UV-nanoimprint lithography tool
Authors: JaeJong Lee, SooYeon Park, KeeBong Choi, GeeHong Kim
Venue: Microelectronic Engineering (2008)

Nanoimprint lithography is a promising technology to produce sub-100nm half-pitch features on silicon wafers. To achieve nano-imprinting process, nano-imprinting lithography equipment must have required some multi-functional units which are imprinting head, self-alignment wafer stage, overlay and alignment system for multi-layer process, stamp with sub-100nm half-pitch patterns, and anti-vibration unit, etc. Although imprinting process has many advantages in terms of low cost, high throughput and reproducibility, these imprinting technologies have a limitation to increase imprinting area and imprinting tool sizes. Also, air entrap phenomenon which is generated between the stamp and the resist surfaces during imprinting process is getting important parameter in the press type imprinting process. In order to get over these limitations and the air entrap and to fabricate large area product, such as above 8in. wafer, display unit and multi-functional device, roll typed UV-nanoimprint lithography tool are certainly necessary. In this study, the roll typed UV-nanoimprint lithography tool which is can be loaded PDMS (polydimethylsiloxane), polycarbonate and PET film as soft stamp, is proposed.
Detecting and resolving policy misconfigurations in access-control systems
Authors: Lujo Bauer, Scott Garriss, Michael K. Reiter
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Access-control policy misconfigurations that cause requests to be erroneously denied can result in wasted time, user frustration and, in the context of particular applications (e.g., health care), very severe consequences. In this paper we apply association rule mining to the history of accesses to predict changes to access-control policies that are likely to be consistent with users' intentions, so that these changes can be instituted in advance of misconfigurations interfering with legitimate accesses. Instituting these changes requires consent of the appropriate administrator, of course, and so a primary contribution of our work is to automatically determine from whom to seek consent and to minimize the costs of doing so. We show using data from a deployed access-control system that our methods can reduce the number of accesses that would have incurred costly time-of-access delays by 44%, and can correctly predict 58% of the intended policy. These gains are achieved without increasing the total amount of time users spend interacting with the system.
Multi-step 3D/2D Image Registration for Image-guided Spinal Surgery
Authors: Yi Zhang, Manning Wang, Zhijian Song
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

We presented a set of methods for registration of preoperative CT data set to intra-operative X-ray images in minimally invasive image-guided spinal surgery. The registration procedure is composed of two steps. Firstly, a rough registration using a variant form of Iterative Closest Point algorithm is adopted to get an overlapped area. Secondly, the fine registration is performed based on gradient projection features. In this step, we introduce a similarity measure of CT gradient projections and use genetic algorithm combined with Powell’s maximization method as optimization strategy, which is able to increase the precision of the registration. The successive registration rate achieves 92% and 81% respectively on simulation data and clinical phantom research. The experimental results show that proposed method is suitable for clinical application with good robustness.