ppxscal/embedding_network huggingface dataset:
A Simple yet Efficient Function Optimizer
Authors: Xinsheng Lai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A new function optimization algorithm inspired by water flowing to the lowest point was proposed. We call it Water Flow Optimization (WFO). No matter wherever the global lowest point locates could water find it if only enough water was poured into. We propose WFO by imitating the process of water flowing to the global lowest point. In this new algorithm, a population of parameter vector standing for a solution to the function optimization problem move to an attractive center which is continuously transferring. Verified by function optimization experiments, it is an efficient optimization algorithm. With an apt mutation probability, the WFO algorithm could efficiently avoid getting trapped by local optima, and it could find global optimum quickly and accurately as well. In addition, the algorithm has only two parameters: the population size and the mutation probability.
Evros: A service-delivery platform for extending security coverage and IT reach
Authors: Dimitrios Stiliadis, Andrea Francini, Sanjay Kamat, Mansoor Alicherry, Adiseshu Hari, Pramod V. Koppol, Ashok K. Gupta, Dor Skuler
Venue: Bell Labs Technical Journal (2007)

Evros is an always-available, secure service-delivery platform for enterprise remote access and device management. Evros satisfies the broad necessities of the key players in today's remote-access/device-management space: the information technology (IT) administrator, who needs an affordable means to minimize threat reaction latencies and continuously monitor the health of off-site laptops; the roaming employee, who needs a streamlined network access experience with conflict-free automatic backups and software updates; and the broadband wireless access service provider, who needs compelling applications to expand the subscription base and increase network utilization during off-peak hours. The platform is built on three components, the Evros card, the Evros gateway, and the Evros management server. The Evros card is a laptop personal computer (PC) card with an embedded wireless wide area network (WWAN) modem, processor, battery, and nonvolatile memory. It independently establishes the Internet Protocol security (IPsec) tunnel that secures the remote access connection, and its WWAN interface makes the laptop reachable by the IT organization virtually anytime and anywhere. The Evros gateway is an enhanced secure access server that deploys within the network perimeter. It hosts the enterprise end points of the IPsec tunnels and exploits the extended reachability of the laptop to improve the effectiveness of all remote management functions. The Evros management server is a software suite for the management of all Evros components. &copy; 2007 Alcatel-Lucent.
Analyzing interacting WS-BPEL processes using flexible model generation
Authors: Niels Lohmann, Peter Massuthe, Christian Stahl, Daniela Weinberg
Venue: Data Knowledge Engineering (2008)

We address the problem of analyzing the interaction between WS-BPEL processes. We present a technology chain that starts out with a WS-BPEL process and translates it into a Petri net model. On the model we decide controllability of the process (the existence of a partner process, such that both can interact properly) and compute its operating guideline (a characterization of all properly interacting partner processes). To manage processes of realistic size, we present a concept of a flexible model generation which allows the generation of compact Petri net models. A case study demonstrates the value of this technology chain.
Seamless Fast Handover in Mobile IPv4 Using Layer-2 Triggers
Authors: Seunghun Oh, Hoyoung Song, Younghan Kim
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In this paper, we propose a new layer-3 (L3) handover scheme which is able to provide the more seamless service than the existing schemes even without buffer. The proposed scheme uses layer-2(L2) triggers and applies the tunnel mechanism and pre-registration method of the low latency handoff scheme in mobile IPv4 (LLH) [1] simultaneously. The tunnel is used to transfer the traffic to the mobile node (MN), which has registered the care-of address of new foreign agent (FA) with home agent (HA) while being still connected to the subnet of the old FA, until the MN connects to the new link. By simulation, we prove its enhanced performance in terms of throughput, delivery rate, end-to-end packet transmission delay, and delay jitter.
Obtaining transparent models of chaotic systems with multi-objective simulated annealing algorithms
Authors: Luciano Sánchez, José R. Villar
Venue: Information Sciences: an International Journal (2008)

Transparent models search for a balance between interpretability and accuracy. This paper is about the estimation of transparent models of chaotic systems from data, which are accurate and simple enough for their expression to be understandable by a human expert. The models we propose are discrete, built upon common blocks in control engineering (gain, delay, sum, etc.) and optimized both in their complexity and accuracy. The accuracy of a discrete model can be measured by means of the average error between its prediction for the next sampling period and the true output at that time, or 'one-step error'. A perfect model has zero one-step error, but a small error is not always associated with an approximate model, especially in chaotic systems. In chaos, an arbitrarily low difference between two initial states will produce uncorrelated trajectories, thus a model with a low one-step error may be very different from the desired one. Even though a recursive evaluation (multi-step prediction) improves the fitting, in this work we will show that a learning algorithm may not converge to an appropriate model, unless we include some terms that depend on estimates of certain properties of the model (so called 'invariants' of the chaotic series). We will show this graphically, by means of the reconstructed attractors of the original system and the model. Therefore, we also propose to follow a multi-objective approach to model chaotic processes and to apply a simulated annealing-based optimization to obtain transparent models.
Integrating Modern Research into Numerical Computation Education
Authors: Chenglie Hu
Venue: Computing in Science and Engineering (2007)

The author explores the possibilities of teaching numerical computation to future engineers and scientists who use numerical computation as a tool.
Control Overhead A Performance Metric for Evaluating Control-Unit Designs
Authors: J. H. Jenkins
Venue: IEEE Transactions on Computers (1980)

The basic goal in the design of computer control units is the efficient, high-speed allocation, orchestration, and synchronization of the computer resources. The key concept to meeting the above requirements is the continual optimization of the control structure during the design process. This paper defines an approach to control optimization which is independent of the particular control structure.
Including inductance in static timing analysis
Authors: Ahmed Shebaita, Dusan Petranovic, Yehea Ismail
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper analytical expressions are derived for effective load capacitances of RLC interconnects to accurately estimate both the propagation delay and transition time at the output of a CMOS gate. The new effective capacitance calculation technique poses no extra complexity as compared to the RC based approaches but can accommodate inductance. These new expressions are derived based on a generalized driving point admittance. The generalized driving point admittance takes inductance into consideration and hence accounts for the inductive shielding that in some cases can even exceed the resistive shielding in current technologies. Another improvement in the new effective capacitance calculation method is the utilization of a more general waveform shape that accounts for the non-monotonic behavior due to inductance effects. It is shown throughout the paper that two effective capacitances are required for accurate estimation of the propagation delay and rise time with an RLC interconnect load. Simulation results show that the error in propagation delays and rise times when neglecting inductance can be over 60% as compared to an RLC model in realistic interconnects. On the other hand, simulations show that the propagation delay and rise time maximum errors associated with the proposed approach are less than 10% as compared to SPICE.
Set covering submodular maximization: An optimal algorithm for data mining in bioinformatics and medical informatics
Authors: Alexander Genkin, Casimir A. Kulikowski, Ilya Muchnik
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

In this paper we show how several problems in different areas of data mining and knowledge discovery can be viewed as finding the optimal covering of a finite set. Many such problems arise in biomedical and bioinformatics research. For example, protein functional annotation based on sequence information is an ubiquitous bioinformatics problem. It consists of finding a set of homolog (high similarity) sequences of known function to a given amino acid sequence of unknown function from the various annotated sequence data bases. These can then be used as clues in suggesting further experimental analysis of the new protein. In the present paper we show that these optimization problems can be stated as maximizations of submodular functions on the set of candidate subsets -- a generalization that may be especially useful when conclusions from data mining need to be interpreted by human experts. This is common to a number of examples we consider below: diagnostic hypothesis generation, logical methods of data analysis, conceptual clustering, and proteins functional annotations.
Self-organizing maps and SVD
Authors: Jiri Dvorsky
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Mean square error is usual method to measure quality of self-organizing map (SOM). MSE brings good theoretical description about learning process, but its rather hard to decide what MSE is small enough, or when learning should be stoped. A new technique for measurement of quality of SOM using singular value decomposition will be presented in this paper.
A Proposed Standard for Binary Floating-Point Arithmetic
Authors: D. Stevenson
Venue: Computer (1981)

Offered here for public comment, this proposed standard facilitates transportation of numerically oriented programs and encourages development of high-quality numerical software.
Stability Analysis of Fuzzy Hopfield Networks Based on Weakly Continuous T-Norms
Authors: Chunlin Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A general dynamical fuzzy neural networks modelfuzzy Hopfield networks with threshold is developed, which is based on the fuzzy operator composition of max( ) and weakly continuous T-norms. It is shown that the model is global stable with the Hamming distance, and its equilibrium point (attractor) is Lyapunov stable.
Requirement and Design Trade-offs in Hackystat: An In-Process Software Engineering Measurement and Analysis System
Authors: Philip M. Johnson
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

For five years, the Hackystat Project has incrementally developed and evaluated a generic framework for in-process software engineering measurement and analysis (ISEMA). At least five other independent ISEMA system development projects have been initiated during this time, indicating growing interest and investment in this approach by the software engineering community. This paper presents 12 important requirement and design tradeoffs made in the Hackystat system, some of their implications for organizations wishing to introduce ISEMA, and six directions for future research and development. The three goals of this paper are to: (1) help potential users of ISEMA systems to better evaluate the relative strengths and weaknesses of current and future systems, (2) help potential developers of ISEMA systems to better understand some of the important requirement and design trade-offs that they must make, and (3) help accelerate progress in ISEMA by identifying promising directions for future research and development.
Component-based tailorability: Enabling highly flexible software applications
Authors: Volker Wulf, Volkmar Pipek, Markus Won
Venue: International Journal of Human-Computer Studies (2008)

Component technologies are perceived as an important means to keep software architectures flexible. Flexibility offered by component technologies typically addresses software developers at design time. However, the design of software which should support social systems, such as work groups or communities, also demands 'use-time', or technically spoken, 'run-time' flexibility. In this paper, we summarize a decade of research efforts on component-based approaches to flexibilize groupware applications at run-time. We address the user as a 'casual programmer' who develops and individualizes software for his work context. To deal with the challenges of run-time flexibility, we developed a design approach which covers three levels: software architecture, user interface, and collaboration support. With regard to the software architecture, a component model, called FlexiBeans, has been developed. The FreEvolve platform serves as an environment in which component-based applications can be tailored at run-time. Additionally, we have developed three different types of graphical user interfaces, enabling users to tailor their applications by recomposing components. To enable collaborative tailoring activities, we have integrated functions that allow sharing component structures among users. We also present different types of support techniques which are integrated into the user interface in order to enable users' individual and collaborative tailoring activities. We conclude by elaborating on the notion of 'software infrastructure' which offers a holistic approach to support design activities of professional and non-professional programmers.
Special Feature Program Testing: Art Meets Theory*
Authors: E. F. Miller
Venue: Computer (1977)

The problems of providing quality assurance for computer software have received a good deal of attention from the computing community. Such areas as program proving, automatic programming, structured programming, and hierarchical design/development methodologies have all experienced significant growth-largely as a result of the increased attention focussed on them. Program testing, on the other hand, has not enjoyed the same level of intensive investigation, even though it has a number of technical and intuitive appeals:
A platform based on the multi-dimensional data modal for analysis of bio-molecular structures
Authors: Srinath Srinivasa, Sujit Kumar
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

A platform called AnMol for supporting analytical applications over structural data of large biomolecules is described. The term "biomolecular structure" has various connotations and different representations. AnMol reduces these representations into graph structures. Each of these graphs are then stored as one or more vectors in a database. Vectors encapsulate structural features of these graphs. Structural queries like similarity and substructure are transformed into spatial constructs like distance and containment within regions. Query results are based on inexact matches. A refinement mechanism is supported for increasing accuracy of the results. Design and implementation issues of AnMol including schema structure and performance results are discussed in this paper.
The Implications of Electronic Serial Memories*
Authors: G. Panigrahi
Venue: Computer (1977)

Advances in such new memory technologies as charge-coupled devices, magnetic bubble memories, and beam access memories have opened avenues for innovative applications of these computer elements in future computing systems. These quasi-serial electronic technologies compete on one hand with the random access memories (bipolar, MOS, and core) and, on the other hand, with disk memories (fixed-head disk and moving-head disk). There are important functional properties common to all these technologies, and their applications as computer memories will depend upon how successfully the systems designers appreciate-and then apply-these characteristics to computer system design. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Dedicated Disk I/O Strategies for IPTV Live Streaming Servers Supporting Timeshift Functions
Authors: Cheng Huang, Chenjie Zhu, Yi Li, Dejian Ye
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

By carefully studying the characteristics of IPTV (Inter- net Protocol TeleVision) live streaming service supporting timeshift functions, we find the default disk I/O strategies of universal OS can not provide satisfactory performance. Based on these observations, this paper proposes a set of dedicated disk I/O strategies in the design and implemen- tation of a live streaming server supporting timeshift func- tions. Our proposed strategies include asynchronous direct I/O, block-level data processing, media caching and me- dia prefetching, which are implemented in a live streaming server (ClearServer) developed by ourselves. ClearServer has been successfully deployed in the Shanghai Zhabei IPTV test-bed. Based on the deployment, detailed perfor- mance evaluation and test results demonstrate that the pro- posed strategies significantly improve several major perfor- mance metrics of the IPTV live streaming servers.
CANDID: preventing sql injection attacks using dynamic candidate evaluations
Authors: Sruthi Bandhakavi, Prithvi Bisht, P. Madhusudan, V. N. Venkatakrishnan
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

SQL injection attacks are one of the topmost threats for applications written for the Web. These attacks are launched through specially crafted user input on web applications that use low level string operations to construct SQL queries. In this work, we exhibit a novel and powerful scheme for automatically transforming web applications to render them safe against all SQL injection attacks. A characteristic diagnostic feature of SQL injection attacks is that they change the intended structure of queries issued. Our technique for detecting SQL injection is to dynamically mine the programmer-intended query structure on any input, and detect attacks by comparing it against the structure of the actual query issued. We propose a simple and novel mechanism, called C<scp>ANDID</scp>, for mining programmer intended queries by dynamically evaluating runs over benign candidate inputs. This mechanism is theoretically well founded and is based on inferring intended queries by considering the symbolic query computed on a program run. Our approach has been implemented in a tool called C<scp>ANDID</scp>, that retrofits Web applications written in Java to defend them against SQL injection attacks. We report extensive experimental results that show that our approach performs remarkably well in practice.
Query-point visibility constrained shortest paths in simple polygons
Authors: Ramtin Khosravi, Mohammad Ghodsi
Venue: Theoretical Computer Science (2007)

In this paper, we study the problem of finding the shortest path between two points inside a simple polygon such that there is at least one point on the path from which a query point is visible. We provide an algorithm which preprocesses the input in O(n^2+nK) time and space and provides logarithmic query time. The input polygon has n vertices and K is a parameter dependent on the input polygon which is O(n^2) in the worst case but is much smaller for most polygons. The preprocessing algorithm sweeps an angular interval around every reflex vertex of the polygon to store the optimal contact points between the shortest paths and the windows separating the visibility polygons of the query points from the source and the destination.
The Task Distribution and Scheduling of The Parallel Delivery System for Massive Databases
Authors: Gong Yue, Wang Yuzhuo, Xu Zhanbo, Ge Shan, Zhao Xin, Fu Huixia
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A dynamic task distribution and scheduling technology of a message middleware for parallel data delivery on massive database systems is presented. The techniques of computer cluster and parallel processing are used to implement the task definition and distribution, processor scheduling, parallel data delivery for massive different structure databases. It implements the massive data parallel exchange between isomerism databases on a large-scale network and multi layer networks, with the method of database synchronization mechanism , configuration technique.
Investigation on the model of consumers' perceived risk-integrated viewpoint
Authors: Wen-Bao Lin
Venue: Expert Systems with Applications: An International Journal (2008)

This research integrated internal and external clues and proposed the model of consumers' perceived risk. The population of this research was the A level travel agency in Taiwan. The reason to choose this industry was in that first, the fashion of Taiwanese' traveling abroad was vigorous; secondly, the proportion of the industry's service quality for customers was high. Based on the regional segmentation of three major geographical districts in Taiwan (north, center and south), this research employed Stratified Random Sampling and distributed 1000 questionnaires. The sampling was based on population proportion (about 6:2:2) and used Non-linear Fuzzy Neural Network Model. The empirical result revealed the follows: there was negative relation between service involvement and perceived risk; the consumers' positive emotion revealed significant and negative influence on perceived risk; the consumers' negative emotion revealed significant and positive influence on perceived risk; perceived risk revealed significant and negative influence on purchasing will. The characteristic of this research was mainly to employ Fuzzy Neural Network Model to validate the related hypotheses and acquire the original data through plenty of questionnaires to meet the conditions of using this method.