ppxscal/embedding_network huggingface dataset:
A new software platform to support feature-based process planning for interoperable STEP-NC manufacture
Authors: A. Nassehi, R. Liu, S. T. Newman
Venue: International Journal of Computer Integrated Manufacturing (2007)

Computer numerical control (CNC) manufacturing has evolved with the use of faster, more precise and more capable CNC controllers and machine tools. The enhancements in machine tools however have not been integrated under a common platform to support computer aided design (CAD)/computer aided manufacturing (CAM)/CNC software interoperability and as a result a plethora of standards are being used for these systems. ISO 10303 (STEP) and ISO 14649 (STEP-NC) seek to eliminate the barriers in the exchange of information in the CNC manufacturing chain and enable interoperability throughout the manufacturing software domain. With the progress on standardization and implementation, computer systems in the manufacturing process chain require evolution to support the STEP-compliant planning and manufacture. The current paper introduces a novel software platform entitled the Integrated Platform for Process Planning and Control (IP3AC) to support STEP-NC compliant process planning (computer aided process planning (CAPP)/CAM). A prototype process planning system (PPS) based on the platform is then presented as a sample application in the light of future interoperable planning and manufacture. The PPS has been developed with the application of a two-stage strategy for STEP-NC part program generation, namely general workplan generation and specific workplan generation. The work is verified through the use of case study components.
Design of a content based multimedia retrieval system
Authors: Yuk Ying Chung, Ka Yee Ng, Liwei Liu, Xiaoming Chen, Mohd Afizi Mohd Shukran, Eric H. C. Choi, David Yu Shi, Fang Chen
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The large and growing amount of digital data, and the development of the Internet highlight the need to develop sophisticated access methods that provide more than just simple text-based queries. Many programs have been developed with complex mathematics algorithms to allow the transformation of image or audio data in a way that enchances searching accuracy. However it becomes difficult when dealing with large sets of multimedia data. This paper proposes and demonstrates a Content Based Multimedia Retrieval System (CBMRS). The proposed CBMRS includes both video and audio retrieval systems. The Content Based Video Retrieval System (CBVRS) based on DCT and clustering algorithms. The audio retrieval system based on Mel-Frequency Cepstral Coefficients (MFCCs), the Dynamic Time Warping (DTW) algorithm and the Nearest Neighbor (NN) rule.
Fitting Curve Passing through Designated Point to Data for Promoting the Reproducibility of Peripheral Quantitative Computed Tomography (pQCT)
Authors: Lianwen Sun, Tian Xie, Yubo Fan, Chi Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The Peripheral quantitative computed tomography (pQCT) is increasingly being used to monitor bone mineral density (BMD) change in both research and clinical practice in order to evaluate the fracture susceptibility in old people or the effect following therapeutic intervention[3]. . In follow-up studies, the drift area (change area) of total cross-sectional area (CSA) comparing with that of the baseline measurement (first measurement) was used to control the position as the baseline measurement. To study the interrelationship between the apparent BMD change and CSA change, the nonlinear regression curve was required to pass through a designated point. However, there is no ready-made software that can give the regression model which can pass through a designated point. In this study, BMD at 21 skeletal locations around 4% length of radius were measured by pQCT, then linear and nonlinear regression models passing through designated point were set up based on least square method using Matlab. The results showed the logarithmic model was suitable to describe the relationship between BMD change and cross-sectional area (CSA) change at the distal radius. This will be helpful to promote the reproducibility of pQCT in follow-up measurements.
Topology synthesis of analog circuits based on adaptively generated building blocks
Authors: Angan Das, Ranga Vemuri
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

This paper presents an automated analog synthesis tool for topology generation and subsequent circuit sizing. Though sizing is indispensable, the paper mainly concentrates on topology generation. A new kind of GA is developed, where a fraction of the offsprings in each generation is built from building blocks or cells obtained from previous generations. The cells are stored in a hierarchically arranged library that also contains information on the preferred neighborhood of each cell. The adaptively formed cell library starts only with basic elements and gradually includes functionally useful and bigger blocks, pertinent to the design. The techniques have been applied to synthesize an operational amplifier and a ring oscillator design. Results show that with reasonable computational effort, topologies have evolved that are designer understandable.
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
Authors: Jie Yin, Qiang Yang, Lionel M. Ni
Venue: IEEE Transactions on Mobile Computing (2008)

In wireless networks, a client's locations can be estimated using the signals received from various signal transmitters. Static fingerprint-based techniques are commonly used for location estimation, in which a radio map is built by calibrating signal-strength values in the offline phase. These values, compiled into deterministic or probabilistic models, are used for online localization. However, the radio map can be outdated when the signal-strength values change with time due to environmental dynamics, and repeated data calibration is infeasible or expensive. In this paper, we present a novel algorithm, known as LEMT (Location Estimation using Model Trees), to reconstruct a radio map using real-time signal- strength readings received at the reference points. This algorithm can take into account real-time signal-strength values at each time point and make use of the dependency between the estimated locations and reference points. We show that this technique can effectively accommodate the variations of signal strength over different time periods without the need to rebuild the radio maps repeatedly. We demonstrate the effectiveness of our proposed technique on realistic data sets collected from an 802.11b wireless network and a RFID-based network.
Crisis Management Simulation: Traffic Evacuation
Authors: Gary Tan, Geraldine Chan
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A traffic flow simulation has been developed to analyse traffic movements in the National University of Singapore (NUS). As part of a crisis management plan, the program’s main function is to analyse the time needed for a full traffic evacuation in the case of an emergency. In addition, it also allows users to determine the shortest path for their journey in the case of a road block at various parts of NUS.
Algorithms for subset selection in linear regression
Authors: Abhimanyu Das, David Kempe
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We study the problem of selecting a subset of k random variables to observe that will yield the best linear prediction of another variable of interest, given the pairwise correlations between the observation variables and the predictor variable. Under approximation preserving reductions, this problem is equivalent to the "sparse approximation" problem of approximating signals concisely. The subset selection problem is NP-hard in general; in this paper, we propose and analyze exact and approximation algorithms for several special cases of practical interest. Specifically, we give an FPTAS when the covariance matrix has constant bandwidth, and exact algorithms when the associated covariance graph, consisting of edges for pairs of variables with non-zero correlation, forms a tree or has a large (known) independent set. Furthermore, we give an exact algorithm when the variables can be embedded into a line such that the covariance decreases exponentially in the distance, and a constant-factor approximation when the variables have no "conditional suppressor variables". Much of our reasoning is based on perturbation results for the R2 multiple correlation measure, which is frequently used as a natural measure for "goodness-of-fit statistics". It lies at the core of our FPTAS, and also allows us to extend our exact algorithms to approximation algorithms when the matrix "nearly" falls into one of the above classes. We also use our perturbation analysis to prove approximation guarantees for the widely used "Forward Regression" heuristic under the assumption that the observation variables are nearly independent.
Low Autocorrelation Fractional PTS Subblocking for PAPR Reduction in OFDM Systems
Authors: A. Ghassemi, T. A. Gulliver
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Partial transmit sequence (PTS) is a distortionless technique used to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. However, PTS has a relatively high computational complexity due to the computation of multiple inverse fast Fourier transforms (IFFTs). To reduce this complexity, fractional subblocking was introduced where a subset of inputs to identical inverse discrete Fourier transforms (IDFTs) (within an N-point IFFT) were used for subblocking. Unfortunately, the PAPR performance is degraded as the number of identical DFTs is increased. In this paper, we exploit the periodic autocorrelation function (ACF) of the PTS sequences to improve the PAPR performance with fractional subblocks. We show that a PAPR reduction is achieved which is better than with pseudo-random subblocking.
A diversity guarantee and SNR performance for unitary limited feedback MIMO systems
Authors: Bishwarup Mondal, Robert W. Heath,  Jr.
Venue: EURASIP Journal on Advances in Signal Processing (2008)

A multiple-input multiple-output (MIMO) wireless channel formed by antenna arrays at the transmitter and at the receiver offers high capacity and significant diversity. Linear precoding may be used, along with spatial multiplexing (SM) or space-time block coding (STBC), to realize these gains with low-complexity receivers. In the absence of perfect channel knowledge at the transmitter, the precoding matrices may be quantized at the receiver and informed to the transmitter using a feedback channel, constituting a limited feedback system. This can possibly lead to a performance degradation, both in terms of diversity and array gain, due to the mismatch between the quantized precoder and the downlink channel. In this paper, it is proven that if the feedback per channel realization is greater than a threshold, then there is no loss of diversity due to quantization. The threshold is completely determined by the number of transmit antennas and the number of transmitted symbol streams. This result applies to both SM and STBC with unitary precoding and confirms some conjectures made about antenna subset selection with linear receivers. A closed form characterization of the loss in SNR (transmit array gain) due to precoder quantization is presented that applies to a precoded orthogonal STBC system and generalizes earlier results for single-stream beamforming.
Concurrent software engineering: preparing for paradigm shift
Authors: Peter Grogono, Brian Shearing
Venue: Proceedings of the 2008 C3S2E conference (2008)

Software systems bridge the gap between information processing needs and available computer hardware. As system requirements grow in complexity and hardware evolves, the gap does not necessarily widen, but it certainly changes. Although today's applications require concurrency and today's hardware provides concurrency, programming languages remain predominantly sequential. Concurrent programming is considered too difficult and too risky to be practiced by "ordinary programmers". However, software engineering is moving towards a paradigm shift, following which concurrency will play a more fundamental role in programming languages. We discuss some of the implications of the shift towards process-oriented programming. We outline some of the features of our own process-oriented language. Finally, we review the potential impact on software engineering and on software development processes.
Beyond separation of duty: An algebra for specifying high-level security policies
Authors: Ninghui Li, Qihua Wang
Venue: Journal of the ACM (JACM) (2008)

The process of introducing security controls into a sensitive task, which we call secure task design in this article, consists of two steps: high-level security policy design and low-level enforcement scheme design. A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a task to be performed by a team of at least k users. Unlike low-level enforcement schemes such as security constraints in workflows, a separation of duty policy states a high-level requirement about the task without referring to individual steps in the task. While extremely important and widely used, separation of duty policies state only requirements on the number of users involved in the task and do not capture the requirements on these users' attributes. In this article, we introduce a novel algebra that enables the formal specification of high-level policies that combine requirements on users' attributes with requirements on the number of users motivated by separation of duty considerations. We give the syntax and semantics of the algebra and study algebraic properties of its operators. After that, we study potential mechanisms to enforce high-level policies specified in the algebra and a number of computational problems related to policy analysis and enforcement.
An approach for applying multi-agent technology into wireless sensor networks
Authors: José-F Martínez, Ana-B García, Antonia-M. Sanz, Lourdes López, Vicente Hernández, Antonio Dasilva
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The present work describes how the concepts and foundations defined for multi-agent system technology can be applied in to a Wireless Sensor Network (WSN), specifically it is focused on how multi-agent system technology's mechanisms and implementations could facilitate the development of systems based on WSN. In this respect, an architectural model where the above mentioned concepts, foundations and mechanisms come together is proposed, in order to define applications and services on WSN. Validation of the proposed architecture is made by means of its use in a perimeter security scenario ("tracking"). It is important to mention, that partial results of this work have been developed in the project PROPSI (Perimeter Protection by means of Wireless Sensor Networks).
A Performance Study of Virtual Machine Migration vs. Thread Migration for Grid Systems
Authors: Po-Cheng Chen, Cheng-I Lin, Sheng-Wei Huang, Jyh-Biau Chang, Ce-Kuen Shieh, Tyng-Yeu Liang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Grid computing integrates abundant distributed resources into a single large-scale problem solving environment for parallel applications. However, the grid is a non-dedicated and dynamic computing environment. Grid applications consequently compete with each other for non-dedicated shared resources; moreover, shared resources are probably reclaimed by their owners according to administration policies, e.g. the scheduled maintenance. The job migration mechanisms which take the non-dedicated and dynamic natures of grids into consideration, therefore, become important for optimizing the application performance. The experiments of two job migration mechanisms, i.e. virtual machine migration and node reconfiguration by thread migration were presented in this study. We completed experiments on both LAN and WAN scenarios with a page-based grid-enabled DSM system, Teamster-G. The experimental results suggest the performance of virtual machine migration competes with node reconfiguration on equal terms; and further, they demonstrated the potential applications of virtual machine technique in the grid environment.
The Cambridge Handbook of Computational Psychology, 1 edition
Authors: Ron Sun
Venue:  (2008)

This book is a definitive reference source for the growing, increasingly more important, and interdisciplinary field of computational cognitive modeling, that is, computational psychology. It combines breadth of coverage with definitive statements by leading scientists in this field. Research in computational cognitive modeling explores the essence of cognition through developing detailed, process-based understanding by specifying computational mechanisms, structures, and processes. Computational models provide both conceptual clarity and precision at the same time. This book substantiates this approach through overviews and many examples.
Optimising the Use of Robust Header Compression Profiles in NEMO Networks
Authors: Priyanka Rawat, Jean Marie Bonnin, Ana Minaburo
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Mobile Internet access in moving entities such as, cars, buses, trains, and airplanes is in great demand. The mobility protocols Mobile IPv6 and NEMO, use abi-directional tunneling mechanism and all communications pass through this tunnel. If this tunnel provides network mobility transparency to the nodes within the network and to their correspondents, it also introduces high protocol overheads since multiple Internet header are carried on each message. This becomes critical since the tunnel is established over different access technologies such as Wireless LAN and 3G where bandwidth is a scarce resource. Moreover, for each mobile terminal (MN) or mobile router (MR), the mobility protocols create a tunnel with the Home Agent (HA) which can become a bottleneck when it has to serve thousands of mobiles. ROHC header compression mechanism is known to be able to reduce header size and improve performance in low bandwidth links. Thus, ROHC can be used to reduce the tunnel header overhead and improve the performance of the HA. However, ROHC is a complex mechanism and its use needs to be optimised for this specific usage. In this paper, we present two approaches to optimise the use of ROHC profiles when ROHC compression is used in NEMO networks. In the first approach, we suggest to use a reduced number of ROHC profiles. It is proposed to use only the IP profile of ROHC as IP header is the largest header. Also, header compression is applied per user in order to reduce the number of contexts and thus to reduce the processing load and the memory consumption at HA. The second approach proposes to classify the ROHC profiles into different levels depending on the resources that are used at the MR and HA. Optimising the use of ROHC profiles, although reduces the header compression performance, in return it saves resources. Moreover, the complexity of the ROHC mechanism is reduced. We present a performance evaluation of the header overhead reduction for different types of IP flows under the two approaches when they are applied to mobile networks.
Maintenance of the prelarge trees for record deletion
Authors: Chun-Wei Lin, Tzung-Pei Hong, Wen-Hsiang Lu
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The frequent pattern tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It, however, needed to process all transactions in a batch way. In addition to record insertion, record deletion is also commonly seen in real-application. In this paper, we propose the structure of prelarge trees for efficiently handling deletion of records based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of records have been deleted. The proposed approach can thus achieve a good execution time for tree construction especially when a small number of records are deleted each time. Experimental results also show that the proposed approach has a good performance for incrementally handling deleted records.
Objects of wonderment
Authors: Eric Paulos, Tom Jenkins, August Joki, Parul Vora
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

While we should celebrate our success at evolving many vital aspects of the human-technology interactive experience, we question the scope of this progress. Step back with us for a moment. What really matters? Everyday life spans a wide range of emotions and experiences - from improving productivity and efficiency to promoting wonderment and daydreaming. But our research and designs do not reflect this important life balance. The research we undertake and the applications we build employ technology primarily for improving tasks and solving problems. Our claim is that our successful future technological tools, the one we really want to cohabitate with, will be those that incorporate the full range of life experiences. In this paper we present wonderment as a design concept, introduce a novel toolkit based on mobile phone technology for promoting non-experts to participate in the creating of new objects of wonderment, and finally describe probe style interventions used to inform the design of a specific object of wonderment based on urban sounds and ringtones called Hullabaloo.
Many-core GPU computing with NVIDIA CUDA
Authors: Mark Harris
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

In the past, graphics processors were special-purpose hardwired application accelerators, suitable only for conventional graphics applications. Modern GPUs are fully programmable, massively parallel floating point processors. In this talk I will describe NVIDIA's scalable, highly parallel many-core GPU architecture and how CUDA software for GPU computing delivers high throughput for data-intensive processing. I will discuss how CUDA is reinvigorating research on data-parallel algorithms, reducing time to scientific discovery, and enabling a variety of compute-intensive industrial applications of GPUs beyond computer graphics.
The lower and upper bounds on Perron root of nonnegative irreducible matrices
Authors: Guang-Xin Huang, Feng Yin, Ke Guo
Venue: Journal of Computational and Applied Mathematics (2008)

Let A be an nxn nonnegative irreducible matrix, let A[@a] be the principal submatrix of A based on the nonempty ordered subset @a of {1,2,...,n}, and define the generalized Perron complement of A[@a] by P"t(A/A[@a]), i.e., P"t(A/A[@a])=A[@b]+A[@b,@a](tI-A[@a])^-^1A[@a,@b],t>@r(A[@a]).This paper gives the upper and lower bounds on the Perron root of A. An upper bound on Perron root is derived from the maximum of the given parameter t"0 and the maximum of the row sums of P"t"""0(A/A[@a]), synchronously, a lower bound on Perron root is expressed by the minimum of the given parameter t"0 and the minimum of the row sums of P"t"""0(A/A[@a]). It is also shown how to choose the parameter t after @a to get tighter upper and lower bounds of @r(A). Several numerical examples are presented to show that our method compared with the methods in [L.Z. Lu, M.K. Ng, Locations of Perron roots, Linear Algebra Appl. 392 (2004) 103-117.] is more effective.