ppxscal/embedding_network huggingface dataset:
High-order quadratures for the solution of scattering problems in two dimensions
Authors: Ran Duan, Vladimir Rokhlin
Venue: Journal of Computational Physics (2009)

We construct an iterative algorithm for the solution of forward scattering problems in two dimensions. The scheme is based on the combination of high-order quadrature formulae, fast application of integral operators in Lippmann-Schwinger equations, and the stabilized bi-conjugate gradient method (BI-CGSTAB). While the FFT-based fast application of integral operators and the BI-CGSTAB for the solution of linear systems are fairly standard, a large part of this paper is devoted to constructing a class of high-order quadrature formulae applicable to a wide range of singular functions in two and three dimensions; these are used to obtain rapidly convergent discretizations of Lippmann-Schwinger equations. The performance of the algorithm is illustrated with several numerical examples.
Design of mobile electronic commerce system based on J2ME
Authors: Xinhua Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, based on the research and analysis of the J2ME architecture and combing with the J2ME technical characteristics, a type of J2ME-based mobile e-commerce system design program is presented, and then the realization of the key technologies in this program is illustrated. The program has the advantages such as simple realization, strong maneuverability.
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Authors: Markus Endler
Venue: Middleware Conference (2003)

Next-generation distributed applications and systems are increasingly developed using middleware. This dependency poses hard R&D challenges, including latency hiding, masking partial failure, information assurance and security, legacy integration, dynamic service partitioning and load balancing, and end-to-end quality of service specification and enforcement. To address these challenges, researchers and practitioners must discover and validate techniques, patterns, and optimizations for middleware frameworks, multi-level distributed resource management, and adaptive and reflective middleware architectures. Following the success of the past IFIP/ACM Middleware conferences (Lake District/UK, Palisades/USA, and Heidelberg/Germany) and building upon the success of past USENIX COOTS conferences, the Middleware 2003 conference is the premier international event for middleware research and technology. The scope of the conference is the design, implementation, deployment, and evaluation of distributed system platforms, architectures, and applications for future computing and communication environments. This year, we had a record of 158 submissions, among which the top 25 papers were selected for inclusion in the technical program of the conference. All papers were evaluated by at least three reviewers with respect to their originality, technical merit, presentation quality, and relevance to the conference themes. The selected papers present the latest results and breakthroughs on middleware research in areas including peer-to-peer computing, publish-subscriber architectures, component- and Web-based middleware, mobile systems, and adaptive computing.
The case for a location metasystem
Authors: Nick Doty
Venue: Proceedings of the 2nd International Workshop on Location and the Web (2009)

Microsoft has proposed an identity metasystem to standardize identity services and the principles behind them. A location metasystem can support interoperation between location services, protect users' privacy and handle issues of granularity. The simple OAuth protocol may be a good model for working towards a location metasystem.
Histogram-Based Partial Differential Equation for Object Tracking
Authors: Peihua Li, Lijuan Xiao
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Traditional object tracking based on color histograms can only represent objects with rectangles or ellipses, thus having very limited ability to follow objects with complex shapes or with highly non-rigid motion. In addressing this problem, we formulate histogram-based tracking as a functional optimization problem based on Jesson-Shannon divergence that is bounded, symmetric and a true metric. Optimization of the functional consists in searching for a candidate image region of possibly very complex shape, whose color distribution is the most similar to the known, target distribution. By using two different techniques of shape derivative and variational derivative (in section 2 and appendix respectively), we derive the partial differential equation (PDE) that describes the evolution of the object contour. Level set algorithm is used to compute the solution of the PDE. Experiments show that the proposed work is globally convergent and can track objects with complex shapes and/or with highly non-rigid motion.
Architectural framework for dynamic web-applications
Authors: Aleksandar Stoev, Aleksandar Dimov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The trend in software development community is to provide web-applications with bigger quality and lower price at the same time. This way maintenance of software becomes a major issue, which could be facilitated by provision of solutions and technologies to develop more dynamic web-applications. However, currently existing solutions, based on Java technology have static and monolithic nature. This paper shows an approach to overcome this and build dynamic web-applications. Two emerging and promising Java based technologies -- Spring and OSGI, are used to provide an architectural framework that enables modular structure of applications, which may be modified during runtime.
Fast Inter Mode Decision Based on RD Costs and Frequencies of Modes
Authors: Wei Li, Bing Zhou, Xueli Huang
Venue: International Journal of Distributed Sensor Networks (2009)

The new video coding standard H.264/AVC achieves higher coding efficiency than previous standards. However, the efficiency arises at the cost of significant complexity. In this paper, an efficient intermode decision algorithm is proposed to cut down the complexity of an exhaustively full mode decision algorithm in the reference software. Statistical variables including RD (Rate Distortion) costs and frequencies of various modes, correlation of modes between current MB (Macroblock), and their spatial and temporal neighbor MBs are utilized to achieve fast mode decision in the algorithm. The proposed algorithm is composed of three primary steps: The characteristics information of video content, RD cost, and frequency of each mode, are obtained by statistics to assist the decision of the best coding mode for the MB. Because the accuracy of the statistical results will affect the succedent mode decision process, FMD (Full Mode Decision) algorithm are used to get the statistical values from several training frames. In addition, considering the above statistical variables change with video content's changes, they are updated at regular intervals. The best coding modes of current MBs and their neighbor MBs (both spatial and temporal) are highly correlated, so the coding mode of these neighbor MBs are used as an indication to that of current MBs. The difference of RD costs between MB mode (16×16, 16×8 and 8×16) and non-MB modes is used to decide the possible modes class for current MB. Furthermore, the possible modes are prioritized based on their occurring probabilities such that the highest probable mode will be tried first. During this process, the computed RD cost is checked against a content adaptive RD cost threshold to decide if the mode decision process should be terminated before trying the remaining modes in the class. In this way many unlikely coding modes are skipped, and the computational time is significantly reduced. Experimental results show that the proposed algorithm performs well on both the low motion sequences and the high motion sequences due to utilizing the sequence-dependent statistical variables as adaptive threshold to decide the best coding modes. On average, the algorithm reduces the total encoding time by 66.3% while image quality (PSNR) degradation is only 0.154dB with bitrate increase about 0.21%.
A service based framework for developing mobile, collaborative games
Authors: Florian Klompmaker, Christian Reimann
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper we introduce a framework that enables developers of mobile, collaborative applications - especially games - to easily use so called services. Services may run either locally on a mobile device or on a remote server application that is also part of the framework. Those that are executed locally are replaceable software libraries. Services may be used to log in to a portal, send messages between multiple devices or doing other kinds of calculation and communication. The benefit of this framework is that it may be used within different operating systems and that it is very easy to be used as an SDK. Therefore developing such kinds of applications has not longer be done from scratch and can be accomplished quite fast.
Design of Output Feedback Controller for Neutral System with Distributed Delay
Authors: Shaohua Wang, Xiaoping Zhao
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper is concerned with the stabilization for linear neutral systems with distributed delays. Based on the model transformation of neutral type, the Lyapunov-Krasovskii functional method is employed to establish the delay-dependent stability criterion. Through the controller parameterization and matrix transformation techniques, the desired parameters are solved from the delay-dependent design condition in terms of linear matrix inequalities, and the desired controller is explicitly formulated. Numerical example is given to illustrate the correctness of the proposed method.
A production-inventory model with remanufacturing for defective and usable items in fuzzy-environment
Authors: Arindam Roy, Kalipada Maity, Samarjit kar, Manoranjan Maiti
Venue: Computers and Industrial Engineering (2009)

This paper investigates a production-remanufacturing system for a single product over a known-finite time horizon. Here the production system produces some defective units which are continuously transferred to the remanufacturing unit and the constant demand is satisfied by the perfect items from production and remanufactured units. Remanufacturing unit uses the defective items from production unit and the collected used-products from the customers and later items are remanufactured for reuse as fresh items. Some of the used items in the remanufacturing unit are disposed off which are not repairable. The remanufactured units are treated as perfect items. Normally, rate of defectiveness varies in a production system and may be approximated by a constant or fuzzy parameter. Hence, two models are formulated separately with constant and fuzzy defective productions. When defective rate is imprecise, optimistic and pessimistic equivalent of fuzzy objective function is obtained by using credibility measure of fuzzy event by taking fuzzy expectation. Here, it is assumed that remanufacturing system starts from the second production cycle and after that both production and remanufacturing units continue simultaneously. The models are formulated for maximum total profit out of the whole system. Here the decision variables are the total number of cycles in the time horizon, the duration for which the defective items are collected and the cycle length after the first cycle. Genetic Algorithm is developed with Roulette wheel selection, Arithmetic crossover, Random mutation and applied to evaluate the maximum total profit and the corresponding optimum decision variables. The models are illustrated with some numerical data. Results of some particular cases are also presented.
Load Identification in Neural Networks for a Non-intrusive Monitoring of Industrial Electrical Loads
Authors: Hsueh-Hsien Chang, Hong-Tzer Yang, Ching-Lung Lin
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

This paper proposes the use of neural network classifiers to evaluate back propagation (BP) and learning vector quantization (LVQ) for feature selection of load identification in a non-intrusive load monitoring (NILM) system. To test the performance of the proposed approach, data sets for electrical loads were analyzed and established using a computer supported program - Electromagnetic Transient Program (EMTP) and onsite load measurement. Load identification techniques were applied in neural networks. The efficiency of load identification and computational requirements was analyzed and compared using BP or LVQ classifiers method. This paper revealed some contributions below. The turn-on transient energy signatures can improve the efficiency of load identification and computational time under multiple operations. The turn-on transient energy has repeatability when used as a power signature to recognize industrial loads in a NILM system. Moreover, the BP classifier is better than the LVQ classifier in the efficiency of load identification and computational requirements.
A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation
Authors: Changchun Pan, G. K. Yang
Venue: Computers and Industrial Engineering (2009)

This paper presents a transparent model and a solution approach to solve a large-scale rolling batch scheduling problem. First, the problem is formulated as a multiple routes problem with multi-objective (MRMOP). By defining a hierarchical cost structure it is natural to decompose the MRMOP into several well-studied sub-problems, i.e. the multiple routes minimum cost problem (MRMCP), the knapsack problem (KP) and the linear assignment problem (LAP). Among these sub-problems the MRMCP is considered as the central one and is tackled first of all. The solution procedure for the MRMCP is based on a partial set-partitioning formulation. It makes use of a variant of column generation. Feasible column is generated as needed by solving a resource constrained elementary shortest path problem (RC-ESPP) by a mixed strategy combing an exact method and heuristics. Then a procedure called Adding-Node is introduced to implicitly solve the KP starting from the solution of the MRMCP. Finally, we solve the LAP with Hungarian algorithm to consider the total tardiness and earliness of the production. Computational results are presented compared with several promising methods on benchmark problems and production orders from Shanghai Baoshan Iron and Steel Complex. The results demonstrate the efficiency of the proposed algorithm.
An Energy Efficient Communication Scheme for Distributed Computing Applications in Wireless Sensor Networks
Authors: Koushik Sinha, Bhabani P. Sinha
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

We propose a new energy efficient communication scheme for multi-hop wireless sensor networks (WSNs). Our run-zero encoding (RZE) communication scheme utilizes the concepts of the RBNSiZeComm protocol introduced in [1, 3, 2]. However, unlike RBNSiZeComm, RZE simultaneously saves energy at both the transmitter and receiver. Also, maintaining synchronization between transmitter and receiver is easier in RZE. Implementation of RZE is based on the transceiver design proposed in [1] that uses a hybrid modulation scheme involving FSK and ASK to keep the cost/complexity of the radio device low. With this non-coherent detection based receiver and assuming equal likelihood of all possible binary strings of a given length, we show that there is a 35.2% savings in energy on an average at the transmitter compared to binary FSK, for additive white gaussian noise (AWGN) channels. Simultaneously, the receiver experiences a savings of 12.5% on an average. These results establish the utility of RZE as a suitable candidate for communication in wireless sensor networks in order to enable distributed computing applications.
Machine efficiency and man power utilization on production lines
Authors: Siva Kumar A. L. Subramaniam, Siti Huzaimah Binti Husin, Yusmarnita Binti Yusop, Abdul Hamid Bin Hamidon
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Efficiency of industrial production lines is crucial as it results in an improved production and utilization of available resources. Factors contributing to production line efficiency are manpower utilization and machine efficiency. Measuring the machine efficiency and man power utilization should be on-line, accurate and truthful. The management should be able to look for relevant production data and to accurately interpret these data in order to identify the various faults at production level and to immediately take steps to improve efficiency. However, faults are overwritten and reports are retouched with inaccurate information. An accurate and on line data management system can ensure that these problems are overcome.
Microbending optical fiber sensors and their applications
Authors: Li Xuejin, Deng Yuanlong, Yu Yongqin, Wang Xinyi, Li Jingxian
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Microbending optical fiber sensors based on bend-induced loss in optical fiber have proved themselves useful for detecting environmental changes. Many different mechanical elements have been developed to perform the sensing, each with attributes suitable for a particular application. The key structures and principles of microbending optical fiber sensors for special applications are introduced in this paper. It mainly includes strain sensor, liquid lever and pressure sensor, differential force and displacement sensor, and temperature sensor specially.
A Domain-Driven Development Approach for Enterprise Applications, Using MDA, SOA and Web Services
Authors: Fabio Perez Marzullo, Jano M. de Souza, José R. Blaschek
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

It is accepted that domain based development is playing an important role on IT projects today. Following such idea, this paper presents preliminary study results of a prototype architecture created with the purpose of using a domain-driven approach to shorten the development of software projects. Our discussion presents a way of sharing business domain models, developed in different project sites, to work together and establish a cooperative development environment. Using a set of development and architectural standards, and modelling theories such as MDA, SOA and Web Services, the proposed architecture indicates that, with the aid of standard and controlled techniques, it is possible to obtain significant gains on software scheduling and cost.
Cluster tracking under kinematical constraints using random matrices
Authors: Wolfgang Koch, Michael Feldmann
Venue: Robotics and Autonomous Systems (2009)

Collectively moving object clusters are of particular interest in certain applications and have to be tracked as separate aggregated entities consisting of an unknown number of individuals. Group targets often will not cause as many detections since there are individual targets in the group due to limited sensor resolution capabilities. In this case, tracking and data association under the 'one target, one detection' assumption are no longer applicable. In this paper, ellipsoidal object extensions are modeled by random matrices, which are treated as additional state variables to be estimated. An important aspect of GMTI tracking is the incorporation of context information into the Bayesian data processing formalism. Here we consider kinematical constraints such as road maps and sensor specific characteristics such as Doppler blindness.
Efficient Data Transmitting Model in Wireless Sensor Networks
Authors: Tian Wang, Weiqing Dong, Lin Wu
Venue: International Journal of Distributed Sensor Networks (2009)

Considering the high similarity among sensor data sequences in wireless sensor networks(WSNs), we propose an efficient data transmitting model—EDTM, which optimizes the data collection scheme utilizing the correlation among sensor nodes. The aim of EDTM is to extend the lifetime of the sensor networks as much as possible, meanwhile guaranteeing the accuracy of data provided to the user which is measured by two parameters, error bounds and confidence. To realize this purpose, EDTM exploits the matching relationship, and if some nodes are matching with each other to a certain degree, it selects the optimal representative nodes Vs to undertake the transportation task. Thus, the measurements of some nodes can be substituted and the energy is conserved. A challenge of the matching algorithm is the time drifting and data lost problem. To obtain the real variation curves of sense attribute, we piecewise fit data sequences using least squares and the fitting error is eliminated in the matching estimation. EDTM computes a parameter IDST based on the sensing curves and we prove that according to the IDST we could analyze the matching degree of any two nodes. At the end, the sensor nodes are distributed into matching sets. We also design the optimal representative node selection scheme including three phases. Every node in the matching sets need to send a cmsg packet to sink in order to inform sink its energy cost information. Sink computes each node's parameter L, which reflects the energy consumption and the influence of energy balance of the node, selects Vs, and informs the transmitting node Vs by sending a tmsg packet. In order to test our approach, an experimental simulation has been done over real-world data and the performance of EDTM has been analyzed. The outcome demonstrates the low error ratio of EDTM, and its effectiveness in decreasing the energy cost.
Optical packet switching with multi-optical-codes label
Authors: Kun Qiu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In the traditional scheme of optical packet switching with optical-code (OC) label, the label is represented by one optical code. The capacity of label is limited by the total available number of optical codes in the same set. For expanding the label number to guarantee the network operation, the code length is required to be increased incredibly but the effect is very insignificant. Furthermore, the long codes make it more difficult to manufacture the encoders and decoders. In this paper, we propose a novel scheme of multi-optical-code (MOC) label which utilize the two dimensions: time and code to construct the label. The quantity of MOC labels increases exponentially with the number of OCs and the divided time slots. The lack of OC label can be solved by adopting the scheme of MOC label. The details of OPS with MOC label including optical packet generation and switching structure are presented. The platform of OPS with MOC label comprised of three edge nodes and one core switching node is established. The key points in the design of edge and core nodes are demonstrated and the experiment results are shown.