ppxscal/embedding_network huggingface dataset:
Streaming model based volume ray casting implementation for Cell Broadband Engine
Authors: Jusub Kim Joseph Jaja
Venue: Scientific Programming (2009)

Interactive high quality volume rendering is becoming increasingly more important as the amount of more complex volumetric data steadily grows. While a number of volumetric rendering techniques have been widely used, ray casting has been recognized as an effective approach for generating high quality visualization. However, for most users, the use of ray casting has been limited to datasets that are very small because of its high demands on computational power and memory bandwidth. However the recent introduction of the Cell Broadband Engine (Cell B.E.) processor, which consists of 9 heterogeneous cores designed to handle extremely demanding computations with large streams of data, provides an opportunity to put the ray casting into practical use. In this paper, we introduce an efficient parallel implementation of volume ray casting on the Cell B.E. The implementation is designed to take full advantage of the computational power and memory bandwidth of the Cell B.E. using an intricate orchestration of the ray casting computation on the available heterogeneous resources. Specifically, we introduce streaming model based schemes and techniques to efficiently implement acceleration techniques for ray casting on Cell B.E. In addition to ensuring effective SIMD utilization, our method provides two key benefits: there is no cost for empty space skipping and there is no memory bottleneck on moving volumetric data for processing. Our experimental results show that we can interactively render practical datasets on a single Cell B.E. processor.
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem
Authors: Hadrien Cambazard, Narendra Jussien
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

This paper presents a study conducted on the minimum number of open stacks problem (MOSP) which occurs in various production environments where an efficient simultaneous utilization of resources (stacks) is needed to achieve a set of tasks. We investigate through this problem how classical look-back reasonings based on explanations could be used to prune the search space and design a new solving technique. Explanations have often been used to design intelligent backtracking mechanisms in Constraint Programming whereas their use in nogood recording schemes has been less investigated. In this paper, we introduce a generalized nogood (embedding explanation mechanisms) for the MOSP that leads to a new solving technique and can provide explanations.
Labs first: a computer scientist's guide to teaching management information systems
Authors: Eric Breimer, Jami Cotler, Robert Yoder
Venue: Journal of Computing Sciences in Colleges (2009)

Management Information Systems is a common course requirement for business programs, but it is often taught as a service course within a Computer Science department. When taught as an entirely lecture-based course, Management Information Systems can seem unrelated to fundamental Computer Science topics. When computer application proficiency is the focus, Management Information Systems can be an unpopular course to teach. However, some departments may be missing out on an excellent opportunity to attract students to the field of Computer Science. By focusing on innovative labs that combine business applications with Computer Science-based solutions, it is possible to teach practical computer application skills, traditional material in Management Information Systems, and both fundamental and emerging Computer Science topics.
CDMA-Based Remote Wireless Water Quality Monitoring System for Intensive Fish Culture
Authors: Daoliang Li, Xiuna Zhu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Water quality monitoring plays an important role in modern Intensive fish farming management. In order to improve the efficiency and precision of the data collection procedure, it is necessary to have an automated monitoring system that collects environmental data, especially to record long-term and up-to-the-minute environmental fluctuations. The purpose of this research was to design a remote-controlled, on-line water quality monitoring system for intensive fish culture in China based on wireless communication technology CDMA. Since the long-term detected data provides us with the details of the environmental conditions dynamics of water quality, the system allows us to control the water quality in time and reduce catastrophic losses. The experimental results demonstrate that affordable, large scale, long distance, and long-term monitoring for water quality information can be achieved by using our proposed monitoring system.
A security policy for a profile-oriented operating system
Authors: Charles R. Young
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A security policy for a profile-oriented operating system is described that is adopted from state-of-the-art security properties designed to meet even the strict security requirements of the Department of Defense. The policy is built around user, execution, and program profiles that serve as repositories for security related information. The security terms access category, access list, security level, clearance level, subject, object, discretionary and nondiscretionary security, and profile are defined. The six security rules that form the foundation of system security are described. Their interactions are detailed and examples are given. The six rules are: discretionary security condition, simple security condition, *-property (star property), tranquility principle, nonaccessibility of deleted objects, and rewriting of newly created objects.
Graph Drawing for Security Visualization
Authors: Roberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

With the number of devices connected to the internet growing rapidly and software systems being increasingly deployed on the web, security and privacy have become crucial properties for networks and applications. Due the complexity and subtlety of cryptographic methods and protocols, software architects and developers often fail to incorporate security principles in their designs and implementations. Also, most users have minimal understanding of security threats. While several tools for developers, system administrators and security analysts are available, these tools typically provide information in the form of textual logs or tables, which are cumbersome to analyze. Thus, in recent years, the field of security visualization has emerged to provide novel ways to display security-related information so that it is easier to understand. In this work, we give a preliminary survey of approaches to the visualization of computer security concepts that use graph drawing techniques.
Proceedings of the June 7-10, 1982, national computer conference
Venue: AFIPS Joint Computer Conferences (1982)

The purpose of the National Computer Conference is to provide an atmosphere in which designers, suppliers, users, managers, educators, and representatives of government and society at large can meet and interact. Discussions of new technical developments, as well as national and international issues and challenges facing the information processing community, are encouraged. This year's discussions and developments are contained, for the most part, in this anniversary Volume 51 of the Proceedings of the National Computer Conference, completing its first decade as the world's premier computer exposition 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
Direct adaptive interval type-2 fuzzy control of multivariable nonlinear systems
Authors: Tsung-Chih Lin, Han-Leih Liu, Ming-Jen Kuo
Venue: Engineering Applications of Artificial Intelligence (2009)

A fuzzy logic controller equipped with a training algorithm is developed such that the H&infin; tracking performance should be satisfied for a model-free nonlinear multiple-input multiple-output (MIMO) system, with external disturbances. Due to universal approximation theorem, fuzzy control provides nonlinear controller, i.e., fuzzy logic controllers, to perform the unknown nonlinear control actions and the tracking error, because of the matching error and external disturbance is attenuated to arbitrary desired level by using H&infin; tracking design technique. In this paper, a new direct adaptive interval type-2 fuzzy controller is developed to handle the training data corrupted by noise or rule uncertainties for nonlinear MIMO systems involving external disturbances. Therefore, linguistic fuzzy control rules can be directly incorporated into the controller and combine the H&infin; attenuation technique. Simulation results show that the interval type-2 fuzzy logic system can handle unpredicted internal disturbance, data uncertainties, very well, but the adaptive type-1 fuzzy controller must spend more control effort in order to deal with noisy training data. Furthermore, the adaptive interval type-2 fuzzy controller can perform successful control and guarantee the global stability of the resulting closed-loop system and the tracking performance can be achieved.
Feed me: motivating newcomer contribution in social network sites
Authors: Moira Burke, Cameron Marlow, Thomas Lento
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Social networking sites (SNS) are only as good as the content their users share. Therefore, designers of SNS seek to improve the overall user experience by encouraging members to contribute more content. However, user motivations for contribution in SNS are not well understood. This is particularly true for newcomers, who may not recognize the value of contribution. Using server log data from approximately 140,000 newcomers in Facebook, we predict long-term sharing based on the experiences the newcomers have in their first two weeks. We test four mechanisms: social learning, singling out, feedback, and distribution. In particular, we find support for social learning: newcomers who see their friends contributing go on to share more content themselves. For newcomers who are initially inclined to contribute, receiving feedback and having a wide audience are also predictors of increased sharing. On the other hand, singling out appears to affect only those newcomers who are not initially inclined to share. The paper concludes with design implications for motivating newcomer sharing in online communities.
The missing LINQ between databases and object-oriented programming: LINQ as an object query language for a database course
Authors: Suzanne W. Dietrich, Mahesh Chaudhari
Venue: Journal of Computing Sciences in Colleges (2009)

LINQ, which stands for Language Integrated Query, is an innovative query language that bridges the gap between databases and object-oriented programming languages. LINQ is declarative, strongly-typed, and based on functional programming and lambda expressions. This paper provides an overview of LINQ for the database educator and provides a pedagogical perspective for learning and incorporating LINQ in a database course.
Turning the tables: an interactive surface for vjing
Authors: Stuart Taylor, Shahram Izadi, David Kirk, Richard Harper, Armando Garcia-Mendoza
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper we describe VPlay, a multi-touch tabletop application that allows users to mix and manipulate multiple video streams in real-time. Our aim is to explore how such an interactive surface can support and augment practices around VJing - a form of video performance art that is becoming increasingly popular in nightclubs and other music events. We conclude with observations from a field deployment, which highlight some initial thoughts and reflections on our design rationale.
A Distributed Object Platform for Multimedia Applications
Authors: Geoff Coulson, Shakuntala Baichoo
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Two current trends in distributed computing are the emergence of standardised distributed object platforms such as CORBA, and the increasing use of continuous media data types. This paper describes and evaluates a platform which supports both standard CORBA interactions and continuous media interactions in a fully integrated environment. The platform is implemented as a self-contained support infrastructure (GOPI core) and a separate 'personality' that sits on top of the infrastructure and provides a CORBA API. The platform user can create both request/ reply oriented and stream oriented bindings with quality of service specifications that are honoured (as far as possible) by the infrastructure. The level of performance attained by the platform provides evidence of the feasibility of natively supporting continuous media in a distributed object platform environment.
Web 2.0: a basis for the second society?
Authors: Johan van Wamelen, Dennis de Kool
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Web 2.0 applications gain in importance in today's society. This development cannot be ignored by the public sector, because Web 2.0 can take the evolution of E-Government in new directions. This paper discusses the impact of (local) Web 2.0 applications on the further development of E-government. Web 2.0 applications have much potential for the public sector in terms of interaction, participation and transparency. However, examples of websites with transaction or transformation characteristics are rare. For that reason it is too early to speak about a virtual state. In order to realize these two final stages of E-Government, it is important to take into account the potential risks of Web 2.0 applications as well, like isolation, exclusion, violation of privacy and misuse of information.
Integrated human decision making model under belief-desire-intention framework for crowd simulation
Authors: Seungho Lee, Young-Jun Son
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

An integrated Belief-Desire-Intention (BDI) modeling framework is proposed for human decision making and planning, whose sub-modules are based on Bayesian belief network (BBN), Decision-Field-Theory (DFT), and probabilistic depth first search (PDFS) technique. To mimic realistic human behaviors, attributes of the BDI framework are reverse-engineered from the human-in-the-loop experiments conducted in the Cave Automatic Virtual Environment (CAVE). The proposed modeling framework is demonstrated for human's evacuation behaviors under a terrorist bomb attack situation. The simulated environment and agents (human model) conforming to the proposed BDI framework are implemented in AnyLogic&reg; agent-based simulation software, where each agent calls external Netica BBN software to perform its perceptual processing function and Soar software to perform its real-time planning and decision-execution functions. The constructed simulation has been used to test impact of several factors (e.g. demographics of people, number of policemen) on evacuation performance (e.g. average evacuation time, percentage of casualties).
Commercialization of Electronic Information
Authors: Jean-Henry Morin, Dimitri Konstantas
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Information dissemination is slowly moving from printed media to electronic media. However this step cannot be completed if the electronic commercialization of information does not provide the same guarantees against copyright infringement as with the printed media. In this paper we present the major requirement for the commercialization of electronic information and describe Hep, an agent based framework we developed for the commercialization of arbitrary electronic documents over open networks.
3D Face Recognition Using R-ICP and Geodesic Coupled Approach
Authors: Karima Ouji, Boulbaba Ben Amor, Mohsen Ardabilian, Liming Chen, Faouzi Ghorbel
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

While most of existing methods use facial intensity images, a newest ones focus on introducing depth information to surmount some of classical face recognition problems such as pose, illumination, and facial expression variations. This abstract summarizes a new face recognition approach invariant to facial expressions based on dimensional surface matching. The core of our recognition/authentication scheme consists of aligning then comparing a probe face surface and gallery facial surfaces. In the off-line phase, we build the 3D face database with neutral expressions. The models inside include both shape and texture channels. In the on-line phase, a partial probe model is captured and compared either to all 3D faces in the gallery for identification scenario or compared to the genuine model for authentication scenario. The first step aligns probe and gallery models based only on static regions of faces within a new variant of the well known Iterative Closest Point called on R-ICP (Region-based Iterative Closest Point) which approximates the rigid transformations between the presented probe face and gallery one. R-ICP result is two matched sets of vertices in the both static and mimic regions of the face surfaces. For the second step, two geodesic maps are computed for the pair of vertices in the matched face regions. The recognition and authentication similarity score is based on the distance between these maps. Our evaluation experiments are done on 3D face dataset of IV2 french project.
Raptor: a visual programming environment for teaching object-oriented programming
Authors: Martin C. Carlisle
Venue: Journal of Computing Sciences in Colleges (2009)

Learning object-oriented programming usually involves learning a programming language with a large amount of complexity. Students very often spend more time dealing with syntactical complexity than learning the underlying principles of object-orientation or solving the problem. Additionally, the textual nature of most programming environments works against the learning style of the majority of students. RAPTOR is an iconic programming environment, designed specifically to help students visualize classes and methods and limit syntactic complexity. RAPTOR programs are created visually using a combination of UML and flowcharts. The resulting programs can be executed visually within the environment and converted to Java.
A numerical algorithm for a one-dimensional nonlinear Timoshenko system
Authors: Jemal Peradze, Vladimer Odisharia
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

We consider the boundary value problem for a system of nonlinear ordinary differential equations that describes the static behavior of a plate. An approximate solution is obtained using the algorithm including the Galerkin method, the convergence of which was proved by the authors previously, and the nonlinear Jacobi iteration process, the accuracy of which is discussed in this work.
An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data
Authors: Peishun Wang, Huaxiong Wang, Josef Pieprzyk
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

We consider the following problem: members in a dynamic group retrieve their encrypted data from an untrusted server based on keywords and without any loss of data confidentiality and member's privacy. In this paper, we investigate common secure indices for conjunctive keyword-based retrieval over encrypted data, and construct an efficient scheme from Wang et al. dynamic accumulator, Nyberg combinatorial accumulator and Kiayias et al. public-key encryption system. The proposed scheme is trapdoorless and keyword-field free. The security is proved under the random oracle, decisional composite residuosity and extended strong RSA assumptions.
Shift to the third space and philosophical perspective of consilience of arts and science-technology
Authors: Kwang-Hyun Shim
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

The ISAT 2007, held last year, tried to find out the "lightning effects" resulting from the encounter of art and science-technology through the catchwords of "lightning rod of mind." The second ISAT this year will search for the meaning of such encounter in the theme of the "Shift to The Third Space" in connection with the new dimensional shift resulted by the ubiquitous computing technology.
Formal verification of hardware support for advanced encryption standard
Authors: Anna Slobodová
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

The Advanced Encryption Standard (AES), approved by National Institute of Standards and Technology, specifies a cryptographic algorithm that can be used to protect electronic data. The next generation of Intel micro-processor introduces a set of instructions known as AES-NI, that promises multi-folded acceleration of the AES encryption and decryption process. In this paper, we report about the formal verification of hardware support for these new instructions. The verification is based on use of Symbolic Trajectory Evaluation that lies at the base of formal verification methodology used by Intel Corporation. To our knowledge, this is the first formal verification of AES hardware support.
Refolding Planar Polygons
Authors: Hayley N. Iben, James F. O&#x2019;Brien, Erik D. Demaine
Venue: Discrete Computational Geometry (2009)

This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of the interpolation sequence. The computational machinery that ensures against self-intersection is independent from a distance metric that determines the overall character of the interpolation sequence. This decoupled approach provides a powerful control mechanism for determining how the interpolation should appear, while still assuring against intersection and guaranteeing termination of the algorithm. Our algorithm also allows additional control by accommodating a set of algebraic constraints that can be weakly enforced throughout the interpolation sequence.
Analysis of Instant Messaging Group Worms
Authors: Wei Wang, Ming Xie, Daisheng Luo, Yong Fang
Venue: International Journal of Distributed Sensor Networks (2009)

Instant Messaging group is the new feature added into the IM system. In the IM group network, two IM users are considered connecting if they are in the same group, which is the essential difference from previous topology. We study worms under IM group topology for the first time. After analyzing the real data, we propose some new propagation approaches of worms and prove their efficiency. To prevent IM group worms, we propose some new defense methods and define some new items. Results can be greatly helpful to administrators of the IM service.