ppxscal/embedding_network huggingface dataset:
A Log-Sigmoid Lagrangian Neural Network for Solving Nonlinear Programming
Authors: Limei Zhou, Liwei Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A similar neural network as Zhang and Constantinides [9] is proposed in this paper for solving nonlinear programming with equality and inequality constraints. We overcome the condition of positive definiteness of Lagrangian Hessian by introducing the Log-Sigmoid (LS) function. Thus the proposed network is simpler than the augmented lagrangian neural network in form and have weaker condition than lagrangian neural network in [9].
Pareto-adaptive ε-dominance
Authors: Alfredo G. Hernández-Díaz, Luis V. Santana-Quintero, Carlos A. Coello Coello, Julián Molina
Venue: Evolutionary Computation (2007)

Efficiency has become one of the main concerns in evolutionary multiobjective optimization during recent years. One of the possible alternatives to achieve a faster convergence is to use a relaxed form of Pareto dominance that allows us to regulate the granularity of the approximation of the Pareto front that we wish to achieve. One such relaxed forms of Pareto dominance that has become popular in the last few years is ε-dominance, which has been mainly used as an archiving strategy in some multiobjective evolutionary algorithms. Despite its advantages, ε-dominance has some limitations. In this paper, we propose a mechanism that can be seen as a variant of ε-dominance, which we call Pareto-adaptive ε-dominance (paε-dominance). Our proposed approach tries to overcome the main limitation of ε-dominance: the loss of several nondominated solutions from the hypergrid adopted in the archive because of the way in which solutions are selected within each box.
A Multi-Agent System for Hand-drawn Diagram Recognition
Authors: G. Casella, V. Deufemia, V. Mascardi
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we present AgentSketch, an agent- based system for on-line recognition of hand-drawn diagrams. Agents are used for managing the activity of symbol recognizers and for providing efficient interpretations of the sketch to the user thanks to the use of contextual information for ambiguity resolution. The system can be applied to a variety of domains by providing recognizers of the symbols in that domain. A first experimental evaluation has been performed on the domain of UML use case diagrams to verify the effectiveness of the proposed approach.
A Blind Indic Script Recognizer for Multi-script Documents
Authors: P. Pati, A. Ramakrishnan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We report a hierarchical blind script identifier for 11 dif- ferent Indian scripts. An initial grouping of the 11 scripts is accomplished at the first level of this hierarchy. At the subsequent level, we recognize the script in each group. The various nodes of this tree use different feature-classifier combinations. A database of 20,000 words of different font styles and sizes is collected and used for each script. Ef- fectiveness of Gabor and Discrete Cosine Transform fea- tures has been independently evaluated using nearest neigh- bor, linear discriminant and support vector machine clas- sifiers. The minimum and maximum accuracies obtained, using this hierarchical mechanism, are 92.2% and 97.6%, respectively.
The flow complex: A data structure for geometric modeling
Authors: Joachim Giesen, Matthias John
Venue: Computational Geometry: Theory and Applications (2008)

We study a special case of the critical point (Morse) theory of distance functions namely, the gradient flow associated with the distance function to a finite point set in R^3. The fixed points of this flow are exactly the critical points of the distance function. Our main result is a mathematical characterization and algorithms to compute the stable manifolds, i.e., the inflow regions, of the fixed points. It turns out that the stable manifolds form a polyhedral complex that shares many properties with the Delaunay triangulation of the same point set. We call the latter complex the flow complex of the point set. The flow complex is suited for geometric modeling tasks like surface reconstruction.
Grid Application Scheduling Model Based on Petri Net with Changeable Structure
Authors: Xiangang Zhao, Bai Wang, Liutong Xu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

This paper proposes a scheduling net based on a hierarchical color Petri net and a job net based on a Petri net with changeable structure. According to the granularity of grid applications, the scheduling net is designed into four levels, which makes it easy to deploy distributed schedulers in grid environment and benefits the management of different application granularities. The job net model is based on Petri net with changeable structure, which can change its structure dynamically according to the real-time state of running jobs. This model supports the dynamic mergence and division of subtasks and has ability to handle the running exceptions of subtasks. Finally, we validate the liveness and reachability of the scheduling net and the job net by analyzing their reachability trees. A transition tree algorithm is also presented to analyze the cost and time properties of job net, which can be used for the optimization of resource allocation.
Design and Evaluation of a Dynamic Anomaly Detection Scheme Using the Age of User Profiles
Authors: Ihn-Han Bae, Hwa-Ju Lee, Kyung-Sook Lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. This paper presents a dynamic anomaly detection scheme that can effectively identify a group of especially harmful internal attackers masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on this, the use pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function with both the age of the user profile and weighted feature values. The performance of our scheme is evaluated by using a simulation.
Watermarking-Based Transparency Authentication in Visual Cryptography
Authors: Hao Luo, Jeng-Shyang Pan, Zhe-Ming Lu, Bin-Yin Liao
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper proposes two transparency authentication schemes used in visual cryptography, which are based on watermarking techniques. In the first scheme, a secret image can be perceptible when stacking two transparencies. In addition, another watermark image is visible when shifting one transparency to an appropriate position and stacking it with the other transparency. In the second scheme, both the secret image and the watermark are of the same size, while in the first scheme, the watermark is half of the size of the secret image. No computer aid is needed in decryption in the first scheme while simple computation is required in the second one. The secret image and the watermark are encrypted at the same time in the two schemes. Experimental results demonstrate the two schemes are effective and practical.
Component-Based Design of Safe Real-Time Kernels for Embedded Systems
Authors: Jesper Berthing, Christo Angelov
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

The paper presents a component-based framework for safe real-time kernels for embedded applications. In this framework, a component is defined as a selfcontained unit encapsulating a specific kernel subsystem. Complex components are decomposed into sub-components that implement an atomic functionality within the subsystem under consideration. Each component is specified in terms of public functions (primitives) and protected functions that are used by other components. Accordingly, kernel configurations are modeled by component call graphs that take into account components and their interactions. Such configurations are actually developed by deriving a conformance class specification from the requirements specification of a real-time application, and then mapping it onto an appropriate subset of kernel components, augmented with relevant component dependencies. Kernel safety is enhanced by the rigorous design of kernel functions, using advanced algorithms that provide for very small overhead and constant execution time of kernel primitives, independent of the number of tasks involved.
A Dynamics Estimation Filter for Pose and Motion Estimation in Orbit
Authors: D. J. McTavish, G. Okouneva, J. Enright, R. Schumacher
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

The fundamental task of a space vision system for rendezvous of satellites on-orbit is the real-time determination of the motion of the target satellite as observed from the chaser spacecraft. The usual task of a vision system is to return a snapshot and measurement of the target's position and orientation at a moment in time. Augmenting this architecture with an extended Kalman filter, incorporating a dynamic model and the ability to propagate motion, synthesizes a system that is more efficient and robust.
Feature Selection Algorithms Using Rough Set Theory
Authors: Yaile Caballero, Delia Alvarez, Rafael Bello, Maria M. Garcia
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Rough Sets Theory has opened new trends for the development of the Incomplete Information Theory. Inside this one, the notion of reduct is a very significant one, but to obtain a reduct in a decision system is an expensive computing process although very important in data analysis and knowledge discovery. Because of this, it has been necessary the development of different variants to calculate reducts. The present work look into the utility that offers Rough Sets Model and Information Theory in feature selection and three methods are presented with the purpose of calculate good reducts. The first algorithm is MRSReduct, a variant of the method RSReduct; both methods consist of a greedy algorithm that uses heuristics to work out good reducts in acceptable times. In this paper we propose other method to find good reducts: RSRed*; this method combines several elements of Rough Set Theory. The new methods are compared with others which are implemented inside Pattern Recognition, Genetic Algorithm and Ant Colony Optimization Algorithms and the results of the statistical tests are shown.
Automatic Age Estimation Based on Facial Aging Patterns
Authors: Xin Geng Zhi-Hua Zhou, Kate Smith-Miles
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

While recognition of most facial variations, such as identity, expression and gender, has been extensively studied, automatic age estimation has rarely been explored. In contrast to other facial variations, aging variation presents several unique characteristics which make age estimation a challenging task. This paper proposes an automatic age estimation method named AGES (AGing pattErn Subspace). The basic idea is to model the aging pattern, which is defined as the sequence of a particular individual' s face images sorted in time order, by constructing a representative subspace. The proper aging pattern for a previously unseen face image is determined by the projection in the subspace that can reconstruct the face image with minimum reconstruction error, while the position of the face image in that aging pattern will then indicate its age. In the experiments, AGES and its variants are compared with the limited existing age estimation methods (WAS and AAS) and some well-established classification methods (kNN, BP, C4.5, and SVM). Moreover, a comparison with human perception ability on age is conducted. It is interesting to note that the performance of AGES is not only significantly better than that of all the other algorithms, but also comparable to that of the human observers.
The librarian as video game player
Authors: John Kirriemuir
Venue: The New Review of Information Networking (2006)

Despite media coverage that is usually negative or non-existent, digital (video) game playing is a major form of entertainment for significant numbers of people in developed countries. This paper begins with a brief outline of what these games are, who plays them and why there is interest within the library community. We then move through several examples of the current direct impact of digital games on libraries. This is followed by more abstract examples of how video games could, and do, influence library practise and technology. Attributes of online games are discussed, focusing on one particular game, Second Life. This game is used widely within the library community, with many librarians spending significant time developing avatars, open services and infrastructure. The paper concludes with a summary of the ten attributes of video game players, found across the research literature body, that are of relevance to digital information and library services.
Toward Reducing Fault Fix Time: Understanding Developer Behavior for the Design of Automated Fault Detection Tools
Authors: Lucas Layman, Laurie Williams, Robert St. Amant
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The longer a fault remains in the code from the time it was injected, the more time it will take to fix the fault. Increasingly, automated fault detection (AFD) tools are providing developers with prompt feedback on recently-introduced faults to reduce fault fix time. If, however, the frequency and content of this feedback does not match the developer's goals and/or workflow, the developer may ignore the information. We conducted a controlled study with 18 developers to explore what factors are used by developers to decide whether or not to address a fault when notified of the error. The findings of our study lead to several conjectures about the design of AFD tools to effectively notify developers of faults in the coding phase. The AFD tools should present fault information that is relevant to the primary programming task with accurate and precise descriptions. The fault severity and the specific timing of fault notification should be customizable. Finally, the AFD tool must be accurate and reliable to build trust with the developer.
A model for cooperative federation of distributed clusters
Authors: R. Ranjan, R. Buyya, A. Harwood
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Interest in grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in grid computing. Central to management of resources is the effectiveness of resource allocation, as it determines the overall utility of the system. In this paper, we propose a new grid system that consists of grid federation agents which couple together distributed cluster resources to enable a cooperative environment.
Peer-to-Peer Rating
Authors: Danny Bickson, Dahlia Malkhi, Lidong Zhou
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

This paper proposes to utilize algorithms from the probabilistic graphical models domain for Peer-to-Peer rating of data items and for computing "social influence" of nodes in a Peer-to-peer social network. We evaluate the practicality of our approach using largescale simulations over a MSN Live Messenger subgraph consisting of about a million nodes. Our algorithms are general since they can be used for Peer-to-peer monitoring and for the efficient computation of other node ranking methods, such as PageRank and Information Centrality.
A measure of landscapes
Authors: Wim Hordijk
Venue: Evolutionary Computation (1996)

This paper introduces a statistical fitness landscape analysis, based on Weinberger's random walk method and on a time series analysis known as the Box-Jenkins approach, to measure and express the correlation structure of fitness landscapes. The analysis has some additions to and advantages over previous methods for measuring this structure. The analysis is demonstrated on fitness landscapes constructed with Kauffman's NK-model, using two operators (point mutation and a form of crossover) and a combination of the two. Furthermore, the predictive value of the method is shown.
A Flexible Architecture for Context-Aware Physical Hypermedia
Authors: Cecilia Challiol, Andres Fortier, Silvia Gordillo, Gustavo Rossi
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we present the rationale and the main components for a modular and extensible architecture for building and deploying physical hypermedia software. We show that this kind of software systems poses strong requirements on supporting software (such as Web browsers) because they involve complex context-aware navigation semantics. By using some simple archetypical examples we also show how to provide context-aware assistance to the mobile user, as he explores the physical world.
Modeling and Caching of Peer-to-Peer Traffic
Authors: Osama Saleh, Mohamed Hefeeda
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected toincrease in the future. We explore the potential of deploying proxy caches in different Autonomous Systems (ASes) with thegoal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. We conducta measurement study to model the popularity of P2P objects in different ASes. Our study shows that the popularity of P2P objectscan be modeled by a Mandelbrot-Zipf distribution, regardless of the AS. Guided by our findings, we develop a novel cachingalgorithm for P2P traffic that is based on object segmentation, and partial admission and eviction of objects. Our trace-basedsimulations show that with a relatively small cache size, less than 10% of the total traffic, a byte hit rate of up to 35%can be achieved by our algorithm, which is close to the byte hit rate achieved by an off-line optimal algorithm with completeknowledge of future requests. Our results also show that our algorithm achieves a byte hit rate that is at least 40% more,and at most triple, the byte hit rate of the common web caching algorithms. Furthermore, our algorithm is robust in face ofaborted downloads, which is a common case in P2P systems.
A Mathematical Model for the Comparison of Static and Dynamic Memory Allocation in a Paged System
Authors: G. Jomier
Venue: IEEE Transactions on Software Engineering (1981)

In this paper we compare the two classical memory allocation policies in a multiprogrammed system with paged memory: a static policy based on prepaging and a dynamic policy using page allocation on demand. The two policies are modeled by networks of queues.
Efficient User Support with DACS Scheme
Authors: Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

When operation and management in the university network are performed, various problems occur. As one of those problems, user support problems in the network are often shown. As an example, support at the time of changing setups of a client computer by a user, is described. In this case, it take trouble very much for a system administrator because it is often necessary to support individual users, respectively. As another example, it is necessary to take some measure for annoying communication to other users. In this case, much time and effort are spent to specify where the client with annoying communication is under the management by DHCP Service. To simplify user supports such as those cases, a new user support by DACS (Destination Addressing Control System) Scheme, which is an efficient scheme for the network operation and management in university network, is examined.
Maximum Variance Image Segmentation Based on Improved Genetic Algorithm
Authors: Chun-mei Wang, Su-zhen Wang, Chong-ming Zhang, Jun-zhong Zou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

An image segmentation method based on the OTSU and improved genetic algorithm (GA) is presented. The OTSU is taken as evaluation function and the segmentation problem is turned to the optimization problem. That is, GA efficiently searches the segmentation parameter space in order to obtain the optimal threshold. On the other hand, to overcome some limitation of GA, elite reinsertion is applied. The experimental results indicate that the method can not only obtain a better result, but also shorten the processing time.
Research on a Block Encryption Cipher Based on Chaotic Dynamical System
Authors: Jun Peng, Mingying You, Zhiming Yang, Shangzhu Jin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, a novel block encryption cipher based on chaotic dynamical system is proposed. The algorithm operates on 64-bit plaintext blocks, and the key is 128 bits long. In round function, the logistic chaotic map and three algebraic group operations are mixed. As the algorithm is a Feistel network, it can be used for both encryption and decryption. Furthermore, the security of the algorithm is analyzed in details. The cryptanalyse results indicate that the algorithm has good diffusion and confusion properties, and it is very sensitive to the plaintexts and keys. Finally, by using differential cryptanalysis we found the upper bound of difference character capability for this cipher is 2-6.6601 and 2-17.1862 when block length is 16 and 32 bits long, respectively.
Text Segmentation from Complex Background Using Sparse Representations
Authors: W. Pan, T. Bui, C. Suen
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

A novel text segmentation method from complex back- ground is presented in this paper. The idea is inspired by the recent development in searching for the sparse sig- nal representation among a family of over-complete atoms, which is called a dictionary. We assume that the image un- der investigation is composed of two components: the fore- ground text and the complex background. We further as- sume that the latter can be modeled as a piece-wise smooth function. Then we choose two dictionaries, where the first one gives sparse representation to one component and non- sparse representation to another while the second one does the opposite. By looking for the sparse representations in each dictionary, we can decompose the image into the two composing components. After that, text segmentation can be easily achieved by applying simple thresholding to the text component. Preliminary experiments show some promising results.