ppxscal/embedding_network huggingface dataset:
A 2-D Automatic Segmentation Scheme for Brainstem and Cerebellum Regions in Brain MR Imaging
Authors: Jiann-der Lee, Yeo-xiang Tseng, Li-chang Liu, Chung-hsien Huang, Shin-tseng Lee, Chien-tsai Wu, Jyi-feng Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper describes a 2-D automatic segmentation scheme for brainstem and cerebellum regions in brain MR images by using Ada-boosted and Active Contour Model technologies. The proposed scheme includes two processing stages: the detection process for the candidate regions and the segmentation process for the final contours. In the detection process, Ada-boosted technology has been used for three times to find the large region containing the brainstem and cerebellum first and to find the individual cerebellum and brainstem candidate regions later. The partial edge information of candidate regions are used as boundary limits in the next stage. In the segmentation process, a modified Scale-based Fuzzy Connectedness algorithm (SFC), Chain code, and Active Contour Model (ACM) are used for the final boundaries. This automatic scheme provides consistent segmentation results to avoid manual errors such as the seed locations in Fuzzy Connectedness methods.
SEDAN: Secure and Efficient protocol for Data Aggregation in wireless sensor Networks
Authors: Miloud Bagaa, Noureddine Lasla, Abdelraouf Ouadjaout, Yacine Challal
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Energy is a scarce resource in Wireless Sensor Networks. Some studies show that more than 70% of energy is consumed in data transmission. Since most of the time, the sensed information is redundant due to geographically collocated sensors, most of this energy can be saved through data aggregation. Furthermore, data aggregation improves bandwidth usage. Unfortunately, while aggregation eliminates redundancy, it makes data integrity verification more complicated since the received data is unique. In this paper, we present a new protocol that provides secure aggregation for wireless sensor networks. Our protocol is based on a two hops verification mechanism of data integrity. Our solution is essentially different from existing solutions in that it does not require referring to the base station for verifying and detecting faulty aggregated readings, thus providing a totally distributed scheme to guarantee data integrity. We carried out simulations using TinyOS environment. Simulation results show that the proposed protocol yields significant savings in energy consumption while preserving data integrity.
Determination of Optimum Antenna Number Ratio Based on Differential Evolution for MIMO Systems under Low SNR Conditions
Authors: Ibrahim Develi
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we derive a simple expression to determine the optimum antenna number ratio for multi-input multi-output systems under low signal- to-noise ratio (SNR) conditions. The parameters of the proposed expression are optimally determined by the differential evolution algorithm. The accuracy of the new expression is evaluated at different low SNRs. Numerical results show that the expression introduced in this paper significantly outperforms the high SNR approximation, and the results exhibit very good agreement with the optimum antenna number ratios that maximize the noise-limited asymptotic capacity expression.
Epidemic Broadcast Trees
Authors: Joao Leitao, Jose Pereira, Luis Rodrigues
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossipbased overlay. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.
Representations and Strategies for Solving Spatial Problems with Diagrams
Authors: Bonny Banerjee, B. Chandrasekaran
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Spatial problems (SP) are inevitable in reasoning with diagrams. In this paper, we investigate general representations and computational strategies for a SP-solver such that it can accept problems from a human in a high-level language and output the solution without human intervention. We propose a language in which a variety of domain-independent 2D SPs can be specified in terms of constraints. The constraints are specified in first-order logic over the real domain using a vocabulary of objects, properties, relations and actions. We also propose two general and independent computational strategies -- constraint satisfaction and spatial search -- for autonomously solving the SPs. Ideas about how to make these strategies computationally efficient are discussed and illustrated by examples.
Disintegration of Gaussian measures and average-case optimal algorithms
Authors: Vaja Tarieladze, Nicholas Vakhania
Venue: Journal of Complexity (2007)

It is shown that a Gaussian measure in a given infinite-dimensional Banach space always admits an essentially unique Gaussian disintegration with respect to a given continuous linear operator. This covers a similar statement made earlier in [Lee and Wasilkowski, Approximation of linear functionals on a Banach space with a Gaussian measure, J. Complexity 2(1) (1986) 12-43.] for the case of finite-rank operators.
Subjunctive interfaces: Extending applications to support parallel setup, viewing and control of alternative scenarios
Authors: Aran Lunzer, Kasper Hornbæk
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Many applications require exploration of alternative scenarios; most support it poorly. Subjunctive interfaces provide mechanisms for the parallel setup, viewing and control of scenarios, aiming to support users' thinking about and interaction with their choices. We illustrate how applications for information access, real-time simulation, and document design may be extended with these mechanisms. To investigate the usability of this form of extension, we compare a simple census browser against a version with a subjunctive interface. In the first of three studies, subjects reported higher satisfaction with the subjunctive interface, and relied less on interim marks on paper. No reduction in task completion time was found, however, mainly because some subjects encountered problems in setting up and controlling scenarios. At the end of a second, five-session study, users of a redesigned interface completed tasks 27&percnt; more quickly than with the simple interface. In the third study we examined how subjects reasoned about multiple-scenario setups in pursuing complex, open-ended data explorations. Our main observation was that subjects treated scenarios as information holders, using them creatively in various ways to facilitate task completion.
Parameterized Complexity of Vertex Cover Variants
Authors: Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
Venue: Theory of Computing Systems (2007)

Important variants of theVERTEX COVER problem (among others, CONNECTED VERTEX COVER, CAPACITATED VERTEX COVER, and MAXIMUM PARTIAL VERTEX COVER) have been intensively studied in terms of polynomial-time approximability. By way of contrast, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as the parameter, CONNECTED VERTEX COVER and CAPACITATED VERTEX COVER are both fixed-parameter tractable while MAXIMUM PARTIAL VERTEX COVER is W[1]-complete. This answers two open questions from the literature. The results extend to several closely related problems. Interestingly, although the considered variants of VERTEX COVER behave very similar in terms of constant factor approximability, they display a wide range of different characteristics when investigating their parameterized complexities.
A Stochastic Algorithm for Feature Selection in Pattern Recognition
Authors: Sébastien Gadat, Laurent Younes
Venue: The Journal of Machine Learning Research (2007)

We introduce a new model addressing feature selection from a large dictionary of variables that can be computed from a signal or an image. Features are extracted according to an efficiency criterion, on the basis of specified classification or recognition tasks. This is done by estimating a probability distribution P on the complete dictionary, which distributes its mass over the more efficient, or informative, components. We implement a stochastic gradient descent algorithm, using the probability as a state variable and optimizing a multi-task goodness of fit criterion for classifiers based on variable randomly chosen according to P. We then generate classifiers from the optimal distribution of weights learned on the training set. The method is first tested on several pattern recognition problems including face detection, handwritten digit recognition, spam classification and micro-array analysis. We then compare our approach with other step-wise algorithms like random forests or recursive feature elimination.
Pulse control problems under ellipsoidal constraints: Constraint parameters sensitivity
Authors: O. G. Vzdornova, T. F. Filippova
Venue: Automation and Remote Control (2007)

Consideration is given to pulse control problems for the tube of trajectories of the linear differential system under incomplete information on the initial data. Apart from the ordinary requirement for boundedness of variation, a special constraint of the ellipsoidal type is imposed on control actions; at this constraint, vectors of jumps of generalized controls belong to the specified ellipsoid of the corresponding finite-dimensional space. The dependence of the variation of optimal pulse control that solves the control problem for the tube of trajectories on parameters of the ellipsoidal constraint on admissible controls is studied.
Activity Monitoring to Guarantee File Availability in Structured P2P File-sharing Systems
Authors: Guowei Huang, Zhi Chen, Qi Zhao
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

A cooperative structured peer-to-peer file-sharing system requires that the nodes participating in the system need to maintain the location mappings of other nodes. However, the selfish nodes have no incentive to donate their own resources to other nodes and they will refuse to take the responsibility for the maintenance of location mappings, if they can get the system's resources for free. Thus, this free-riding behavior of selfish nodes will make many files unavailable to the whole system. To address this problem, we propose a robust distributed system to monitor the activities of each node and evaluate the node's reputation, which influences the node's access to the system resources. We analyze the system and demonstrate that it is scalable and is secure under a strong attack model. Furthermore, simulation results show that the system can detect and prevent the freeriding behavior effectively and efficiently.
Software Program Cohesion Notion Apply to Evaluating Product Process Assignment
Authors: Fusheng Qiu, Wenjian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

For process assignment that is strongly cohesive and weakly coupled, an evaluating model based on activity relation matrix is constructed on the similarities between software programs and the process. In this model, activity relationship matrix is employed to describe constraint-dependent relationships among activities, and this matrix is presented for calculating the numbers of controlling elements to improve the efficiency and rate of getting cohesion coefficients. In additional, the inspiration for the introduced notion is derived from cohesion metrics in software engineering. Also, a heuristic qualitative analysis method is provided that is based on this model to decide between various process assignment alternatives. Both a theoretical and an empirical evaluating method give a positive support its soundness. Lastly, three examples are given to verify the feasibility and effectiveness of the model.
Nonnegativity of covariances between functions of ordered random variables
Authors: Taizhong Hu, Junchao Yao, Qingshu Lu
Venue: Probability in the Engineering and Informational Sciences (2007)

In this article we investigate conditions by a unified method under which the covariances of functions of two adjacent ordered random variables are nonnegative. The main structural results are applied to several kinds of ordered random variable, such as delayed record values, continuous and discrete ℓ&infin; &le;-spherical order statistics, epoch times of mixed Poisson processes, generalized order statistics, discrete weak record values, and epoch times of modified geometric processes. These applications extend the main results for ordinary order statistics in Qi [28] and for usual record values in Nagaraja and Nevzorov [25].
An Application of Improved PageRank in Focused Crawler
Authors: Yulian Zhang, Chunxia Yin, Fuyong Yuan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The focused crawler of a special-purpose search engine aims to selectively seek out pages that are relevant to a pre-defined set of topics, rather than to exploit all regions of the Web. The PageRank algorithm is often used in ranking web pages, and it is also used in URL ordering for focused crawler. It estimates the page's authority by taking into account the link structure of the Web. However, it assigns each outlink the same weight and is independent of topics, resulting in topic-drift. In this paper, we propose an improved PageRank algorithm, which we called "To-PageRank", and then we present a crawling strategy using the To-PageRank algorithm combining with the topic similarity of the hyperlink metadata. The experiment in focused crawler shows that the new improved crawling strategy has better performance than the Breath-first and PageRank algorithms.
Hardware then and now
Venue: Computer (1976)

Computer hardware has evolved from huge machines requiring rooms full of equipment and highly skilled operators to computers on a chip that are accessible to an ever-increasing circle of users. Below, photos of ENIAC and Intel's newest single board computer (held by one of its youngest users) suggest the extent of that evolution. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
Authors: Imen Essafi, Yazid Mati, Stéphane Dauzère-Pérès
Venue: Computers and Operations Research (2008)

This paper considers the job-shop problem with release dates and due dates, with the objective of minimizing the total weighted tardiness. A genetic algorithm is combined with an iterated local search that uses a longest path approach on a disjunctive graph model. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Previous studies on genetic algorithms for the job-shop problem point out that these algorithms are highly depended on the way the chromosomes are decoded. In this paper, we show that the efficiency of genetic algorithms does no longer depend on the schedule builder when an iterated local search is used. Computational experiments carried out on instances of the literature show the efficiency of the proposed algorithm.
The Intel MCS-48 Microcomputer Family: A Critique
Authors: J. F. Wakerly
Venue: Computer (1979)

A System designer and teacher, who has made liberal use of microcomputers in his own work and whose students have designed 8048 processors, reviews the capabilities and limitations of the MCS-48 family of microcomputers.
An Interactive Real Time Segmentation Method for 3D medical image
Authors: Jian Yuan Dong, Min Qi, Yi Wang, Chong Yang Hao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper an interactive real time 3D segmentation method is presented. Not as the usual slice by slice segmentation in 2D, we perform volumetric segmentation on the 3D image directly, by the extention of fast marching algorithm to 3D. The key steps that set seed points and construct velocity in the fast marching method are put forward. Then 3D segmentation results are show in various anatomical organ (lung, trachea), and the whole segmentation procedure takes only several minutes.
Characterizing Web users' online information behavior
Authors: Chun-Yao Huang, Yung-Cheng Shen, I-Ping Chiang, Chen-Shun Lin
Venue: Journal of the American Society for Information Science and Technology (2007)

Although the body of literature pertaining to the study of micro, context-specific behavior on the Web is growing, there lacks a global, macro analysis as to the behavioral dimensions of Web users' online activities. In an attempt to fill in the gap, this study proposes a three-dimensional, cubic typology for the characterization of Web users' online information behavior. We discuss a set of hypotheses concerning the relationships among these dimensions as well as those between these dimensions and related behavioral aspects. Online panel data consisting of month-long clickstreams of 2,022 Web users obtained from InsightXplore, Taiwan are made available for the empirical validation of the hypotheses. We found that a Web user's width (i.e., number of categories of Web sites explored), length (i.e., number of sites visited per category), and depth (i.e., number of pages downloaded per site) of online information behavior are highly correlated. Furthermore, these three dimensions of the behavioral &ldquo;cube&rdquo; are positively associated with speed of navigation, but negatively associated with the Web users' explicit online information search propensity and the degree of relatedness among the sites they visited. &copy; 2007 Wiley Periodicals, Inc.
Quality-of-Service Management in ASEMA System for Unicast MPEG4 Video Transmissions
Authors: Johannes Oikarinen, Tomi Raty, Luo Miao, Markus Sihvonen
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

The Active Service Environment Management system (ASEMA) provides best possible multimedia service experience to enduser. One of the main aspects of the ASEMA is to provide a variable live streaming service to the endusers of the ASEMA. The ASEMA implements this through dynamic change in the properties of the video stream delivered to the enduser's enddevice. The live video stream used in the ASEMA is delivered to the endusers is in MPEG4 video format. The video itself is streamed on top of the RealTime Protocol (RTP) and the parameters are negotiated with the RealTime Streaming Protocol (RTSP) before the streaming commences. The research problem of this is to provide easy solution for QoS measurements in networks that are closed nature. The research is based on the constructive method of the related publications and the results are deducted from the constructed QualityofService management of the ASEMA System. The management is founded on the measuring of the receiving and sending bitrate values in both ends, in the sending end and in the receiving end. If a fluctuation in the values are detected the video stream's properties are changed dynamically.
Synthetic Evaluation for Operating Economy of Thermal Power Plant Based on SVM and Quick Sort Algorithm
Authors: Wei Sun, Xing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In view of the situation that the single index of net coal consumption rate can not evaluate the operating economy of thermal power plant in all sides, a comprehensive index system is established and a synthetic evaluation model based on support vector machine (SVM) and quick sort algorithm is presented. Then experiments are made by using the real data from thermal power plants and the sequence of them is obtained ultimately. The results show that the model proposed has simple operation and high accuracy, and comparaing with BP network, SVM shows better performance in the condition of few data.
Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-path Routes in Ad Hoc Networks
Authors: Natarajan Meghanathan
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The high-level contribution of this paper is a simulation-based analysis to provide benchmarks for the stability and hop count of node-disjoint and link- disjoint multi-path routes in mobile ad hoc networks. For a given source s and destination d, the stability of a link-disjoint and node-disjoint multi-path routing approach is the number of multi-path sets of s-d routes determined over the duration of a network simulation session. We persist with the determined multi-path set of s-d routes as long as at least one path in the set exists. The average hop count of a multi-path set of s-d routes is the time averaged hop count of the constituent s-d routes according to the duration of their utility. We observe that for different conditions of network density and node mobility, node-disjoint paths are as stable as link-disjoint paths and also there is not much difference in the hop count of these paths.
Fuzzy Data Envelopment Analysis with Credibility Constraints
Authors: Mingqiang Meng, Yankui Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Based on credibility theory, this paper provides the input-oriented credibility data envelopment analysis (CDEA) model, in which we adopt the concept of fuzzy chance constrained programming on objective function and all constraints with fuzzy inputs and fuzzy outputs. In some special cases, such as the fuzzy inputs and fuzzy outputs are independent trapezoidal fuzzy variables, this kind of CDEA model can be changed into the crisp equivalent class. Fur- thermore, some basic properties about the proposed CDEA model are discussed. At last, we give a numerical example to illustrate the effectiveness of the proposed CDEA model.
Character Recognition with a Coherent Optical Multichannel Correlator
Authors: G. Winzer
Venue: IEEE Transactions on Computers (1975)

A coherent-optical reading method for Optical Character Recognition Set A [OCR(A)]-numerics is derived modifying a customary coding method which has been used in optical correlators that feature signal input via ultrasonic light modulators for time compression of radar pulses. It is shown by computer simulation that unambiguous recognition of these numerics will be possible if combined application