ppxscal/embedding_network huggingface dataset:
Time series pattern recognition using s-transform and soft computing
Authors: P. K. Dash, Maya Nayak, I. W. C. Lee
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper presents a new approach to time series pattern classification using a modified wavelet transform for feature extraction of non-stationary time series data and a fuzzy multilayer perceptron network to generate the rules and classify the patterns. Also simple rule based event detection systems are used in a hybrid manner to classify all the categories of the non-stationary data that occur in a power distribution network during faults, sudden switching operations, and transient disturbances. The choice of modified wavelet transform known as multiresolution S-transform is essential for transient time series data of very short duration as they can not be handled by conventional Fourier and other transform methods for extraction of relevant features pertinent for temporal pattern recognition applications. The trained network infers the output class membership value of an input pattern and a certainty measure is also presented to facilitate rule generation. Several simulated data patterns along with the classification scores are presented in this paper.
CCVisu: automatic visual software decomposition
Authors: Dirk Beyer
Venue: Companion of the 30th international conference on Software engineering (2008)

Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given software system, a decomposition of the system into its subsystems. CCVisu is a lightweight tool that takes as input a software graph model and computes a visual representation of the system's structure, i.e., it structures the system into separated groups of artifacts that are strongly related, and places them in a 2- or 3-dimensional space. Besides the decomposition into subsystems, it reveals the relatedness between the subsystems via interpretable distances. The tool reads a software graph from a simple text file in RSF format, e.g., call, inheritance, containment, or co-change graphs. The resulting system structure is currently either directly presented on the screen, or written to an output file in SVG, VRML, or plain text format. The tool is designed as a reusable software component, easy to use, and easy to integrate into other tools; it is based on efficient algorithms and supports several formats for data interchange.
Tiny split data-caches make big performance impact for embedded applications
Authors: Afrin Naz, Krishna Kavi, Wentong Li, Philip Sweany
Venue: Journal of Embedded Computing (2006)

This paper shows that even very small data caches, when split to serve data streams exhibiting temporal and spatial localities, can improve performance of embedded applications without consuming excessive silicon real estate or power. It also shows that large block sizes or higher set-associativities are unnecessary with split cache organizations. We use benchmark programs from MiBench to show that our cache organization outperforms other organizations in terms of miss rates, access times, energy consumption and silicon area.
The effects of active queue management and explicit congestion notification on web performance
Authors: Long Le, Jay Aikat, Kevin Jeffay, F. Donelson Smith
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

We present an empirical study of the effects of active queue management (AQM) and explicit congestion notification (ECN) on the distribution of response times experienced by users browsing the Web. Three prominent AQM designs are considered: the Proportional Integral (PI) controller, the Random Exponential Marking (REM) controller, and Adaptive Random Early Detection (ARED). The effects of these AQM designs were studied with and without ECN. Our primary measure of performance is the end-to-end response time for HTTP request-response exchanges. Our major results are as follows. • If ECN is not supported, ARED operating in byte-mode was the best performing design, providing better response time performance than drop-tail queueing at offered loads above 90% of link capacity. However, ARED operating in packet-mode (with or without ECN) was the worst performing design, performing worse than drop-tail queueing. • ECN support is beneficial to PI and REM. With ECN, PI and REM were the best performing designs, providing significant improvement over ARED operating in byte-mode. In the case of REM, the benefit of ECN was dramatic. Without ECN, response time performance with REM was worse than drop-tail queueing at all loads considered. • ECN was not beneficial to ARED. Under current ECN implementation guidelines, ECN had no effect on ARED performance. However, ARED performance with ECN improved significantly after re versing a guideline that was intended to police unresponsive flows. Overall, the best ARED performance was achieved without ECN. • Whether or not the improvement in response times with AQM is significant, depends heavily on the range of round-trip times (RTTs) experienced by flows. As the variation in flows' RTT increases, the impact of AQM and ECN on response-time performance is reduced. We conclude that AQM can improve application and network performance for Web or Web-like workloads. In particular, it appears likely that with AQM and ECN, provider links may be operated at near saturation levels without significant degradation in user-perceived performance.
Higher order multivariate automatic differentiation and validated computation of remainder bounds
Authors: Martin Berz, Kyoko Makino
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

High order automatic differentiation has been used in recent years for simultaneous computation of Taylor expansions of functional dependencies as well as validated enclosures for the remainder over a certain domain. The resulting Taylor model methods offer certain advantages compared to other validated methods, including an approximation by a functional form with an accuracy scaling with a high order, as well as the ability to suppress the dependency problem. In this paper we describe the implementation of the method in a validated setting. Several steps are taken to increase computational efficiency. Computations of coefficients are not performed in interval arithmetic, but rather in floating point arithmetic with simultaneous accurate accounting of the possible computational errors. Furthermore, the storage and elementary operations of the objects supports sparsity of the coefficients.
Secure Team-Based EPR Access Acquisition in Wireless Networks
Authors: Sigurd Eskeland, Vladimir Oleshchuk
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Electronic patient records (EPR) may contain highly confidential and sensitive medical data, and it is therefore essential that such information is properly protected. Medical teams that are providing care to a patient has a legitimate need to access the medical dataof the concerning patient, and this could be a valid criteria for medical professionals to obtain access to such data. Moreover, since teams consist of more than one individual, the consent or agreement among a number of the members of a medical team could by itself be a proper basis for trust and therefore a legitimate basis for medical teams to acquire access to medical data.In this paper, we present three closely related cryptographic protocols for secure team-based EPR access acquisition where the cryptographically verifiable mutual consent from some minimum number of participants of a medical team is the granting criteria for the team to acquire EPR access. The schemes are based on thresholdcryptography and are moreover broadcast-oriented, and are thus well-suitable for wireless networks. All schemes do also provide secure transfer of medical data.
Catalog of Metrics for Assessing Security Risks of Software throughout the Software Development Life Cycle
Authors: Khalid Sultan, Abdeslam En-Nouaary, Abdelwahab Hamou-Lhadj
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In this paper, we present a new set of metrics for building secure software systems. The proposed metrics aim to address security risks throughout the entire Software Development Life Cycle (SDLC). The importance of this work comes from the fact that assessing security risks at early stages of the development life cycle can help implement efficient solutions before the software is delivered to the customer. The proposed metrics are defined using the Goal/Question/Metric method. It is anticipated that software engineers will use these metrics in combination with other techniques to detect security risks and prevent these risks from becoming reality. This work is part of a larger research project that aims at examining the concept of “Design for Security”. The objective is to investigate software engineering techniques to support security requirements from the very beginning of the development process.
An Efficient Structural Index for Graph-Structured Data
Authors: Yingjie Fan, Chenghong Zhang, Shuyun Wang, Xiulan Hao, Yunfa Hu
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

To speed up queries over XML and semi-structured data, a number of structural indexes have been proposed. The structural index is usually a labeled directed graph defined by partitioning nodes in the XML datagraph in to equivalence classes and storing equivalence classes as index nodes. On the basis of the Inter-Relevant Successive Trees (IRST), we propose an efficient adaptive structural index, IRST (k)-index. Compared with the previous indexes, such as the A (k)-index, D (k)-index, and M (k)-index, our experiment results show that the IRST(k)-index performs more efficiently in terms of space consumption and query performance, while using significantly less construction time.
A Content-Based Multimedia Retrieval System Base on MPEG-7 Metadata Schema
Authors: Yongbo Ma, Zhiyi Fang, Jin Liu, Tianyang Wang, Peng Xu, Lianyu Zhao
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we proposed a framework of multimedia retrieval system base on the MPEG-7 standard as information schema. It provides a content-based retrieval method which uses MPEG-7 Metadata Schema. Our framework is aim at the high-level semantic retrieval, which composed of three module and fully rely on the MPEG-7 standard. This framework provides a rich set of automatic feature extraction components and an independent retrieval interface.
Study of Regional Innovation Networks Based on Industry Amalgamation
Authors: Hu Shuhua, Zhang Jixin
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper is based on the phenomenon of the integrative innovation from product innovation to industry innovation, from industry innovation to regional industry discussed above. It extends the meso research scope from separate industry innovation to synergetic innovation of industry amalgamation. this paper puts forward that regional innovation networks could be constructed by new industry value chain that is brought about by industry amalgamation. Particularly it studies on the dot-line-section principle of technology amalgamationindustry Amalgamationregional innovation; on diffusion path and value mode of high technology in the integrated innovation of technology amalgamation-industry amalgamationregional innovation. Consequently it draws the conclusion that regional innovation networks should be constructed specifically by computer and management combined integrative instruments. Finally integrated and synergetic advantages of regional innovation networks based on technology amalgamation and industry amalgamation will be beneficial to the improvement of regional whole innovation competence and regional competitive power.
Experimental Study of Voice over IP Services over Broadband Wireless Networks
Authors: Edwin W. C. Peh, Winston K. G. Seah, Y. H. Chew, Y. Ge
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, a hybrid network consisting of both WiMAX and WiFi links is set up and used as a testbed for Voice-over-IP (VoIP) performance studies. Relevant metrics are defined and used to analyse the performance of this hybrid network and its ability to support VoIP calls. End-to-end delay and packets loss are measured as a function of number of ongoing VoIP calls. Based on these measured results, we propose a procedure to evaluate the maximum number of ongoing calls can be supported by the hybrid network while maintain the call quality at the desired level using the ITU-T specified E-model. The experimental studies show that this hybrid network is capable of supporting real-time VoIP calls, and that the network is able to support up to 12 simultaneous G.711-based VoIP calls and more than 20 simultaneous G.729-based VoIP calls. While it remains a challenge to ascertain the exact reasons behind the low network utilization, the proposed procedure for determining the maximum number of VoIP calls which meet the QoS requirements will be useful and valuable to service providers with the intention to provide VoIP services over such hybrid networks that interoperate these two technologies in the near future.
Handoff Performance Comparison of Mobile IP, Fast Handoff and mSCTP in Mobile Wireless Networks
Authors: Ken C. K. Tsang, Cho-Li Wang, Francis C. M. Lau
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

We compare the performance of three handoff protocols, namely Mobile IP, Fast Handoff and mSCTP. Among the three schemes, Mobile IP suffers from the lowest data throughput and longest handoff latency. Fast Handoff can perform better, provided that the mobile node can handoff to the new base station at an appropriate time instant when data forwarding between network routers begins. mSCTP supports multihoming; the mobile node does not need to determine the exact handoff time. Nevertheless, packet reordering and the subsequent fast retransmission degrades its handoff performance. To avoid these problems, adding some flow control operations in the transport layer is necessary. Flow control should be carried out in-sync with the handoff operations. This implies the transport layer should additionally recognise when do the handoff procedures start or finish. We therefore come up with a natural choice in designing a handoff scheme, which is to centralise the handoff and flow control operations in the transport layer.
Fully distributed EM for very large datasets
Authors: Jason Wolfe, Aria Haghighi, Dan Klein
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of the parameters in a single node for the M-step can be impractical. We present a framework that fully distributes the entire EM procedure. Each node interacts only with parameters relevant to its data, sending messages to other nodes along a junction-tree topology. We demonstrate improvements over a MapReduce topology, on two tasks: word alignment and topic modeling.
A new method for fast transforms in parity-mixed PDEs: Part I. Numerical techniques and analysis
Authors: Geoffrey M. Vasil, Nicholas H. Brummell, Keith Julien
Venue: Journal of Computational Physics (2008)

We address the problem of parity mixing, where the projection of a variable expressed as a finite series of half-period cosine (sine) functions onto a half-period sine (cosine) function basis is not finite. We propose new fast methods for computing these complicated projections exactly up to some arbitrary degree using fast Fourier transforms. This method has immediate applications for pseudospectral solutions of many systems of partial differential equations.
Partial resolution for redundant operation table
Authors: Byung-Soo Choi, Jun-Dong Cho
Venue: Microprocessors Microsystems (2008)

In this work, we discuss several drawbacks of the conventional wide-width redundant operation table such as the waste of area cost and power consumption. We found that the waste of area cost and power consumption is caused by storing meaningless bits of the narrow-width operand values. Based on this analysis, we propose a way to avoid these storing of meaningless information of the narrow-width operands. The proposed method, partial resolution method, divides the conventional wide-width redundant operation table into two tables as the wide-width table for the half entries and the narrow-width table for the other half entries. The wide-width and the narrow-width redundant operation tables store different dynamic instructions whose operand values are wide and narrow, respectively. Since the narrow-width redundant operation table stores smaller number of bits, it requires lower area cost and also power consumption compared with the wide-width redundant operation table. The partial resolution method decreases the area cost by about 7% and 20% for the integer and the floating-point tables, respectively, and reduces the dynamic power consumption by about 34% and 30% for the integer and the floating-point tables, respectively, compared with the conventional wide-width redundant operation table with 2K entries. Meanwhile, the performance simulation with a high-end microarchitecture model and SPEC2000 benchmarks shows that the partial resolution method affects the performance very little, and even increases slightly in terms of IPC (Instruction per Cycle) value.
MOVIS: A system for visualizing distributed mobile object environments
Authors: Yaniv Frishman, Ayellet Tal
Venue: Journal of Visual Languages and Computing (2008)

This paper presents MOVIS-a system for visualizing mobile object frameworks. In such frameworks, the objects can migrate to remote hosts, along with their state and behavior, while the application is running. An innovative graph-based visualization is used to depict the physical and the logical connections in the distributed object network. Scalability is achieved by using a focus+context technique jointly with a user-steered clustering algorithm. In addition, an event synchronization model for mobile objects is presented. The system has been applied to visualizing several mobile object applications.
Long-term cumulative distribution modeling of tropospheric scintillation for the earth-satellite links in the 40/50 GHz band
Authors: M. Akhondi, A. Ghorbani
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In this paper, we have obtained a model for the prediction of scintillation fade depth, scintillation intensity, and cumulative distribution of its intensity, in the 40/50 GHz band. By applying a regression analysis to the experimental data collected at Madrid, a new model is proposed. Moreover, the prediction accuracy of the our new model is evaluated using the experimental results from Spino d'Adda, Italy.
Agent Mertacor: A robust design for dealing with uncertainty and variation in SCM environments
Authors: Kyriakos C. Chatzidimitriou, Andreas L. Symeonidis, Ioannis Kontogounis, Pericles A. Mitkas
Venue: Expert Systems with Applications: An International Journal (2008)

Supply Chain Management (SCM) has recently entered a new era, where the old-fashioned static, long-term relationships between involved actors are being replaced by new, dynamic negotiating schemas, established over virtual organizations and trading marketplaces. SCM environments now operate under strict policies that all interested parties (suppliers, manufacturers, customers) have to abide by, in order to participate. And, though such dynamic markets provide greater profit potential, they also conceal greater risks, since competition is tougher and request and demand may vary significantly in the quest for maximum benefit. The need for efficient SCM actors is thus implied, actors that may handle the deluge of (either complete or incomplete) information generated, perceive variations and exploit the full potential of the environments they inhabit. In this context, we introduce Mertacor, an agent that employs robust mechanisms for dealing with all SCM facets and for trading within dynamic and competitive SCM environments. Its efficiency has been extensively tested in one of the most challenging SCM environments, the Trading Agent Competition (TAC) SCM game. This paper provides an extensive analysis of Mertacor and its main architectural primitives, provides an overview of the TAC SCM environment, and thoroughly discusses Mertacor's performance.
The impact of traffic aggregation on the memory performance of networking applications
Authors: Javier Verdú, Jorge García, Mario Nemirovsky, Mateo Valero
Venue: Journal of Embedded Computing (2006)

The trend of the networking processing is to increase the intelligence of the routers (i.e. security capacities). This means that there is an increment in the workload generated per packet and new types of applications are emerging, such as stateful programs. On the other hand, Internet traffic continues to grow vigorously. This fact involves an increment of the traffic aggregation levels and overloades the processing capacities of the routers. In this paper we show the importance of traffic aggregation level on networking application studies. We also classify the applications according to the data management of the packet processing. Hence, we present the different impacts on the data cache performance depending on the application category. Our results show that traffic aggregation level may affect the cache performance depending on the networking application category. Stateful applications show a significant sensitivity to this impact.
Object recognition and segmentation in videos by connecting heterogeneous visual features
Authors: Valérie Gouet-Brunet, Bruno Lameyre
Venue: Computer Vision and Image Understanding (2008)

We present an approach for model-free and instance-level object recognition and segmentation in cluttered scenes, based on heterogeneous visual features. The first contribution of this work addresses the description of the visual appearance of objects, by proposing the joint use of complementary features of different natures: on the one hand, a set of local descriptors based on interest points that have well-known interesting properties; on the other hand, a global descriptor based on a snake, providing a high-level description of the object shape. Our second contribution consists in efficiently structuring and connecting the visual features obtained, making possible the use of global descriptors without prior segmentation/detection. Our approach is compared to a classic one based on local descriptors only and is evaluated for video surveillance purposes over sequences involving 20 objects. We show that recognition is improved, and provides precise object segmentation, even with large occlusions. A real scenario of application to video surveillance of truck traffic validates the relevance of the approach.