ppxscal/embedding_network huggingface dataset:
Study on Water Conservancy Project Network Planning in Fuzzy Environment
Authors: Wu Wen-ping, Li Xia, Zhong Xiao-ping, Ma Bin
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Engineering construction of water conservancy is a complex system project, there are many uncertain factors in construction. Based on addition formulas for calculating time parameters and the hierarchical linear programming method in fuzzy network, this paper used triangular fuzzy number to show activity duration, then discussed its application in the Shu-He- Dam construction, lastly got fuzzy time parameters, fuzzy critical path and fuzzy duration. This way's accuracy is higher than traditional CPM and PERT model, it is feasible and effective.
Computational Physics: A Better Model for Physics Education?
Authors: Rubin Landau
Venue: Computing in Science and Engineering (2006)

Computational physics provides a broader, more balanced, and more flexible education than a traditional physics major. Moreover, presenting physics within a scientific problem-solving paradigm is a more effective and efficient way to teach physics than the traditional approach.
Security Issues in Wireless Sensor Networks
Authors: Tanveer Zia, Albert Zomaya
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Due to inherent limitations in wireless sensor networks, security is a crucial issue. While research in WSN security is progressing at tremendous pace, no comprehensive document lists the security issues and the threat models which pose unique threats to the wireless sensor networks. In this paper we have made an effort to document all the known security issues in wireless sensor networks and have provided the research direction towards countermeasures against the threats posed by these issues.
Quality Management using RFID and Third Generation Mobile Communications Systems
Authors: Hon Ng, Wilton Fok, Edward Wong, Zongwei Luo
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Quality management, Radio Frequency Identification (RFID) and Third Generation Mobile Communications Systems (3G) are increasing attracting the attention of corporate managers. This paper illustrates the convergence of the three seemingly independent initiatives. RFID provides data inputs into the company's quality improvement systems, such as Six Sigma, while 3G supports realtime data communications between remote RFID devices and enterprise applications. RFID readers can simultaneously scan and identify hundreds of tagged items. This detailed data give companies unprecedented visibility and insights into processes. Supplementing the "Measure" step of the Six Sigma project, RFID enables companies to identify issues early in their lifecycle. This paper also presents two cases studies on using RFID and 3G to improve processes. The first case describes how property management companies leverage a Property Management System to improve operations efficiencies. The second case describes how hospitals and clinics implement Smart Medicine Shelf to minimize the occurrence of dispensing the wrong medications to patients.
Modeling out-of-order processors for WCET analysis
Authors: Xianfeng Li, Abhik Roychoudhury, Tulika Mitra
Venue: Real-Time Systems (2006)

Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typically model the timing effects of micro-architectural features in modern processors (such as pipeline, cache, branch prediction) to obtain safe and tight estimates. In this paper, we model out-of-order superscalar processor pipelines for WCET analysis. The analysis is, in general, difficult even for a basic block (a sequence of instructions with single-entry and single-exit points) if some of the instructions have variable latencies. This is because the WCET of a basic block on out-of-order pipelines cannot be obtained by assuming maximum latencies of the individual instructions. Our timing estimation technique for a basic block proceeds by a fixed-point analysis of the time intervals at which the instructions enter/leave a pipeline stage. To extend our estimation to whole programs, we use Integer Linear Programming (ILP) to combine the timing estimates for basic blocks. Timing effects of instruction cache and branch prediction are also modeled within our pipeline analysis framework. This forms a combined timing analysis framework that captures out-of-order pipeline, cache, branch prediction as well as the mutual interaction among these micro-architectural features. The accuracy of our analysis is demonstrated via tight estimates obtained for several benchmarks.
On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation
Authors: Kimikazu Kato, Mayumi Oto, Keiko Imai, Hiroshi Imai
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

For one-qubit pure quantum states, it is already proved that the Voronoi diagrams with respect to two distances - Euclidean distance and the quantum divergence - coincide. This fact is a support for a known method to calculate the Holevo capacity. To consider an applicability of this method to quantum states of a higher level system, it is essential to check if the coincidence of the Voronoi diagrams also occurs. In this paper, we show a negative result for that expectation. In other words, we mathematically prove that those diagrams no longer coincide in a higher dimension. That indicates that the method used in one-qubit case to calculate the Holevo capacity might not be effective in a higher dimension.
Evaluating increasing capacity of steel hot rolling line to 4.2 million ton per year
Authors: Mehdi Ashrafi Nasrabadi, Soheil Mardani
Venue: Proceedings of the 37th conference on Winter simulation (2005)

There is complex logistic operation to transfer slabs which are being produced with continuous casting machines to hot rolling in MobarakehSteelComplex. First the slabs should get cooled and then there will be quality control and scarf operation is needed for some of them. Then slabs get transferred via conveyor to warehouse & then transferred to 4 furnaces. The conveyor is bottleneck. The simulation model proved if a parallel conveyor gets used to increase transferring rate because next warehouse will get bottleneck, it will not increase production. Then Hot Charge technology gets evaluated which there is no need to cool the slabs & then again making them hot. So the slabs will be transferred to furnace area with out losing temperature & considerable energy will be saved. Simulation has been used to evaluate what kind of facility is needed & how to assigning the furnaces to Hot Charge & cooled slabs.
Acquisition system for a minicomputer
Authors: B. R. Kane, R. B. Yarbrough
Venue: ACM SIGSMALL Newsletter (1980)

In the course of the development of apparatus to evaluate magnetic recording media it has become expedient to improve the accuracy of the data and to accelerate its analysis by the use of a data acquisition system which digitizes the measured voltages and sends them directly to the computer for processing and analysis. Such a system has been developed at the University of Santa Clara.
Semantic Pattern for User-Interactive Question Answering
Authors: Tianyong Hao, Qingtian Zeng, Liu Wenyin
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

A new semantic pattern is proposed in this paper, which can be used by users to post questions and answers in user-interactive question answering (QA) system. The necessary procedures of using semantic pattern in a QA system are also presented, which include question structure analysis, pattern matching, pattern generation, pattern classification and answer extraction. A user interface of using semantic pattern is also implemented in our QA system, which allows users to effectively post and answer questions. It gains good overall user satisfaction.
The formal semantics of the timeER model
Authors: Heidi Gregersen
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

A wide range of database applications manage information that varies over time. Many of the underlying database schemas of these were designed using one of the several versions of the Entity-Relationship (ER) model. In the research community as well as in industry, it is common knowledge that the temporal aspects of the mini-world are pervasive and important, but are also difficult to capture using the ER model. Not surprisingly, several enhancements to the ER model have been proposed in an attempt to more naturally and elegantly support the modeling of temporal aspects of information. Common to most of the existing temporally extended ER models is that the semantics of the models are unclear. This problem is addressed in this paper by developing a formal semantics for the TIMEER model based on denotational semantics.
Assessing the predictive performance of artifIcial neural network-based classifiers based on different data preprocessing methods, distributions and training mechanisms: Research Articles
Authors: Adrian Costea, Iulian Nastac
Venue: International Journal of Intelligent Systems in Accounting and Finance Management (2005)

We analyse the implications of three different factors (preprocessing method, data distribution and training mechanism) on the classification performance of artificial neural networks (ANNs). We use three preprocessing approaches: no preprocessing, division by the maximum absolute values and normalization. We study the implications of input data distributions by using five datasets with different distributions: the real data, uniform, normal, logistic and Laplace distributions. We test two training mechanisms: one belonging to the gradient-descent techniques, improved by a retraining procedure, and the other is a genetic algorithm (GA), which is based on the principles of natural evolution. The results show statistically significant influences of all individual and combined factors on both training and testing performances. A major difference with other related studies is the fact that for both training mechanisms we train the network using as starting solution the one obtained when constructing the network architecture. In other words we use a hybrid approach by refining a previously obtained solution. We found that when the starting solution has relatively low accuracy rates (80&ndash;90&percnt;) the GA clearly outperformed the retraining procedure, whereas the difference was smaller to non-existent when the starting solution had relatively high accuracy rates (95&ndash;98&percnt;). As reported in other studies, we found little to no evidence of crossover operator influence on the GA performance. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Feature-Preserving Simplification of Texture-Mapped Models
Authors: Xiuwen Liu, Cui Xie, Yicheng Jin
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

A feature-preserving multi-resolution simplification algorithm based on half-edge collapse operation for texture-mapped models is proposed. A new error metric based on the geometric importance the textureattribute importance of a half-edge is presented. It can generate a low-polygon-count approximation model with shape preservation and texture attributes preservation. In addition, the half-edge based scheme is more efficient in memory usage and convenient for generating progressive meshes with texture attributes for real-time transmission of various surface data on the Web. The visual comparisons showing that the proposed algorithm results in higher quality approximations of original models with texture attribute preservation even at very low levels of detail than other algorithms in the literature.
From isolation to interaction?: network-based professional development and patterns of teacher communication
Authors: Teresa A. McMahon
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

As on-line professional development opportunities increase, interest in better understanding the possibilities these experiences have for teacher learning and professional growth also increases. While an overarching goal of many network-based professional development opportunities is to support teacher learning through peer dialogue, not enough is known about what factors best support such communication. Indeed, even though teachers are central to the successful use of technology for student learning, we know relatively little about their use of technology for their own communication and learning. As a recent OTA report noted, "Most research about educational technology has focused on the impact of technology on students; little attention has been given to its impact on teachers" [OTA 1995, p. 51].
A Scalable Algorithm for Adjusting Node-Node Overlaps
Authors: Xiaodi Huang, A. S. M. Sajeev, Wei Lai
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynamic drawing, have been a problem in graph visualization. Several approaches have recently been proposed to solve such a problem. These approaches, however, lack the scalabilities of dealing with large number of overlapping nodes. Providing a formal description of the problem, this paper presents a scalable version of our previous approach called the Force-Transfer algorithm. Compared to other methods, our new algorithm is able to achieve the compact adjusted layout of a large graph.
Sensitivity analysis for transient single server queuing models using an interpolation approach
Authors: Mohamed A. Ahmed, Talal M. Alkhamis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation is an essential tool for performance evaluation of many practical systems where planners typically want to know how the system will perform under various parameter settings. Since large-scale simulation may require great amount of computer time and storage, appropriate statistical analysis can become quite costly. In this paper, we develop an interpolation technique as an effective tool for estimating system respones to parametric perturbations in simulation. We also analyze the usefulness of the continuous-time Markov chains frame-work to find the likelihood ratio (Radon- Nikodym derivative) for Markovian single server queueing models. We provide numerical experiments that demonstrate how the interpolation technique significantly outperform the likelihood ratio performance extrapolation technique in the context of the Markovian queueing models in transient analysis.
Simultaneous Registration and Modeling of Deformable Shapes
Authors: Jing Xiao, Bogdan Georgescu, Xiang Zhou, Dorin Comaniciu, Takeo Kanade
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Many natural objects vary the shapes as linear combinations of certain bases. The measurement of such deformable shapes is coupling of rigid similarity transformations between the objects and the measuring systems and non-rigid deformations controlled by the linear bases. Thus registration and modeling of deformable shapes are coupled problems, where registration is to compute the rigid transformations and modeling is to construct the linear bases. The previous methods [3, 2] separate the solution into two steps. The first step registers the measurements regarding the shapes as rigid and the deformations as random noise. The second step constructs the linear model using the registered shapes. Since the deformable shapes do not vary randomly but are constrained by the underlying model, such separate steps result in registration biased by nonrigid deformations and shape models involving improper rigid transformations. We for the first time present this bias problem and formulate that, the coupled registration and modeling problems are essentially a single factorization problem and thus require a simultaneous solution. We then propose the Direct Factorization method that extends a structure from motion method [16]. It yields a linear closedform solution that simultaneously registers the deformable shapes at arbitrary dimensions (2D \to 2D, 3D \to 3D, . . .) and constructs the linear bases. The accuracy and robustness of the proposed approach are demonstrated quantitatively on synthetic data and qualitatively on real shapes.
A further study in the data partitioning approach for frequent itemsets mining
Authors: Son N. Nguyen, Maria E. Orlowska
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), this paper shows the extension of the data pre-processing approach to further improve the performance of frequent itemsets computation. The methods focus on potential reduction of the size of the input data required for deployment of the partitioning based algorithms.We have made a series of the data pre-processing methods such that the final step of the Partition algorithm, where a combination of all local candidate sets must be processed, is executed on substantially smaller input data. Moreover, we have made a comparison among these methods based on the experiments with particular data sets.
REERM: reenhancing the entity-relationship model
Authors: Luis González Jiménez
Venue: Data Knowledge Engineering (2006)

The entity-relationship model (ERM) remains one of the most widely used SW Engineering techniques. Much research effort has focused on incorporating into database design in general, and ER modeling in particular the historical support requirements arising from the temporal nature of dynamic domains. This paper discusses REERM, an extension to the enhanced ERM, whose primary objective is to address this problem, but that may bear positively on other aspects of conceptual modeling.REERM redefines the concept of entity, introduces additional relations classification criteria, adds the construct event and uses derived attributes and relations. Its application is illustrated with a case study.
A High-Efficiency Vector Interpolator Using Redundant CORDIC Arithmetic in Power-Aware 3-D Graphics Rendering
Authors: Tze-Yun Sung, Yaw-Shih Shieh, Chun-Wang Yu, Hsi-Chin Hsin
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

High performance architectures can be designed for data intensive and latency tolerant applications by maximizing the parallelism and pipelining of the algorithm. The hardware primitives for 3-D rotation for high throughput 3-D vector interpolation are presented in this paper. The primitives are based on the CORDIC algorithm. The proposed architecture of the 3-D vector interpolator using redundant CORDIC arithmetic is presented in this paper. The highthroughput 3-D vector interpolator is implemented by VLSI.
Introduction to Identity Management Risk Metrics
Authors: Gunnar Peterson
Venue: IEEE Security and Privacy (2006)

In this installment of Building Security In, the author presents some identity management risk metrics that highlight the distribution, quality, affiliation, and governance of identity in a system as well as inform the decision-making process.
A constraint programming approach to the Chinese postman problem with time windows
Authors: U. F. Aminu, R. W. Eglese
Venue: Computers and Operations Research (2006)

The Chinese postman problem with time windows (CPPTW) is modelled as a constraint programme and results are reported for a set of test problems with up to 69 edges. Two different formulations are proposed. The first formulation approaches the problem directly and the second transforms the problem to an equivalent vehicle routing problem with time windows. The results demonstrate that optimal solutions can be obtained quickly when the time windows are tight. However, the results also show that as the time windows are made wider and the number of feasible solutions increases, these constraint programming formulations take significantly longer to find a provably optimal solution. The results also demonstrate how the size and density of the graph affects the computing time needed to find an optimal solution.
A polynomial algorithm for codes based on directed graphs
Authors: A. V. Kelarev
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known in system theory. Our construction has already been considered in the literature in relation to other questions. The investigation of codes in this graph-based construction is inspired by analogy with classical cyclic codes that are defined in a similar way in polynomial rings. We show that all cyclic codes can be embedded in this construction. For each graph, the algorithm computes the largest number of errors which can be corrected by codes defined with this graph. In addition, it finds a generator of a code with this optimum value.
Impact of interference on multi-hop wireless network performance
Authors: Kamal Jain, Jitendra Padhye, Venkata N. Padmanabhan, Lili Qiu
Venue: Wireless Networks (2005)

In this paper, we address the following question: given a specific placement of wireless nodes in physical space and a specific traffic workload, what is the maximum throughput that can be supported by the resulting network? Unlike previous work that has focused on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, we work with any given network and workload specified as inputs.A key issue impacting performance is wireless interference between neighboring nodes. We model such interference using a conflict graph, and present methods for computing upper and lower bounds on the optimal throughput for the given network and workload. To compute these bounds, we assume that packet transmissions at the individual nodes can be finely controlled and carefully scheduled by an omniscient and omnipotent central entity, which is unrealistic. Nevertheless, using ns-2 simulations, we show that the routes derived from our analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention. This suggests that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
A validation of first-order detonation shock dynamics theory
Authors: David Lambert, Sunhee Yoo, D. Scott Stewart
Venue: Proceedings of the 37th conference on Winter simulation (2005)

High energy explosives are used in a variety of applications, from military to industrial processes. The use of embedded, inert material "wave shapers" is a primary method to customize the detonation front for desired explosive applications. These systems create detonation states that do not follow the simple line of sight, or Huygens model and, hence, advanced detonation physics with associated theory are required. The theory of detonation shock dynamics (DSD) is one such description used to provide high fidelity modeling of complex wave structures. A collection of experiments using ultra-high speed cameras is presented as a means of obtaining spatial and temporal characteristics of complex detonation fronts that validate the DSD descriptions. The method of test, operational conditions and results are given to demonstrate the use of high-rate imaging of detonation events and how this validates our understanding of the physics and the capability of advanced detonation wave tracking models.