ppxscal/embedding_network huggingface dataset:
Efficient image transmission using transform-based compression techniques
Authors: A. Alasaad, H. Behairy, M. Khorsheed
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

We present a system for still image transmission over noisy satellite channels. The system couples image compression together with error control codes to improve the received image quality while maintaining its bandwidth requirements. In this paper we extend our previous work on Discrete Cosine Transform (DCT) based image compression in noisy channels. We evaluate the performance of Discrete Wavelet Transform (DWT) based image compression and compare it to its equivalent DCT-based. We show how DWT-based image compression outperforms DCT-based both in noise-free and noisy channels. We also show how using a class of Forward Error Correction called Parallel Concatenated Gallager Codes (PCGC) can significantly improve the quality of the transmitted image in noisy channels. Despite the bandwidth expansion caused by introducing PCGC, the protected image occupies a smaller bandwidth now by compressing the image before applying PCGC. Evaluation results show improvement in the over-all system including bandwidth requirements compared to similar systems with different coding schemes.
Data locality enhancement for CMPs
Authors: Mahmut Kandemir
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As chip multiprocessors (CMPs) are being increasingly used in embedded computing, optimizing data locality considering interprocessor interactions is becoming critical. To address this problem, this paper proposes a new abstraction called the interprocessor data reuse vector, which captures the reuse distance (in terms of loop iterations) between successive accesses to a given data element from different processors. Based on this reuse vector, we then present a data locality optimization scheme. A unique characteristic of this scheme is that it allows application of different transformations to different processors of the CMP if this helps improve locality of data shared across processors. We automated our approach within an optimizing compiler and collected statistics using eight application codes. Our results indicate that the proposed code restructuring is very effective in practice (about 9% savings in performance over a standard data locality optimizer).
Evaluation of all one-to-many reliabilities for acyclic multistate-node distributed computing system under cost and capacity constraints
Authors: Wei-Chang Yeh
Venue: Computer Communications (2007)

A novel problem is proposed in this study by considering all one-to-many acyclic multistate-node distributed computing system (AMNDCS) reliabilities with limited cost (budget) and memory capacity. The AMNDCS is an extension of the multistate network without satisfying the flow conservation law. A very straightforward and simply programmed exact algorithm is developed for this problem using the universal generating function method (UGFM) and a generalized multiplication operator. The correctness and computational complexity of the proposed algorithm will be analyzed and proven. An illustrative example is presented to demonstrate how this problem is solved using the proposed UGFM.
Game-theoretic modeling and control of military operations with partially emotional civilian players
Authors: Mo Wei, Genshe Chen, Jose B. Cruz,  Jr., Leonard Hayes, Martin Kruger, Erik Blasch
Venue: Decision Support Systems (2008)

Civilians are not just passively static but might purposefully take actions to help one side in a battle. Sometimes civilians might directly join one side if they are excessively agitated by the other side. In this paper, a three-player attrition-type discrete time dynamic game model is formulated, in which there are two opposing forces and one civilian player that might be neutral, biased, or even joining one side publicly. Emotions of civilians are dynamically updated via anger mechanism. An example scenario and extensive simulations illustrate possible applications of this model, and comparative discussions further clarify the benefits.
Soft computing based multi-agent marketing decision support system
Authors: Rafik A. Aliev, Bijan Fazlollahi, Rustam M. Vahidov
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

The new concept of soft computing based distributed multi-agent marketing decision support system (DSS) is proposed in this paper. The DSS is composed of a number of parallel intelligent agents acting in a distributed mode, and one coordinating agent for evaluation of solutions. Generation of a final solution in DSS is achieved through cooperative and competitive interactions among intelligent agents. The main idea of the proposed DSS is based on decomposition of the overall system intelligence among cooperative autonomous intelligent agents capable of competing and cooperating with each other in order to propose total solution to the problem and to integrate local solutions into the final solution. Each distributed intelligent agent is implemented as fuzzy knowledge based system with modest number of rules. The agent-coordinator (evaluator) evaluates the proposals and ranks the fuzzy values of the outcome produced by intelligent contending agents. The outcome of each agent is estimated on the basis of its solution, input information, and other necessary information using a neuro-fuzzy estimator tuned by a genetic algorithm. The proposed concept for designing DSS is illustrated through a marketing-mix DSS.
Uncertain Privacy Decision about Access Personal Information in Pervasive Computing Environments
Authors: Qingsheng Zhang, Yong Qi, Di Hou, Jizhong Zhao, Huawei Han
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In pervasive computing environments, context- aware applications provide services for people by using personal information. People also make privacy decision about personal information disclosure as privacy concerns. Privacy decision depends on people's interaction situation. The trust of information collector and personal information sensitivity often enable people to make uncertain privacy decision. Therefore, we construct a fuzzy objective information system that consists of personal interaction situation history. The privacy disclosure policies are extracted from this information system under using rough set theory. The context-aware applications are assigned to an adequate privacy role with the privacy disclosure policies and situation of people's interaction. Finally, we provide a working example and the initial performance evaluation.
KQStream: Kindred-Based QoS-Aware Live Media Streaming in Heterogeneous Peer-to-Peer Environments
Authors: Yuan He, Tao Gu, Jiang Guo, Jingyao Dai
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

This paper presents the design of a Kindred-based QoS-aware Live Media Streaming (KQStream) system in heterogeneous peer-to-peer environments. Motivated by the Multiple Description Coding technique, we propose a novel kindred-based approach to construct a peer-to-peer overlay topology. To achieve QoS-awareness during the streaming process, we propose a dynamic QoS-aware regulating technique which takes into account of user's preference, network bandwidth and buffer size. With the integration of the two proposed techniques, KQStream provides more flexibility in heterogeneous peer-to-peer environments and configurable playback with dynamic QoS-aware regulating.
Fuzzy time-series based on adaptive expectation model for TAIEX forecasting
Authors: Ching-Hsue Cheng, Tai-Liang Chen, Hia Jong Teoh, Chen-Han Chiang
Venue: Expert Systems with Applications: An International Journal (2008)

Time-series models have been used to make predictions in the areas of stock price forecasting, academic enrollment and weather, etc. However, in stock markets, reasonable investors will modify their forecasts based on recent forecasting errors. Therefore, we propose a new fuzzy time-series model which incorporates the adaptive expectation model into forecasting processes to modify forecasting errors. Using actual trading data from Taiwan Stock Index (TAIEX) and, we evaluate the accuracy of the proposed model by comparing our forecasts with those derived from Chen's [Chen, S. M. (1996). Forecasting enrollments based on fuzzy time-series, Fuzzy Sets and Systems, 81, 311-319] and Yu's [Yu, Hui-Kuang. (2004). Weighted fuzzy time-series models for TAIEX forecasting. Physica A, 349, 609-624] models. The comparison results indicate that our model surpasses in accuracy those suggested by Chen and Yu.
MPSoC memory optimization for digital camera applications
Authors: Y. Bouchebaba, B. Lavigueur, B. Girodias, G. Nicolescu, P. G. Paulin
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Multiprocessor system-on-a-chip architectures have received a lot of attention in the past years, but few advances in compilation techniques are targeting these architectures. This is particularly true for the exploitation of data locality. Most of the compilation techniques discussed in the literature for parallel architectures are based on single loop nest. However, most multimedia and image processing applications are composed of several loop nests. In this paper, new techniques based on program transformations are proposed to optimize these types of applications. In a monoprocessor architecture, the loop fusion technique is well known. In this paper, the loop fusion is generalized and adapted to a MPSoC architecture. Another technique called "Computation Propagation" is proposed. It completely removes the temporary arrays and significantly reduces the memory accesses, the memory space and the processing time. Experimental results show that this new technique yields a significant reduction in the number of data cache misses (35%), in processing time (30%) and in channel transactions (85%).
Comparative Analysis and Design of Wired and Wireless Integrated Networks for Wireless Sensor Networks
Authors: Meong-hun Lee, Hyun Yoe
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Plenty of new routing protocols have been presented to overcome the difficulty in applying the routing protocol which was proposed for the existing wireless networks (IEEE 802.11) to WSN. Therefore, this paper presents the wired and wireless integrated networks which transmit the information collected from the wireless sensor networks to wired networks via WSN Gateway. At this time, this paper embodies the Zigbee protocol in the wireless networks based on the 802.15.4 standard and designs an advanced routing protocol for wired and wireless integrated networks by modifying the existing ad hoc routing protocol to enable access to wired networks such as the internet. Moreover, we design an integration method which is based on WSN Gateway which integrates two different networks efficiently. To evaluate the proposed research, we simulated an advanced routing method and WSN Gateway in the wired and wireless integrated networks using the NS-2 simulator.
Warning: Launch off Shift Tests for Delay Faults May Contribute to Test Escapes
Authors: Zhuo Zhang, Sudhakar M. Reddy, Irith Pomeranz
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Two methods to apply tests to detect delay faults in standard scan designs are used. One is called launch off capture and the other is called launch off shift. Launch off shift test method has the advantage that it provides higher fault coverage at reduced test generation time and test pattern counts. However a concern expressed often in the literature is the potential over testing or yield loss caused by the fact that launch off shift operates the circuit under test in non-functional manner. In this paper we present data, for the first time, which points to another potential problem with launch off shift tests. The data presented for ISCAS-89 benchmark circuits shows that a considerable numbers of functionally detectable transition delay faults are not detected by the normally used launch off shift tests that use a single fault activation cycle. Functionally detectable faults that escape tests could cause circuit malfunction in normal operation. Thus launch off shift tests when used in manufacturing test may result in test escapes. We also present data that shows that if launch off shift tests with multiple fault activation cycles are used essentially all functionally detectable faults can be detected.
Evaluating curricula for the teaching of programming
Authors: Ronald G. Ragsdale
Venue: ACM SIGCUE Outlook (1978)

Despite the great and continuing interest in methods of effective teaching of computer science concepts, especially programming, there is little hard data to back up the opinions that are so vigorously expressed. Moreover, most of those studies that have attempted to investigate programming instruction have been sufficiently flawed so as to render them of little use. The first section of this paper deals with many of the flaws commonly found in studies of instruction in programming. These include non-random assignment of subjects, assuming identical instruction to different groups, experimenter bias, use of "available resources", short experimental treatments, home grown tests, and questionable analysis techniques. The second section contains a description of the principles of good experimental design, using the concepts of internal and external validity. An experiment usually requires a compromise between the internal validity, which relates to control of experimental conditions, and the external validity, which has to do with the generalizability of the results. The final section contains conclusions concerning initial steps that might be taken to rectify the problem caused by a lack of valid data. These steps include better and more objective quantification of the attributes of good programs and more integrative techniques for analyzing the results of multiple studies.
Comparison of neuro-fuzzy systems for classification of transcranial Doppler signals with their chaotic invariant measures
Authors: Ali Ozturk, Ahmet Arslan, Firat Hardalac
Venue: Expert Systems with Applications: An International Journal (2008)

Transcranial Doppler (TCD) is a non-invasive diagnosis method which is used in diagnosis of various brain diseases by measuring the blood flow velocities in brain arteries. In this study, chaos analysis of the TCD signals recorded from the middle arteries of the temporal region of the brain of 82 patients and 24 healthy people was investigated. Among 82 patients, 20 of them had cerebral aneurism, 10 patients had brain hemorrhage, 22 patients had cerebral oedema and the remaining 30 patients had brain tumour. It was found that all of the TCD signals represented nonlinear dynamics and had an underlying low-level determinism. All of the TCD signals were passed through the nonlinearity tests which involved the application of surrogate data method. The maximum Lyapunov exponent (@l"1) which is the strongest quantitative indicator of chaos was found to be positive for all TCD signals. The correlation dimension (D"2) was found as greater than 2 and as fractional value for all TCD signals. This result indicates that the nonlinear dynamics of the TCD signals corresponds to a strange attractor in phase space which implies a non-ergodic dissipative system having low-level chaotic behaviour. Besides, the values of @l"1 and D"2 were approximately the same for the TCD signals of the patients having the same brain disease. Relying on this observation, these two chaotic invariant measures were divided into training and test subsets including 52 and 54 subjects, respectively. For comparison purposes, the training set was used to build two different neuro-fuzzy models, namely ANFIS and NEFCLASS. The rule base of the NEFCLASS model was created by applying the samples in the training subset for 1000 epochs. On the other hand, the ANFIS model was trained for 250 epochs until the convergence error has decreased to 0.42x10^-^5. The ANFIS model achieved better classification accuracy than the NEFCLASS model for the samples in the test set. The classification accuracy of the ANFIS model after training was 94.40% whilst this value was found as 88.88% for the NEFCLASS model.
Hybrid Host/Network Topologies for Massive Storage Clusters
Authors: Asha Andrade, Ungzu Mun, Dong Hwan Chung, Alexander E. Mohr
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The high demand for large scale storage capacity calls for the availability of massive storage solutions with high performance interconnects. Although cluster file systems are rapidly improving and have the potential to allow extremely large numbers of commodity storage nodes to be pooled into a single large file-system, the number of ports on individual switches has not been increasing as quickly -- the largest switches available today support fewer than 2,000 Gigabit Ethernet ports. Our goal, therefore, is to develop a new interconnect topology that can connect hundreds of thousands of nodes and achieve performance comparable to a single switch of equivalent size. At the same time, such a new topology should be readily buildable using inexpensive components. Our proposed architecture exploits the multiple Ethernet ports that are now standard on servers and combines host-based routing and forwarding with network-based switching to allow massively large storage clusters to be built. Simulation results have shown that our proposed design achieves 72% to 90% of the performance of a single switch capable of accommodating all storage nodes, but our approach scales to hundreds of thousands of nodes. Furthermore, we use common off-the-shelf layer-2 switches rather than more expensive models that support layer-3 routing. Finally, our approach is resilient to network faults because it maintains multiple paths between storage nodes.
Session Control Protocol Exploiting Controlled Mobility in Multi-Robot Sensor Networks
Authors: Ryohei Suzuki, Yoshito Tobe, Kaoru Sezaki
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Sensor networks using mobile robots have recently been proposed to provide more flexible and efficient sensing. One of the key challenges under this paradigm is a management of transferring a huge amount of data. In this paper, we propose a model and protocol for session control exploiting controlled mobility in Multi-Robot Sensor Networks (MRSNs) to transfer the huge amount of data efficiently. Since a communication in MRSNs is mainly provided by a physical movement of the mobile node, the performance of the session heavily depends on this movement. However, if a node initiating the session can utilize sufficient amount of nodes, the performance of the session significantly depends on the wireless communication. In this paper, we propose a suitable method of session control which is determined the balance between movement and wireless communications based on local information such as the location, number, maximum-velocity and buffer-size of surrounding nodes. WISER/s also takes a system policy of either delay minimization or energy efficiency into consideration. In this paper, we describe a method of how to initiate, terminate and manage the session including dynamic selection of optimal nodes' formation. We evaluate the performance of WISER/s using mobile robots which are equipped with MICA2 mote and comparing with non-optimized method. The experimental results demonstrate that WISER/s achieves better performance than non-optimized method.
Employing Expert Opinion and Software Metrics for Reasoning About Software
Authors: Norita Ahmad, Phillip A. Laplante
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

When comparing software programs based on certain qualities there is usually more than one metric that can be used. Often these metrics may contradict one another or there may be no standard acceptance thresholds. In this work we demonstrate how the Analytical Hierarchy Process (AHP) can be used to mitigate the aforementioned deficiencies in metrics-based software decision making. We illustrate the procedure by incorporating value judgments from a group of experts into an existing metrics data set to rank the design complexity in three imaging software packages. In this case the injection of expert opinion in a formalized framework minimizes the problems associated with conflicting metrics. The contribution of this work is to demonstrate how a combination of expert opinion and tool-collected measures can be used to reason about software programs. The methodology employed can be easily modified to include different metrics, applications and weights, thus providing a practical assessment tool for decision making about software.
Estimation of Classification Error
Authors: K. Fukunaga, D. L. Kessell
Venue: IEEE Transactions on Computers (1971)

This paper discusses methods of estimating the probability of error for the Bayes' classifier which must be designed and tested with a finite number of classified samples. The expected difference between estimates is discussed. A simplifled algorithm to compute the leaving-one-out method is proposed for multivariate normal distributions wtih unequal co-variance matrices. The discussion is extended to nonparametric classifiers by using the Parzen approximation for the density functions. Experimental results are shown for both parametric and nonparametric cases.
An Extensible Architecture for Network-Attached Device Management
Authors: Michael J. Jr. McMahon, Sergiu M. Dascalu, Frederick C. Jr. Harris, Juan Quiroz
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The development of network-attached devices has ushered in an era of autonomous, multi-function equipment demanding minimal human interaction: the only requirements are data and electricity. Despite these advances, these machines continue underutilized in network environments due to operating system limitations regarding the management of these devices. These limitations force the use of these devices via other network hardware, such as a server, that manage the device access and data. While effective, this results in increased resource consumption and ignores the capabilities presented by network-attached devices. In order to facilitate optimal utilization of these devices, we have designed a new, extensible management architecture for all network-attached devices. This architecture, presented here, supports the central management of network-attached devices while allowing client machines access to the device without intermediate server hardware. Implementation of this paradigm on test networks has decreased resource consumption - especially bandwidth - considerably.
Modeling of streaming and elastic flow integration in OFDMA-based IEEE802.16 WiMAX
Authors: Chadi Tarhini, Tijani Chahed
Venue: Computer Communications (2007)

We study in this paper the capacity of the downlink of OFDMA-based IEEE802.16 WiMAX system in the presence of two types of traffic, streaming and elastic. We focus in particular on the impact of Adaptive Modulation and Coding (AMC) as well as inter-cell interference resulting from different frequency reuse schemes. Several performance measures, namely blocking rates, mean transfer time and the mean number of collisions between two OFDMA WiMAX cells, are then derived and quantified. We show that reuse partitioning results in a higher blocking rate at the appreciable gain in terms of lower mean transfer time for users close to the base station as well as a lower number of collisions which implies a higher throughput.