ppxscal/embedding_network huggingface dataset:
Positive Solutions for Quasilinear Second Order Differential Equation
Authors: Shijie Dong, Zhifeng Gao, Yunhai Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

It is well known that Krasnosel'skii fixed point theorem is very important. It was extensively used for studying the boundary value problems. In this paper, Krasnosel'skii fixed point theorem is extended. A new fixed point theorem is obtained. The second order quasilinear differential equation (\Phi(y'))' + a(t)f(t, y, y') = 0, 0 \le t \le 1 subject to Dirichlet boundary condition is studied, where f is a nonnegative continuous function, \Phi(v) = |v|^{p-2}v, p \ge 1. We show the existence of at least one positive solution by using the new fixed point theorem in cone.
Module Clustering to Minimize Delay in Digital Networks
Authors: E. L. Lawler, K. N. Levitt, J. Turner
Venue: IEEE Transactions on Computers (1969)

An important aspect of the packaging of digital networks is the allocation of logic gates to modules such that a predetermined objective function is minimized. In order to develop techniques for this partitioning of a logic network we have considered the following problem: Given an acyclic combinational network composed of various primitive blocks such as NOR gates, assume that a maximum of M gates can be "clustered" together into larger modules, and that a maximum of P pins can be accommodated in each larger module. Assume also that in a network composed of such larger modules, no delay is encountered on the interconnections linking two gates internal to a module and a delay of one time unit is encountered on interconnections linking two gates in different modules . Find an easily applied algorithm that will result in a network such that the maximum delay through the network is minimized.
C-fuzzy numbers and a dual of extension principle
Authors: S. Mahmoud Taheri
Venue: Information Sciences: an International Journal (2008)

In this paper, we introduce and investigate the concept of c-fuzzy numbers. We extend the algebraic operations on c-fuzzy numbers, and specially study the properties of these operations on LR type c-fuzzy numbers. In addition, a dual of extension principle is introduced. It is shown that the algebraic operations with c-fuzzy numbers have a representation based on the dual of extension principle.
Refactoring Test Code Safely
Authors: Eduardo Martins Guerra, Clovis Torres Fernandes
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Test Driven Development is a technique in which the refactoring occurs all the time, in the application code and in the test code. But there is not a method to guarantee that the test code behavior after one refactoring remains unchanged. This paper presents a representation based on the JUnit unit test structure, as well as a classification of test code refactorings that may ease the analysis to verify if he test code refactoring was carried out safely, i.e., if the observable behavior of the refactored test code has been kept unchanged. The use of this proposed technique may safely improve and speed up the production of test code refactorings.
Computing pagerank in a distributed internet search system
Authors: Yuan Wang, David J. DeWitt
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Existing Internet search engines use web crawlers to download data from the Web. Page quality is measured on central servers, where user queries are also processed. This paper argues that using crawlers has a list of disadvantages. Most importantly, crawlers do not scale. Even Google, the leading search engine, indexes less than 1% of the entire Web. This paper proposes a distributed search engine framework, in which every web server answers queries over its own data. Results from multiple web servers will be merged to generate a ranked hyperlink list on the submitting server. This paper presents a series of algorithms that compute PageRank in such framework. The preliminary experiments on a real data set demonstrate that the system achieves comparable accuracy on PageRank vectors to Google's well-known PageRank algorithm and, therefore, high quality of query results.
Gradient Based Error Concealment for H.264 Inter Frames
Authors: Toan Nguyen Dinh, GueeSang Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, an improved BMA(Boundary Matching Algorithm) using gradient vectors is presented to conceal channel errors in inter-frames of H.264 video images. BMA computes the sum of pixel differences around the perimeter of the lost block between the candidate block and its neighboring blocks to estimate the validity of the candidate block, assuming that adjacent pixels in an image have almost the same value. In real images, however, there exist some gradients in local area of the image, which means that the pixel values are increasing or decreasing in a specific slope. A simple and efficient method for estimating candidate blocks using gradient information has been developed and thereby the modified BMA has been applied to recover lost blocks. Experiments show the proposed method improves picture quality of about 1 3dB compared to existing methods.
Automated generation of non-verbal behavior for virtual embodied characters
Authors: Werner Breitfuss, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this paper we introduce a system that automatically adds different types of non-verbal behavior to a given dialogue script between two virtual embodied agents. It allows us to transform a dialogue in text format into an agent behavior script enriched by eye gaze and conversational gesture behavior. The agents' gaze behavior is informed by theories of human face-to-face gaze behavior. Gestures are generated based on the analysis of linguistic and contextual information of the input text. The resulting annotated dialogue script is then transformed into the Multimodal Presentation Markup Language for 3D agents (MPML3D), which controls the multi-modal behavior of animated life-like agents, including facial and body animation and synthetic speech. Using our system makes it very easy to add appropriate non-verbal behavior to a given dialogue text, a task that would otherwise be very cumbersome and time consuming.
Study on Distributing Pattern of Shared Data in CC-NUMA System
Authors: Guoteng Pan, Qiang Dou, Lunguo Xie
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Nowadays, directory-based cache coherence protocols have been the best choice in designing large-scaled CC-NUMA systems. Directory contains the shared information of all memory blocks in system. The number of copies of shared data in system and their distributing characteristics are deeply influenced by the characteristics of application programs. In this paper, a Markov Chains model is built for the distributing pattern of shared data in CC-NUMA systems. It's proved that, the average number of cache copies of shared data is small in CC-NUMA systems. Especially, when the percentage of shared read operations in applications is lower than 80%, this number is less than 5.
Adaptive &Delta;-causality control with adaptive dead-reckoning in networked games
Authors: Yutaka Ishibashi, Yousuke Hashimoto, Tomohito Ikedo, Shinji Sugawara
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

This paper proposes an adaptive &Delta;-causality control scheme with adaptive dead-reckoning to preserve the consistency among players and the causality for networked games. The proposed scheme carries out adaptive &Delta;-causality control and adaptive dead-reckoning together. By simulation, we make a performance comparison among nine schemes including the scheme for a networked racing game. We also investigate the influence of the maximum value of &Delta; of the scheme on the interactivity by subjective assessment. As a result, we illustrate that the scheme is superior to the other schemes in terms of the consistency among players. Also, we show that if the maximum value of &Delta; is less than about 100 ms, the influence of the value on the interactivity is small.
Boundary Function Identification in Linear Differential Equation
Authors: Chuan-Sheng Wu, Hua-Ping Zhu, Li Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The inversion algorithm is a hot topic in the circle of science and technology. Even though many researchers pay at- tention to it, there is still lack of boundary function inversion because of the endpoints which are difficult to confirm. This paper introduces evolutionary algorithm which is applied to get the boundary function. Afterwards, some numeric experimental results on this inversion process are presented in order to verify the inversion algorithm efficiency.
A Combinatorial Analysis of Boundary Data Structure Schemata
Authors: Tony Woo
Venue: IEEE Computer Graphics and Applications (1985)

Speed up the software in geometric algorithms for solid modeling, CAD/CAM, and robotics applications. How? By using boundary data structures that are fast and use less storage.
Corner Displacement from Motion Blur
Authors: Giacomo Boracchi, Vincenzo Caglioti
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We propose a novel procedure for estimating blur in a single image corrupted by blur due to a rigid camera motion during the exposure. Often this blur is approximated as space invariant, even if this assumption holds, for example, only on small image region in perspective images captured during camera movement. Our algorithm analyzes separately selected image regions containing a corner and in each region the blur is described by its direction and extent. The algorithm works directly in space domain, exploiting gradient vectors at pixels belonging to the blurred corner edges. The algorithm has been successfully tested both on synthetic and real images showing good performance even on small image regions and in presence of noise.
Using layered video to provide incentives in P2P live streaming
Authors: Zhengye Liu, Yanming Shen, Shivendra S. Panwar, Keith W. Ross, Yao Wang
Venue: Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV (2007)

In this paper, we design a distributed incentive mechanism for mesh-pull P2P live streaming networks. In our system, a video is encoded into layers with lower layers having more importance. The system is heterogeneous with peers having different uplink bandwidths. We design a distributed protocol in which a peer contributing more uplink bandwidth receives more layers and consequently better video quality. Previous approaches consider single-layer video, where each peer receives the same video quality no matter how much bandwidth it contributes to the system. The simulation results show that our approach can provide differentiated video quality commensurate with a peer's contribution to other peers, and can also discourage free-riders. Furthermore, we also compare our layered approach with a multiple description coding (MDC) approach, and conclude that the layered approach is more promising, primarily due to its higher coding efficiency.
Preparation of conductive HfN by post rapid thermal annealing-assisted MOCVD and its application to metal gate electrode
Authors: Wenwu Wang, Toshihide Nabatame, Yukihiro Shimogaki
Venue: Microelectronic Engineering (2008)

Conductive hafnium nitride (HfN) with negligible carbon impurity (
Fault diagnosis in industry using sensor readings and case-based reasoning
Authors: Erik Olsson, Peter Funk, Ning Xiong
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Fault diagnosis of industrial equipments becomes increasingly important for improving the quality of manufacturing and reducing the cost for product testing. Developing a fast and reliable diagnosis system presents a challenging issue in many complex industrial scenarios. The major difficulties therein arise from contaminated sensor readings caused by heavy background noise as well as the unavailability of experienced technicians for support. In this paper we propose a novel method for diagnosis of faults by means of case-based reasoning and signal processing. The received sensor signals are processed by wavelet analysis to filter out noise and at the same time to extract a group of related features that constitutes a reduced representation of the original signal. The derived feature vector is then forwarded to a classification component that uses case-based reasoning to recommend a fault class for the probe case. This recommendation is based on previously classified cases in a case library. Case-based diagnosis has attractive properties in that it enables reuse of past experiences whereas it imposes no demand on the size of the case base. The proposed approach has been applied to fault diagnosis of industrial robots at ABB Robotics and the results of experiments are very promising.
ECM: An evidential version of the fuzzy c-means algorithm
Authors: Marie-Hélène Masson, T. Denux
Venue: Pattern Recognition (2008)

A new clustering method for object data, called ECM (evidential c-means) is introduced, in the theoretical framework of belief functions. It is based on the concept of credal partition, extending those of hard, fuzzy, and possibilistic ones. To derive such a structure, a suitable objective function is minimized using an FCM-like algorithm. A validity index allowing the determination of the proper number of clusters is also proposed. Experiments with synthetic and real data sets show that the proposed algorithm can be considered as a promising tool in the field of exploratory statistics.
Enriching Your Project Planning: Tying Risk Assessment to Resource Estimation
Authors: Scott E. Donaldson, Stanley G. Siegel
Venue: IT Professional (2007)

A five-step process for incorporating risk assessment and risk-derived resource allocation recommendations into project plan development can help organizations deal with real-life hazards and help ensure the project's successful completion.
Laplacian Discriminant Projection with Optimized Kernels for Supervised Feature Extraction and Classification
Authors: Jun-Bao Li, Shu-Chuan Chu, Jeng-Shyang Pan
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

A novel feature extraction method, namely Laplacian Discriminant Projection with Optimized Kernels (KLDP-Opt) algorithm is proposed in this paper. The advantage of KLDP-Opt lies in: 1) The similarity matrix is constructed with the class-wise nonparametric similarity measure where it solves procedure selection problem; 2) Data-dependent kernel is applied to solve the limitation of linearity of LPP, where the adaptive parameters of the data-dependent kernel are computed through optimizing an objective function designed for measuring the class separability of data in the feature space. Besides the theory derivation, the experiments are implemented on ORL and Yale face databases to evaluate the feasibility of the proposed algorithm.
Right Shift for Low-Cost Multiply and Divide
Authors: B. J. Shepherd
Venue: IEEE Transactions on Computers (1971)

Although integrated-circuit technology promises to reduce the cost of logic, there are still situations where low-cost multiplication and/or division algorithms must be implemented in today's technology. This can be accomplished by the algorithms presented here: repetitive addition (subtraction) algorithms for multiplication (division), employing a right shift. The result of the operation is truncated, which limits the accurqcy but reduces significantly the amount of intermediate storage required. The degree of accuracy is quite adequate for selected applications.
Choosing cross-over designs when few subjects are available
Authors: S. T. Bate, E. J. Godolphin, J. D. Godolphin
Venue: Computational Statistics Data Analysis (2008)

Cross-over designs are used extensively for experiments in many fields. If the n subjects are relatively scarce compared to the t treatments then universally optimal designs do not exist under these restrictions and a computational procedure is usually required to select the design. This arises, for example, if the subjects comprise several animals which are in short supply, due perhaps to weight or age limitations. It is shown that cyclic cross-over designs are available that have lower average variances for direct and carry-over elementary treatment contrasts than other cyclic cross-over designs described in the literature. Examples of these improved designs are given for typical values of t and n. It is further shown that in these circumstances it is sensible to guard against a choice of design that can become disconnected if a few observations are lost during the experimentation. These points are illustrated in detail by considering the selection of a cross-over design for an experiment involving seven treatments applied to four subjects.
When it comes to E-learning
Authors: Joseph Bih
Venue: Ubiquity (2007)

E-learning is fast becoming a major learning and skills delivery method within larger companies as a staff development tool. Survey shows that among American colleges and universities in 2002, 11% of students took an online course, 97 % of public institutions offered at least one online or blended course, 49% offered an online degree program, and 67% considering e-learning a critical long-term strategy for their institution. The questions about e-learning have become "how", "why" and "with what outcomes.
Stability Conditions for Discrete Delayed Hopfield Neural Networks
Authors: Run-Nian Ma, Peng Chu, Sheng-Rui Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The stability of neural networks is not only the most basic and important problem but also the foundation of some neural network's applications. In this paper, the stability of discrete delayed Hopfield neural networks is mainly investigated by constructing Lyapunov function and taking some inequality techniques into account. The sufficient conditions for discrete delayed Hopfield neural networks converging towards a limit cycle with 4-period are given. Also, some conditions for discrete delayed Hopfield neural networks neither having a stable state nor a limit cycle with 2-period are obtained. The obtained results here extend and improve some previously established results on the stability of discrete Hopfield neural network and the stability of discrete delayed Hopfield neural network in the literature.
Productivity and Automation
Authors: R. T. Chien
Venue: Computer (1977)

Neither of the two basic ways we assemble things today-i. e., by people or by special-purpose machines-rests on a coherent body of analytically derived knowledge. These manufacturing methods, which may be accurately characterized as experience-based rather than science-based, have been the principal handicap in achieving major improvements manufacturing productivity. In the absence of major productivity improvements, the consumer has borne the brunt of cost increases in raw materials, labor, and energy. Clearly, the key to improved productivity is the development of advanced computer-based systems that incorporate a greater degree of the knowledge base-systems that compensate for the designer's unfamiliarity with manufacturing technology and help him come up with a more manufacturable product design.
Design of stable circularly symmetric two-dimensional GIC digital filters using PLSI polynomials
Authors: Ezra Morris Abraham Gnanamuthu, C. Eswaran, K. Ramar
Venue: EURASIP Journal on Advances in Signal Processing (2007)

A method for designing stable circularly symmetric two-dimensional digital filters is presented. Two-dimensional discrete transfer functions of the rotated filters are obtained from stable one-dimensional analog-filter transfer functions by performing rotation and then applying the double bilinear transformation. The resulting filters which may be unstable due to the presence of nonessential singularities of the second kind are stabilized by using planar least-square inverse polynomials. The stabilized rotated filters are then realized by using the concept of generalized immittance converter. The proposed method is simple and straight forward and it yields stable digital filter structures possessing many salient features such as low noise, low sensitivity, regularity, and modularity which are attractive for VLSI implementation.
Limiting disclosure in hippocratic databases
Authors: Kristen LeFevre, Rakesh Agrawal, Vuk Ercegovac, Raghu Ramakrishnan, Yirong Xu, David DeWitt
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We present a practical and efficient approach to incorporating privacy policy enforcement into an existing application and database environment, and we explore some of the semantic tradeoffs introduced by enforcing these privacy policy rules at cell-level granularity. Through a comprehensive set of performance experiments, we show that the cost of privacy enforcement is small, and scalable to large databases.
Time Synchronization with Extended Clock Model for Wireless Sensor Networks
Authors: Liming He
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Time synchronization is an essential problem for WSNs. The synchronization performance is mainly affected by two factors: the uncertainty in the message delay, and the clock drift. Most solutions on time synchronization in WSNs have concentrated on one of the two factors, and neglected the other. In this paper, we consider both of them and propose a novel time synchronization protocol for WSNs. In the protocol, we model the variation of the clock drift and develop algorithms to estimate and compensate the drift. Meanwhile, the clock offset is corrected continuously avoiding the time discontinuity which is a prevalent drawback of existing synchronization protocols. Additionally, we extend the bound-drift clock model by considering both the absolute drift and the relative drift. Mathematical analyses and simulations are presented in this paper, and verify the effectiveness of our synchronization protocol.
Kernelised Relaxation Labelling using Fokker-Planck Diffusion
Authors: Hong-Fang Wang, Edwin R. Hancock
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper shows how the relaxation labelling problem can be formulated as a diffusion process on a support graph using the Fokker-Planck equation. We abstract the labelling problem using a support graph with each graph node representing a possible object-label assignment and the edge weights representing label compatibilities. Initial objectlabel probabilities are updated using a relaxation-like process. The update equation is the solution of the Fokker- Planck equation, and is governed by an infinitesimal generator matrix computed from the edge-weights of the support graph. Iterative updating of the label probabilities can be effected using the eigenvalues and eigenvectors of the generartor matrix. We illustrate the newly developed relaxation process for the applications of data classification.