ppxscal/embedding_network huggingface dataset:
Constant Rate Dataflow Model with Intermediate Ports for Efficient Code Synthesis with Top-Down Design and Dynamic Behavior
Authors: Hyunok Oh
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper extends the existing synchronous dataflow (SDF) model to provide dynamic behavior and top down design with compile time deadlock detection and bounded buffer memory.We propose a new dataflow model called constant rate dataflow with intermediate ports (CRDF-IP) in which a component (or actor) can send and receive data to/from another actor through intermediate port during its execution. Since an actor can call another actor multiple times per execution, dynamic behaviors are easily specified without introducing run-time scheduler. Moreover, top-down design can be achieved by extracting a sub-actor from the top actor.This paper has proved that deadlock detection and buffer size computation can be performed at compile in CRDF-IP model. The proposed model has been implemented in a system level design platform in which H.263 video encoding algorithm is specified.
Smoothed L-estimation of regression function
Authors: P. íek, J. Tamine, W. Härdle
Venue: Computational Statistics Data Analysis (2008)

The Nadaraya-Watson nonparametric estimator of regression is known to be highly sensitive to the presence of outliers in data. This sensitivity can be reduced, for example, by using local L-estimates of regression. Whereas the local L-estimation is traditionally done using an empirical conditional distribution function, we propose to use instead a smoothed conditional distribution function. The asymptotic distribution of the proposed estimator is derived under mild @b-mixing conditions, and additionally, we show that the smoothed L-estimation approach provides computational as well as statistical finite-sample improvements. Finally, the proposed method is applied to the modelling of implied volatility.
Security analysis of Internet technology components enabling globally distributed workplaces&mdash;a framework
Authors: Manish Gupta, Shamik Banerjee, Manish Agrawal, H. Raghav Rao
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

As organizations increasingly operate, compete, and cooperate in a global context, business processes are also becoming global to propagate the benefits from coordination and standardization across geographical boundaries. In this context, security has gained significance due to increased threats, as well as legislation and compliance issues. This article presents a framework for assessing the security of Internet technology components that support a globally distributed workplace. Four distinct information flow and design architectures are identified based on location sensitivities and placements of the infrastructure components. Using a combination of scenarios, architectures, and technologies, the article presents the framework of a development tool for information security officers to evaluate the security posture of an information system. To aid managers in better understanding their options to improve security of the system, we also propose a three-dimensional representation, based on the framework, for embedding solution alternatives. To demonstrate its use in a real-world context, the article also applies the framework to assess a globally distributed workforce application at a northeast financial institution.
Trajectory tracking control for a wheeled mobile robot using fuzzy logic controller
Authors: K. N. Faress, M. T. El hagry, A. A. El kosy
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

A trajectory tracking control for a wheeled mobile robot using fuzzy logic controller (FLC) is presented in this paper. The control algorithm based on the errors in postures of mobile robot which feed FLC, which generates correction signals for the left and right motor speeds. The control strategy is based on a feed forward velocity profile and the correcting signal in the velocity generated from the FLC according to the postures errors. Simulation and experimental results demonstrate the effectiveness of the proposed algorithm, which proved the good tracking results and showed the robustness of the algorithm against the uncertainties in the system model.
A General Method for Shot Boundary Detection
Authors: Xue Ling, Li Chao, Li Huan, Xiong Zhang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Shot boundary detection is a fundamental step for the organization of large video data. A general shot boundary detection method is proposed. To improve the performance of the algorithm and reduce the calculation, smooth intervals inside shots are first concatenated from the original video. After that, features, like intensity pixel-wise difference, color histograms in HSV space and edge histograms in X and Y direction, are extracted from the new video sequence and used as the input vectors to the support vector machine (SVM). Consequently, we use the SVM to classify the frames. The outputs of the SVM are divided into four categories, which are respectively abrupt cuts, gradual changes and etc. After the classification, a detection algorithm is applied to the result sequence of the SVM classification to fulfill the shot boundary detection. Experimental results show that the proposed algorithm produces good detection results.
Operational analysis of processor speed scaling
Authors: Kai Shen, Alex Zhang, Terence Kelly, Christopher Stewart
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

This brief announcement presents a pair of performance laws that bound the change in aggregate job queueing time that results when the processor speed changes in a parallel computing system. Our laws require only lightweight passive external observations of a black-box system and they apply to many commonly employed scheduling policies. By predicting the application-level performance impact of processing speed adjustments in parallel processors, including traditional SMPs and now increasingly ubiquitous multicore processors, our laws address problems ranging from capacity planning to dynamic resource allocation. Finally, our results show that operational analysis---an approach to performance analysis traditionally associated with commercial transaction processing systems---usefully complements existing parallel performance analysis techniques.
On the efficiency of a random search method
Authors: G. Pérez-Lechuga, J. C. S. Tuoh-Mora, E. Morales-Sánchez, M. M. Álvarez Suárez
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper studies the efficiency of the random search reported by Rubinstein [1] and widely studied by Pérez-Lechuga [2]. We proof that the efficiency of the selected random search algorithm is a linear function both of the step size and the direction of the descent movement. We report the theoretical results.
Evaluation of Anomaly Based Character Distribution Models in the Detection of SQL Injection Attacks
Authors: Mehdi Kiani, Andrew Clark, George Mohay
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The ubiquity of web applications has led to an increased focus on the development of attacks targeting these applications. One particular type of attack that has recently become prominent is the SQL injection attack. SQL injection attacks can potentially result in unauthorized access to confidential information stored in a backend database. In this paper we describe an anomaly based approach which utilizes the character distribution of certain sections of HTTP requests to detect previously unseen SQL injection attacks. Our approach requires no user interaction, and no modification of, or access to, either the backend database or the source code of the web application itself. Our practical results suggest that the model proposed in this paper is superior to existing models at detecting SQL injection attacks. We also evaluate the effectiveness of our model at detecting different types of SQL injection attacks.
Comparison between ATSR-2 stereo, MOS O2-A band and ground-based cloud top heights
Authors: C. Naud, K. L. Mitchell, J. -P. Muller, E. E. Clothiaux, P. Albert, R. Preusker, J. Fischer, R. J. Hogan
Venue: International Journal of Remote Sensing (2007)

A new method to retrieve cloud top heights stereoscopically using the dual-view facility of the Along Track Scanning Radiometer 2 (ATSR-2) instrument is assessed. This assessment is performed through a comparison of the cloud top heights obtained from ATSR-2 stereo and those derived from a 94-GHz radar, radiosonde profiles and independently from the Modular Optoelectronic Scanner (MOS) using the O2-A band. The data for this study were collected over the United Kingdom from September 1998-March 1999. The results show that the accuracy of the ATSR-2 stereo heights is generally as predicted on theoretical grounds, with the errors in the 1.6 µm and 0.65 µm stereo heights rarely exceeding 2 km. Case study periods with disagreements between the ATSR-2 heights and the ground-based retrievals are often due to the lack of precise match-ups between the ground-based and satellite scenes, while the MOS O2-A band is shown sometimes to miss the tops of high clouds. Evidence that the 11 µm channel is more sensitive to high clouds than originally thought is given and a future application of multi-spectral stereo cloud top heights is proposed.
Connectivity and separating sets of cages
Authors: Tao Jiang, Dhruv Mubayi
Venue: Journal of Graph Theory (1998)

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least &lfloor;g-2&rfloor;, with equality only when distance &lfloor;g-2&rfloor; occurs for at least two pairs of vertices in G[S]. This structural property is used to prove that every (k; g)-cage with k &ge; 3 is 3-connected. This result supports the conjecture of Fu, Huang, and Rodger that every (k; g)-cage is k-connected. A nonseparating g-cycle C in a graph G is a cycle of length g such that G - V(C) is connected. We prove that every (k; g)-cage contains a nonseparating g-cycle. For even g, we prove that every g-cycle in a (k; g)-cage is nonseparating. &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 35&ndash;44, 1998
Consistency measures for feature selection
Authors: Antonio Arauzo-Azofra, Jose Manuel Benitez, Juan Luis Castro
Venue: Journal of Intelligent Information Systems (2008)

The use of feature selection can improve accuracy, efficiency, applicability and understandability of a learning process. For this reason, many methods of automatic feature selection have been developed. Some of these methods are based on the search of the features that allows the data set to be considered consistent. In a search problem we usually evaluate the search states, in the case of feature selection we measure the possible feature sets. This paper reviews the state of the art of consistency based feature selection methods, identifying the measures used for feature sets. An in-deep study of these measures is conducted, including the definition of a new measure necessary for completeness. After that, we perform an empirical evaluation of the measures comparing them with the highly reputed wrapper approach. Consistency measures achieve similar results to those of the wrapper approach with much better efficiency.
E-Business Law in China: Strengths and Weaknesses
Authors: Aashish Srivastava, S. Bruce Thomson
Venue: Electronic Markets (2007)

With 123 million Internet users, China represents a phenomenal potential market for e-business. The astounding success of China in attracting foreign direct investment (FDI) can be partially explained by a series of reforms of policies, regulations, and laws. Can the introduction of China's new electronic signatures law produce the same results for e-business in China? This paper analyses the electronic signatures law as a tool fashioned by Chinese lawmakers to encourage e-business growth in China as they encouraged FDI. We find that China has created an electronic signature law that mirrors the open, flexible, and ever-changing e-environment. The fact that the law is not technology-specific, but rather technology-neutral, allowing for technological advances, is one of its strong points. A negative aspect of the law is its lack of a set guideline for identification requirements for purchasers of a reliable electronic signature, more commonly known as a digital signature, from electronic certification service providers. Despite the few negative aspects, the electronic signatures law should encourage the development of e-business in China.
Pure MPLS Technology
Authors: Liwen He, Paul Botham
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper presents a novel idea for building a pure MPLS network from the initial stage (bootstrapping) without using any native IP packets to transfer control traffic. Therefore the MPLS network is a purely layer 2.5 label switched network based on layer 2 switching functionality without layer 3 IP routing. As far as we know, there is no previous work reported in this area. The motivation of this research is to simplify MPLS networks and achieve a high level of availability, reliability and security.
Instruction-driven clock scheduling with glitch mitigation
Authors: Gu-Yeon Wei, David Brooks, Ali Durlov Khan, Xiaoyao Liang
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Instruction-driven clock scheduling is a mechanism that minimizes clock power in deeply-pipelined datapaths. Analysis of realistic processor workloads shows a preponderance of bubbles persist through pipelines like the floating point unit. Clock scheduling ostensibly adapts pipeline depth with respect to bubbles in the instruction stream without performance loss. Unfortunately, shallower pipelines (i.e. longer pipe stages) are prone to larger amounts of glitches propagating through logic, increasing dynamic power. Experimentally measured results from a 130nm FPU test chip with flexible clocking capabilities show a super-linear increase in glitch-induced dynamic power for shallower pipelines. While higher glitch power can severely diminish the power savings offered by clock scheduling, judicious clocking of intermediate stages offers glitch mitigation to recover power savings for worst-case scenarios. Detailed analysis of clock scheduling applied to a FPU in a POWER4-like processor running realistic workloads shows an average net power savings of 15% compared to an aggressively clock-gated design.
Ethnographic studies as a requirement gathering process for the design of context aware middleware
Authors: Kristian Ellebæk Kjær
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

As a preparation for building service oriented, context aware middleware for agriculture, we have employed ethnographic field studies as a mean in the requirements gathering process.
Requirements on unique identifiers for managing product lifecycle information: comparison of alternative approaches
Authors: K. Främling, M. Harrison, J. Brusey, J. Petrow
Venue: International Journal of Computer Integrated Manufacturing (2007)

Managing product information for product items during their whole lifetime is challenging, especially during their usage and end-of-life phases. The main difficulty is to maintain a communication link between the product item and its associated information as the product item moves over organizational borders and between different users. As network access will typically not be continuous during the whole product-item lifecycle, it is necessary to embed at least a globally unique product identifier (GUPI) that makes it possible to identify the product item anytime during its lifecycle. A GUPI also has to provide a linking mechanism to product information that may be stored in backend systems of different organizations. GUPIs are thereby a cornerstone for enabling the Internet of Things, where 'intelligent products' can communicate over the Internet. In the current paper, we analyse and compare the three main currently known approaches for achieving such functionality, i.e. the EPC Network, DIALOG and WWAI.
MERIS in-flight spectral calibration
Authors: S. Delwart, R. Preusker, L. Bourg, R. Santer, D. Ramon, J. Fischer
Venue: International Journal of Remote Sensing (2007)

This paper will describe the spectral calibration activities conducted during the MERIS commissioning phase and during operation since orbit 12000. MERIS is a medium resolution (300-1200m) push-broom imaging spectrometer covering the spectral domain 390-1040nm with 15 bands, programmable in position and width down to steps of 1.25nm. The onboard spectral calibration hardware is based on the use of an Erbium doped-diffuser panel presenting well-defined absorption peaks. In the spectral calibration mode, MERIS is configured with narrow bands centred on an Erbium absorption feature (two are used). The first orbit, the instrument is calibrated by viewing the "white" radiometric diffuser plate and the following orbit the "pink" Erbium diffuser plate is deployed. This method allows each of the MERIS detectors involved to be characterized in wavelength. The Fraunhofer absorption lines were used to complement these results by providing additional measurements in the violet and near infrared part of the spectrum. For this method, MERIS was configured both for Earth and diffuser observations and acquired data for only a limited number of orbits. This procedure was repeated for different band settings covering a number of Fraunhofer absorption lines. Finally, using Oxygen (O2A) absorption Earth observation data, two different approaches were developed, one based on the retrieval of surface pressure and one based on the shape of the O2A absorption band. Both methods were developed for clear sky land observations, but their performances are improved over bright land targets. Both methods agree to within an accuracy of 0.02 nm. The results from the different methods are analyzed in order to propose a spectral model for the MERIS instrument. Preliminary results of the spectral variation with time are reported. Except camera 4, the instrument is quite stable with time. Camera 4 needs further investigations to better understand its behaviour. Except for the use of the MERIS oxygen band, the spectral characterization of the other MERIS bands is achieved within the nominal accuracy (1 nm).
Attribute selection in multivariate microaggregation
Authors: Jordi Nin, Javier Herranz, Vicenç Torra
Venue: Proceedings of the 2008 international workshop on Privacy and anonymity in information society (2008)

Microaggregation is one of the most employed microdata protection methods. The idea is to build clusters of at least k original records, and then replace them with the centroid of the cluster. When the number of attributes of the dataset is large, a common practice is to split the dataset into smaller blocks of attributes. Microaggregation is successively and independently applied to each block. In this way, the effect of the noise introduced by microaggregation is reduced, but at the cost of losing the k-anonymity property. The goal of this work is to show that, besides of the specific microaggregation method employed, the value of the parameter k, and the number of blocks in which the dataset is split, there exists another factor which can influence the quality of the microaggregation: the way in which the attributes are grouped to form the blocks. When correlated attributes are grouped in the same block, the statistical utility of the protected dataset is higher. In contrast, when correlated attributes are dispersed into different blocks, the achieved anonymity is higher, and, so, the disclosure risk is lower. We present quantitative evaluations of such statements based on different experiments on real datasets.
Task-based entailment constraints for basic workflow patterns
Authors: Christian Wolter, Andreas Schaad, Christoph Meinel
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Access Control decisions are based on the authorisation policies defined for a system as well as observed context and behaviour when evaluating these constraints at runtime. Workflow management systems have been recognised as a primary source for defining authorisation policies at workflow designtime, as well as generating context at runtime. This paper analyses recent work in the workflow community regarding established control-flow patterns. We claim that there is an intrinsic relationship between these patterns and a set of task-based entailment constraints - such as Separation of Duty - that have been recently identified by the access control community. These constraints are based on a pre-determined partial order on sequence and parallel execution patterns. When, however, such an order does not exist, because of more complex control-flow patterns, ambiguous constraint evaluation situations will arise at workflow runtime. Accordingly, this paper reviews basic workflow patterns and identifies relationships between these and task-based entailment constraints. In addition, an analysis of possible runtime ambiguities that may arise from these relationships is presented. Our approach is based on recently developed techniques for visual constraint representation at a workflow design-time.
Unit Commitment Scheduling Using a Hybrid ANN and Lagrangian Relaxation Method
Authors: Zhen Liu, Na Li, Chaohai Zhang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

A hybrid artificial neural network (ANN) Lagrangian relaxation approach to combinatorial optimization problems in power systems, in particular to unit commitment is presented in this paper. Until now, the Lagrangian relaxation method has been studied as it appeared to be the most practical method for obtaining an approximate solution to unit commitment. Based on the use of supervised learning neural-net technology and the adaptive pattern recognition concept, which presume the relationship between power demand pattern and Lagrange multipliers (LMPs). The numerical results obtained are very encouraging.
The uniform locally finite tilings of the plane
Authors: D. Renault
Venue: Journal of Combinatorial Theory Series B (2008)

We characterize the uniform locally finite tilings of the plane by finite combinatorial objects called labeling schemes. This representation is based on the analysis of the group of symmetries of a tiling which is realized independently of its geometry. As a consequence, we are able to give an exhaustive enumeration of these tilings. This description encompasses the regular polyhedra and the Archimedean tilings, but most of these are tilings of the hyperbolic plane.
A new polyphase current-mode filter using programmable-gain current-controlled current-conveyor
Authors: Muhammad Taher Abuelma'atti, Sa'ad Muhammad Al-Shahrani
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A novel polyphase current-mode filter suitable for CMOS integrated circuit implementation is presented. The circuit uses two programmable-gain current-controlled current-conveyors and two grounded capacitors. The proposed circuit can be operated from a low power supply voltage (±1.25V) and its parameters enjoy low active- and passive-sensitivity. Simulation results using CMOS programmable gain CCCII are included.