ppxscal/embedding_network huggingface dataset:
On threshold circuits for parity
Authors: R. Paturi, M. E. Saks
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Motivated by, the problem of understanding the limitations of neural networks for representing Boolean functions, the authors consider size-depth tradeoffs for threshold circuits that compute the parity function. They give an almost optimal lower bound on the number of edges of any depth-2 threshold circuit that computes the parity function with polynomially bounded weights. The main technique used in the proof, which is based on the theory of rational approximation, appears to be a potentially useful technique for the analysis of such networks. It is conjectured that there are no linear size, bounded-depth threshold circuits for computing parity.
Novel Multiple Spatial Watermarking Technique in Color Images
Authors: Ibrahim Nasir, Ying Weng, Jianmin Jiang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes novel robust multiple watermarking technique for color images in spatial domain. The host image is divided into four different regions. Each region consists of four 128*128 blocks in order to hide a watermark. The watermark is a binary image, encrypted and embedded into different regions of the blue component of the host image by altering intensity values of the selected region. Five watermarks can be extracted by comparing the intensities of the selected region of the original image with the corresponding region of the watermarked image. The extracted watermark bits can be determined by calculating the probability of detecting '0' or '1'. Only one watermark will be selected or built from the five extracted watermarks according to the highest value of the normalized cross correlation (NCC). The proposed watermarking technique is shown to be robust for a wide range of attacks, including JPEG2000, JPEG compression, rotation, cropping, scaling, self-similarity, rotation-scaling, rotation-cropping and filtering.
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Authors: Johan Dovland, Einar Broch Johnsen, Olaf Owe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in distributed and unstable networks. Second, the common model of thread concurrency makes reasoning about program behavior very challenging. Models based on concurrent objects communicating by asynchronous method calls, have been proposed to combine object orientation and distribution in a more satisfactory way. In this paper, a high-level language and proof system are developed for such a model, emphasizing simplicity and modularity. In particular, the proof system is used to derive external specifications of observable behavior for objects, encapsulating their state. A simple and compositional proof system is paramount to allow verification of real programs. The proposed proof rules are derived from the Hoare rules of a standard sequential language by a semantic encoding preserving soundness and relative completeness. Thus, the paper demonstrates that these models not only address the first criticism above, but also the second.
Equivolumetric offsets for 2D machining with constant material removal rate
Authors: Hwan Pyo Moon
Venue: Computer Aided Geometric Design (2008)

We introduce two special types of variable radius planar offsets: equivolumetric offsets. Both types of equivolumetric offsets provide us the machining method with the constant material removal rate. The first type of equivolumetric offsets can be used as semi-finished workpiece boundary with which we are able to perform the final finish milling of constant material removal rate with the uniform feedrate profile. Another type of equivolumetric offsets allows us to devise a machining strategy which has the constant material removal rate and the constant contact trajectory speed. By using this, we are able to achieve the constant cutting force and the fairness of the finished surface simultaneously.
Research on System Integrative Evaluation Method Based on Survivability
Authors: Wei-Hua Jiang, Jun Du, Feng Liu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Survivability is the essential ability of a system to fulfill its mission, in a timely manner, in the presence of attacks, failures, or accidents. Survivability should be considered beyond security for information system, and quantitative analysis can assess system survivability accurately for improvement. The paper presents a new type of analysis method for computer system survivability which considers both exterior environment and interior components and their correlations. The method can describe the survivability more precisely and exactly. The paper also elaborates on the process of using this method to evaluate system survivability and its advantages.
Integrated Platform for Collaborative Learning in the Mobile Environment
Authors: Yu-Tsung Tai, Meng-Chien Yang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The internet application for education has changed as development of technology. The prevalence of Web 2.0 makes internet become an environment to share knowledge differ from traditional e-Learning systems. Moreover, mobile devices have become more and more popular as a result of the advance of device performance. How to integrate the Web 2.0 environment and mobile devices to create a mobile learning system becomes an important issue. In this paper, we design an integrated platform for collaborative learning and mobile learning. The platform allows users to edit learning materials collaboratively in a Wiki system and learners can study online with a handheld device.
SIMULATING KNOWLEDGE-GENERATION AND DISTRIBUTION PROCESSES IN INNOVATION COLLABORATIONS AND NETWORKS
Authors: Andreas Pyka, Nigel Gilbert, Petra Ahrweiler
Venue: Cybernetics and Systems (2007)

An agent-based simulation model representing a theory of the dynamic processes involved in innovation in modern knowledge-based industries is described. The agent-based approach allows the representation of heterogenous agents that have individual and varying stocks of knowledge. The simulation is able to model uncertainty, historical change, effect of failure on the agent population, and agent learning from experience, from individual research and from partners and collaborators. The aim of the simulation exercises is to show that the artificial innovation networks show certain characteristics they share with innovation networks in knowledge intensive industries and which are difficult to be integrated in traditional models of industrial economics.
A 7-step approach to the design and implementation of parallel algorithms
Authors: Thomas F. Steck, Gerard G. L. Meyer
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

This paper presents a 7-step, semi-systematic approach for designing and implementing parallel algorithms. In this paper, the target implementation uses MPI for message passing. The approach is applied to a family of matrix factorization algorithms- LU, QR, and Cholesky - which share a common structure, namely, that the second factor of each is upper right triangular. The efficacy of the approach is demonstrated by implementing, tuning, and timing execution on two commercially available multiprocessor computers.
A Grid-Based Approach To Paraloading Using Mirrored Corba Servers
Authors: G. Sudha Sadasivam
Venue: Journal of Integrated Design Process Science (2006)

Internet and Intranet repositories are store houses for multi-gigabit movie files and large multimedia documents. It thus necessitates the development of scalable architectures to locate these resources and to distribute the downloading efficiently among them. Traditionally the documents are downloaded entirely from a single server by establishing parallel connections between the clients and servers. The proposed method of parallel access downloading, i.e. paraloading, is a process that downloads parts of a document in parallel from different mirrored Common Object Request Broker Architecture (CORBA) servers. It considers the load of the servers and their distance from the clients. It is also tolerant to server failures and hence it is highly suitable for a grid-based environment. The proposed method is implemented as a service in Zen, an open source, embedded CORBA implementation based on real time CORBA, as well as real time Java specifications. Test results show that the proposed method consistently downloads files faster then the traditional method.
KALA: Kernel aspect language for advanced transactions
Authors: Johan Fabry, Éric Tanter, Theo DHondt
Venue: Science of Computer Programming (2008)

Transaction management is a known crosscutting concern. Previous research has been conducted to express this concern as an aspect. However, such work has used general-purpose aspect languages which lack a formal foundation, and most importantly are unable to express advanced models of transaction management. In this paper, we propose a domain-specific aspect language for advanced transaction management, called KALA, that overcomes these limitations. First, KALA is based on a recognized formalism for the domain of advanced transaction management, called ACTA. Second, as a consequence of being based on the ACTA formalism, KALA covers a wide variety of models for transaction management. Finally, being a domain-specific aspect language, KALA allows programmers to express their needs at a higher level of abstraction than what is achieved with general-purpose aspect languages. This paper reports on the design of KALA and its implementation over Java, based on the Reflex AOP kernel for domain-specific aspect languages.
A Simple Deterministic Model for the Spread of Hand, Foot and Mouth Disease (HFMD) in Sarawak
Authors: Felix Chuo Sing Tiing, Jane Labadin
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Hand, foot and mouth disease (HFMD) is considered a common disease among children. However, HFMD recent outbreaks in Sarawak had caused many death particularly children below the age of ten. In this study we are building a simple deterministic model based on the SIR (Susceptible-Infected-Recovered) model to predict the number of infected and the duration of an outbreak when it occurs. Our findings show that the disease spread quite rapidly and the parameter that may be able to control that would be the number of susceptible persons. We hope the model will allow public health personnel to plan intervention in an effective manner in order to reduce the effect of the disease in the coming outbreak.
GA based energy loss minimization approach for optimal sizing & placement of distributed generation
Authors: Deependra Singh, Devender Singh, K. S. Verma
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

Distributed Generators (DG) provide the lowest cost solution to handle low voltage or overload problems. In conjunction with such problems, a technique of energy saving is introduced by placement of distributed generation (DG) in distribution systems. A GA based optimal sizing and placement of DG keeping in view of system energy loss minimization in different loading conditions with time varying loads is explained. Minimal annual system energy loss is calculated under voltage and line loading constraints. Proposed strategy is applied to power distribution systems and its effectiveness is verified through simulation results on 16-bus, 37-bus and 75-bus systems with time varying load.
The Data Mining Technology Based on CIMS and its Application on Automotive Remanufacturing
Authors: Ke Chen, Jia Wang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Nowadays, with the development of computer technology, data mining has been widely used in various fields. This paper describes a CIMSMINER that combines the data mining with CIMS (Computer Integrated Manufacturing System) and instructs its objectives, model, physical architecture and methods. Considering the characteristics of remanufacturing of automotive products in China, the CIMSMINER is used to get the information concourse together and obtain the data mining results to help the improvement of products. The application in automotive remanufacturing is a reform to make the automotive product information chain be not only an information carrier, but also an information miner. Currently, the government strongly emphasizes energy saving and emission reducing, which is closely related to the sustainable development of China. Obviously, CIMSMINER is an effective tool to support the implementation of this policy.
Time-sharing parallel applications through performance-targeted feedback-controlled real-time scheduling
Authors: Bin Lin, Ananth I. Sundararaj, Peter A. Dinda
Venue: Cluster Computing (2008)

Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applications from each other and optimize their performance. However, this leads to low utilization or potentially long waiting times. We propose a self-adaptive approach to time-sharing such machines that provides isolation and allows the execution rate of an application to be tightly controlled by the administrator. Our approach combines a periodic real-time scheduler on each node with a global feedback-based control system that governs the local schedulers. We have developed an online system that implements our approach. The system takes as input a target execution rate for each application, and automatically and continuously adjusts the applications' real-time schedules to achieve those rates with proportional CPU utilization. Target rates can be dynamically adjusted. Applications are performance-isolated from each other and from other work that is not using our system. We present an extensive evaluation that shows that the system remains stable with low response times, and that our focus on CPU isolation and control does not come at the significant expense of network I/O, disk I/O, or memory isolation.
Multi-hop all-to-all optical routings in Cartesian product networks
Authors: Li Sun, Fuji Zhang, Jianguo Qian
Venue: Information Processing Letters (2008)

This paper considers the wavelength assignment problem for Cartesian product networks with multi-hops. An upper bound of the (uniform) wavelength index for Cartesian product networks with single-hop is established. This result leads to a consequence for the nth power of an arbitrary network with k-hops. In particular, if k=1, this bound partially generalizes the results of Pankaj [R.K. Pankaj, Architectures for linear lightwave networks, PhD thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992], Bermond et al. [J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno, U. Vaccaro, Efficient collective communication in optical networks, Theoret. Comput. Sci. 233 (2000) 165-189] and Beauquier [B. Beauquier, All-to-all communication for some wavelength-routed all-optical networks, Networks 33 (1999) 179-187] for hypercubes and Hamming graphs. As an application, a tight upper bound for Hamming graph with k hops is established and a corresponding open problem is also proposed.
Dealing with AADL End-to-End Flow Latency with UML MARTE
Authors: Su-Young Lee, Frédéric Mallet, Robert de Simone
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

AADL and MARTE are both modeling formalisms supporting the analysis of real-time embedded systems. We investigate how MARTE, with its Time Model facilities, can be made to represent faithfully AADL periodic/aperiodic tasks communicating through event or data ports, in an approach to end-to-end flow latency analysis.
Multi-agent modeling of the immune system: The situated cellular agents approach
Authors: Stefania Bandini, Sara Manzoni, Giuseppe Vizzari
Venue: Multiagent and Grid Systems (2007)

The Immune System (IS) is the main defense mechanism of higher level organisms to antigens (microscopic threats, such as viruses and bacteria). It is a very complex system, genuinely distributed and providing mechanisms of adaptation to unknown threats. The most relevant characteristics of the IS, such as learning capabilities and the possibility to tackle unknown threats in any part of the body, are a consequence of interactions among its composing parts. This paper describes a Multi-Agent Systems modeling approach to the study of interactions in the IS, adopting the Situated Cellular Agents (SCA) model. After a brief description of the IS, an overview of current modeling and simulation approaches will be given. The SCA model will be then introduced and exploited in order to model some relevant elements and mechanisms of the IS. This work is one of the results of an interdisciplinary research that has involved immunologists of the Advanced Biotechnology Center of Genova and computer scientists of the University of Milan-Bicocca.
Study of Scheduling for Processing Real-Time Communication Signals on Heterogeneous Clusters
Authors: Xiaomin Zhu, Peizhong Lu
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from high-speed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.
Automatic matching of high-resolution SAR images
Authors: F. Chen, C. Wang, H. Zhang
Venue: International Journal of Remote Sensing (2007)

Based on high-resolution SAR data, in this paper, a novel automatic matching model is proposed. The model, which employs a coarse to fine strategy as a whole, consists of three steps. In the first step, edge features are extracted on different levels of pyramid images and an efficient Hausdorff distance-based method is used to yield a coarse global feature match. Due to bi-tree searching, the bottleneck of Hausdorff distance's matching is well resolved. Secondly, SSDA (Sequence Similarity Detection Algorithm) is employed to acquire tie-points using a cross-searching approach which treats features extracted from master and slave images equally. Finally, local-adaptive splitting algorithm with MMSE (Minimum Mean Square Error) is used to achieve a fine matching; local-adaptive splitting algorithm is the essential process to achieve sub-pixel matching accuracy, which enhances the process's flexibility and robustness. Airborne SAR images with high resolution are provided by the Institute of Electronics, CAS and used for experiments-the results of the experiments demonstrate that the model proposed in this paper is robust, with high accuracy (up to a fraction of a pixel), and can be successfully applied to automatic matching of high-resolution SAR images.
Positive almost periodic solutions for shunting inhibitory cellular neural networks with time-varying delays
Authors: Mingshan Cai, Hong Zhang, Zhaohui Yuan
Venue: Mathematics and Computers in Simulation (2008)

This paper is concerned with the existence and exponential stability of positive almost periodic solutions of shunting inhibitory cellular neural networks (SICNNs) with time-varying delays arising from the description of the states of neurons in delayed neural networks in a time-varying situation. By applying Lyapunov functional method and differential inequality techniques, new sufficient conditions ensuring the existence and exponential stability of positive almost periodic solutions for SICNNs are established.
Optimum design of MEMS-SAW filter for wireless system applications
Authors: Nabil Khalil, Amal Zaki, M. B. Saleh, Hazem Ali
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

SAW devices have become increasingly important in implementing sensors, chemical and biological warfare agent detectors, resonators and wireless applications as a filter. These types of device can be implemented with microelectro-mechanical systems (MEMS) to be compatible with CMOS technology. In this work we design RF SAW filter at different frequencies for wireless communication system applications. We focus on optimum design of Input/output IDTs number of electrodes, so the total frequency response of the SAW filter with required bandwidth can be achieved. The designed parameters of the piezoelectric substrate have been obtained from the experimental work for a fabricated multilayer substrate of ZnO/SiO2/Si using MEMS technology. Implementation of the optimized SAW filter in a wireless system is described. Simulation results are presented for different design of SAW filter for verification.
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem
Authors: Mounir Kechid, Jean Frédéric Myoupo
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents a CGM parallel algorithm forthe cost of the Optimal Binary Search Tree Problem(OBST Problem). The best sequential algorithm forthis problem, due to Knuth, requires O(n2) time stepsand O(n2) space. Our CGM (Coarse GrainMulticomputer) algorithm uses p processors, each withO(n2/p) local memory. It requires O(p) communicationrounds and O(n2/p) local computations per processor.To the best of our knowledge, it is the first CGMparallel algorithm, based on the Knuth sequentialversion of the OBST problem.
Secure protocols for varietycash transactions
Authors: Chandra Bhusan Pandey
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Electronic Payment Systems have paved long since the pathway for Electronic Commerce and the technologies for Card based and Network based transactions. Variety Cash is yet another Multi purpose electronic payment system which does guarantees a secure incorporation the Merchant, the Bank and the Customer in providing anonymity in e-Money transactions. However there does exist security flaws and redundancies in the cryptographic transaction protocols of the system, which needs be analyzed and altered for achieving a robust and an attack-proof message exchange. The online transactions part of the system, which is Network based is vulnerable to attacks, viruses and other adversary's effects which might infringe on the integrity of the data involved. In this paper a close analysis of the existing protocols is provided followed by an easy implementation of a new, secure protocol which does not involve any redundancies.