ppxscal/embedding_network huggingface dataset:
Buoyancy and local friction effects on rockfill settlements: A discrete modelling
Authors: C. Silvani, S. Bonelli, P. Philippe, T. Desoyer
Venue: Computers Mathematics with Applications (2008)

Measured displacements in the upstream shell of rockfill dams show some settlements which can reach a few meters with water levels changes, especially during the first impounding, whereas downstream displacements are smaller. Complementary phenomena are responsible for rockfill collapse due to wetting. Here we numerically investigate the effects of buoyancy forces and the decrease in the coefficient of friction with water on a rockfill column maintained by vertical rigid walls and progressively filled with water. Numerical simulations of the settlements of the rockfill column, using the Contact Dynamics method, are presented. Buoyancy forces seem to have only a negligible influence on the granular pile. Decrease in the friction angle of the rock with water induces rearrangements of the medium, all the more as the decrease is significant. These dynamic rearrangements exhibit an irregular temporal evolution of the granular medium which can be characterized by a phenomenon of local ''crisis''. Analysis of the settlements shows that these two combined effects are not the major cause of the settlements observed in rockfill dams and that they cannot in particular explain the settlements.
Clustering Spatial Data with Obstacles Constraints by PSO
Authors: Xueping Zhang, Fen Qin, Jiayao Wang, Yongheng Fu, Jinghui Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper proposes a particle swarm optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use PSO to get obstructed distance, and then we developed the PSO K-Medoids SCOC (PKSCOC) to cluster spatial data with obstacles constraints. The experimental results show that PKSCOC performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).
Error propagation of general linear methods for ordinary differential equations
Authors: J. C. Butcher, Z. Jackiewicz, W. M. Wright
Venue: Journal of Complexity (2007)

We discuss error propagation for general linear methods for ordinary differential equations up to terms of order p+2, where p is the order of the method. These results are then applied to the estimation of local discretization errors for methods of order p and for the adjacent order p+1. The results of numerical experiments confirm the reliability of these estimates. This research has applications in the design of robust stepsize and order changing strategies for algorithms based on general linear methods.
A Study about the Mapping of Process- Processor based on Petri Nets
Authors: Xianwen Fang, Zhicai Xu, Zhixiang Yin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In the design and analysis of discrete event systems, the validation of their models is often addressed via simulation. Petri nets have been applied widely. Lookahead computation is a good method that improves the distributed simulation performance of Timed Transition Petri Nets (TTPN). The approach is based on a part of optimism computed on the prediction time each logical process can determine for its advancement. Timed Petri nets meet these requirements, and use the lookahead to analyze the TTPN model for finding the concurrency and blocking structure, thereby making certain the logical process (LP). Based on the specialties of lookahead, the lookahead was applied in parallel simulation, and acquire the sufficient condition about the TTPN model existing concurrency. According to the condition, parallel program can be partitioned into several logical processes, and the partition algorithm that can decide quickly the mapping project on the mapping process-processor is presented.
A Distributed Infrastructure Supporting Personalized Services for the Mobile Web
Authors: Claudia Canali, Michele Colajanni, Riccardo Lancellotti, Philip S. Yu
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Personalized services are a key feature for the success of the next generation Web that is accessed by heterogeneous and mobile client devices. The need to provide high per- formance and to preserve user data privacy opens a novel dimension in the design of infrastructures and request dis- patching algorithms to support personalized services for the Mobile Web. Performance issues are typically addressed by distributed architectures consisting of multiple nodes. Per- sonalized services that are often based on sensitive user in- formation may introduce constraints on the service location when the nodes of the distributed architecture do not pro- vide the same level of security. In this paper, we propose an infrastructure and related dispatching algorithms that aim to combine performance and privacy requirements. The proposed scheme may efficiently support personalized ser- vices for the Mobile Web especially if compared with exist- ing solutions that separately address performance and pri- vacy issues. Our proposal guarantees that up to the 97% of the requests accessing sensitive user information are as- signed to the most secure nodes with limited penalty conse- quences on the response time.
Computation of storage requirements for multi-dimensional signal processing applications
Authors: Florin Balasa, Hongwei Zhu, Ilie I. Luican
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Many integrated circuit systems, particularly in the multimedia and telecom domains, are inherently data dominant. For this class of systems, a large part of the power consumption is due to the data storage and data transfer. Moreover, a significant part of the chip area is occupied by memory. The computation of the memory size is an important step in the system-level exploration, in the early stage of designing an optimized (for area and/or power) memory architecture for this class of systems. This paper presents a novel nonscalar approach for computing exactly the minimum size of the data memory for high-level procedural specifications of multidimensional signal processing applications. In contrast with all the previous works which are estimation methods, this approach can perform exact memory computations even for applications with numerous and complex array references, and also with large numbers of scalars.
A Goal Driven Configurable Service Workflow Model
Authors: Jian Cao, Haiyan Zhao, Yujie Mou, Minglu Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Service computing is being a prevailing software paradigm now and also becomes the underling supporting technology for grid environment. Since single service can only provide limited functions, they are often be combined by a service workflow model so that users requirements can be meet by executing some service workflow model. In order to support various users requests through a common workflow, the service workflow model should be configurable, i.e., they can be refined into different forms. A rule driven service workflow model is presented in the paper. And a goal driven service workflow customization method is introduced. A prototype system is also presented.
An Alphard Specification of a Correct and Efficient Transformation on Data Structures
Authors: J. L. Bentley
Venue: IEEE Transactions on Software Engineering (1980)

In this paper we study the problem of designing and specifying standard program components applicable to a wide variety of tasks; we choose for this study the specific problem domain of data structures for general searching problems. Within this domain Bentley and Saxe [1] have developed transformations for converting solutions of simple searching problems to solutions of more complex problems. We discuss one of those transformations, specify precisely the transformation and its conditions of applicability, and prove its correctness; we accomplish this by casting it in terms of abstract data types-specifically by using the Alphard form mechanism. The costs of the structures derived by this transformation are only slightly greater than the costs of the original structures, and the correctness of the transformation definition together with the correctness of the original structure assure the correctness of the derived structure. The transformation we describe has already been used to develop a number of new algorithms, and it represents a new level of generality in software engineering tools.
Comparative study of the influence of the solvent on the catalytic growth of carbon nanotubes
Authors: R. Engel-Herbert, H. Pforte, T. Hesjedal
Venue: Microelectronic Engineering (2008)

The catalytic growth by chemical vapor deposition is a well-established route to single-wall carbon nanotubes (SWNTs). In this process, the choice and preparation of the metal catalyst determines the nanotube growth. The system Fe/Mo is known to yield a large percentage of SWNTs. In order to make use of SWNTs in electronic or electromechanical devices, the patterned growth relies on lithography techniques like photolithography or electron beam lithography. Many standard lithographic processes, i.e. the combination of photoresist and lift-off procedure, are not compatible with Fe/Mo catalyst solutions, resulting in low SWNT yield. We present a systematic study of the influence of the catalyst solvent on the patterned SWNT growth. Most remarkably, the use of water as a solvent is the basis for integrating SWNT with the established processing techniques due to its compatibility with any lithographic process and the simultaneous high SWNT yield.
Modified Evolution Strategy Based Identification of Multi-input Single-Output Wiener-Hammerstein Model
Authors: Jing Ke, Chengjin Zhang, Yizheng Qiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Evolution strategies are a class of evolutionary algorithms with self-adaptation. A new method for identification of multi-input single-output (MISO) Wiener-Hammerstein model using evolution strategy is proposed. By using the least absolute residuals criterion, the identification scheme is cast as a complex nondifferentiable function optimization problem over parameter space. In order to find the optimal estimation of the system parameters, a modified evolution strategy is proposed to optimize the objective function. Simulation results show that the proposed method is a simple and effective non-recursive identification method, particularly for small samples.
XSeek: a semantic XML search engine using keywords
Authors: Ziyang Liu, Jeffrey Walker, Yi Chen
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We present XSeek, a keyword search engine that enables users to easily access XML data without the need of learning XPath or XQuery and studying possibly complex data schemas. XSeek addresses a challenge in XML keyword search that has been neglected in the literature: how to determine the desired return information, analogous to inferring a "return" clause in XQuery. To infer the search semantics, XSeek recognizes possible entities and attributes in the data, differentiates search predicates and return specifications in the keywords, and generates meaningful search results based on the analysis.
Prediction of Moving Objects_ K-Nearest Neighbor Based on Fuzzy-Rough Sets Theory
Authors: Xiaoguang Hong, Yan Yuan, Xinglei Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In the previous study of the prediction of moving objects' k-nearest neighbor, there are many analyses on the diversified uncertainties of objects' predicted position and many disposals, but there have not been any measures to deal with the rough-uncertainty of moving objects' k-nearest neighbor, which is caused by the fuzzy-uncertainty of moving objects' predicted position. In this paper, the theory of fuzzy-rough sets is employed to analyze the fuzzy position of moving objects and its extended k + m nearest neighbor. Also, the fuzzy-rough membership function is employed to obtain the final k-nearest neighbor. A comparison between the processed result and the initial result is made by experiments. It is concluded that, compared to the actual position of moving objects, the analysis based on the theory of fuzzy-rough sets can promote the precision of its k-nearest neighbor noticeably.
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability
Authors: Eli GAFNI, Michel RAYNAL, Corentin TRAVERS
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

An important issue in fault-tolerant asynchronous computing is the respective power of an object type with respect to another object type. This question has received a lot of attention, mainly in the context of the consensus problem where a major advance has been the introduction of the consensus number notion that allows ranking the synchronization power of base object types (atomic registers, queues, test & set objects, compare & swap objects, etc.) with respect to the consensus problem. This has given rise to the well-known Herlihy's hierarchy.
Courseware Development and the NSF
Authors: J. M. Heines
Venue: Computer (1980)

With projected prices of courseware surpassing those of hardware, the NSF must promote software transportability if computer-based instruction is to gain widespread implementation.
Virtual Reality Based on Stereotypical RUPERT for Stroke Functional Rehabilitative Training Scenarios
Authors: Xuhui Chen, Chaolin Ma, Shaochun Xu, Jiping He
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This paper outlines our work in developing a series of game-like VR scenarios to assess and rehabilitate System with 3-D Exercise Machine for Upper Limb, coordination, range of motion and other relevant perceptual motor activities. The novel experiments with a new perturbation paradigm were designed to study the control of hand orientation and arm movement during 3D reach-to-grasp in both human subjects and rhesus monkeys. The experiments captured the signal from the monkey's brain (Electrocorticogram, EcoG), and integrated the signals into a DATABASE. Our efforts have focused on building engaging game-based stereoscopic video and audio scenarios that allow clients to participate in perceptual-motor rehabilitation. From the audio and video, the system of DEMO could activate the patient's consciousness to adjust the arm's movement; this depends on the patient self-adjust and self-rehabilitation. Exploratory work using EcoG signal DATABASE to match the motion and the biofeedback model, detect and track 3D body motion, identify body postures and quantify motor performance is also described, this method of biofeedback could extract the subjective desire and promote the effect of the rehabilitative training.
Using Gunnnig-Fog Index to Assess Instant Messages Readability from ECAs
Authors: Ong Sing Goh, Chun Che Fung, Arnold Depickere, Kok Wai Wong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, we examine the readability of the human- machine conversation transcripts in the instant messaging environment based on the Gunning-fog Index. The study is based on an embodied conversational agent (ECA) called Artificial Intelligent Natural-language Identity (AINI) which was designed to mimic human conversation. The ECA is also expected to supply answers with a sense of humour. We report on the collection and analysis of a corpus containing over 3,280 utterances in a series of real instant messages exchanged between AINI with 65 online "buddies".
Anomaly-based Fault Detection System in Distributed System
Authors: Byoung uk Kim, Salim Hariri
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

One of the important design criteria for distributed systems and their applications is their reliability and robustness to hardware and software failures. The increase in complexity, interconnectedness, dependency and the asynchronous interactions between the components that include hardware resources (computers, servers, network devices), and software (application services, middleware, web services, etc.) makes the fault detection and tolerance a challenging research problem. In this paper, we present an innovative approach based on statistical and data mining techniques to detect faults (hardware or software) and also identify the source of the fault. In our approach, we monitor and analyze in realtime all the interactions between all the components of a distributed system. We used data mining and supervised learning techniques to obtain the rules that can accurately model the normal interactions among these components. Our anomaly analysis engine will immediately produce an alert whenever one or more of the interaction rules that capture normal operations is violated due to a software or hardware failure. We evaluate the effectiveness of our approach and its performance to detect software faults that we inject asynchronously, and compare the results for different noise level.
Shot Boundary Detection Based on Difference Sequences of Mutual Information
Authors: Dingyuan Xia, Xuefei Deng, Qingning Zeng
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Aimed at the characteristics and localizations of mutual information used in shot boundary detection, a new shot boundary detection method based on difference sequences of mutual information is presented. The measure used for detecting the shot boundary is not the mutual information itself involved in the frames of video sequences, but the absolute value difference between the frames, thereby the disadvantage influences resulted from the zoom of camera or movement of object are effectively eliminated. Moreover, the two-order mutual information is introduced into the shot boundary detection to make up for the scarcity of spatial information and fully utilize the relativity of gray-level between the adjacent pixels, and the detection effect is further improved. Experimental results validate the validity of the new method.
High-performance routing at the nanometer scale
Authors: Jarrod A. Roy, Igor L. Markov
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this work we describe significant improvements to core routing technologies and outperform the best results from the ISPD '07 Global Routing Contest, as well as previous literature, in terms of route completion, runtime and total wirelength. In particular, our router, FGR, improves upon wirelengths produced by BoxRouter and MaizeRouter in March 2007 by 9.9% and 8.4%, respectively. Additionally, we reveal the mathematical basis of negotiated-congestion routing, offer comprehensive analysis of existing routing techniques and discuss several applications at the nanometer scale.
The Evolution of Host-to-Host Protocol Technology
Authors: D. C. Walden
Venue: Computer (1979)

The growth of networking-more and more computers of different makes communicating with each other-will motivate the greater standardization of host-to-host protocols.
Extended abstract: on the property-based verification in SoC design flow founded on transaction level modeling
Authors: N. Bombieri, A. Fedeli
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

In this paper we present the properties specification language (PSL) utilization in a system level verification flow for system on chip (SoC) designs, A compositional approach is proposed and two properties-based techniques are described and compared in terms of properties refinement effort and simulation speed delay.
The Study of Membrane Fouling Modeling Method Based on Wavelet Neural Network for Sewage Treatment Membrane Bioreactor
Authors: Meijuan Gao, Jingwen Tian, Lixin Zhao, Kai Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The membrane bioreactor(MBR) is a new technology of sewage treatment combining the membrane with the bioreactor, but the membrane fouling is an important factor to limit the MBR further development. Considering the issues that the relationship between the membrane fouling and affecting factors is a complicated and nonlinear, a modeling method based on wavelet neural network is presented. We adopt a method of reduce the number of the wavelet basic function by analysis the sparsity property of sample data, and use the learning algorithm based on gradient descent to train network. The main parameters of affecting MBR membrane fouling are studied. With the ability of strong function approach and fast convergence of wavelet network, the modeling method can detect and assess the membrane fouling degree of MBR in real time by learning the membrane fouling information. The detection results show that this method is feasible and effective.
Magic Paper: Sketch-Understanding Research
Authors: Randall Davis
Venue: Computer (2007)

Sketch-understanding systems let users interact with computers by drawing naturally, offering a freedom not available with traditional CAD systems.
Methodology and Case Study of Hybrid Quantum-Inspired Evolutionary Algorithm for Numerical Optimization
Authors: Qing Yang, Shengchao Ding
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper proposes a hybrid quantum-inspired evolutionary algorithm which codes individuals with amplitudes. The evolutionary goals are evolved by classical crossover operator. Self-adaptive rotation operator and mutation operator with respect to mutation degree are introduced too. Extensive case studies show that the novel algorithm exceeds other quantum evolutionary algorithms and classical genetic algorithms on the single-objective numerical optimization problems. In addition, novel algorithm with random weighted-sum aggregation strategy performs very well on multi-objective numerical optimization problems.
Software Reliability Growth Modeling: Models and Applications
Authors: S. Yamada
Venue: IEEE Transactions on Software Engineering (1985)

This paper summarizes existing software reliability growth models (SRGM's) described by nonhomogeneous Poisson processes. The SRGM's are classified in terms of the software reliability growth index of the error detection rate per error. The maximum-likelihood estimations based on the SRGM's are discussed for software reliability data analysis and software reliability evaluation. Using actual software error data observed by software testing, application examples of the existing SRGM's are illustrated.
Domain-Driven, Actionable Knowledge Discovery
Authors: Longbing Cao, Chengqi Zhang, Qiang Yang, David Bell, Michail Vlachos, Bahar Taneri, Eamonn Keogh, Philip S. Yu, Ning Zhong, Mafruz Zaman Ashrafi, David Taniar, Eugene Dubossarsky, Warwick Graco
Venue: IEEE Intelligent Systems (2007)

Existing knowledge discovery and data mining (KDD) field seldom deliver results that businesses can act on directly. This issue, Trends & Controversies presents seven short articles reporting on different aspects of domain-driven KDD, an R&D area that targets the development of effective methodologies and techniques for delivering actionable knowledge in a given domain, especially business.