ppxscal/embedding_network huggingface dataset:
MediaFranca: ubiquitous computing for youth engagement
Authors: Herbert Spencer, Shelley Evenson, John Zimmerman
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Networking technology strives for maximizing the possibilities of connection among people; however, communication technology also promotes atomistic individualism in narrow communities of interest. Today's youths experience this paradox as the increasing emergence of mobile communication technology and networked devices contribute to a steady decline of social capital. This research explores opportunities for using ubiquitous computing and location-based media in order to develop design strategies for engaging young adults in the issues of their communities and providing them with a space where they can raise their voice.
Passivity and Passification of T-S Fuzzy-Model-Based Switched Uncertain Systems
Authors: Xingwen Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper addresses the passivity and passification analysis of T-S fuzzy-model-based uncertain switched sys- tems. For arbitrary switching, the passivity condition is de- rived, and the passification criterion is also established. All results are expressed as linear matrix inequalities (LMIs), thus they are convenient for application. A numerical exam- ple is given to illustrate the effectiveness of the theoretical results.
Software Descriptions with Flow Expressions
Authors: A. C. Shaw
Venue: IEEE Transactions on Software Engineering (1978)

Flow expressions describe sequential and concurrent flows of entities, such as control, messages, commands, jobs, and resources, through system software components, such as programs, procedures, modules, and processes. They consist of regular expressions extended with cyclic and interleaving operators and a synchronization facility. The language of flow expressions is defined and some of its formal properties are presented. Applications are exhibited in the modeling of concurrent programs, the description of operating system architectures, the specification and solution of synchronization problems, the flow and description of command languages, and in systems analysis and verification.
Applying Structured Programming to Command, Control, and Communication Software Development
Authors: G. R. Katkus
Venue: Computer (1975)

Much has been written describing structured programming (SP) technologies, but little has been written concerning measurable results from using those technologies to deliver programs within cost, time, and performance constraints. SP technologies have been applied to large-scale real-time program development, analyzed, and further developed at Hughes since 1971. As new software projects are started, the respective managers must state which of the technologies will and will not be used. The use of the applied techniques is then monitored to determine benefits and problems and to define useful modifications to the technologies. 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
Formal testing from timed finite state machines
Authors: Mercedes G. Merayo, Manuel Núñez, Ismael Rodríguez
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper we present a formal methodology to test both the functional and temporal behaviors in systems where temporal aspects are critical. We extend the classical finite state machines model with features to represent timed systems. Our formalism allows three different ways to express the timing requirements of systems. Specifically, we consider that time requirements can be expressed either by means of fix time values, by using random variables, or by considering time intervals. Different implementation relations, depending on both the interpretation of time and on the non-determinism appearing in systems, are presented and related. We also study how test cases are defined and applied to implementations. Test derivation algorithms, producing sound and complete test suites, are also presented. That is, by deriving these test suites we relate the different notions of passing tests and the different implementation relations. In other words, for a given correctness criterion, a system represents an appropriate implementation of a given model if and only if the system successfully passes all the test belonging to the derived test suite.
Computer Network Protocols: A Hierarchical Viewpoint
Authors: G. M. Schneider
Venue: Computer (1979)

Progress in network protocol design brings us closer to fully-supported public data networks. These networks will provide message switching and computing services to a national user community.
A Novel Background Extraction and Updating Algorithm for Vehicle Detection and Tracking
Authors: Jun Kong, Ying Zheng, Yinghua Lu, Baoxue Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper proposes a new adaptive background extraction and updating algorithm for vehicle detection and tracking. Gray-level quantification and two attenuation weights are introduced to reduce the impact of environment lighting condition in background extraction method, two discriminant functions are employed to distinguish false moving objects and true moving objects for solving the deadlock problem of background updating. The experimental results show that the proposed method is more robust, accurate and powerful than traditional methods, and is simple to implement and suitable for real-time vehicle detection and tracking.
Nomadik®: AMobile Multimedia Application Processor Platform
Authors: M. Paganini
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The Nomadikreg platform supports a range of consumer-oriented multimedia applications, and is specifically designed for mobile applications. The combined use of industry standard host processor, and multiple low-power DSPs associated with dedicated hardware accelerators make for a flexible, yet low-cost and low-power solution.
A search-based framework for automatic testing of MATLAB/Simulink models
Authors: Yuan Zhan, John A. Clark
Venue: Journal of Systems and Software (2008)

Search-based test-data generation has proved successful for code-level testing but almost no search-based work has been carried out at higher levels of abstraction. In this paper the application of such approaches at the higher levels of abstraction offered by MATLAB/Simulink models is investigated and a wide-ranging framework for test-data generation and management is presented. Model-level analogues of code-level structural coverage criteria are presented and search-based approaches to achieving them are described. The paper also describes the first search-based approach to the generation of mutant-killing test data, addressing a fundamental limitation of mutation testing. Some problems remain whatever the level of abstraction considered. In particular, complexity introduced by the presence of persistent state when generating test sequences is as much a challenge at the Simulink model level as it has been found to be at the code level. The framework addresses this problem. Finally, a flexible approach to test sub-set extraction is presented, allowing testing resources to be deployed effectively and efficiently.
State feedback $H^\infty$ controller design for fuzzy dynamic systems
Authors: Z. X. Han, B. L. Walcott, Y. M. Zhang, G. Feng
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper presents robust H^\infty controller design for fuzzy dynamic systems with state feedback. Three kinds of controller design methods are proposed based on a quadratic Lyapunov function or a piecewise smooth quadratic Lyapunov function. The control laws are numerically tractable by using LMI techniques and the global stability with disturbance attenuation of the closed-loop fuzzy control system is established. An example is given to illustrate the application of the proposed method.
CHICAGO: a test and evaluation environment for coarse-grained optimization
Authors: Tobias Kraft, Holger Schwarz
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Relational OLAP tools and other database applications generate sequences of SQL statements that are sent to the database server as result of a single information request issued by a user. Coarse-Grained Optimization is a practical approach for the optimization of such statement sequences based on rewrite rules. In this demonstration we present the CHICAGO test and evaluation environment that allows to assess the effectiveness of rewrite rules and control strategies. It includes a lightweight heuristic optimizer that modifies a given statement sequence using a small and variable set of rewrite rules.
Real-Time Animation of Human Figure Drawings with Hidden Lines Omitted
Authors: D. Herbison-Evans
Venue: IEEE Computer Graphics and Applications (1982)

Using a graphics system called NUDES, researchers in Australia are investigating just how well polyellipsoid human figures work in real-time vector and raster graphics displays. 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
Improving the Usability of E-Commerce Applications using Business Processes
Authors: Ying Zou
Venue: IEEE Transactions on Software Engineering (2007)

E-commerce applications automate many daily business activities. Users interact with e-commerce applications throughmenu-driven User Interface (UI) components, such as toolbars, dialogs and windows. However, the tremendous number offunctionality may overwhelm the users. Users struggle to locate the appropriate UI components to accomplish the tasks required bybusiness processes. In this paper, we enhance e-commerce applications by improving their usability using the knowledgeembedded in business process definitions. Our improved application provides contextual information to fulfill each business task.The improved application guides users through the various tasks in a step-by-step fashion. Through a controlled experiment, wedemonstrate that our improved application offers a better usability experience for novice users by giving them more guidance andreducing the time needed to locate the next UI component in a complex UI.
An Improved Ant Colony Optimization for the Maximum Clique Problem
Authors: Xinshun Xu, Jun Ma, Jingsheng Lei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The maximum clique problem is a classical combinatorial optimization problem which is one of the first problems shown to be NP-Complete. Moreover, it does not admit a polynomial-time approximation algorithm unless P=NP. So many heuristic algorithms have been proposed for this problem. In this paper, we introduce an improved ant colony optimization (ACO) for the maximum clique problem. In the proposed algorithm, both a new pheromone updating method and a parameter tuning method are introduced. Simulations are performed on some graphs of the DIMACS clique instances in the second DIMACS challenge. The results show that the improved ant colony optimization can yield satisfactory results.
Data Burst Statistics and Performance Analysis of Optical Burst Switching Networks with Self-Similar Traffic
Authors: Wang Ruyan, Wu Dapeng, Guo Fang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The self-similar model can reflect the Internet traffic property more precisely than Poisson model, the theoretical and simulation results of burst length distribution based on the time threshold assembly mechanism are shown in this paper. Moreover, the simulation result of OBS schedule algorithm under self-similar traffic model is reported. Both the analytic and simulation results show that burst length distribution is related to the length of assembly period; secondly, the assembly mechanism based on time period can reduce the self-similarity of traffic effectively; at last, the schedule algorithms in OBS have different performance based on the self-similar traffic.
Proto-value Functions: A Laplacian Framework for Learning Representation and Control in Markov Decision Processes
Authors: Sridhar Mahadevan, Mauro Maggioni
Venue: The Journal of Machine Learning Research (2007)

This paper introduces a novel spectral framework for solving Markov decision processes (MDPs) by jointly learning representations and optimal policies. The major components of the framework described in this paper include: (i) A general scheme for constructing representations or basis functions by diagonalizing symmetric diffusion operators (ii) A specific instantiation of this approach where global basis functions called proto-value functions (PVFs) are formed using the eigenvectors of the graph Laplacian on an undirected graph formed from state transitions induced by the MDP (iii) A three-phased procedure called representation policy iteration comprising of a sample collection phase, a representation learning phase that constructs basis functions from samples, and a final parameter estimation phase that determines an (approximately) optimal policy within the (linear) subspace spanned by the (current) basis functions. (iv) A specific instantiation of the RPI framework using least-squares policy iteration (LSPI) as the parameter estimation method (v) Several strategies for scaling the proposed approach to large discrete and continuous state spaces, including the Nyström extension for out-of-sample interpolation of eigenfunctions, and the use of Kronecker sum factorization to construct compact eigenfunctions in product spaces such as factored MDPs (vi) Finally, a series of illustrative discrete and continuous control tasks, which both illustrate the concepts and provide a benchmark for evaluating the proposed approach. Many challenges remain to be addressed in scaling the proposed framework to large MDPs, and several elaboration of the proposed framework are briefly summarized at the end.
Enterprise Security for Web 2.0
Authors: Mary Ann Davidson, Elad Yoran
Venue: Computer (2007)

Security 2.0 means securing all data, end points, and networks and perimeters.
Verifying C++ with STL containers via predicate abstraction
Authors: Nicolas Blanc, Alex Groce, Daniel Kroening
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

This paper describes a flexible and easily extensible predicate abstraction-based approach to the verification of STLusage, and observes the advantages of verifying programsin terms of high-level data structures rather than low-level pointer manipulations. We formalize the semantics of theSTL by means of a Hoare-style axiomatization. The verification requires an operational model conservatively approximating the semantics given by the Standard. Our results show advantages (in terms of errors detected and false positives avoided) over previous attempts to analyze STL usage, due to the power of the abstraction engine and model checker
Very Lowbit Rate ideo Codec Based on Diffrentialwavelet Filters
Authors: Mostafa A. Ahmad, Ayoub Al-Hamadi, Gerald B. Michaelis
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

State-of-the-art in digital coding/decoding includes discrete image transformation, quantization, and entropy coding. The key to efficient data compression is associated with image transformation/reconstruction processes. In this paper, we present a different filters wavelet-based intra-frame video coding technique. The wavelet transformation is developed and optimized in order to enhance the visual quality especially at very low bit rate. The proposed coding technique reduces the bit rate while performing well regarding PSNR and visual quality. In comparison with the conventional coding methods, our proposed coding technique provides significant performance gains in objective and subjective quality.
Evolutionary program induction directed by logic grammars
Authors: Man Leung Wong, Kwong Sak Leung
Venue: Evolutionary Computation (1997)

Program induction generates a computer program that can produce the desired behavior for a given set of situations. Two of the approaches in program induction are inductive logic programming (ILP) and genetic programming (GP). Since their formalisms are so different, these two approaches cannot be integrated easily, although they share many common goals and functionalities. A unification will greatly enhance their problem-solving power. Moreover, they are restricted in the computer languages in which programs can be induced. In this paper, we present a flexible system called LOGENPRO (The LOgic grammar-based GENetic PROgramming system) that uses some of the techniques of GP and ILP. It is based on a formalism of logic grammars. The system applies logic grammars to control the evolution of programs in various programming languages and represent context-sensitive information and domain-dependent knowledge. Experiments have been performed to demonstrate that LOGENPRO can emulate GP and GP with automatically defined functions (ADFs). Moreover, LOGENPRO can employ knowledge such as argument types in a unified framework. The experiments show that LOGENPRO has superior performance to that of GP and GP with ADFs when more domain-dependent knowledge is available. We have applied LOGENPRO to evolve general recursive functions for the even-n-parity problem from noisy training examples. A number of experiments have been performed to determine the impact of domain-specific knowledge and noise in training examples on the speed of learning.
A Constrained Maximum Frequent Itemsets Incremental Mining Algorithm
Authors: Han Wang, Lingfu Kong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Among all data mining algorithms of association rules, incremental algorithms fit dataset updating better. This paper proposes a novel algorithm of mining the constrained maximum frequent itemsets namely algorithm ISL-DM. This algorithm filters the item-sequences which can not get or become the maximum frequent itemsets by the constraint conditions, and it can always surround getting the maximum frequent itemsets currently.
Autocalibration in hydrologic modeling: Using SWAT2005 in small-scale watersheds
Authors: C. H. Green, A. van Griensven
Venue: Environmental Modelling Software (2008)

SWAT is a physically based model that can simulate water quality and quantity at the watershed scale. Due to many of the processes involved in the manual- or autocalibration of model parameters and the knowledge of realistic input values, calibration can become difficult. An autocalibration-sensitivity analysis procedure was embedded in SWAT version 2005 (SWAT2005) to optimize parameter processing. This embedded procedure is applied to six small-scale watersheds (subwatersheds) in the central Texas Blackland Prairie. The objective of this study is to evaluate the effectiveness of the autocalibration-sensitivity analysis procedures at small-scale watersheds (4.0-8.4ha). Model simulations are completed using two data scenarios: (1) 1 year used for parameter calibration; (2) 5 years used for parameter calibration. The impact of manual parameter calibration versus autocalibration with manual adjustment on model simulation results is tested. The combination of autocalibration tool parameter values and manually adjusted parameters for the 2000-2004 simulation period resulted in the highest E"N"S and R^2 values for discharge; however, the same 5-year period yielded better overall E"N"S, R^2 and P-values for the simulation values that were manually adjusted. The disparity is most likely due to the limited number of parameters that are included in this version of the autocalibration tool (i.e. Nperco, Pperco, and nitrate). Overall, SWAT2005 simulated the hydrology and the water quality constituents at the subwatershed-scale more adequately when all of the available observed data were used for model simulation as evidenced by statistical measure when both the autocalibration and manually adjusted parameters were used in the simulation.
A Topology Set Method for Vectorization
Authors: Jinhe Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A topology set structure is a powerful image segmentation technique, it has advantages over individual pixels due to its intrinsic behavior, retrieval of colony characteristic of related pixels, shape independence, and ease of implementation. In this paper, we present a new method of topology model designed using Barnode, which achieves geometric preservation by collecting the pixels from binary patterns. The Barnodes are divided into several types from which the element features, and its distributions are extracted and concatenated into several enhanced feature links, formed a topology set structure. Several experiments on simulated and real data are provided to demonstrate the performance of the algorithm.
Fusing Data and Optimizing Queries for Intelligent Search
Authors: Vaclav Snasel, Pavel Kromer, Suhail S. J. Owais, Dusan Husek, Behzad Moshiri, Amir Keyhanipour
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

A progressive application of evolutionary computing to optimize Boolean search queries in crisp and fuzzy information retrieval systems was investigated, evaluated in laboratory environment and presented. Additionally, WebFusion - novel metasearch engine contributing to the effectiveness of web search has been presented. The system learns the expertness of every particular underlying standalone search engine in a certain category based on the users' preferences estimated according to an analysis of the click-through behavior. An intelligent re-ranking based on ordered weighted averaging is used .for fusing the results' scores obtained from the underlying search engines. In this paper, the two promising web search improvement techniques are merged on the way towards intelligent search application.
Short-term hydropower production planning by stochastic programming
Authors: Stein-Erik Fleten, Trine Krogh Kristoffersen
Venue: Computers and Operations Research (2008)

Within the framework of multi-stage mixed-integer linear stochastic programming we develop a short-term production plan for a price-taking hydropower plant operating under uncertainty. Current production must comply with the day-ahead commitments of the previous day which makes short-term production planning a matter of spatial distribution among the reservoirs of the plant. Day-ahead market prices and reservoir inflows are, however, uncertain beyond the current operation day and water must be allocated among the reservoirs in order to strike a balance between current profits and expected future profits. A demonstration is presented with data from a Norwegian hydropower producer and the Nordic power market at Nord Pool.
Introduction
Authors: Tullio Vardanega, Josée F. Ruiz
Venue: ACM SIGAda Ada Letters (2007)

This session focused on discussing open issues that arose from consideration of the real-time part of the Ada 2005 LRM. Three issues were table for the workshop to discuss. Accordingly, the goals of the session were to: &bull; Agree on proposed correction to EDF semantics &bull; Agree on resolution to requeue problem &bull; Review Ravenscar extensions for 2005 and consider extensions for distributed systems