ppxscal/embedding_network huggingface dataset:
The expressiveness of spider diagrams augmented with constants
Authors: Gem Stapleton, John Taylor, Simon Thompson, John Howse
Venue: Journal of Visual Languages and Computing (2009)

Spider diagrams are a visual language for expressing logical statements or constraints. Several sound and complete spider diagram systems have been developed and it has been shown that they are equivalent in expressive power to monadic first order logic with equality. However, these sound and complete spider diagram systems do not contain syntactic elements analogous to constants in first order predicate logic. We extend the spider diagram language to include constant spiders which represent specific individuals. Formal semantics are given for the extended diagram language. We prove that this extended system is equivalent in expressive power to the language of spider diagrams without constants and, hence, equivalent to monadic first order logic with equality.
Research of Traffic Safety Simulation Based on 3DS MAX
Authors: Wen-bo Wang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

With the increase in the number of motor vehicles, the speed of the car must be limited in different weather environment in order to ensure the traffic safety. According to the traffic safety problem in our country now days, 3DS MAX is used in the field of traffic simulation. This paper takes that the speed of car does not exceed 60km/h when the visibility is between 100m to 200m for example. Firstly, the car model is created with 3DS MAX, then, the simulation of car that is going is realized with MaxScript built in 3DS MAX. Experimental results show the correctness of the car’s speed limited on by 3D animation.
La r&eacute;alit&eacute; fusion
Authors: Philippe Quéau
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

The immersive power of virtual reality, the realism of simulation imagery, the variety of man-machine interaction tools, the pervasiveness of bionic prosthesis, the ubiquity of networking, the abundance of RFID and IPv6-based tagging and the precision of geolocalisation, are as many signals of the growing convergence between virtual worlds and reality. This convergence raises numerous technical, but also societal, economic and ethical challenges. It announces the emergence of a &laquo; fusion reality &raquo;, with new and acute issues of governance and regulation.
Expert WSS 3.0 and MOSS 2007 Programming, New edition
Authors: Shahram Khosravi
Venue: Wrox Programmer To Programmer (2008)

Windows SharePoint Services 3.0 (WSS) is a built-in feature of Windows Server that allows for the development of collaborative business applications. Microsoft Office SharePoint Server 2007 (MOSS) is an integrated server offering that leverages the WSS 3.0 features of Windows Server and adds an additional 100+ collaborative features. With WSS 3.0 and MOSS 2007 combined, you can create a variety of highly collaborative business applications. Using numerous practical, real-world examples, this book discusses implementing custom master pages, programming against site pages, implementing custom application pages, developing custom server controls, and extending existing controls.
Quantification and Evaluation of Survivability on Information Systems
Authors: Ming He, Hang-Ping Qiu, Ai-qun Hu, Ji-Chuan Quan
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

We propose a general survivability quantification framework which is applicable to a wide range of information system architectures and applications. We show how this framework can be used to derive survivability measures based on different definitions and extend it to other measures not covered by current definitions which can provide helpful information for better understanding of system steady state and transient behaviors under failures/attacks. Markov models Also, this paper puts forward a survivability evaluation model, SQEM (Survivability Quantitative Evaluation Model), which is developed and solved to depict various aspects of information system survivability. Then it defines the measurement factors and parses the survivability mathematically, introduces state change probability and the idea of setting the weights of survivability factors dynamically into the evaluating process of SQEM, which improved the accuracy of evaluation. An example is presented to illustrate the way SQEM works, which demonstrated the validity and feasibility of the method.
Evaluating Time Diversity Performance on an On-board Processing Satellite to Earth Station Downlink
Authors: Kufre M. Udofia, Ifiok E. Otung
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

A method for assessing the performance of time diversity (TD) along a single downlink path is proposed. The evaluation is done using TD gain, which is obtained from joint distribution of similar retransmitted rain attenuation time series separated by finite time delay. Statistics use to assess the performance of TD are obtained from analyses of measurements from the most recent British Atmospheric Data Centre (BADC) database. TD is presented in this paper as a suitable fade mitigation scheme for increasing link availability and improving the quality of service in broadcast systems. Prior to achieving a model of TD, analyses of propagation datasets (November 2005) and extraction of attenuation statistics have been carried out. These statistics are necessary for the modeling process and for the design of a satellite link between any two earth stations having a separation distance in excess of the mean rain cell size which is roughly 10Km. Comparisons are made with ITU-R model and some useful conclusions deduced.
The 0wned Price Index
Authors: Daniel E. Geer Jr., Daniel G. Conway
Venue: IEEE Security and Privacy (2009)

This installment of For Good Measure examines the price index of the 12 days of Christmas items, based on the 0wned Price Index, an index of underground economy prices.
On the departure process of burst aggregation algorithms in optical burst switching
Authors: Xenia Mountrouidou, Harry Perros
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

We characterize analytically the departure process from the following three burst aggregation algorithms: the time based aggregation algorithm, the burst-length based aggregation algorithm and the time and burst-length based aggregation algorithm. The arrival process of packets is assumed to be Poisson or bursty modeled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy.
Measuring Transaction Costs in Spatial Data Infrastructures: Examples of Sweden and Germany
Authors: Alenka Krek
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Many national mapping agencies offer geographic datasets on the Web. The potential users are interested in buying the dataset. An exchange of geographic data is a transaction and involves transaction costs. Transaction costs include the cost of measuring what has been exchanged and the cost of protecting rights, plus policing and enforcing agreements. Our research on transaction costs is based on experiments in Sweden and Germany. We focus on the cost of data acquisition, the search for information about the data provider, and the quality and price of its dataproducts. The experiments show that there is a difference if only one data provider exists or there are several different suppliers available. We conclude the paper with a description of the experiment, our first results and further research work.
A Framework for Task Scheduling and Memory Partitioning for Multi-Processor System-on-Chip
Authors: Hassan Salamy, J. Ramanujam
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

The growing trend in current complex embedded systems is the use of multiprocessor system-on-chip (MPSoC). An MPSoC consists of multiple heterogeneous processing elements, a memory hierarchy, and input/output components which are linked together by an on-chip interconnect structure. Using such an architecture provides the flexibility to meet the performance requirements of multimedia applications while respecting the constraints on memory, cost, size, time and power. Such embedded systems employ software-managed memories known as scratch-pad memories (SPM). Scratchpad memories, unlike caches, are software-controlled and hence the execution time of applications on such systems can be accurately predicted and controlled. Scheduling the tasks of an application on the processors as well as partitioning the available SPM budget among those processors are two critical issues in reducing the overall computation time as well as the communication overhead. Traditionally, the step of task scheduling is applied separately from the memory partitioning step. Such a decoupled approach may miss better quality schedules. In this paper, we present an effective heuristic that integrates task allocation and SPM partitioning to further reduce the execution time of embedded applications. Results on several real life benchmarks show the significant improvement of our proposed technique compared to decoupled techniques as well as to an integer-linear programming approach.
Facilitating the communication between Malaysian grandparents and grandchildren living abroad through computer-mediated communication
Authors: N. Jomhari
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

The main focus of this research is to design a Computer-Mediated Communication system that is easily used bygrandparents (GP) and grandchildren (GC) separated by physical distance. An effective and usable design solution requires an understanding of its users and context, and therefore this project also aims to understand the nature of the communication failures and successes in GP-GC relationship and how physical distance and technology change this relationship, especially in Eastern (more specifically Malaysian) culture, which has not been studied extensively in published GP-GC communication literature.
Parallel hopfield networks
Authors: Robert C. Wilson
Venue: Neural Computation (2009)

We introduce a novel type of neural network, termed the parallel Hopfield network, that can simultaneously effect the dynamics of many different, independent Hopfield networks in parallel in the same piece of neural hardware. Numerically we find that under certain conditions, each Hopfield subnetwork has a finite memory capacity approaching that of the equivalent isolated attractor network, while a simple signal-to-noise analysis sheds qualitative, and some quantitative, insight into the workings (and failures) of the system.
Fast communication: Proportionate normalized subband adaptive filter algorithms for sparse system identification
Authors: Mohammad Shams Esfand Abadi
Venue: Signal Processing (2009)

In this paper, the concept of proportionate adaptation is extended to the normalized subband adaptive filters (NSAFs) and four proportionate adaptive filters are established. The proposed algorithms are proportionate normalized subband adaptive filter (PNSAF), @m-law PNSAF (MPNSAF), improved PNSAF (IPNSAF), and improved IPNSAF (IIPNSAF) which are suitable for sparse system identification. Simulation results show good performance of the proposed algorithms.
Mediation system for cooperative activities: knowledge system design
Authors: Victoria Eugenia Ospina Becerra, Alain-Jérôme Fougères
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In this article we present the use the knowledge for a Mediation System, developed to give support to mechanical system designer activities. The use of cooperative systems must contain a sufficient level of assistance to facilitate and coordinate the actor's activities. To accomplish this goal we introduce an artificial actor: the Mediator. To illustrate our approach we will present the specification of the knowledge of the Mediation System.
A computer game as a context for non-routine mathematical problem solving: The effects of type of question prompt and level of prior knowledge
Authors: Chun-Yi Lee, Ming-Puu Chen
Venue: Computers Education (2009)

The purpose of this study was to investigate the effects of type of question prompt and level of prior knowledge on non-routine mathematical problem solving. A computer game was blended within the pattern reasoning tasks, along with question prompts, in order to demonstrate and enhance the connections between viable problem-solving strategies and the content knowledge in a visible manner. Seventy-eight 9th graders from two classes in a public junior high school participated in the 6-week experimental instruction. Participants were randomly assigned to the specific-prompt group and the general-prompt group to receive the one-hour weekly treatment. The results revealed that (a) the interaction of question prompts and prior knowledge was not significant, and (b) for the problem-solving performances, the specific-prompt group outperformed the general-prompt group and the high prior-knowledge group outperformed the low prior-knowledge group. Further, students receiving specific prompts outperformed those receiving general prompts in the problem-solving performance: reasoning for two variables. Students with high prior knowledge outperformed those with low prior knowledge in the two problem-solving performances: reasoning for one variable and reasoning for two variables. It was also found that prior knowledge and comprehensive mathematical ability were important predictors for the two problem-solving performances: reasoning for one variable and reasoning for two variables. However question prompts and mathematics attitude were not significant predictors for predicting the problem-solving performance of reasoning for one variable. Lastly, implications for these results and recommendations for future research were discussed.
Isolating web programs in modern browser architectures
Authors: Charles Reis, Steven D. Gribble
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Many of today's web sites contain substantial amounts of client-side code, and consequently, they act more like programs than simple documents. This creates robustness and performance challenges for web browsers. To give users a robust and responsive platform, the browser must identify program boundaries and provide isolation between them. We provide three contributions in this paper. First, we present abstractions of web programs and program instances, and we show that these abstractions clarify how browser components interact and how appropriate program boundaries can be identified. Second, we identify backwards compatibility tradeoffs that constrain how web content can be divided into programs without disrupting existing web sites. Third, we present a multi-process browser architecture that isolates these web program instances from each other, improving fault tolerance, resource management, and performance. We discuss how this architecture is implemented in Google Chrome, and we provide a quantitative performance evaluation examining its benefits and costs.
Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal Perspective
Authors: Fernando Mourão, Leonardo Rocha, Lucas Miranda, Virgílio Almeida, Wagner Meira,  Jr.
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

Complex networks are a popular and frequent tool for modeling a variety of entities and their relationships. Understanding these relationships and selecting which data will be used in their analysis is key to a proper characterization. Most of the current approaches consider all available information for analysis, aggregating it over time. In this work, we studied the impact of such aggregation while characterizing complex networks. We model four real complex networks using an extended graph model that enables us to quantify the impact of the information aggregation over time. We conclude that data aggregation may distort the characteristics of the underlying real-world network and must be performed carefully.
Robust Key Exchange Protocol between Set-Top Box and Smart Card in DTV Broadcasting
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Informatica (2009)

Secure communication between set-top boxes (STBs) and smart cards is directly related to the benefit of the service providers and the legal rights of users, while key exchange is the essential part of a secure communication. In 2004, Jiang et al. proposed a key exchange protocol for STBs and smart cards based upon Schnorr's digital signature protocol and a one-way hash function. This paper, however, demonstrates that Jiang et al.'s protocol is vulnerable to an impersonation attack and does not provide perfect forward secrecy. In addition, in order to isolate such problems, we present a new secure key exchange protocol based on a one-way hash function and Diffie-Hellman key exchange algorithm.
PCA-Based Elman Neural Network Algorithm
Authors: Shifei Ding, Weikuan Jia, Chunyang Su, Xinzheng Xu, Liwen Zhang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

When we manipulate high dimensional data with Elman neural network, many characteristic variables provide enough information, but too many network inputs go against designing of the hidden-layer of the network and take up plenty of storage space as well as computing time, and in the process interfere the convergence of the training network, even influence the the accuracy of recognition finally. PCA,which is short for principal component analysis is a multivariate analysis method which transforms many characteristic variables to few synthetic variables. Not only can it eliminate relationship among characteristic variables but new variables can also hold most information of the original ones as well. In this paper we make full use of the advantages of PCA and the properties of Elman neural network structures to establish PCA-Elman based on PCA. The new algorithm reduces dimensions of the high dimensional data by PCA, and carry on network training and simulation with low dimensional data that we get, which obviously simplifies the network structure, and in the process, improves the training speed and generalization capacity of the Elman neural network. We prove the effectiveness of the new algorithm by case analysis. The algorithm improves the efficiency in network problems solving and is worth further generalizing.
Mobile Content Sharing Utilizing the Home Infrastructure
Authors: Petros Belimpasakis, Shahzad Akhtar Awan, Eleni Berki
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Mobile content sharing, as a practical concept, has had limited user acceptance. There is, though, a need for improving the communication and social interaction of people, and content sharing practices can prove to be a significant factor for creating a communication culture. Current available technologies for mobile content creation and sharing impose functionality and usability obstacles and are not widely used by mobile phone users. We propose a solution to ease and automate mobile content creation and sharing using a client-server system, in which client software runs on mobile device whereas server software runs on home PC. This solution principally automates mobile content sharing by reusing endusers' smart homes resources, such as storage and the Internet connections, without other parties' interventions or risks that might lead to privacy concerns. The system allows a group of mobile devices to create an alliance for the sake of content sharing. A prototype implementation proved the feasibility and usability of the concept, setting the baseline for further functionality enhancements in future research and development.
Hellboy II: The Golden Army
Authors: Alex Hope
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In "Hellboy II: The Golden Army," director Guillermo Del Toro (Pan's Labyrinth, Hellboy) takes the unlikely comic book hero to new heights in a visually stunning sequel to the first installment, "Hellboy." After an ancient truce existing between humankind and the invisible realm of the fantastic is broken, Hell is ready to erupt. The ruthless leader, Prince Nuada (Luke Goss), seeks to reunite the three golden pieces of the royal crown and raise a mythical Golden Army against the humans. Only Hellboy (Ron Perlman) and his friends in the Bureau for Paranormal Research and Defence can stop him.
The Study of Filtration of Two Phase Fluid in a Porous Medium in a Class of Discontinuous Functions
Authors: Mahir Rasulov, R. Haluk Kul
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this study a new numerical method for obtaining the solution of the problem for 2-D system of equations which describes the filtration of the multi-phase fluid in porous medium with suitable initial and boundary conditions is proposed. For this aim, the special auxiliary problem having some advantages over the main problem is introduced. An efficient and accurate numerical algorithm based on the auxiliary problem is derived. Furthermore, some results of numerical experiments from the related subjects of physics are presented.
Parallel sorting machines: their speed and efficiency
Authors: Leon E. Winslow, Yuan-Chieh Chow
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A unified approach for analyzing and classifying parallel sorting machines is discussed. The approach accounts for a number of important factors that have significant impacts on the measure of the size and complexities of parallel sorters. These factors include the sorter architectures, sequential/parallel input, single/multiple passes, and the base of the comparitors. An efficiency measure is also introduced to describe the optimality and other general characteristics of the sorters. Finally, a new sorter with the time complexity of O(c*logbN), where b is an arbitrary base, is proposed. Its efficiency is independent of the number of processors, the size of the list, and the maximum value in the list.