ppxscal/embedding_network huggingface dataset:
Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution
Authors: Bin Qian, Ling Wang, De-Xian Huang, Xiong Wang
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, a memetic algorithm (MA) based on differential evolution (DE), namely MADE, is proposed for the multi-objective no-wait flow-shop scheduling problems (MNFSSPs). Firstly, a largest-order-value rule is presented to convert individuals in DE from real vectors to job permutations so that the DE can be applied for solving flow-shop scheduling problems (FSSPs). Secondly, the DE-based parallel evolution mechanism is applied to perform effective exploration, and several local searchers developed according to the landscape of multi-objective FSSPs are applied to emphasize local exploitation. Thirdly, a speed-up computing method is developed based on the property of the no-wait FSSPs. In addition, the concept of Pareto dominance is used to handle the updating of solutions in sense of multi-objective optimization. Due to the well balance between DE-based global search and problem-dependent local search as well as the utilization of the speed-up evaluation, the MNFSSPs can be solved effectively and efficiently. Simulation results and comparisons demonstrate the effectiveness and efficiency of the proposed MADE.
Revenue management: models and methods
Authors: Kalyan T. Talluri, Garrett J. van Ryzin, Itir Z. Karaesmen, Gustavo J. Vulcano
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Revenue management is the collection of strategies and tactics firms use to scientifically manage demand for their products and services. The practice has grown from its origins in airlines to its status today as a mainstream business practice in a wide range of industry areas, including hospitality, energy, fashion retail, and manufacturing. This article provides an introduction to this increasingly important subfield of operations research, with an emphasis on use of simulation. Some of the contents are based on excerpts from the book The Theory and Practice of Revenue Management (Talluri and van Ryzin 2004a), written by the first two authors of this article.
Provably secure proxy-protected signature schemes based on RSA
Authors: Zuhua Shao
Venue: Computers and Electrical Engineering (2009)

The proxy signature schemes allow proxy signers to sign messages on behalf of an original signer, a company or an organization. Such schemes have been suggested for use in a number of applications, particularly in distributed computing, where delegation of rights is quite common. Most of proxy signature schemes previously proposed in literatures are based on discrete logarithms or from pairings. In 2003, Shao proposed the first two proxy signature schemes based on RSA. Though being very efficient, they have no formal security proofs. In this paper, we provide formal security proofs under a strong security model in the random oracle model after minor modification.
On the complexity of constructing Golomb Rulers
Authors: Christophe Meyer, Periklis A. Papakonstantinou
Venue: Discrete Applied Mathematics (2009)

A Golomb Ruler is a ruler with integer marks where the distances between every two marks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers. The main contribution of this work is NP-completeness results for two such decision problems.
A design of ontology context model in ubiquitous learning environments
Authors: Dae Jea Cho, Myoung Woo Hong
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper describes the conceptual architecture and ontology-based context model for providing context-aware learning services in ubiquitous learning environments. If ubiquitous computing environments have been realized, it can lead to ubiquitous learning. In ubiquitous learning environments, various embedded computational devices will be pervasive and interoperable across the network for supporting the learning, so users may utilize these devices anytime anywhere. An important next step for ubiquitous learning is the introduction of context-aware learning service that employing knowledge and reasoning to understand the local context and share this information in support of intelligent learning services. In this paper, we assume that a school was equipped with ubiquitous computing environments. We present context-aware manager based architecture to support user-centric ubiquitous learning services, and describe a ontology based context model for intelligent school spaces.
Intelligent discovery of the capabilities of reconfiguration options in a cognitive wireless B3G context
Authors: Konstantinos Demestichas, Evgenia Adamopoulou, Michael Theologou
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Beyond 3G (B3G) wireless connectivity can efficiently be realized by exploiting cognitive networking concepts. Cognitive systems dynamically reconfigure the radio access technologies and the spectrum they use, based on experience, in order to adapt to the changing environment conditions. However, dynamic reconfiguration decisions call for robust discovery, i.e., radio-scene analysis and channel identification schemes. This paper intends to contribute in the areas of radio-scene analysis and channel identification: first, by providing an overview of interference estimation methods, and explaining how capacity estimations can be derived based on the measured interference levels; second, by specifying the information flow for the radio-scene analysis process of a cognitive radio system; and third, by enhancing the above with a learning system, which is essential for obtaining a truly cognitive process. The proposed approach lies in the introduction of a robust probabilistic model for optimal prediction of the capabilities of alternative configurations, in terms of capacity.
Optimal Backlog in the Plane
Authors: Valentin Polishchuk, Jukka Suomela
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

Suppose that a cup is installed at every point of a planar set P, and that somebody pours water into the cups. The total rate at which the water flows into the cups is 1. A player moves in the plane with unit speed, emptying the cups. At any time, the player sees how much water there is in every cup. The player has no information on how the water will be poured into the cups in the future; in particular, the pouring may depend on the player&rsquo;s motion. The backlog of the player is the maximum amount of water in any cup at any time, and the player&rsquo;s objective is to minimise the backlog. Let D be the diameter of P. If the water is poured at the rate of 1/2 into the cups at the ends of a diameter, the backlog is &Omega;(D). We show that there is a strategy for the player that guarantees the backlog of O(D), matching the lower bound up to a multiplicative constant. Note that our guarantee is independent of the number of the cups.
Simulation analysis of semiconductor manufacturing with small lot size and batch tool replacements
Authors: Kilian Schmidt, Oliver Rose
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Long cycle times in semiconductor manufacuring represent an increasing challenge for the industry and lead to a growing need of break-through approaches to reduce it. Small lot sizes and the conversion of batch processes to mini-batch or single-wafer processes are widely regarded as a promising means for a step-wise cycle time reduction. However, there is still a lack of comprehensive and meaningful studies. In this paper we present first results of our modeling and simulation assessment. Our simulation analysis shows that small lot size and the replacement of batch tools with mini-batch or single wafer tools are beneficial but lot size reduction lacks persuasive effectiveness if reduced by more than half.
Improving forecasts of GARCH family models with the artificial neural networks: An application to the daily returns in Istanbul Stock Exchange
Authors: Melike Bildirici, Özgür Ömer Ersin
Venue: Expert Systems with Applications: An International Journal (2009)

In the study, we discussed the ARCH/GARCH family models and enhanced them with artificial neural networks to evaluate the volatility of daily returns for 23.10.1987-22.02.2008 period in Istanbul Stock Exchange. We proposed ANN-APGARCH model to increase the forecasting performance of APGARCH model. The ANN-extended versions of the obtained GARCH models improved forecast results. It is noteworthy that daily returns in the ISE show strong volatility clustering, asymmetry and nonlinearity characteristics.
Frequency Domain Testing: A New Approach in Online Test of VLSI Digital Signal Processing Systems
Authors: R. Yousefi, A. Jalili, S. M. Fakhraie
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A new implementation of frequency domain online test approach is proposed for general digital linear time-invariant(LTI) systems. An analytical signal processing approach is used to extract the online test relation of LTI systems in frequency domain. An optimal implementation of the developed technique is proposed using sliding Goertzel DFT to reduce area and computational overheads with minimum error detection latency. Finite-precision analysis is done for fixed-point implementation of the proposed technique. The overhead is fixed and does not increase as complexity of LTI system increases. Simulation of fault detection capability is done for different filters using developed FLI fault injector platform.
Dynamic optimisation of price, warranty length and production rate
Authors: Pei-Chun Lin, Jenhung Wang, Shiao-Shan Chin
Venue: International Journal of Systems Science (2009)

This study investigates a marketing and production problem that uses price, warranty length and production rate as simultaneous dynamic decision variables. Furthermore, this study was conducted under a policy of free replacement of defective items; and under conditions where demand was dynamic and dependent on price, warranty and cumulative sales. A continuous profit maximisation model was formulated, which first considers the expected warranty cost per item. Then, it considers the steps for dynamic optimisation, which eventually derive the optimal price, warranty length and production rate. Discretisation was then applied to the profit maximisation model and a digital computer was used to identify the optimal control paths, obtaining a finite solution that is a set of real numbers for practical application. A model-driven Decision Support System is finally established, which provides a graphical user interface for overcoming the complexity of the analytical process. Subsequently, the proposed system was tested and the analytical solution was verified using several demand functions for additive lifetime distributions, thereby demonstrating the system's effectiveness.
Classification-Based Probabilistic Modeling of Texture Transition for Fast Line Search Tracking and Delineation
Authors: Ali Shahrokni, Tom Drummond, François Fleuret, Pascal Fua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We introduce a classification-based approach to finding occluding texture boundaries. The classifier is composed of a set of weak learners which operate on image intensity discriminative features which are defined on small patches and fast to compute. A database which is designed to simulate digitized occluding contours of textured objects in natural images is used to train the weak learners. The trained classifier score is then used to obtain a probabilistic model for the presence of texture transitions which can readily be used for line search texture boundary detection in the direction normal to an initial boundary estimate. This method is fast and therefore suitable for real-time and interactive applications. It works as a robust estimator which requires a ribbon like search region and can handle complex texture structures without requiring a large number of observations. We demonstrate results both in the context of interactive 2-D delineation and fast 3-D tracking and compare its performance with other existing methods for line search boundary detection.
HandiGlyph: une m&eacute;thode de saisie de texte sur dispositifs mobiles pour personnes handicap&eacute;es
Authors: Mohammed Belatar, Franck Poirier
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

In this paper we describe a new mobile text input method called "HandiGlyph" for severe disabled people based on the universal UniGlyph character set. It uses the same principles as UniGlyph in addition to some well-known techniques used in Augmentative and Alternative Communication (AAC). The new solution was evaluated with a disabled user suffering of the Locked-In Syndrom and the results are promising.
Quality assurance and maintenance application systems
Authors: Barbara J. Taute
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Modifications to application systems in production can have a devastating effect on the environment if the changes are not handled correctly. A comprehensive quality assurance (QA) approach can help minimize this potentially harmful effect. This approach involves all groups: users, data processing center, applications programming, and quality assurance. The QA approach should address four areas: 1. Phased approach 2. Procedure flows 3. Maintenance guidelines 4. Implementation This paper describes the QA phased approach successfully developed at Time Inc. The phased approach consists of the definition and implementation of eight phases, envisioned in a circular life cycle. Emergency processing is considered separately. Procedure flows consist of diagrams and charts listing responsibilities of the participants. Maintenance guidelines contain helpful hints and checklists and provide direction to the participants. The benefits are noteworthy: The phased QA approach consolidates groups, forms a standard for maintenance procedures, and increases productivity.
Brief paper: Analysis of partial stability problems using sum of squares techniques
Authors: James Fisher, Raktim Bhattacharya
Venue: Automatica (Journal of IFAC) (2009)

A methodology for algorithmic construction of Lyapunov functions for problems concerning the stability of an equilibrium with respect to part of the system variables is proposed. This methodology utilizes the previously developed sum of squares technique to determine Lyapunov certificates. Conditions for stability with respect to part of the variables are developed that allow for Lyapunov functions to be determined in terms of a sum of squares. Asymptotic stability conditions in terms of sum of squares polynomials are developed for autonomous and non-autonomous systems. An example is presented which demonstrates the methodology and gives insight into the new stability conditions.
A Web-Based Bimatrix Game Optimization Model of Polynomial Complexity
Authors: Jonas Mockus
Venue: Informatica (2009)

The objective of this paper is the description, justification, and web-based implementation of polynomial time algorithms for equilibrium search of Quadratic Bimatrix Games (QBG). An algorithm is proposed combining exact and heuristic parts. The exact part has the Irelevant Fraud (IF) component for cases when an equilibrium exists with no pure strategies. The Direct Search (DS) component finds a solution if an equilibrium exists in pure strategies. The heuristic Quadratic Strategy Elimination (QSE) part applies IF and DS to reduced matrices obtained by sequential elimination of strategies that lead to non-positive IF solutions. Finally, penalties needed to prevent unauthorized deals are calculated based on Nash axioms of two-person bargaining theory. In the numeric experiments QSE provided correct solution in all examples. The novel results include necessary and sufficient conditions when the QBG problem is solved by IF algorithm, the development of software and the experimental testing of large scale QBG problems up to n=800. The web-site http://pilis.if.ktu.lt/~jmockus includes this and accompanying optimization models.
Suburban nostalgia: the community building potential of urban screens
Authors: Christine Satchell, Marcus Foth, Greg Hearn, Ronald Schroeter
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Urbanely nomadic residents are increasingly forgoing the potential of locale based serendipitous encounters in favour of digitally mediated interactions within their walled garden of existing social networks. This limits a sense of community in urban neighbourhoods to members of one's social network, but what of interactions with those outside of these networks, such as inhabitants of residential spaces? We report on our pilot study of open ended interviews which investigates the different user archetypes whose needs we consider when designing social technology for urban spaces. We propose a design to extend the sense of community in urban neighbourhoods beyond pure network sociality. Through a lens of 'suburban nostalgia' we envision how neighbourhood interactions might be retrofitted in new ways through civic engagement in the enhancement of environments.
Grid Approximation of a Singularly Perturbed Parabolic Reaction-Diffusion Equation on a Ball
Authors: Lidia Shishkina, Grigory Shishkin
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We consider a Dirichlet problem on a ball for a singularly perturbed parabolic reaction-diffusion equation. The Laplacian in the equation is multiplied by a perturbation parameter &epsilon; 2, where &epsilon;&thinsp;&isin;&thinsp;(0,1]. The solution of such a problem exhibits the parabolic boundary layer in a neighbourhood of the ball boundary as &epsilon;&rarr;0. Using the integro-interpolational method and the condensing mesh method, we construct conservative finite difference schemes whose solutions converge &epsilon;-uniformly.
Effective Reformulation for Resource Allocation in Computational Grid
Authors: Xiaoshe Dong, Yiduo Mei, Siyuan Ma, Guannan Gong, Zhengdong Zhu
Venue: International Journal of Distributed Sensor Networks (2009)

Grid enables resource sharing and dynamic allocation of computational resources. It is a great challenge to make numerous resources available on-demand to guarantee the Quality-of-Service for jobs. This paper presents a two-stage optimization model for resource allocation in grid. Job constraints are classified into mandatory constraints and negotiated constraints. In the first stage, a preprocessing procedure such as resource discovery deals with the mandatory constraints. This has been fulfilled as our previous work. In the second stage, negotiated constraints are treated as Knapsack Problem-based optimization problem. Centralized scheduling and decentralized scheduling have been considered in this paper. This work is fulfilled as part of the Constellation Model for grid resource management. We formulate centralized scheduling as Multi-Constraint Multiple Knapsack Problem (MCMKP). In centralized scheduling, jobs are submitted to a global job queue. A global scheduler assigns each job to a proper grid site according to the scheduling strategy. The scheduling is done periodically (e.g. daily or weekly). We formulate decentralized scheduling as Multi-Dimensional Knapsack Problem (MDKP). In decentralized scheduling, jobs are submitted to local job queues. Allocation decisions are made by local schedulers individually. Jobs that can not be executed immediately are sent to a global waiting queue. When local scheduling is initialized, a local scheduler can select jobs from both the local job queue and the global waiting queue. Objectives of both centralized scheduling and decentralized scheduling are to optimize the utility defined by a grid economy approach. The defined utility makes the trade-offs between user-concerned metrics and system-concerned metrics. Heuristic algorithms such as Very Large-Scale Neighborhood Search proposed by R. K. Ahuja and C. B. Cunha [2005] can be used to solve the combinatorial optimization problem. We implemented a prototype of the Constellation Model. Genetic algorithms for constrained optimization which is proposed by S. Venkatraman and G. G. Yen [2005] have been implemented to solve the above optimization problems. Experimental results show that, performance metrics such as gained utility, response rate, and resource utilization are improved and resources are allocated in an optimal way.
Survey on Directed Model Checking
Authors: Stefan Edelkamp, Viktor Schuppan, Dragan Bošnački, Anton Wijs, Ansgar Fehnker, Husain Aljazzar
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

This article surveys and gives historical accounts to the algorithmic essentials of directed model checking, a promising bug-hunting technique to mitigate the state explosion problem. In the enumeration process, successor selection is prioritized. We discuss existing guidance and methods to automatically generate them by exploiting system abstractions. We extend the algorithms to feature partial-order reduction and show how liveness problems can be adapted by lifting the search space. For deterministic, finite domains we instantiate the algorithms to directed symbolic, external and distributed search. For real-time domains we discuss the adaption of the algorithms to timed automata and for probabilistic domains we show the application to counterexample generation. Last but not least, we explain how directed model checking helps to accelerate finding solutions to scheduling problems.
Mixed Transition Systems Revisited
Authors: Ou Wei, Arie Gurfinkel, Marsha Chechik
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Partial models support abstract model-checking of complex temporal properties by combining both over- and under-approximating abstractions into a single model. Over the years, three families of such modeling formalisms have emerged, represented by Kripke Modal Transition Systems (KMTSs), with restrictions on necessary and possible behaviors, Mixed Transition Systems (MixTSs), with relaxation on these restrictions, and Generalized Kripke MTSs (GKMTSs), with hyper-transitions, respectively. In this paper, we compare the three families w.r.t. their expressive power (i.e., what can be modeled, what abstraction can be captured), and the cost and precision of model-checking. We show that these families have the same expressive power (but do differ in succinctness), whereas GKMTSs are more precise (i.e, can establish more properties) for model-checking than the other two families. However, the use of GKMTSs in practice has been hampered by the difficulty of encoding them symbolically. We address this problem by developing a new semantics for temporal logic of partial models that makes the MixTS family as precise for model-checking as the GKMTS family. The outcome is a symbolic model-checking algorithm that combines the efficient symbolic encoding of MixTSs with the model-checking precision of GKMTSs. Our preliminary experiments indicate that the new algorithm is a good match for predicate-abstraction-based model-checkers.