ppxscal/embedding_network huggingface dataset:
Flow Characteristics around a Rotating Grooved Circular Cylinder with Grooved of Different Depths
Authors: S. Takayama, K. Aoki
Venue: Journal of Visualization (2005)

The present paper describes the flow characteristics around a rotating grooved circular cylinder with grooves of different depths. The surface structure of a circular cylinder was varied by changing the depths of 32 arc grooves on the surface. The surface pressure on the cylinder is measured for the Re range of from 0.4 &times;10$^5$ to 1.8&times;10$^5$ and for rotations of from 0 to 4500 rpm. The drag coefficient of a grooved cylinder increases as the spin rate ratio &alpha; (= rotational speed of the cylinder surface/uniform velocity) increases for Re > 1.0&times;10$^5$. As the groove depth increases, the drag coefficient of a grooved cylinder is independent from the spin rate ratio &alpha;. The direction of the lift force of a smooth cylinder is opposite to the Magnus force for Re > 1.0&times;10$^5$. However, the direction of the lift force of a grooved cylinder is the same as that of the Magnus force for all Re > 1.0&times;10$^5$. As the groove depth increases, the increase in the slope of the lift coefficient becomes small. These phenomena are related to the positions of the flow separation points, which are clarified from the pressure distribution and flow visualization by the spark tracing method. In addition, in the present study, the flow around a rotating grooved cylinder is clarified by flow visualization.
From ML to MLF: graphic type constraints with efficient type inference
Authors: Didier Rémy, Boris Yakobowski
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or MLF. We show that this constraint system is a small extension of the formalism of graphic types, originally introduced to represent MLF types. We give a few semantic preserving transformations on constraints and propose a strategy for applying them to solve constraints. We show that the resulting algorithm has optimal complexity for MLF type inference, and argue that, as for ML, this complexity is linear under reasonable assumptions.
An Approach to Modelling and Verification of Component Based Systems
Authors: Gregor Gössler, Sussane Graf, Mila Majster-Cederbaum, M. Martens, Joseph Sifakis
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We build on a framework for modelling and investigating component-based systems that strictly separates the description of behavior of components from the way they interact. We discuss various properties of system behavior as liveness, local progress, local and global deadlock, and robustness. We present a criterion that ensures liveness and can be tested in polynomial time.
Pulse density Hopfield neural network system with learning capability using FPGA
Authors: Yutaka Maeda, Yoshinori Fukuda
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper, we present a FPGA Hopfield Neural Network system with learning capability using the simultaneous perturbation learning rule. In the neural network, outputs and internal values are represented by pulse train. That is, analog Hopfield Neural Network with pulse frequency representation is considered. The pulse density representation and the simultaneous perturbation enable the system with learning capability to easily implement as a hardware system. Details of the design are described. Analog and digital examples are also shown to confirm a viability of the system configuration and the learning capability.
Model-Driven Security in Practice: An Industrial Experience
Authors: Manuel Clavel, Viviane Silva, Christiano Braga, Marina Egea
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

In this paper we report on our experience on using the so-called model-driven security approach in an MDA industrial project. In model-driven security, "designers specify system models along with their security requirements and use tools to automatically generate system architectures from the models." Our report includes a discussion of the languages that we used to model both the functional and the security system's requirements, as well as a description of the transformation function that we developed to build from the security-design models the system's access control infrastructure. The report concludes with the lessons about the feasibility and practical industrial relevance of the model-driven security approach that we learned from this experience.
Forensic analysis of database tampering
Authors: Kyriacos E. Pavlou, Richard T. Snodgrass
Venue: ACM Transactions on Database Systems (TODS) (2008)

Regulations and societal expectations have recently expressed the need to mediate access to valuable databases, even by insiders. One approach is tamper detection via cryptographic hashing. This article shows how to determine when the tampering occurred, what data was tampered with, and perhaps, ultimately, who did the tampering, via forensic analysis. We present four successively more sophisticated forensic analysis algorithms: the Monochromatic, RGBY, Tiled Bitmap, and a3D algorithms, and characterize their &ldquo;forensic cost&rdquo; under worst-case, best-case, and average-case assumptions on the distribution of corruption sites. A lower bound on forensic cost is derived, with RGBY and a3D being shown optimal for a large number of corruptions. We also provide validated cost formul&aelig; for these algorithms and recommendations for the circumstances in which each algorithm is indicated.
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation
Authors: Grzegorz Rozenberg
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

Natural computing refers to computation taking place in nature and to humandesigned computation inspired by nature. When complex phenomena going on in nature are viewed as computational processes, our understanding of these phenomena and of the essence of computation is enhanced. On the other hand human-designed computing inspired by nature has had already a big impact on the development of computer science (think, e.g., about neural computing, evolutionary computing, molecular computing and quantum computing).
Frequency Domain Filter Design and Analysis of Request Scheduling in Internet Servers
Authors: Minghua Xu, Cheng-Zhong Xu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Internet traffic has a characteristic of strong correlation. This traffic characteristic greatly complicates the problem of server performance modeling and optimization. Conventional time domain analysis has limitations in the study of the impact of complex traffic on server performance, because self-similarity of Internet traffic is often characterized in frequency domain. In this paper, we present a frequency domain filter model to characterize the relationship between server capacity, resource allocation, and service quality for general input traffic. Power spectral density (PSD) shows the strength of variations (power) as a function of frequency. By the model, server scheduler operates as a filter of input traffic that transforms its PSD function into another PSD function of server utilization process. The optimality of the scheduler in second-order statistics is to minimize the power leakage in the transformation. Most Internet traffic has monotonically decreasing PSD functions. For this type of input traffic, we prove that the optimal schedulers have a convex structure. Uniform allocation is an extreme case of the convexity and is proven to be optimal for traffic of independent arrivals. We integrate the convex-structured scheduling principle with GPS discipline and show that the enhanced GPS policy improves the service quality significantly.
The virtual museum of sculpture
Authors: M. Carrozzino, C. Evangelista, A. Scucces, F. Tecchia, G. Tennirelli, M. Bergamasco
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper presents the Virtual Museum of Sculpture (VMS) of Pietrasanta, a permanent Virtual Reality installation enabling users to interactively explore a museographical diffused virtual space. The virtual environment hosts several digital 3D models of sculptures realized by important Italian artists of the XX century, connected for historical and cultural reasons with the town of Pietrasanta, a renowned place near the marble quarries of Alpi Apuane. The VMS is currently being enriched of new content, aimed at promoting local art and culture, with the perspective of developing guidelines for an integrated methodology sharing museological and ICT know-hows, targeted to the design of specific virtual applications and to the qualitative evaluation of their social impact as a novel important means of communication and learning.
Model-Based Analysis of Network Reconfigurations Using Graph Transformation Systems
Authors: Ajab Khan
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

P2P VoIP traffic potentially suffers from performance issues like packet loss, delay, jitter and echo [1], which greatly affect the quality of the service (QoS). Packet loss and delay mostly occur due to network reconfiguration caused by peer dynamics. In case of VoIP traffic, the network has to recover fast enough so that the quality of service is not affected [2]. 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
Design of T-S Fuzzy Model Based on PSODE Algorithm
Authors: Ben Niu, Li Li
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper presents a novel fuzzy modeling strategy based on the hybrid of particle swarm optimization (PSO) and differential evolution (DE), and the proposed hybrid algorithm is referred to as PSODE. PSODE is based on a two-population scheme, in which the individuals in one population is enhanced by PSO and the individuals in the other population is evolved by DE. The individuals both in PSO and DE are co-evolved during the algorithm execution by employing an information sharing mechanisms. To further improve the proposed PSODE algorithm a nonlinear inertia weight approach and a mutation mechanism are presented respectively. In the simulation part, the PSODE is used to automatic design of fuzzy identifier for a nonlinear dynamic system. The performance of the suggested method is compared to PSO, DE and some other methods in the fuzzy identifier design to demonstrate its superiority.
Immersive Visual Data Mining: The 3DVDM Approach
Authors: Henrik R. Nagel, Erik Granum, Søren Bovbjerg, Michael Vittrup
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

A software system has been developed for the study of static and dynamic data visualization in the context of Visual Data Mining in Virtual Reality. We use a specific data set to illustrate how the visualization tools of the 3D Visual Data Mining (3DVDM) system can assist in detecting potentially interesting non-linear data relationships that are hard to discover using traditional statistical methods of analysis. These detected data structures can form a basis for specification of further explanatory statistical analysis. The visualization tools are shown to reveal many interesting patterns and in particular the dynamic data visualization appears to have a very promising potential.To further explore the human faculties, sound has also been used to represent statistical data. Current technology enables us to create advanced real-time 3D soundscapes which may prove useful since the human ears' field of hearing is larger than the eyes' field of view, and thus is able to inform us on events happening in areas that we cannot see. The audio-visual tools in the 3DVDM system are tested and the effectiveness of them is discussed for situations where sound acts as support for visual exploration, as well as use of sound as a sole cue for analyzing data in VR.
Stochastic Modelling and Simulation of Coupled Autoregulated Oscillators in a Multicellular Environment: The her1/her7 Genes
Authors: André Leier, Kevin Burrage, Pamela Burrage
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Delays are an important feature in temporal models of genetic regulation due to slow biochemical processes such as transcription and translation. In this paper we show how to model intrinsic noise effects in a delayed setting. As a particular application we apply these ideas to modelling somite segmentation in zebrafish across a number of cells in which two linked oscillatory genes her1 and her7 are synchronized via Notch signalling between the cells.
An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-Wireless Networks
Authors: Doina Bein, S. Q. Zheng
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Given a wireless network in which node positions are fixed and a specific source node r in the network, the minimum energy broadcasting problem (MEB) asks each node to adjust its transmission range to create a spanning tree rooted at r with minimum total energy. This problem is NP-complete for both general graphs as well as Euclidean space graphs.We propose a heuristic algorithm, called Greedy Tradeoff (GT) algorithm for the MEB problem. We compare the broadcasting trees computed by our GT algorithm with the broadcasting trees computed by two previously proposed algorithms, BIP and IMBM, in terms of total power, tree height, and the number of leave nodes. Our results show that the performance of our GT algorithm is better than the performances of BIP and IMBM.
Software and technologies designed for people with autism: what do users want?
Authors: Cynthia Putnam, Lorna Chong
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Software developers, designers and researchers have been looking to technology for solutions to help and educate people with autism for over two decades. There are many examples of seemingly successful technology-based products and prototypes, yet very little is known about how well these solutions are currently integrated into lives of children and adults with autism and their families. This paper reports on results from an anonymous on-line survey intended as a first step to elucidate information about software and technology use. Additionally, data was analyzed to aid creation of future technology-based products for people with autism that are not just effective, but that also meet important user goals and align to their interests and strengths. Major findings included: (1) very few respondents (25\%) had any experience with software or technology designed for people with cognitive disabilities; (2) when asked an open-ended question about what they desire in technology design, respondents reported three major goals (social skills, academic skills, and organization skills), and many suggestions for improvements to software and hardware design; and (3) technology was reported as both a major strength and interest for people with autism.
Radar Signal Detection Based on the Slope of Singular Curve
Authors: Mingshun Ai, Hongguang Ma, Linghuan Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A novel method based on the slope of singular curve (SOSC) is proposed in this paper, which is aiming at the signal detection in radar reconnaissance. The SOSC reflects the component rather than the power of the signal, and it is more sensitive to distinguish the radar pulse signals from background noises. Beside that, detecting the pulse signals by their pulse width is adopted, which can farther reduce the false alarm rate. In a low signal noise ratio (SNR) condition, the SOSC based detection method possesses a good performance. The computer simulation with typical radar pulse signals shows that, given the SNR is -2dB and the false alarm rate is 10-3, the detection probability is near to 90 %.
A tabu search algorithm for the global planning problem of third generation mobile networks
Authors: Marc St-Hilaire, Steven Chamberland, Samuel Pierre
Venue: Computers and Electrical Engineering (2008)

In this paper, we propose a tabu search (TS) algorithm for the global planning problem of third generation (3G) universal mobile telecommunications system (UMTS) networks. This problem is composed of three NP-hard subproblems: the cell, the access network and the core network planning subproblems. Therefore, the global planning problem consists in selecting the number, the location and the type of network nodes (including the base stations, the radio network controllers, the mobile switching centers and the serving GPRS (General Packet Radio Service) support nodes) as well as the interconnections between them. After describing our metaheuristic, a systematic set of experiments is designed to assess its performance. The results show that quasi-optimal solutions can be obtained with the proposed approach.
Cryptanalysis of the Modified Remote Login Authentication Scheme Based on a Geometric Approach
Authors: Chin-Chen Chang, Iuon-Chang Lin
Venue: Informatica (2005)

In 1995, Wu proposed a remote login authentication scheme based on geometric approach. However, Chien, Jan and Tseng presented a cryptanalysis of Wu's scheme to show that it is not secure. Moreover, they proposed a modified version of Wu's scheme. This paper presents there is a serious weakness in this modified remote login authentication scheme. We show that an illegal user can easily forge a valid login request in the modified version proposed previously.
Optimal Dimensional Synthesis of a Dual Purpose Haptic Exoskeleton
Authors: Ramazan Unal, Volkan Patoglu
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper presents multi-criteria design optimization of a 3RPS-R parallel mechanism to be employed as a dual purpose haptic exoskeleton for human forearm and wrist. The primary use for the optimized device is aimed as a high fidelity haptic interface, while the exoskeleton can also be employed as a rehabilitation device. Multiple design objectives are discussed and classified for both application scenarios, and optimization problems to study the trade-offs between these criteria are formulated. A general framework for optimization of haptic interfaces is applied to efficiently obtain the Pareto-front hyper-surfaces between conflicting criteria. Optimal dimensional synthesis of the dual purpose haptic exoskeleton is demonstrated.
A Visual and Interactive Data Exploration Method for Large Data Sets and Clustering
Authors: David Costa, Gilles Venturini
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

We present in this paper a new method for the visual exploration of large data sets with up to one million of objects. We highlight some limitations of the existing visual methods in this context. Our approach is based on previous systems like Vibe, Sqwid or Radviz which have been used in information retrieval: several data called points of interest (POIs) are placed on a circle. The remaining large amount of data is displayed within the circle at locations which depend on the similarity between the data and the POIs. Several interactions with the user are possible and ease the exploration of the data. We highlight the visual and computational properties of this representation: it displays the similarities between data in a linear time, it allows the user to explore the data set and to obtain useful information. We show how it can be applied to standard 'small' databases, either benchmarks or real world data. Then we provide results on several large, real or artificial, data sets with up to one million data. We describe then both the successes and limits of our method.
Automated Detection of Optic Disc Location in Retinal Images
Authors: Carmen Alina Lupascu, Domenico Tegolo, Luigi Di Rosa
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This contribution presents an automated method to locate the optic disc in color fundus images. The method uses texture descriptors and a regression based method in order to determine the best circle that fits the optic disc. The best circle is chosen from a set of circles determined with an innovative method, not using the Hough transform as past approaches. An evaluation of the proposed method has been done using a database of 40 images. On this data set, our method achieved 95% success rate for the localization of the optic disc and 70% success rate for the identification of the optic disc contour (as a circle).
Blind Estimation of Motion Blur Parameters for Image Deconvolution
Authors: João P. Oliveira, Mário A. Figueiredo, José M. Bioucas-Dias
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper describes an approach to estimate the parameters of a motion blur (direction and length) directly form the observed image. The motion blur estimate can then be used in a standard non-blind deconvolution algorithm, thus yielding a blind motion deblurring scheme. The estimation criterion is based on recent results about the general spectral behavior of natural images. Experimental results show that the proposed approach is able to accurately estimate both the length and orientation of motion blur kernels, even for small lengths which are traditionally difficult.
Proposal for a Structure Mark-Up Supporting Accessibility for the Next Generation (X)HTML-Standards
Authors: Gerhard Nussbaum, Mario Batusic, Claudia Fahrengruber, Klaus Miesenberger
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The layout of most web pages consists of several logical blocks or page areas which reflect the global structure of the page content. The recommended and published standards HTML 4.01 and XHTML 1.0 do not support an adequate global structuring in the mark-up which leads to accessibility and usability problems. The upcoming new standards HTML 5 and XHTML 2 introduce some structure mark-up. It is feared that this new mark-up does not improve the accessibility significantly due to the flexibility in applying it. This paper will critically examine this new structure mark-up regarding accessibility. Furthermore it proposes an alternative mark-up definition for the global page structure which should help to improve accessibility significantly.
Moving Happily through the World Wide Web
Authors: Nahum Gershon
Venue: IEEE Computer Graphics and Applications (1996)

"... people are required to conform to technology. It is time to reverse this trend, time to make technology conform to people".Donald A. Norman"Designing the Future"Scientific American, Sept. 1995