snu-aidas/HVMap-dataset huggingface dataset:
BER Analysis of MIMO-OFDM System using Alamouti STBC and MRC Diversity Scheme over Rayleigh Multipath Channel

Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. Global Journal of Researches in Engineering Electrical and Electronics Engineering Volume 13 Issue 13 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 2249-4596 & Print ISSN: 0975-5861
Aerodynamic Design Optimization Studies of a Blended-Wing-Body Aircraft

Abstract The blended-wing body is an aircraft configuration that has the potential to be more efficient than conventional large transport aircraft configurations with the same capability. However, the design of the blended-wing is challenging due to the tight coupling between aerodynamic performance, trim, and stability. Other design challenges include the nature and number of the design variables involved, and the transonic flow conditions. To address these issues, we perform a series of aerodynamic shape optimization studies using Reynolds-averaged Navier–Stokes computational fluid dynamics with a Spalart–Allmaras turbulence model. A gradient-based optimization algorithm is used in conjunction with a discrete adjoint method that computes the derivatives of the aerodynamic forces. A total of 273 design variables—twist, airfoil shape, sweep, chord, and span—are considered. The drag coefficient at the cruise condition is minimized subject to lift, trim, static margin, and center plane bending moment constraints. The studies investigate the impact of the various constraints and design variables on optimized blended-wing-body configurations. The lowest drag among the trimmed and stable configurations is obtained by enforcing a 1% static margin constraint, resulting in a nearly elliptical spanwise lift distribution. Trim and static stability are investigated at both onand off-design flight conditions. The single-point designs are relatively robust to the flight conditions, but further robustness is achieved through a multi-point optimization.
Pravastatin in elderly individuals at risk of vascular disease (PROSPER): a randomised controlled trial

BACKGROUND
Although statins reduce coronary and cerebrovascular morbidity and mortality in middle-aged individuals, their efficacy and safety in elderly people is not fully established. Our aim was to test the benefits of pravastatin treatment in an elderly cohort of men and women with, or at high risk of developing, cardiovascular disease and stroke.


METHODS
We did a randomised controlled trial in which we assigned 5804 men (n=2804) and women (n=3000) aged 70-82 years with a history of, or risk factors for, vascular disease to pravastatin (40 mg per day; n=2891) or placebo (n=2913). Baseline cholesterol concentrations ranged from 4.0 mmol/L to 9.0 mmol/L. Follow-up was 3.2 years on average and our primary endpoint was a composite of coronary death, non-fatal myocardial infarction, and fatal or non-fatal stroke. Analysis was by intention-to-treat.


FINDINGS
Pravastatin lowered LDL cholesterol concentrations by 34% and reduced the incidence of the primary endpoint to 408 events compared with 473 on placebo (hazard ratio 0.85, 95% CI 0.74-0.97, p=0.014). Coronary heart disease death and non-fatal myocardial infarction risk was also reduced (0.81, 0.69-0.94, p=0.006). Stroke risk was unaffected (1.03, 0.81-1.31, p=0.8), but the hazard ratio for transient ischaemic attack was 0.75 (0.55-1.00, p=0.051). New cancer diagnoses were more frequent on pravastatin than on placebo (1.25, 1.04-1.51, p=0.020). However, incorporation of this finding in a meta-analysis of all pravastatin and all statin trials showed no overall increase in risk. Mortality from coronary disease fell by 24% (p=0.043) in the pravastatin group. Pravastatin had no significant effect on cognitive function or disability.


INTERPRETATION
Pravastatin given for 3 years reduced the risk of coronary disease in elderly individuals. PROSPER therefore extends to elderly individuals the treatment strategy currently used in middle aged people.
Dual-Transfer Face Sketch–Photo Synthesis

Recognizing the identity of a sketched face from a face photograph dataset is a critical yet challenging task in many applications, not least law enforcement and criminal investigations. An intelligent sketched face identification system would rely on automatic face sketch synthesis from photographs, thereby avoiding the cost of artists manually drawing sketches. However, conventional face sketch–photo synthesis methods tend to generate sketches that are consistent with the artists’drawing styles. Identity-specific information is often overlooked, leading to unsatisfactory identity verification and recognition performance. In this paper, we discuss the reasons why conventional methods fail to recover identity-specific information. Then, we propose a novel dual-transfer face sketch–photo synthesis framework composed of an inter-domain transfer process and an intra-domain transfer process. In the inter-domain transfer, a regressor of the test photograph with respect to the training photographs is learned and transferred to the sketch domain, ensuring the recovery of common facial structures during synthesis. In the intra-domain transfer, a mapping characterizing the relationship between photographs and sketches is learned and transferred across different identities, such that the loss of identity-specific information is suppressed during synthesis. The fusion of information recovered by the two processes is straightforward by virtue of an ad hoc information splitting strategy. We employ both linear and nonlinear formulations to instantiate the proposed framework. Experiments on The Chinese University of Hong Kong face sketch database demonstrate that compared to the current state-of-the-art the proposed framework produces more identifiable facial structures and yields higher face recognition performance in both the photo and sketch domains.
Eliminating Tight Coupling using Subscriptions Subgrouping in Structured Overlays

An advertisement and matching subscription are tightly coupled to activate a single publication routing path in content-based publish/subscribe systems. Due to this tight coupling, instantaneous updates in routing tables are required to generate alternative paths for dynamic routing. This poses serious challenges in offering scalable and robust dynamic routing in cyclic overlays when network conditions like link congestion is detected. We propose, OctopiA, a distributed publish/subscribe system for content-based dynamic routing in structured cyclic overlays. OctopiA uses a novel concept of subscription subgrouping to divide subscriptions into disjoint sets, called subscription subgroups, to eliminate tight coupling. While aiming at deployment in data center networks, OctopiA generates routing paths of minimum lengths. We use a homogeneous clustering approach with a bit-vector to realize subscription subgrouping and offer inter-cluster dynamic routing without requiring updates in routing tables. Experiments on a cluster testbed with real world data show that OctopiA reduces the number of saved advertisements in routing tables by 93%, subscription broadcast delay by 33%, static and dynamic publication delivery delays by 25% and 54%, respectively.
Bayesian Methods for Mixtures of Experts

Tony Robinson Cambridge University Engineering Department Cambridge CB2 1PZ England. Tel: [+44] 1223 332815 ajr@eng.cam.ac.uk We present a Bayesian framework for inferring the parameters of a mixture of experts model based on ensemble learning by variational free energy minimisation. The Bayesian approach avoids the over-fitting and noise level under-estimation problems of traditional maximum likelihood inference. We demonstrate these methods on artificial problems and sunspot time series prediction.
A multi-objective artificial bee colony algorithm

This work presents a multi-objective optimization method based on the artificial bee colony, called the MOABC, for optimizing problems with multiple objectives. The MOABC uses a grid-based approach to adaptively assess the Pareto frontmaintained in an external archive. The external archive is used to control the flying behaviours of the individuals and structuring the bee colony. The employed bees adjust their trajectories based on the non-dominated solutionsmaintained in the external archive. On the other hand, the onlooker bees select the food sources advertised by the employed bees to update their positions. The qualities of these food sources are computed based on the Pareto dominance notion. The scout bees are used by the MOABC to get rid of food sources with poor qualities. The proposed algorithm was evaluated on a set of standard test problems in comparison with other state-of-the-art algorithms. Experimental results indicate that the proposed approach is competitive compared to other algorithms considered in this work. © 2011 Elsevier B.V. All rights reserved.
Setting Lower Bounds on Truthfulness

We present general techniques for proving inapproximability results for several paradigmatic truthful multidimensional mechanism design problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of 2 − 1 m for the scheduling problem with m unrelated machines (formulated as a mechanism design problem in the seminal paper of Nisan and Ronen on Algorithmic Mechanism Design). Our lower bound applies to truthful randomized mechanisms, regardless of any computational assumptions on the running time of these mechanisms. Moreover, it holds even for the wider class of truthfulness-in-expectation mechanisms. This lower bound nearly matches the known 1.58606 randomized truthful upper bound for the case of two machines (a non-truthful FPTAS exists). Recently, Daskalakis and Weinberg [17] show that there is a polynomial-time 2approximately optimal Bayesian mechanism for makespan minimization for unrelated machines. We complement this result by showing an appropriate lower bound of 1.25 for deterministic incentive compatible Bayesian mechanisms. We then show an application of our techniques to the workload-minimization problem in networks. We prove our lower bounds for this problem in the inter-domain routing setting presented by Feigenbaum, Papadimitriou, Sami, and Shenker. Finally, we discuss several notions of non-utilitarian fairness (Max-Min fairness, Min-Max fairness, and envy minimization) and show how our techniques can be used to prove lower bounds for these notions. No lower bounds for truthful mechanisms in multidimensional probabilistic settings were previously known.1 ∗Computer Science Department, Technion, Haifa, Israel. ahumu@yahoo.com. †School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel. schapiram@huji.ac.il. The current paper supersedes "Setting Lower Bounds on Truthfulness" that appeared as an extended abstract in the Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA07), pages 1143-1152, 2007. The current version includes a new lower bound result for Bayesian Incentive compatible Mechanisms.
Benign Osteoblastoma Involving Maxilla: A Case Report and Review of the Literature

Background. Osteoblastoma is a rare benign tumor. This tumor is characterized by osteoid and bone formation with the presence of numerous osteoblasts. The lesion is more frequently seen in long bones and rarely involves maxilla and mandible. Due to its clinical and histological similarity with other bone tumors such as osteoid osteoma and fibro-osseous lesions, osteoblastoma presents a diagnostic dilemma. Case Report. Very few cases of osteoblastomas involving maxillofacial region have been reported in the literature. This case report involves osteoblastoma involving right maxilla in an 18-year-old male patient. Following detailed clinical examination, radiological interpretation, and histopathological diagnosis, surgical excision was performed. The patient was followed up for a period of 3 years and was disease free. Summary and Conclusion. Benign osteoblastoma involving jaw bones is a rare tumor. There is a close resemblance of this tumor with other lesions such as fibro-osseous lesions and odontogenic tumors and thus faces a diagnostic challenge. Surgical excision with a long-term follow-up gives good prognosis to this lesion-Benign Osteoblastoma.
An adaptive FEC algorithm using hidden Markov chains

Anumber of performance issues must be addressed in order to transmit continuous media stream over the Internet with acceptable quality [9, 6] . These include reducing jitter and recovering from packet losses mainly due to congestion in the routers . Several methods can be used to deal with the loss of a packet such as : retransmission schemes, error concealment, error resilience, interleaving, and FEC (forward error correction) . Each has its advantages/disadvantages depending on the network scenario and conditions (RTT, propagation delay, topology, channel error rate, congestion in the sender/receiver path, etc.) . In this work we focus on FEC techniques. FEC works by adding redundant information to the stream being transmitted in order to reconstruct the original stream at the receiver when packet losses occur. Among its advantages are the small delays introduced to recover information compared to retransmission, for instance, and simplicity of implementation . A clear disadvantage is the increase in the transmission rate due to the redundancy added. One of the simplest approaches among FEC techniques that have been proposed in the literature [11] is to add a packet to each group of N 1 packets with a payload equal to the result of an XOR operation performed in the group. Clearly, if one packet out of the N is lost, the stream is completely recovered . This is accomplished at the expense ofextra bandwidth, in this example an increase of 1/(N 1) . In [4] a clever FEC scheme was proposed in which each packet carries a sample of the previous transmitted packet but compression is used to reduce the overhead . In [7] another technique was developed aimed at maintaining a good compromise between recovery efficiency and bandwidth usage. Since packet losses are mostly due to congestion, increasing the amount of protection using FEC may be unfair to flow controlled streams and also may even have an adverse effect on the results [1] . Therefore, the FEC algorithm should be carefully chosen according to the error characteristics ofthe path between the sender and receiver. Another issue is to develop accurate models ofthe loss process . Many studies exist to characterize the loss process [2, 14, 8] . Simple models such as the Bernoulli process, the Gilbert model and sophisticated Markov models have been proposed. Using either the Bernoulli or the Gilbert process, the work of[3] propose an adaptive algorithm based on the FECscheme of[4] . Recently, the work of Salamatian and Vaton [13] has shown that Hidden
Observations on periorbital and midface aging.

BACKGROUND
Many of the anatomical changes of facial aging are still poorly understood. This study looked at the aging process in individuals linearly over time, focusing on aspects of periorbital aging and the upper midface.


METHODS
The author compared photographs of patients' friends and relatives taken 10 to 50 years before with closely matched recent follow-up pictures. The best-matching old and recent pictures were equally sized and superimposed in the computer. The images were then assembled into GIF animations, which automate the fading of one image into the other and back again indefinitely.


RESULTS
The following findings were new to the author: (1) the border of the pigmented lid skin and thicker cheek skin (the lid-cheek junction) is remarkably stable in position over time, becoming more visible by contrast, not by vertical descent as is commonly assumed. (2) Orbicularis wrinkles on the cheek and moles and other markers on the upper midface were also stable over decades. (3) With aging, there can be a distinct change in the shape of the upper eyelid. The young upper lid frequently has a medially biased peak. The upper lid peak becomes more central in the older lid. This article addresses these three issues. No evidence was seen here for descent of the globe in the orbit.


CONCLUSIONS
There seems to be very little ptosis (inferior descent) of the lid-cheek junction or of the upper midface. These findings suggest that vertical descent of skin, and by association, subcutaneous tissue, is not necessarily a major component of aging in those areas. In addition, the arc of the upper lid changes shape in a characteristic way in some patients. Other known changes of the periorbital area are visualized.
Development of the radiographic union score for tibial fractures for the assessment of tibial fracture healing after intramedullary fixation.

BACKGROUND
: The objective was to evaluate the newly developed Radiographic Union Score for Tibial fractures (RUST). Because there is no "gold standard," it was hypothesized that the RUST score would provide substantial improvements compared with previous scores presented in the literature.


METHODS
: Forty-five sets of X-rays of tibial shaft fractures treated with intramedullary fixation were selected. Seven orthopedic reviewers independently scored bony union using RUST. Radiographs were reassessed at 9 weeks. Intraclass correlation coefficients (ICC) with 95% confidence intervals (CI) measured agreement.


RESULTS
: Overall agreement was substantial (ICC, 0.86; 95% CI, 0.79-0.91). There was improved reliability among traumatologists compared with others (ICC = 0.86, 0.81, and 0.83, respectively). Overall intraobserver reliability was also substantial (ICC, 0.88; 95% CI, 0.80-0.96).


CONCLUSIONS
: The RUST score exhibits substantial improvements in reliability from previously published scores and produces equally reproducible results among a variety of orthopedic specialties and experience levels. Because no "gold standards" currently exist against which RUST can be compared, this study provides only the initial step in the score's full validation for use in a clinical context.
Comparison of Measurement-Based Call Admission Control Algorithms for Controlled-Load Service

We compare the performance of four admission control algorithms—one parameter-based and three measurementbased—for controlled-load service. The parameter-based admission control ensures that the sum of reserved resources is bounded by capacity. The three measurementbased algorithms are based on measured bandwidth, acceptance region [9], and equivalent bandwidth [7]. We use simulationon several network scenarios to evaluate the link utilization and adherence to service commitment achieved by these four algorithms.
A Model-Based Method for Computer-Aided Medical Decision-Making

While MYCIN and PIP were under development at Stanford and Tufts! M.I. T., a group of computer scientists at Rutgers University was developing a system to aid in the evaluation and treatment of patients with glaucoma. The group was led by Professor Casimir K ulikou1ski, a researcher with extensive background in mathematical and pattern-recognition approaches to computer-based medical decision making (Nordyke et al., 1971), working within the Rutgers Research Resource on Computers in Biomedicine headed by Professor Saul Amarel. Working collaboratively with Dr. Arin Safir, Professor of Ophthalmology, "who was then based at the Mt. Sinai School of Medicine in New York City, Kulikowski and Sholom Weiss (a graduate student at Rutgers who "went on to become a research scientist there) developed a method of computer-assisted medical decision making that was based on causal-associational network (CASNET) models of disease. Although the work was inspired by the glaucoma domain, the approach had general features that were later refined in the development of the EXPERT system-building tool (see Chapters 18 and 20). A CASNET model consists of three rnain components: observations of a patient, pathophysiological states, and disease classifications. As observations are recorded, they are associated with the appropriate intennediate states. These states, in turn, are typically causally related, thereby forming a network that summarizes the mechanisms of disease. It is these patterns of states in the network that are linked to individual disease classes. Strat-
Process Mining and Fraud Detection

A case study on the theoretical and practical value of using process mining for the detection of fraudulent behavior in the procurement process Abstract This thesis presents the results of a six month research period on process mining and fraud detection. This thesis aimed to answer the research question as to how process mining can be utilized in fraud detection and what the benefits of using process mining for fraud detection are. Based on a literature study it provides a discussion of the theory and application of process mining and its various aspects and techniques. Using both a literature study and an interview with a domain expert, the concepts of fraud and fraud detection are discussed. These results are combined with an analysis of existing case studies on the application of process mining and fraud detection to construct an initial setup of two case studies, in which process mining is applied to detect possible fraudulent behavior in the procurement process. Based on the experiences and results of these case studies, the 1+5+1 methodology is presented as a first step towards operationalizing principles with advice on how process mining techniques can be used in practice when trying to detect fraud. This thesis presents three conclusions: (1) process mining is a valuable addition to fraud detection, (2) using the 1+5+1 concept it was possible to detect indicators of possibly fraudulent behavior (3) the practical use of process mining for fraud detection is diminished by the poor performance of the current tools. The techniques and tools that do not suffer from performance issues are an addition, rather than a replacement, to regular data analysis techniques by providing either new, quicker, or more easily obtainable insights into the process and possible fraudulent behavior. iii Occam's Razor: " One should not increase, beyond what is necessary, the number of entities required to explain anything " iv Contents