ppxscal/embedding_network huggingface dataset:
Fast Animation of Lightning Using an Adaptive Mesh
Authors: Theodore Kim Ming C. Lin
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a fast method for simulating, animating, and rendering lightning using adaptive grids. The "dielectric breakdown model” is an elegant algorithm for electrical pattern formation that we extend to enable animation of lightning. The simulation can be slow, particularly in 3D, because it involves solving a large Poisson problem. Losasso et al. recently proposed an octree data structure for simulating water and smoke, and we show that this discretization can be applied to the problem of lightning simulation as well. However, implementing the incomplete Cholesky conjugate gradient (ICCG) solver for this problem can be daunting, so we provide an extensive discussion of implementation issues. ICCG solvers can usually be accelerated using "Eisenstat's trick,” but the trick cannot be directly applied to the adaptive case. Fortunately, we show that an "almost incomplete Cholesky” factorization can be computed so that Eisenstat's trick can still be used. We then present a fast rendering method based on convolution that is competitive with Monte Carlo ray tracing but orders of magnitude faster, and we also show how to further improve the visual results using jittering.
A Survey on Trust and Privacy Negotiability in the Norwegian Mobile Telecom Market
Authors: Stig F. Mjølsnes, Marius Teigen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We investigate, by method of statistical survey, people's attitudes toward privacy, trust and personal information sharing in the context of price discrimination effects in the mobile telecom market, by asking a selection of 546 individuals, a sample size that is sufficient to be representative for the Norwegian mobile market of consumers. Common wisdom tells that people value their privacy, but not much facts have been collected about how much people value privacy, say, as consumers of specific services in the mobile market. Moreover, it is reasonable to expect that individuals will differ in their negotiability of personal information vs price of service. In this study, we measure a strong privacy negotiability correlated to age and income, thus confirming common intuition about this. We find that technically assuring anonymity of service will significantly affect and facilitate the user's willingness to release personal information to the service provider, in particular with respect to information about specific buying preferences and frequent travel destinations. Somewhat surprising, a practice of targeted advertisement in exchange for lower mobile service price is acceptable to about half the population.
Blind separation of voice modulated single-side-band using the multi-target variable modulus algorithm
Authors: J. D. Fite
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper introduces a blind algorithm for adaptive array processing, the multi-target variable modulus algorithm (MT-VMA), which can blindly separate multiple voice-modulated single-side-band (SSB) signals in the presence of strong co-channel interference. This algorithm does not require estimation of direction of arrival (DOA) or receiver calibration data to separate the signals-of-interest (SOIs). The paper presents simulations results demonstrating the use of the MT-VMA to blindly separate six overlapped SSB voice signals received by a six-element antenna array in the HF frequency band.
Spike: an optimizer for alpha/NT executables
Authors: Robert Cohn, David Goodwin, P. Geoffrey Lowney, Norman Rubin
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

Spike is a profile-directed optimizer for Alpha/NT executables that is actively being used to optimize shipping products. Spike consists of the Spike Optimization Environment (SOE) and the Spike Optimizer. Through both a graphical interface and a command-line interface, the Spike Optimization Environment provides a simple means to instrument and optimize large applications consisting of many images. SOE manages the instrumented and optimized images as well as any profile information collected for those images, freeing the user from many tedious and error-prone tasks typically associated with profile-directed optimization. SOE also simplifies the collection of profile information with Transparent Application Substitution (TAS). With TAS, the user invokes the original version of the application and the instrumented or optimized version of the application is transparently executed in its. SOE uses the Spike Optimizer to optimize images. The Spike Optimizer performs code layout to improve instruction cache behavior [Pettis90], hot cold optimization [Cohn96] and register allocation. The optimizations are targeted at large call-intensive applications, where loops span multiple routines, and each routine contains complex control-flow. For this class of applications, Spike provides significant performance improvement, reducing execution time by as much as 20%.
Conceptual design using a synergistically compatible morphological matrix
Authors: R. G. Weber
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The morphological matrix is a key methodology that can improve the effectiveness of the concept generation phase of the design process. However, as discussed in the paper, there are difficulties identifying independent design functions and determining the synergistic compatibility of combining solution alternatives. In order to address these difficulties, the authors extend the morphological matrix methodology by including the theory of coupling. A case study is presented to illustrate the overall methodology and its impact.
WLAN Mesh Network Interference Management Using FSO Link Deployment
Authors: Valavan Rajakumar, Mohammed N. Smadi, Sasthi C. Ghosh, Terence D. Todd, Steve Hranilovic
Venue: Proceedings of the Third International Conference on Wireless and Mobile Communications (2007)

Frequency channels are assigned in wireless LAN mesh networks subject to strict co-channel interference constraints. Since Wi-Fi may be freely used by other networks, added interference may eventually invalidate the original frequency assignment, making full link activation impossible. In this paper we address this problem by selectively installing supplementary free space optical (FSO) links when RF link performance has deteriorated. We first formulate the channel assignment problem with the objective of maximizing the number of simultaneous link activations while satisfying cumulative RF interference constraints. A proof is given for the NP-completeness of the joint frequency assignment and FSO link placement problem. We then propose an efficient heuristic to solve the channel assignment problem using a genetic algorithm. Our comparisons show that the proposed algorithm gives good results compared with computed bounds.
Real-World Implications of Digital Forensics: Technical, Methodological & Procedural Hurdles
Authors: Philip Attfield, Stephen Schroeder
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

This panel will discuss the issues and challenges that need to be taken into consideration when bringing laboratory Digital Forensic Science into the courtroom. Panelists and audience are encouraged to think about everything that was involved when laboratory DNA, its analysis and implications were first presented in court. The discussion will include 1) a brief overview of the technology, methodology or process and its objectives and limitations 2) a summary of what perceived challenges could be: technical complexity, jargon, challenges in deployment (e.g., education & training requirements for digital forensic laboratory personnel) 3) discussion of "lay person" challenges (e.g., courtroom presentation to jury, judge, and those involved in investigation, prosecution and defense; identification of educational analogies that facilitate understanding and presentation).
Approximating nash equilibria using small-support strategies
Authors: Tomas Feder, Hamid Nazerzadeh, Amin Saberi
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

We study the problem of finding approximate Nash equilibria of two player games. We show that for any 0<ε<1, there is no 1<over>1 + ε - approximate equilibrium with strategies of support O(log n<over>ε2).
A stochastic diffusion approach to signal denoising
Authors: H. Krim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

We present a stochastic formulation of a linear diffusion equation (or heat equation), and in light of the potential applications ranging from signal denoising to image enhancement/segmentation of its nonlinear extensions, we propose a more general nonlinear stochastic diffusion. The constructed stochastic framework, in contrast to traditional deterministic approaches, unveils the sources of existing limitations and allows us to further significantly improve the performance by addressing the key problem. Substantiating examples are provided.
On Fq-linear sets of PG(3,q3) and semifields
Authors: Giuseppe Marino, Olga Polverino, Rocco Trombetti
Venue: Journal of Combinatorial Theory Series A (2007)

Any finite semifield 2-dimensional over its left nucleus and 2n-dimensional over its center defines a linear set of rank 2n of PG(3,q^n) disjoint from a hyperbolic quadric and conversely [G. Lunardon, Translation ovoids, J. Geom. 76 (2003) 200-215]. Using this connection, semifields 2-dimensional over their left nucleus and 4-dimensional over their center were classified [I. Cardinali, O. Polverino, R. Trombetti, Semifield planes of order q^4 with kernel F"q"^"2 and center F"q, European J. Combin. 27 (2006) 940-961]. In this paper we give a characterization result in the case n=3, proving that there exist five or six non-isotopic families of such semifields, the families F"i, i=0,...,5 (F"3 might be empty), according to the different configurations of the associated linear sets of PG(3,q^3). Also, we prove that to any semifield belonging to the family F"5 is associated an F"q-pseudoregulus of PG(3,q^3) and we characterize the known examples of semifields of the family F"5 in terms of the associated F"q-pseudoregulus.
A RBF classifier with supervised center selection and weighted norm
Authors: Rong Liu, Yong Shi
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

A variation of RBF (radial basis function) classifier based on supervised (or adaptively) ceneter selection and weighted norm is formulated and then tested in labeling overlapped data sets generated from two binormal distributions in this paper. Besides its simplicity, the experimental results and the comparsions to other classifiers suggest that this method is significant in capability owing to offering reasonable classifications with mild computation costs. Moreover, this variation outperforms the RBF based on exact interpolation not just in accuracy but in efficiency as well.
Simulating Self-replicating Machines
Authors: William M. Stevens
Venue: Journal of Intelligent and Robotic Systems (2007)

A simulation framework is described in which sliding tiles moving in a discrete two-dimensional grid can be put together to build machines. The tiles can perform logical and mechanical functions, and can be connected to each other. A self-replicating machine has been designed in this environment and its operation is summarised. Observations are made about the usefulness and the limitations of the machine and its environment, and several ways in which the limitations could be addressed are described. A justification of the simulation approach for modelling self-replicating systems is given.
Multi-Agent Architecture for Knowledge Discovery
Authors: Daniel Pop, Viorel Negru, Calin Sandru
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Knowledge Discovery from Databases (KDD) is a complex process composed of several phases: business understanding, data understanding, data preparation, modeling, evaluation and deployment. For each of the phases, there are many algorithms and methods available, the end-user having to select one of them. The AgentDiscover is a multi-agent based intelligent recommendation system for selection of the most appropriate solving method for each phase. This brings added value for both novice and experienced users.
Mobile G-Portal supporting collaborative sharing and learning in geography fieldwork: an empirical study
Authors: Yin-Leng Theng, Kuah-Li Tan, Ee-Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Integrated with G-Portal, a Web-based geospatial digital library of geography resources, this paper describes the implementation of Mobile G-Portal, a group of mobile devices as learning assistant tools supporting collaborative sharing and learning for geography fieldwork. Based on a modified Technology Acceptance Model and a Task-Technology Fit model, an initial study with Mobile G-Portal was conducted involving 39 students in a local secondary school. The findings suggested positive indication of acceptance of Mobile G-Portal for geography fieldwork. The paper concludes with a discussion on technological challenges, recommendations for refinement of Mobile G-Portal, and design implications in general for digital libraries and personal digital assistants supporting mobile learning.
A Resource Synchronization Protocol for Multiprocessor Real-Time Systems
Authors: Chia-Mei Chen, Satish K. Tripathi, Alex Blackmore
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.
A Model for Massively Multiplayer Role-Playing Games System Performance
Authors: Jiyi Wu, Xiangguo Gong, Jiwen Zheng
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Massively multiplayer role-playing games (MMORPGs), are among the most popular types of online game. After the introduction of a typical multitiered client/server architecture for MMORPGs, a method for modeling MMORPG system performance is presented. Then experimental and analytical results for a zoned MMORPG and a seamless MMORPG are proposed. The performance model presented here can be used for automated IT resource allocation at runtime and is thus useful in the context of utility computing and on demand systems.
Demystifying Data-Driven and Pausible Clocking Schemes
Authors: Robert Mullins, Simon Moore
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

VLSI systems are often constructed from a multitude of independently clocked synchronous IP blocks. Unfortunately, while a synchronous design style may produce efficient block level implementations it does little to support their composition. The addition of asynchronous interfaces to each synchronous block is one way to simplify and strengthen their integration. Asynchronous interfaces allow blocks to be composed without the need to consider synchronisation failure rates, permit data-driven operation and provide greater freedom when designing on-chip buses and networks. This paper surveys the significant body of published work in this area. We highlight similarities between schemes that are often concealed by differences in specification or circuit style. We also present new local clock implementations and provide solutions to mitigate the effect of clock-tree insertion delays. The ultimate goal of this work is to permit multi-clock synchronous systems to be composed simply, robustly and efficiently.
Supporting automatic configuration of component-based distributed systems
Authors: Fabio Kon, Roy H. Campbell
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Recent developments in Component technology enable the construction of complex software systems by assembling together off-the-shelf components. However, it is still difficult to develop efficient, reliable, and dynamically configurable component-based systems. Components are often developed by different groups with different methodologies. Unspecified dependencies and behavior lead to unexpected failures. Component-based software systems must maintain explicit representations of inter-component dependence and component requirements. This provides a common ground for supporting fault-tolerance and automating dynamic configuration. In this paper, we present a generic model for reifying dependencies in distributed component systems and discuss how it can be used to support automatic configuration. We describe our experience deploying the framework in a CORBA-compliant reflective ORB and discuss the use of this model in a new distributed operating system.
A distributed programming environment from the ground up: pvmsync
Authors: Andrew Pitman
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

My talk will cover my reasons for developing pvmsync, what it is, what it does (and doesn't do), and how I designed it. Essentially, I will cover how I created this package from the ground up, including protocols used (and designed) and the design of the client library.
Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization
Authors: Pradip K. Srimani, Zhenyu Xu
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms.
Humanistic and modern education for engineering in the new society
Authors: C. da Rocha Brito
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The education scheme of the UNILUS Engineering Program consists of some courses in nontechnical areas, which are considered important for a more suitable formation so that the future engineer is a professional of high quality, and capable of facing challenges of the new century work market. The curriculum contains some courses in social science added to the basic science courses, basic science of engineering courses and specific engineering courses. The social science courses are philosophy, human resources, development of projects, management strategies, and assisted training period and in 1999 sociology was included. For the year 2000 a change has become necessary and so development of projects was replaced by environmental consciousness. The goal is to enrich the engineering program providing the students with more knowledge about the importance of the environment in engineering practice.
Learning continuous models for estimating intrinsic component images
Authors: Edward H. Adelson, William T. Freeman
Venue:  (2006)

The goal of computer vision is to use an image to recover the characteristics of scene, such as its shape or illumination. This is difficult because an image is the mixture of multiple characteristics. For example, an edge in an image could be caused by either an edge on a surface or a change in the surface's color. Distinguishing the effects of different scene characteristics is an important step towards high-level analysis of an image. This thesis describes how to use machine learning to build a system that recovers different characteristics of the scene from a single, gray-scale image of the scene. The goal of the system is to use, the observed image to recover images, referred to as Intrinsic Component Images, that represent the scene's characteristics. The development of the system is focused on estimating two important characteristics of a scene, its shading and reflectance, from a single image. From the observed image, the system estimates a shading image, which captures the interaction of the illumination and shape of the scene pictured, and an albedo image, which represents ow the surfaces in the image reflect light. Measured both qualitatively and quantitatively, this system produces state-of-the-art estimates of shading and albedo images. This system is also flexible enough to be used for the separate problem of removing noise from an image. Building this system requires algorithms for continuous regression and learning the parameters of a Conditionally Gaussian Markov Random Field. Unlike previous work, this system is trained using real-world surfaces with ground-truth shading and albedo images. The learning algorithms are designed to accommodate the large amount of data in this training set. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Securing web service by automatic robot detection
Authors: KyoungSoo Park, Vivek S. Pai, Kang-Won Lee, Seraphin Calo
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Web sites are routinely visited by automated agents known as Web robots, that perform acts ranging from the beneficial, such as indexing for search engines, to the malicious, such as searching for vulnerabilities, attempting to crack passwords, or spamming bulletin boards. Previous work to identify malicious robots has relied on ad-hoc signature matching and has been performed on a per-site basis. As Web robots evolve and diversify, these techniques have not been scaling. We approach the problem as a special form of the Turing test and defend the system by inferring if the traffic source is human or robot. By extracting the implicit patterns of human Web browsing, we develop simple yet effective algorithms to detect human users. Our experiments with the CoDeeN content distribution network show that 95% of human users are detected within the first 57 requests, and 80% can be identified in only 20 requests, with a maximum false positive rate of 2.4%. In the time that this system has been deployed on CoDeeN, robot-related abuse complaints have dropped by a factor of 10.