ppxscal/embedding_network huggingface dataset:
An Expedite State Dissemination Mechanism for MMOGs
Authors: Dewan Tanvir Ahmed, Shervin Shirmohammadi
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Massively Multiuser Online Game, i.e. MMOG, is an active research especially to integrate players to perform routing task with the intention of keeping the game deployment cost to a minimum. This paper proposes a novel state dissemination mechanism for MMOG in the context of hybrid P2P architecture by exploiting the idle period of the participating players. The proposed approach performs such task well ahead of other traditional approaches with the identical environmental setup. It expedites the task of state sharing even with heterogeneous environment. The performance of this technique is compared with the most popular multi-tree dissemination method. The measurement validates its superiority.
Dynamic Description Logic Based Services Semantic Matching
Authors: Zhixiong Jiang, Leqiu Qian, Yiming Lau, Shan Tang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A key issue in semantic web services is semantic matching which is important to facilitate to reuse of web services. Existing semantic matching technique such as ontology based, do not guarantee fulfilling the preconditions and desired effect, and hence do not guarantee the correctness of the matching results. in this paper we prose a novel semantic matching approach based on service dynamic description logic (SDDL).SDDL is used to present services specification for capturing both static information and dynamic state aspect of service function, and then semantic matching take into account all these aspects to achieve a precise matching .furthermore not only exact matching, but also various kinds of matching degree are defined. Keywords: semantic web services, service dynamic description logic, semantic matching, matching degree
Implementation and Automatic Testing for Security Enhancement of Linux Based on Least Privilege
Authors: Gaoshou Zhai, Jie Zeng, Miaoxia Ma, Liang Zhang
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Nowadays, technologies of information security have been attached more and more importance to and it's a critical problem to take measures to ensure the reliability of related trustworthy software such as secure operating systems (SOSs). Thereafter, it's always necessary for such systems to be taken complete and rigorous security test and evaluation among development team and/or by third-party security certification organization. However, such software testing is usually time consuming, cost consuming and boresome and thus technologies of software testing automation have alluring application foreground in that field. In this paper, methods and technologies about how to test a SOS automatically are discussed in breadth and in depth at first. Then least privilege is studied and the corresponding modules of security enhancement are added to Linux based on Linux Kernel Modules (LKM). Finally, a prototype of automatic security testing as to such least privilege mechanism is implemented and the results are analyzed.
Leveraging non-blocking collective communication in high-performance applications
Authors: Torsten Hoefler, Peter Gottschling, Andrew Lumsdaine
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Although overlapping communication with computation is an important mechanism for achieving high performance in parallel programs, developing applications that actually achieve good overlap can be difficult. Existing approaches are typically based on manual or compiler-based transformations. This paper presents a pattern and library-based approach to optimizing collective communication in parallel high-performance applications, based on using non-blocking collective operations to enable overlapping of communication and computation. Common communication and computation patterns in iterative SPMD computations are used to motivate the transformations we present. Our approach provides the programmer with the capability to separately optimize communication and computation in an application, while automating the interaction between computation and communication to achieve maximum overlap. Performance results with a model application show more than a 90% decrease in communication overhead, resulting in 21% overall performance improvements.
On discrete Gauss-Hermite functions and eigenvectors of the discrete Fourier transform
Authors: Balu Santhanam, Thalanayar S. Santhanam
Venue: Signal Processing (2008)

The problem of furnishing an orthogonal basis of eigenvectors for the discrete Fourier transform (DFT) is fundamental to signal processing and also a key step in the recent development of discrete fractional Fourier transforms with projected applications in data multiplexing, compression, and hiding. Existing solutions toward furnishing this basis of DFT eigenvectors are based on the commuting matrix framework. However, none of the existing approaches are able to furnish a commuting matrix where both the eigenvalue spectrum and the eigenvectors are a close match to corresponding properties of the continuous differential Gauss-Hermite (G-H) operator. Furthermore, any linear combination of commuting matrices produced by existing approaches also commutes with the DFT, thereby bringing up issues of uniqueness. In this paper, inspired by concepts from quantum mechanics in finite dimensions, we present an approach that furnishes a basis of orthogonal eigenvectors for both versions of the DFT. This approach furnishes a commuting matrix whose eigenvalue spectrum is a very close approximation to that of the G-H differential operator and in the process furnishes two generators of the group of matrices that commute with the DFT.
Characterization of various alloying metal oxide nanoparticles embedded in HfOxNy as charge trapping nodes in nonvolatile memory devices
Authors: Chien-Wei Liu, Chin-Lung Cheng, Jin-Tsong Jeng, Bau-Tong Dai, Sung-Wei Huang
Venue: Microelectronic Engineering (2008)

This work compares Co"xMo"yO, Co"xFe"yO and Fe"xMo"yO alloying metal oxide nanoparticles (AMONs) that were individually embedded in HfO"xN"y high-k dielectric as charge trapping nodes. They were formed by chemical vapor deposition using Co/Mo, Co/Fe and Fe/Mo acetate, respectively, calcined and reduced in Ar/NH"3 ambient. The effects of various pre-treatments on Co"xMo"yO, Co"xFe"yO and Fe"xMo"yO AMONs preparation were investigated. The results indicate that the larger charge trap density, larger memory window and better programming characteristics of Co"xMo"yO AMONs are attributable to their higher surface density and smaller diameter. The average collected charge in each Co"xMo"yO AMON is the smallest among three AMONs, revealing that a local leakage path is associated with the least charge loss. The main mechanism that governs the programming characteristics involves the trapping of holes.
Perceptual evaluation of cartoon physics: accuracy, attention, appeal
Authors: Marcos Garcia, John Dingliana, Carol O'Sullivan
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

People have been using stylistic methods in classical animation for many years and such methods have also been recently applied in 3D Computer Graphics. We have developed a method to apply squash and stretch cartoon stylisations to physically based simulations in real-time. In this paper, we present a perceptual evaluation of this approach in a series of experiments. Our hypotheses were: that stylised motion would improve user Accuracy (trajectory prediction); that user Attention would be drawn more to objects with cartoon physics; and that animations with cartoon physics would have more Appeal. In a task that required users to accurately predict the trajectories of bouncing objects with a range of elasticities and varying degrees of information, we found that stylisation significantly improved user accuracy, especially for high elasticities and low information. To assess attention, many simulated objects were shown to participants on which words appeared at random, the task being to speak and remember them. Our results do not confirm that attention can be directed in such a scenario using cartoon physics. However, a game with cartoon physics was chosen to be more appealing almost twice as often as one with no stylisation applied. We conclude that stylised motion can be a valuable tool to improve physically based animations.
Output-sensitive hidden surface removal
Authors: M. Overmars
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Several output-sensitive algorithms for hidden surface removal in a collection of n horizontal triangles, viewed from a point at z=- infinity , are derived. If k is the combinatorial complexity of the output visibility map, then the result is a simple (deterministic) algorithm that runs in time O(n square root k log n) and several improved and more sophisticated algorithms that use randomization. One of these algorithms runs in time O(n/sup 4/3/log /sup gamma /n+k/sup 3/5/n/sup 4/5+ delta /) for any delta >0, where gamma is some constant less than 3. The performance of the other algorithms is potentially even faster; it depends on other parameters of the structure of the given triangles, as well as on the output size. A variant of the simple algorithm performs hidden surface removal for n (nonintersecting) balls in time O(n/sup 3/2/log n+k).
Transitioning from a Community College to a Four-Year University
Authors: Patricia Morreale, George Chang, Lee Wittenberg
Venue: Computer (2008)

Faculty cooperation and programming contests help bridge the curriculum disconnect for transferring computer-science students.
A Robust Feature-Based Method for Mosaic of the Curved Human Color Retinal Images
Authors: Jupeng Li, Houjin Chen, Chang Yao, Xinyuan Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Accurate registration is essential for montage synthesis, change detection, and design of computer-aided instrumentation. This paper describes a robust local feature-based for automatic mosaic of the curved human color retinal images. The kernel of this method is the m space scale invariant feature transform (mSIFT). The mSIFT algorithm is designed to over-come the SIFT’s drawback that detects less features in the flat regions. Using the mSIFT algorithm, second-nearest-neighbor strategy, inlier identification, bilinear warping and multi-blending techniques, pairs of the curved color retinal images can be mosaicked to create panoramic images. Experiments show that the proposed method works well with the rejection error in 0.2 pixels, even for these cases where the retinal images without enough discernable structures, in contrast to the state-of-the-art algorithms.
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Authors: Bin Qian, Ling Wang, De-xian Huang, Wan-liang Wang, Xiong Wang
Venue: Computers and Operations Research (2009)

This paper proposes an effective hybrid algorithm based on differential evolution (DE), namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) with limited buffers between consecutive machines, which is a typical NP-hard combinatorial optimization problem with strong engineering background. Firstly, to make DE suitable for solving scheduling problems, a largest-order-value (LOV) rule is presented to convert the continuous values of individuals in DE to job permutations. Secondly, after the DE-based exploration, an efficient local search, which is designed based on the landscape of MPFSSP with limited buffers, is applied to emphasize exploitation. Thus, not only does the HDE apply the parallel evolution mechanism of DE to perform effective exploration (global search) in the whole solution space, but it also adopts problem-dependent local search to perform thorough exploitation (local search) in the promising sub-regions. In addition, the concept of Pareto dominance is used to handle the updating of solutions in sense of multi-objective optimization. Moreover, the convergence property of HDE is analyzed by using the theory of finite Markov chain. Finally, simulations and comparisons based on benchmarks demonstrate the effectiveness and efficiency of the proposed HDE.
Operator splitting techniques for the numerical analysis of natural convection heat transfer
Authors: Mehmet Ilicak, Ali Ecder, Erhan Turan
Venue: International Journal of Computer Mathematics (2007)

Natural convection heat transfer in rectangular enclosures is an active research area, due to its significance for both fundamental interest and engineering applications such as thermal management of electronic components. In this present numerical study, combined conduction and natural convection have been analysed for one or two heat sources mounted on substrates in an enclosure. For one heat source, the substrate is mounted on a vertical wall, and for the case of two heat sources, the substrates are mounted vertically and horizontally. Buoyancy forces drive the fluid flow. The Picard method with a hybrid grid system is utilized to decouple between pressure and velocity components, resulting in componentwise splitting. Linear systems obtained via the Picard method have been solved by the ADI method, resulting in directional splitting. Effects of different parameters such as Prandtl number, Rayleigh number, and boundary conditions on the temperature and flow field have been analysed.
Optimized Routing Based on Mobility Prediction in Wireless Mobile Adhoc Networks for Urban Area
Authors: Mohsen Chegin, Mahmood Fathy
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The mobile nodes in adhoc networks have the various movements. These movements break the links between nodes in network. This is a major problem because nodes don’t have any aware of link expiration time. If nodes of network know awareness of link expiration time they can choice a reliable and durable paths and save in time and energy because they don’t need to discover new paths. So we can predict the link expiration time and save the result in a prediction table. For mobility prediction in urban area we should obey a mobility model. For simulation of mobility prediction in an urban area we select the Manhattan mobility model. After computing the prediction table base on Manhattan mobility model we introduce a new routing algorithm that will improve the throughput of network compared with shortest routing algorithms.
Epi-convergent discretizations of multistage stochastic programs via integration quadratures
Authors: Teemu Pennanen
Venue: Mathematical Programming: Series A and B (2008)

This paper presents procedures for constructing numerically solvable discretizations of multistage stochastic programs that epi-converge to the original problem as the discretizations are made finer. Epi-convergence implies, in particular, that the cluster points of the first-stage solutions of the discretized problems are optimal first-stage solutions of the original problem. The discretization procedures apply to a general class of nonlinear stochastic programs where the uncertain factors are driven by time series models. Using existing routines for numerical integration allows for an easy and efficient implementation of the procedures.
Singular Coverings and Non-Uniform Notions of Closed Set Computability
Authors: Stéphane Le Roux, Martin Ziegler
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe have asserted the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are even 'large' in the sense of positive Lebesgue measure. This leads us to investigate for various classes of computable real subsets whether they always contain a (not necessarily effectively findable) computable point.
coverage-based dynamically adjusted probabilistic forwarding for wireless mobile ad hoc networks
Authors: Imran Ali Khan, Akmal Javaid, Hua Lin Qian
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

Flooding is a fundamental and effective data dissemination mechanism for route discovery, address resolution and many other network services in MANET, cause redundant rebroadcasts, which in result leads to the broadcast storm problem. Although many approaches have been proposed to solve the broadcast storm problem, none have been regarded as the satisfying solution. In this paper, we propose a coverage-based dynamically adjusted probabilistic forwarding scheme and compare it with simple flooding and fixed probabilistic schemes. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area. The adaption is based only on additional coverage without the assistance of neighbor knowledge. The proposed scheme keeps up the reachability of blind flooding while maintaining the simplicity of probability based schemes.
Multimodal Interaction with Mobile Devices: Fusing a Broad Spectrum of Modality Combinations
Authors: Rainer Wasinger
Venue: Dissertations In Artificial Intelligence (2007)

This publication presents a multimodal architecture for use in mobile scenarios such as shopping and navigation. It also analyses a wide range of feasible modality input combinations for these contexts. For this purpose, two interlinked demonstrators were designed for stand-alone use on mobile devices. Of particular importance was the design and implementation of a modality fusion module capable of combining input from a range of communication modes like speech, handwriting, and gesture. The implementation is able to account for confidence value biases arising within and between modalities and also provides a method for resolving semantically overlapped input. Tangible interaction with real-world objects and symmetric multimodality are two further themes addressed in this work. This work concludes with the results from two usability field studies that provide insight on user preference and modality intuition for different modality combinations, as well as user acceptance for anthropomorphized objects.
A video stream management system for heterogeneous information integration environments
Authors: Yousuke Watanabe, Ryo Akiyama, Kousuke Ohki, Hiroyuki Kitagawa
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Massive data streams are obtained from various types of sources such as sensors, GPS and live cameras. Since demand for applications integrating multiple data streams and databases is increasing, we must consider an integration framework for heterogeneous information sources. Integrating numeric and text streams is comparatively easy, but integrating video streams and other sources is difficult because of the properties of video streams: highly-frequent, largevolume and complex binary data. Based on this background, we propose a video stream management system. The system provides a SQL-like query interface for heterogeneous information sources including video streams. To integrate video streams, we employ an abstract data type to hold a subsequence of video frames and functions to extract metadata from video data. Beyond that, we also propose a dynamic source selection scheme for some applications, like moving object tracking with video streams. The scheme is used when information sources to be accessed may change according to changes in user interest. Our system dynamically accesses necessary information sources and saves system resources by closing connections to unnecessary information sources.
A Parametric Proxy-Based Compression of Depth Movies
Authors: Pooja Verlani, P. J. Narayanan
Venue: Proceedings of the Data Compression Conference (2008)

Capturing dynamic scenes in 3D using a suitable depth or structure recovery mechanism has become popular today for image based modelling, 3D telelconferencing, etc. The 2-1/2 D geometric structure and the aligned texture -- together called a depth image -- are captured by such setups. Time varying sequences of depth images are called "depth movies". Depth movies of humans performing interesting actions are being captured using specialized setups today in different research labs. The data so captured is often streamed to another location for immersive viewing using standard depth-image rendering techniques. The depth maps are bulky and need innovative algorithms for efficient representation and compression. In this paper, we present a compression scheme that uses parametric proxy models for the underlying action. We use a generic articulated human model as the proxy and the various joint angles as its parameters for each time instant. The proxy model represents common prediction of the scene structure for that time instant. It can be projected to each view and the difference or residue between the depth due to the proxy and the original depth can be used to represent the scene. The residues compress better and can exploit temporal and spatial relationship between multiple depth movies. We show results on several synthetic actions to demonstrate the usefulness of the scheme.
On optimal degree selection for polynomial kernel with support vector machines: Theoretical and empirical investigations
Authors: Shawkat Ali, Kate Smith-Miles
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

The key challenge in kernel based learning algorithms is the choice of an appropriate kernel and its optimal parameters. Selecting the optimal degree of a polynomial kernel is critical to ensure good generalisation of the resulting support vector machine model. In this paper we propose Bayesian and Laplace approximation methods to estimate the polynomial degree. A rule based meta-learning approach is then proposed for automatic polynomial kernel and its optimal degree selection. The new approach is constructed and tested on different sizes of 112 datasets with binary class as well as multi class classification problems. An extensive computational evaluation of these methods is conducted, and rules are generated to determine when these approximation methods are appropriate.
Economic Grid Resource Management for CPU Bound Applications with Hard Deadlines
Authors: Kurt Vanmechelen, Wim Depoorter, Jan Broeckhove
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The introduction of economic principles in grid resource management provides an interesting avenue for efficiently addressing the problem of conflicting user requirements. In shared computing infrastructures such as grids, such conflicting requirements are prevalent and stem from the selfish actions users follow when formulating their service requests. We develop and analyze both a centralized and a decentralized algorithm for economic resource management in the context of consumer requests for CPU bound applications with deadline-based QoS requirements and non-migratable workloads. A comparison with an algorithm recently proposed in the literature is presented with a focus on performance in terms of realized consumer value. We establish that our algorithms perform well and that they compare favorably to existing approaches.