ppxscal/embedding_network huggingface dataset:
An algorithm portfolio based solution methodology to solve a supply chain optimization problem
Authors: Salik R. Yadav, Raja Ram M. R. Muddada, M. K. Tiwari, Ravi Shankar
Venue: Expert Systems with Applications: An International Journal (2009)

This paper introduces the algorithm portfolio concept to solve a combinatorial optimization problem pertaining to a supply chain. The supply chain problem is modeled with capacity constraints and demand variations over different time periods to minimize the total supply chain configuration cost. The algorithm portfolio is implemented over various problem instances to inspect and alleviate the computational expensiveness of a solution strategy. A bunch of five algorithms are utilized hereby viz. AIS, GA, Endosymbiotic Optimization, PSO and Psychoclonal algorithm. The observations reflect the appropriateness and effect of algorithm portfolios over the adopted supply chain, and viability over other optimization problems.
TOWARDS A MODELING OF NATURAL SYSTEMS
Authors: Yu. G. Dmitriev, F. P. Tarasenko
Venue: Cybernetics and Systems (2009)

We percept the infinitely various and diverse world as a huge system of systems. In the classification of them the one entity can be singled out and be called the growing systems. This paper presents an attempt of modeling such systems. It resulted with some non-trivial inferences and suggests methods of studying and controlling such systems.
Metadata in an ecosystem of presentation dissemination
Authors: R. John Robertson, Phil Barker, Mahendra Mahey
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Developing and managing local practices about metadata implementation (desired quality, workflow, support tools, guidelines, and vocabularies) and about metadata exposure (supported standards, and pre-exposure transformations) requires an ability to understand and communicate the specific complex settings in which the metadata, resources, and users exist. Developing such an understanding is often informed by an implicit or explicit conceptual model.
Using Quotient Image and Linear Subspace for Face Recognition under Arbitrary Illumination Conditions
Authors: Lin He, Jiwei Liu, Bo Zhang, Zhiliang Wang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In this paper, we theoretically analyze the limitation of the Quotient Image (QI) method proposed by Shashua and present a new way to compute the quotient image. Based on the observation that nine basis point light sources can represent almost arbitrary lighting conditions for face recognition application, we use the corresponding nine basis images which are all real images to span the image space. And similar to the QI, our method can not only get an illumination invariant image but also synthesize a new image under arbitrary illumination conditions. We provide an experimental result to show the effectiveness of our algorithm as well.
The technology profile inventory: Construction, validation, and application
Authors: Ian Spence, Colin G. DeYoung, Jing Feng
Venue: Computers in Human Behavior (2009)

The technology profile inventory (TPI) measures attitudes toward computers and the internet. We describe the most recent phase of the construction of the TPI. The studies reported refine and validate the instrument, and we present the final version as an Appendix A. Using a new sample of respondents (N=394), we replicated the three major factors found previously (Confidence, Approval, and Interest). The TPI scores were related to patterns of information technology (IT) usage and also to gender. To demonstrate the practical utility of the TPI we report (1) results linking TPI scores to behavior during an internet search task; (2) test-retest results obtained as part of a cognitive training experiment using action video games; and (3) results showing that attitudes to IT may be modified by a particular experience with information technology.
Practical, fast Monte Carlo statistical static timing analysis: why and how
Authors: Amith Singhee, Sonia Singhal, Rob A. Rutenbar
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the approximations made in all SSTA tools, but Monte Carlo itself is never employed as a strategy for practical SSTA. It is widely believed to be "too slow" -- despite an uncomfortable lack of rigorous studies to support this belief. We offer the first large-scale study to refute this belief. We synthesize recent results from fast quasi-Monte Carlo (QMC) deterministic sampling and efficient Karhunen-Lo&eacute;ve expansion (KLE) models of spatial correlation to show that Monte Carlo SSTA need not be slow. Indeed, we show for the ISCAS89 circuits, a few hundred, well-chosen sample points can achieve errors within 5%, with no assumptions on gate models, wire models, or the core STA engine, with runtimes less than 90 s.
An ROI/xROI Based Rate Control Algorithm in H.264|AVC for Video Telephony Applications
Authors: Changhee Kim, Taeyoung Na, Jeongyeon Lim, Youngho Joo, Kimun Kim, Jaewoan Byun, Munchurl Kim
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Channel bandwidth in 3G communication networks is very much limited for video telephony services. Therefore, it is worthwhile to enhance a subjective quality of video contents via ROI based coding. In this paper, An ROI/xROI based rate-control method is proposed, which considers the coding of both the ROI and the extended ROIs (xROI's) in non-ROI to meet given target bitrates. In the proposed method, the QP values are increasingly assigned in MB wide inside the non-ROI away from ROI. This reduces the abrupt change in visual quality and the amounts of residual signals along the border between ROI and non-ROI. In this regard, the subjective visual quality is enhanced as well as the proposed rate control has flexibility to control the amounts of the output bitstreams. Experimental results show that the proposed scheme can more effectively achieve the average target bitrates with the better subjective quality than the existing rate control algorithm in H.264|AVC by reducing the variation of the output bitstream amounts.
Decision fusion for improved automatic license plate recognition
Authors: Cristian Molder, Mircea Boscoianu, Iulian C. Vizitiu, Mihai I. Stanciu
Venue: WSEAS Transactions on Information Science and Applications (2009)

Automatic license plate recognition (ALPR) is a pattern recognition application of great importance for access, traffic surveillance and law enforcement. Therefore many studies are concentrated on creating new algorithms or improving their performance. Many authors have presented algorithms that are based on individual methods such as skeleton features, neural networks or template matching for recognizing the license plate symbols. In this paper we present a novel approach for decisional fusion of several recognition methods, as well as new classification features. The classification results are proven to be significantly better than those obtained for each method considered individually. For better results, syntax corrections are also considered. Several trainable and non-trainable decisional fusion rules have been taken into account, evidencing each of the classification methods at their best. Experimental results are shown, the results being very encouraging by obtaining a symbol good recognition rate (GRC) of more than 99.4% on a real license plate database.
A dual iterative substructuring method with a penalty term
Authors: Chang-Ock Lee, Eun-Hee Park
Venue: Numerische Mathematik (2009)

An iterative substructuring method with Lagrange multipliers is considered for second order elliptic problems, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point problem by addition of a penalty term with a positive penalization parameter &#x03b7;, we propose a dual substructuring method which is implemented iteratively by the conjugate gradient method. In spite of the absence of any preconditioners, it is shown that the proposed method is numerically scalable in the sense that for a large value of &#x03b7;, the condition number of the resultant dual problem is bounded by a constant independent of both the subdomain size H and the mesh size h. Computational issues and numerical results are presented.
Improve the Accuracy of One Dependence Augmented Naive Bayes by Weighted Attribute
Authors: Siwei Jiang, Zhihua Cai
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Naive Bayes is a effective and widely used data mining algorithm for classification, but its unrealistic attribute conditional independence harm its performance. Selecting attributes subsets is an important approach to extend the Naive Bayes, and the state-of-the-art SBC algorithm has better accuracy in classification. In this paper, we review the weighted attribute method for Naive Bayes, and explain SBC is one of the special case in weighted attributed methods. Interesting this method, we present a new one dependence augmented Naive Bayes with weighted attribute called WODANB, which use the fuzzy Support Vector Machine to optimize the weights. Experiment on whole 36 datasets recommended by Weka, results show that WODANB significant outperforms than NB, SBC, ODANB, TAN.
A genetic algorithm approach to determine the sample size for control charts with variables and attributes
Authors: İhsan Kaya
Venue: Expert Systems with Applications: An International Journal (2009)

Generally today's production systems consist of multistage processes. Control of these processes is a very important to meet customer's and engineering's specifications. Generally control charts which are used to monitor the process and process capability analysis (PCA) which is a summary statistic to show the process performance are used to determine whether or not the process is in statistical control and meet specifications. Although control charts have been applied in very large area of process control, determining the sample size for control charts is generally a problem. In the literature many techniques to solve this problem have been executed. Kaya and Engin [Kaya, I. & Engin, O. 2007. A new approach to define sample size at attributes control chart in multistage processes: An application in engine piston manufacturing process. Journal of Materials Processing Technology, 183, 38-48] also proposed a model based on minimum cost and maximum acceptance probability to determine the sample size in Attribute Control Charts (ACCs). In this paper, this model is solved by Genetic Algorithms (GAs) with linear real-valued representation and a new chromosome structure is suggested to increase the efficiency of GAs. The performance of GAs is affected by mutation and crossover operators and their ratios. To determine the most appropriate operators, five different mutation and crossover operators are used and they are compared with each other. For this purpose a computer program is coded by MS Visual Basic and it has been run to determine the suitable operators and ratios, respectively. One of the results of the model is sample size, n, and it is suggested to set up ACCs and Variable Control Charts (VCCs). Also the sample size, n, is used to PCA. To show the usage of the proposed model an application from a motor engine factory is illustrated. For quality characteristics cannot be easily represented in numerical form, ''u-control charts'' and for characteristics measurable on numerical scales, ''x@?-R control charts'' are constructed for every stage by taking into account the sample size, n, determined by GAs from the proposed model. These control charts are used to determine whether or not the every stage is in statistical control. Then PCA has been executed for every stage and capability ratios are determined.
Optimisation analysis for reliability assessment based on stochastic differential equation modelling for open source software
Authors: Yoshinobu Tamura, Shigeru Yamada
Venue: International Journal of Systems Science (2009)

A new distributed software development paradigm typified by such open source project will evolve at a rapid pace in the future. Especially, open source software (OSS) which serve as key components of critical infrastructures in the social life are still ever-expanding now. We propose a software reliability growth model based on stochastic differential equations in order to consider the active state of the open source project. Especially, we assume that the software failure intensity depends on the time, and the software fault-reporting phenomena on the bug-tracking system keeps an irregular state. Moreover, it has been necessary to manage the software development process in terms of reliability, development effort and version-upgrade time. We find the optimal version-upgrade time based on the total expected software maintenance effort. We show that the proposed model can assist improvement of quality for OSS systems developed under the open source project.
A lossless data embedding technique by joint neighboring coding
Authors: Chin-Chen Chang, The Duc Kieu, Wen-Chuan Wu
Venue: Pattern Recognition (2009)

Information hiding methods are currently exploited by many researchers for various applications. Proposing an efficient and feasible information hiding method is valuable. This paper presents a new reversible information hiding method for vector quantization (VQ)-compressed grayscale images by using joint neighboring coding (JNC) technique. The proposed method embeds secret data by using the difference values between the current VQ-compressed index and left or upper neighboring indices. The experimental results show that the proposed method achieves the best visual quality of reconstructed images compared with the two related works. In addition, the proposed method obtains as high embedding capacity as Lin and Chang's method, followed by Yang et al.'s method. As for execution speed, Yang et al.'s method is fastest, followed by the proposed method, and then Lin and Chang's method. With respect to bit rate, the proposed method has a little higher bit rate in comparison with the two related works.
The Influence of Regularization Parameter on Error Bound in Super-Resolution Reconstruction
Authors: Minmin Shen, Ping Xue, Ci Wang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Regularization method is widely used to address the ill-conditioned problem of super-resolution (SR) reconstruction to improve its performance. The tradeoff between the fidelity of the data (due to small values of regularization parameter) and the smoothness of the SR result necessitates the choice of the regularization parameter to obtain the optimal solution. In this paper, the objective relative error is analyzed to explore the influence of the regularization parameter on SR reconstruction performance. With the optimal regularization parameter, we derive a relative error bound. The analysis is verified by experiment results.
IHM de suppl&eacute;ance sensorielle visuo-tactile pour aveugles et autistes
Authors: Hervé Segond, Stéphane Maris
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Our research focuses on perceptual and cognitive mechanisms involved in learning procedures in order to develop and validate innovating technologies in the field of health for blind people through the implementation of an embarked version of a Tactile Vision Sensory Substitution device (TVSS) with wireless connections between the three TVSS components (micro camera, coupling system and matrix of tactile stimulators), aesthetically acceptable and allowing an ecological use. Such a device could allow prevention of developmental disorders in blind infants, autonomy for blind people in everyday life (thanks to the implementation of a Human Machine Interface allowing connections between the embarked TVSS device and a Personal Computer with a software development presenting a 3D numerization of the subject's urban environment). A new perspective is proposed in favour of innovating taking care programs for autistic people. The main goal of this project is to allow disabled people to benefit from the scientifically demonstrated efficacy of TVSS devices.
The super spanning connectivity and super spanning laceability of the enhanced hypercubes
Authors: Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. Tan, Hua-Min Huang, Lih-Hsing Hsu
Venue: The Journal of Supercomputing (2009)

A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k * -container if it contains all vertices of G. A graph G is k * -connected if there exists a k *-container between any two distinct vertices of G. Therefore, a graph is 1*-connected (respectively, 2*-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k *-container between any two distinct vertices of G for every k with 1¿k¿¿(G) where ¿(G) is the connectivity of G. A bipartite graph G is k * -laceable if there exists a k *-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k *-container between any two vertices from different partite set of G for every k with 1¿k¿¿(G). In this paper, we prove that the enhanced hypercube Q n,m is super spanning laceable if m is an odd integer and super spanning connected if otherwise.
Introducing the ACM Transactions on Computing Education
Authors: Josh Tenenberg, Robert McCartney
Venue: ACM Transactions on Computing Education (TOCE) (2009)

The ACM Transactions on Computing Education (TOCE) represents a name change and a broadening of scope for the ACM Journal on Educational Resources on Computing (JERIC). The topics covered by this new journal will range across diverse aspects of computing education: traditional computer science, computer engineering, software engineering, information technology, and informatics; emerging aspects of computing; and applications of computing to other disciplines, such as computational biology. The common characteristics shared by these articles are a scholarly approach to teaching and learning, a broad appeal to educational practitioners, and a clear connection to student learning.
Like bees around the hive: a comparative study of a mobile augmented reality map
Authors: Ann Morrison, Antti Oulasvirta, Peter Peltonen, Saija Lemmela, Giulio Jacucci, Gerhard Reitmayr, Jaana Näsänen, Antti Juustila
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present findings from field trials of MapLens, a mobile augmented reality (AR) map using a magic lens over a paper map. Twenty-six participants used MapLens to play a location-based game in a city centre. Comparisons to a group of 11 users with a standard 2D mobile map uncover phenomena that arise uniquely when interacting with AR features in the wild. The main finding is that AR features facilitate place-making by creating a constant need for referencing to the physical, and in that it allows for ease of bodily configurations for the group, encourages establishment of common ground, and thereby invites discussion, negotiation and public problem-solving. The main potential of AR maps lies in their use as a collaborative tool.
Analysis of the nonlinear Uzawa algorithm for symmetric saddle point problems
Authors: Yiqin Lin
Venue: International Journal of Computer Mathematics (2009)

In this paper we discuss the convergence behaviour of the nonlinear Uzawa algorithm for solving saddle point problems presented in a recent paper of Cao [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math. 46 (2003), pp. 157-171]. For a general case, the results on the convergence of the algorithm are given.
Overheads reduction of the distributed time warp simulation
Authors: Hristo Valchanov, Nadezhda Ruskova, Trifon Ruskov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Parallel discrete event simulation (PDES) is a basic approach for evaluation of complex systems. A PDES attempts to speed up the execution of a simulation by distributing the simulation's workload between multiple processors. A network of workstations is a widely available platform for PDES. The present article provides a comparative analysis of operational distributed simulation models based on the Time Warp algorithm. An operational model allowing for reduction of the simulation costs has been proposed based on an experimental evaluation.
Use of Local Ranking in Cellular Genetic Algorithms with Two Neighborhood Structures
Authors: Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

In our former study (Ishibuchi et al. 2006), we proposed the use of two neighborhood structures in a cellular genetic algorithm. One is for local selection where a pair of parents is selected from neighboring cells for mating. This neighborhood structure has been usually used in standard cellular algorithms. The other is for local competition, which is used to define local elitism and local ranking. We have already examined the effect of local elitism on the performance of our cellular genetic algorithm (Ishibuchi et al. 2008). In this paper, we examine the effect of using local ranking as the fitness of each individual. First we explain our cellular genetic algorithm with the two neighborhood structures. Then we examine its two variants with/without local ranking. In one variant, the local ranking of an individual among its neighbors is used as its fitness. Such a fitness redefinition scheme can be viewed as a kind of noise in parent selection. The other variant uses the original fitness value (instead of its local ranking). Through computational experiments, we demonstrate that the use of the local ranking improves the ability to escape from local optima.
Validation Of Interface System Architecture
Authors: William Evan Westermann, Murat M. Tanik
Venue: Journal of Integrated Design Process Science (2007)

In this research, an interface-driven system architecture is validated and then decomposed into interface subsystems. The system is modeled and simulated in order to validate the system architecture prior to design and implementation. In addition to its emphasis on interfaces between components and its partitioning ability, the method presented has the following advantages over other design and analysis techniques: (1) It lays the foundation of interfaces as the primary emphasis of requirements; thus, categorizing the objects to be developed for any design. (2) The method validates an interface-based system architecture by modeling and simulating it, providing feedback at the architectural and requirements levels. (3) It permits the development of subsystems separated by a minimum number of edges and minimum capacity utilization across the cuts. The flows on the edges are based on bits per second as specified in the system requirements.